/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 13:09:08,012 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 13:09:08,015 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 13:09:08,027 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 13:09:08,027 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 13:09:08,028 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 13:09:08,030 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 13:09:08,031 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 13:09:08,033 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 13:09:08,034 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 13:09:08,035 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 13:09:08,036 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 13:09:08,036 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 13:09:08,037 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 13:09:08,038 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 13:09:08,039 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 13:09:08,039 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 13:09:08,040 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 13:09:08,042 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 13:09:08,044 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 13:09:08,045 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 13:09:08,046 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 13:09:08,047 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 13:09:08,048 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 13:09:08,050 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 13:09:08,050 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 13:09:08,050 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 13:09:08,051 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 13:09:08,052 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 13:09:08,053 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 13:09:08,053 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 13:09:08,054 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 13:09:08,054 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 13:09:08,055 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 13:09:08,056 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 13:09:08,056 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 13:09:08,057 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 13:09:08,057 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 13:09:08,057 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 13:09:08,058 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 13:09:08,059 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 13:09:08,060 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 13:09:08,074 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 13:09:08,074 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 13:09:08,075 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 13:09:08,075 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 13:09:08,076 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 13:09:08,076 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:09:08,076 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 13:09:08,076 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 13:09:08,076 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 13:09:08,076 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 13:09:08,077 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 13:09:08,077 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 13:09:08,077 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 13:09:08,077 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 13:09:08,077 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:09:08,077 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 13:09:08,078 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 13:09:08,078 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 13:09:08,078 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 13:09:08,078 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 13:09:08,078 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 13:09:08,079 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 13:09:08,079 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 13:09:08,079 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 13:09:08,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:09:08,079 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 13:09:08,080 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 13:09:08,080 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 13:09:08,080 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 13:09:08,247 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 13:09:08,260 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 13:09:08,263 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 13:09:08,265 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 13:09:08,265 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 13:09:08,266 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 13:09:08,331 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_N0Lk83/tmp/cec2849d43504b9eb3155062ff8494b6/FLAG23c92671d [2020-07-01 13:09:08,660 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 13:09:08,661 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 13:09:08,661 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 13:09:08,667 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_N0Lk83/tmp/cec2849d43504b9eb3155062ff8494b6/FLAG23c92671d [2020-07-01 13:09:09,081 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_N0Lk83/tmp/cec2849d43504b9eb3155062ff8494b6 [2020-07-01 13:09:09,092 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 13:09:09,093 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 13:09:09,094 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 13:09:09,094 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 13:09:09,098 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 13:09:09,099 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:09:09" (1/1) ... [2020-07-01 13:09:09,102 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@716c2c7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:09:09, skipping insertion in model container [2020-07-01 13:09:09,103 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:09:09" (1/1) ... [2020-07-01 13:09:09,111 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 13:09:09,128 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 13:09:09,353 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:09:09,365 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 13:09:09,382 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:09:09,398 INFO L208 MainTranslator]: Completed translation [2020-07-01 13:09:09,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:09:09 WrapperNode [2020-07-01 13:09:09,399 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 13:09:09,399 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 13:09:09,400 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 13:09:09,400 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 13:09:09,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:09:09" (1/1) ... [2020-07-01 13:09:09,418 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:09:09" (1/1) ... [2020-07-01 13:09:09,439 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 13:09:09,440 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 13:09:09,440 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 13:09:09,440 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 13:09:09,449 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:09:09" (1/1) ... [2020-07-01 13:09:09,450 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:09:09" (1/1) ... [2020-07-01 13:09:09,451 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:09:09" (1/1) ... [2020-07-01 13:09:09,452 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:09:09" (1/1) ... [2020-07-01 13:09:09,456 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:09:09" (1/1) ... [2020-07-01 13:09:09,460 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:09:09" (1/1) ... [2020-07-01 13:09:09,461 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:09:09" (1/1) ... [2020-07-01 13:09:09,463 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 13:09:09,464 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 13:09:09,464 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 13:09:09,464 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 13:09:09,465 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:09:09" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:09:09,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 13:09:09,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 13:09:09,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 13:09:09,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 13:09:09,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 13:09:09,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 13:09:09,804 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 13:09:09,804 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-01 13:09:09,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:09:09 BoogieIcfgContainer [2020-07-01 13:09:09,808 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 13:09:09,808 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 13:09:09,809 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 13:09:09,811 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 13:09:09,811 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:09:09" (1/1) ... [2020-07-01 13:09:09,826 INFO L313 BlockEncoder]: Initial Icfg 41 locations, 43 edges [2020-07-01 13:09:09,828 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 13:09:09,828 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 13:09:09,829 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 13:09:09,829 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:09:09,831 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 13:09:09,832 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 13:09:09,832 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 13:09:09,858 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 13:09:09,892 INFO L200 BlockEncoder]: SBE split 21 edges [2020-07-01 13:09:09,897 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 13:09:09,898 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:09:09,919 INFO L100 BaseMinimizeStates]: Removed 10 edges and 5 locations by large block encoding [2020-07-01 13:09:09,922 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states [2020-07-01 13:09:09,923 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 13:09:09,923 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:09:09,924 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 13:09:09,924 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 13:09:09,925 INFO L313 BlockEncoder]: Encoded RCFG 34 locations, 57 edges [2020-07-01 13:09:09,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:09:09 BasicIcfg [2020-07-01 13:09:09,926 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 13:09:09,927 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 13:09:09,927 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 13:09:09,930 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 13:09:09,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 01:09:09" (1/4) ... [2020-07-01 13:09:09,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba24fda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:09:09, skipping insertion in model container [2020-07-01 13:09:09,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:09:09" (2/4) ... [2020-07-01 13:09:09,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba24fda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:09:09, skipping insertion in model container [2020-07-01 13:09:09,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:09:09" (3/4) ... [2020-07-01 13:09:09,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba24fda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:09:09, skipping insertion in model container [2020-07-01 13:09:09,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:09:09" (4/4) ... [2020-07-01 13:09:09,934 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:09:09,945 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 13:09:09,952 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2020-07-01 13:09:09,966 INFO L251 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2020-07-01 13:09:09,990 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 13:09:09,990 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 13:09:09,990 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:09:09,990 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:09:09,990 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:09:09,990 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 13:09:09,991 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:09:09,991 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 13:09:10,006 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-07-01 13:09:10,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:09:10,012 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:09:10,013 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:09:10,013 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:09:10,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:09:10,019 INFO L82 PathProgramCache]: Analyzing trace with hash 114487, now seen corresponding path program 1 times [2020-07-01 13:09:10,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:09:10,029 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877162415] [2020-07-01 13:09:10,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:09:10,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:09:10,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:09:10,185 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877162415] [2020-07-01 13:09:10,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:09:10,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:09:10,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615878965] [2020-07-01 13:09:10,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:09:10,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:09:10,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:09:10,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:09:10,210 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 3 states. [2020-07-01 13:09:10,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:09:10,339 INFO L93 Difference]: Finished difference Result 66 states and 109 transitions. [2020-07-01 13:09:10,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:09:10,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:09:10,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:09:10,353 INFO L225 Difference]: With dead ends: 66 [2020-07-01 13:09:10,353 INFO L226 Difference]: Without dead ends: 34 [2020-07-01 13:09:10,356 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:09:10,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-01 13:09:10,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-07-01 13:09:10,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-01 13:09:10,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 54 transitions. [2020-07-01 13:09:10,394 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 54 transitions. Word has length 3 [2020-07-01 13:09:10,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:09:10,394 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 54 transitions. [2020-07-01 13:09:10,394 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:09:10,394 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 54 transitions. [2020-07-01 13:09:10,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:09:10,395 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:09:10,395 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:09:10,396 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 13:09:10,397 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:09:10,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:09:10,397 INFO L82 PathProgramCache]: Analyzing trace with hash 114580, now seen corresponding path program 1 times [2020-07-01 13:09:10,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:09:10,398 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957884150] [2020-07-01 13:09:10,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:09:10,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:09:10,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:09:10,448 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957884150] [2020-07-01 13:09:10,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:09:10,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:09:10,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676907460] [2020-07-01 13:09:10,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:09:10,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:09:10,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:09:10,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:09:10,452 INFO L87 Difference]: Start difference. First operand 34 states and 54 transitions. Second operand 3 states. [2020-07-01 13:09:10,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:09:10,545 INFO L93 Difference]: Finished difference Result 34 states and 54 transitions. [2020-07-01 13:09:10,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:09:10,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:09:10,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:09:10,548 INFO L225 Difference]: With dead ends: 34 [2020-07-01 13:09:10,548 INFO L226 Difference]: Without dead ends: 30 [2020-07-01 13:09:10,549 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:09:10,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-01 13:09:10,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-01 13:09:10,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-01 13:09:10,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 46 transitions. [2020-07-01 13:09:10,554 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 46 transitions. Word has length 3 [2020-07-01 13:09:10,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:09:10,555 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 46 transitions. [2020-07-01 13:09:10,555 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:09:10,555 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 46 transitions. [2020-07-01 13:09:10,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:09:10,555 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:09:10,555 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:09:10,556 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 13:09:10,556 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:09:10,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:09:10,556 INFO L82 PathProgramCache]: Analyzing trace with hash 114582, now seen corresponding path program 1 times [2020-07-01 13:09:10,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:09:10,557 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127557139] [2020-07-01 13:09:10,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:09:10,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:09:10,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:09:10,587 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127557139] [2020-07-01 13:09:10,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:09:10,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:09:10,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659738351] [2020-07-01 13:09:10,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:09:10,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:09:10,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:09:10,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:09:10,589 INFO L87 Difference]: Start difference. First operand 30 states and 46 transitions. Second operand 3 states. [2020-07-01 13:09:10,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:09:10,680 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2020-07-01 13:09:10,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:09:10,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:09:10,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:09:10,681 INFO L225 Difference]: With dead ends: 34 [2020-07-01 13:09:10,682 INFO L226 Difference]: Without dead ends: 30 [2020-07-01 13:09:10,682 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:09:10,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-01 13:09:10,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-01 13:09:10,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-01 13:09:10,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2020-07-01 13:09:10,686 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 42 transitions. Word has length 3 [2020-07-01 13:09:10,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:09:10,687 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 42 transitions. [2020-07-01 13:09:10,687 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:09:10,687 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 42 transitions. [2020-07-01 13:09:10,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:09:10,687 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:09:10,688 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:09:10,688 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 13:09:10,688 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:09:10,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:09:10,688 INFO L82 PathProgramCache]: Analyzing trace with hash 114583, now seen corresponding path program 1 times [2020-07-01 13:09:10,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:09:10,689 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930391167] [2020-07-01 13:09:10,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:09:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:09:10,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:09:10,729 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930391167] [2020-07-01 13:09:10,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:09:10,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:09:10,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258166595] [2020-07-01 13:09:10,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:09:10,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:09:10,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:09:10,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:09:10,731 INFO L87 Difference]: Start difference. First operand 30 states and 42 transitions. Second operand 3 states. [2020-07-01 13:09:10,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:09:10,792 INFO L93 Difference]: Finished difference Result 30 states and 42 transitions. [2020-07-01 13:09:10,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:09:10,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:09:10,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:09:10,793 INFO L225 Difference]: With dead ends: 30 [2020-07-01 13:09:10,793 INFO L226 Difference]: Without dead ends: 26 [2020-07-01 13:09:10,794 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:09:10,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-01 13:09:10,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-07-01 13:09:10,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-01 13:09:10,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2020-07-01 13:09:10,797 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 38 transitions. Word has length 3 [2020-07-01 13:09:10,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:09:10,798 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 38 transitions. [2020-07-01 13:09:10,798 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:09:10,798 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 38 transitions. [2020-07-01 13:09:10,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:09:10,798 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:09:10,798 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:09:10,799 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 13:09:10,799 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:09:10,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:09:10,799 INFO L82 PathProgramCache]: Analyzing trace with hash 3550283, now seen corresponding path program 1 times [2020-07-01 13:09:10,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:09:10,800 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602874492] [2020-07-01 13:09:10,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:09:10,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:09:10,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:09:10,827 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602874492] [2020-07-01 13:09:10,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:09:10,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:09:10,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661178995] [2020-07-01 13:09:10,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:09:10,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:09:10,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:09:10,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:09:10,829 INFO L87 Difference]: Start difference. First operand 26 states and 38 transitions. Second operand 3 states. [2020-07-01 13:09:10,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:09:10,888 INFO L93 Difference]: Finished difference Result 26 states and 38 transitions. [2020-07-01 13:09:10,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:09:10,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:09:10,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:09:10,889 INFO L225 Difference]: With dead ends: 26 [2020-07-01 13:09:10,889 INFO L226 Difference]: Without dead ends: 20 [2020-07-01 13:09:10,890 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:09:10,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-01 13:09:10,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-01 13:09:10,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-01 13:09:10,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2020-07-01 13:09:10,893 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 4 [2020-07-01 13:09:10,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:09:10,893 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2020-07-01 13:09:10,893 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:09:10,894 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2020-07-01 13:09:10,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:09:10,894 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:09:10,894 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:09:10,894 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 13:09:10,894 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:09:10,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:09:10,895 INFO L82 PathProgramCache]: Analyzing trace with hash 3550285, now seen corresponding path program 1 times [2020-07-01 13:09:10,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:09:10,895 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322387450] [2020-07-01 13:09:10,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:09:10,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:09:10,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:09:10,921 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322387450] [2020-07-01 13:09:10,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:09:10,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:09:10,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764905698] [2020-07-01 13:09:10,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:09:10,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:09:10,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:09:10,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:09:10,923 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand 3 states. [2020-07-01 13:09:10,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:09:10,954 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2020-07-01 13:09:10,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:09:10,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:09:10,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:09:10,955 INFO L225 Difference]: With dead ends: 26 [2020-07-01 13:09:10,955 INFO L226 Difference]: Without dead ends: 20 [2020-07-01 13:09:10,955 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:09:10,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-01 13:09:10,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-01 13:09:10,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-01 13:09:10,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2020-07-01 13:09:10,958 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 4 [2020-07-01 13:09:10,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:09:10,959 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2020-07-01 13:09:10,959 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:09:10,959 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2020-07-01 13:09:10,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:09:10,960 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:09:10,960 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:09:10,960 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 13:09:10,960 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:09:10,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:09:10,961 INFO L82 PathProgramCache]: Analyzing trace with hash 3550286, now seen corresponding path program 1 times [2020-07-01 13:09:10,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:09:10,961 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334545610] [2020-07-01 13:09:10,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:09:10,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:09:10,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:09:10,994 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334545610] [2020-07-01 13:09:10,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:09:10,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:09:10,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218168297] [2020-07-01 13:09:10,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:09:10,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:09:10,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:09:10,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:09:10,997 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 3 states. [2020-07-01 13:09:11,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:09:11,039 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2020-07-01 13:09:11,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:09:11,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:09:11,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:09:11,040 INFO L225 Difference]: With dead ends: 20 [2020-07-01 13:09:11,040 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 13:09:11,040 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:09:11,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 13:09:11,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 13:09:11,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 13:09:11,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 13:09:11,041 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2020-07-01 13:09:11,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:09:11,042 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 13:09:11,042 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:09:11,042 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 13:09:11,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 13:09:11,042 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 13:09:11,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 13:09:11,077 INFO L268 CegarLoopResult]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-07-01 13:09:11,077 INFO L268 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-07-01 13:09:11,077 INFO L268 CegarLoopResult]: For program point L15-2(lines 15 17) no Hoare annotation was computed. [2020-07-01 13:09:11,078 INFO L268 CegarLoopResult]: For program point L11(lines 11 14) no Hoare annotation was computed. [2020-07-01 13:09:11,078 INFO L264 CegarLoopResult]: At program point L15-4(lines 15 17) the Hoare annotation is: (and (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0) (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (<= 1 |#StackHeapBarrier|) (= 4 (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~x_ref~0.offset)) [2020-07-01 13:09:11,078 INFO L268 CegarLoopResult]: For program point L15-5(lines 15 17) no Hoare annotation was computed. [2020-07-01 13:09:11,078 INFO L268 CegarLoopResult]: For program point L9(line 9) no Hoare annotation was computed. [2020-07-01 13:09:11,078 INFO L268 CegarLoopResult]: For program point L9-1(line 9) no Hoare annotation was computed. [2020-07-01 13:09:11,079 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 13:09:11,079 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 13:09:11,079 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:09:11,079 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:09:11,079 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:09:11,079 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:09:11,079 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:09:11,079 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:09:11,079 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:09:11,080 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:09:11,080 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:09:11,080 INFO L268 CegarLoopResult]: For program point L16(line 16) no Hoare annotation was computed. [2020-07-01 13:09:11,080 INFO L268 CegarLoopResult]: For program point L16-1(line 16) no Hoare annotation was computed. [2020-07-01 13:09:11,080 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:09:11,080 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:09:11,080 INFO L268 CegarLoopResult]: For program point L16-2(line 16) no Hoare annotation was computed. [2020-07-01 13:09:11,080 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:09:11,081 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:09:11,081 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:09:11,081 INFO L268 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2020-07-01 13:09:11,081 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:09:11,081 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 13:09:11,082 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 13:09:11,082 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:09:11,082 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 13:09:11,082 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 13:09:11,085 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 13:09:11,094 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:09:11,095 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:09:11,095 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:09:11,101 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:09:11,101 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:09:11,101 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:09:11,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:09:11 BasicIcfg [2020-07-01 13:09:11,104 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 13:09:11,105 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 13:09:11,105 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 13:09:11,109 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 13:09:11,110 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:09:11,110 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 01:09:09" (1/5) ... [2020-07-01 13:09:11,111 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e35ab33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:09:11, skipping insertion in model container [2020-07-01 13:09:11,111 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:09:11,111 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:09:09" (2/5) ... [2020-07-01 13:09:11,111 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e35ab33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:09:11, skipping insertion in model container [2020-07-01 13:09:11,111 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:09:11,111 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:09:09" (3/5) ... [2020-07-01 13:09:11,112 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e35ab33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:09:11, skipping insertion in model container [2020-07-01 13:09:11,112 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:09:11,112 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:09:09" (4/5) ... [2020-07-01 13:09:11,112 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e35ab33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:09:11, skipping insertion in model container [2020-07-01 13:09:11,112 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:09:11,112 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:09:11" (5/5) ... [2020-07-01 13:09:11,114 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:09:11,138 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 13:09:11,138 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 13:09:11,139 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:09:11,139 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:09:11,139 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:09:11,139 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 13:09:11,139 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:09:11,139 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 13:09:11,143 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states. [2020-07-01 13:09:11,149 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-01 13:09:11,150 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:09:11,150 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:09:11,156 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:09:11,157 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:09:11,157 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 13:09:11,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states. [2020-07-01 13:09:11,159 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-01 13:09:11,159 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:09:11,159 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:09:11,160 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:09:11,160 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:09:11,166 INFO L794 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue [84] ULTIMATE.startENTRY-->L-1: Formula: (and (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0)) (= |v_#NULL.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 12#L-1true [127] L-1-->L9: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (and (= 0 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1) |v_#valid_3|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet10_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= (store (store |v_#length_3| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_#length_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|)) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet9_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~ret11=|v_ULTIMATE.start_main_#t~ret11_1|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~ret11, ULTIMATE.start_test_fun_~y_ref~0.offset] 10#L9true [69] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_4| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= 1 (select |v_#valid_6| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_4|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_4|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 8#L9-1true [66] L9-1-->L10: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (= (select |v_#valid_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) 1) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_test_fun_~y_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_6|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 14#L10true [73] L10-->L11: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= |v_ULTIMATE.start_test_fun_#t~mem2_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5))) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_8|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_2|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_8|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2] 29#L11true [108] L11-->L15-4: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem2_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_6|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2] 30#L15-4true [2020-07-01 13:09:11,166 INFO L796 eck$LassoCheckResult]: Loop: 30#L15-4true [88] L15-4-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= 1 (select |v_#valid_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem4_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 35#L15-1true [98] L15-1-->L15-2: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= 1 (select |v_#valid_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem5_2|)) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 33#L15-2true [97] L15-2-->L16: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem5_6| |v_ULTIMATE.start_test_fun_#t~mem4_6|) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_6|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_6|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5] 5#L16true [61] L16-->L16-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9)) (= 1 (select |v_#valid_21| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_16| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9)) InVars {#memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_21|} OutVars{#valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 3#L16-1true [58] L16-1-->L16-2: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= |v_ULTIMATE.start_test_fun_#t~mem7_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9)) (= 1 (select |v_#valid_23| v_ULTIMATE.start_test_fun_~x_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_18| v_ULTIMATE.start_test_fun_~x_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_18|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_23|} OutVars{#valid=|v_#valid_23|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_18|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 19#L16-2true [172] L16-2-->L15-4: Formula: (and (= (store |v_#memory_int_17| v_ULTIMATE.start_test_fun_~y_ref~0.base_23 (store (select |v_#memory_int_17| v_ULTIMATE.start_test_fun_~y_ref~0.base_23) v_ULTIMATE.start_test_fun_~y_ref~0.offset_17 (+ |v_ULTIMATE.start_test_fun_#t~mem7_6| |v_ULTIMATE.start_test_fun_#t~mem6_6|))) |v_#memory_int_16|) (= 1 (select |v_#valid_36| v_ULTIMATE.start_test_fun_~y_ref~0.base_23)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_17 4) (select |v_#length_26| v_ULTIMATE.start_test_fun_~y_ref~0.base_23)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_17)) InVars {#valid=|v_#valid_36|, #memory_int=|v_#memory_int_17|, #length=|v_#length_26|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_23, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_17, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_6|} OutVars{#valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_26|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_23, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_17, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7] 30#L15-4true [2020-07-01 13:09:11,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:09:11,168 INFO L82 PathProgramCache]: Analyzing trace with hash -883206388, now seen corresponding path program 1 times [2020-07-01 13:09:11,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:09:11,168 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951930395] [2020-07-01 13:09:11,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:09:11,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:09:11,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:09:11,219 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:09:11,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:09:11,220 INFO L82 PathProgramCache]: Analyzing trace with hash -794642951, now seen corresponding path program 1 times [2020-07-01 13:09:11,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:09:11,221 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271922585] [2020-07-01 13:09:11,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:09:11,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:09:11,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:09:11,240 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:09:11,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:09:11,240 INFO L82 PathProgramCache]: Analyzing trace with hash -272279356, now seen corresponding path program 1 times [2020-07-01 13:09:11,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:09:11,241 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869624232] [2020-07-01 13:09:11,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:09:11,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:09:11,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:09:11,279 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:09:11,576 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 72 [2020-07-01 13:09:11,670 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 13:09:11,671 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 13:09:11,671 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 13:09:11,671 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 13:09:11,671 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 13:09:11,672 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:09:11,672 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 13:09:11,672 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 13:09:11,672 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso [2020-07-01 13:09:11,672 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 13:09:11,672 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 13:09:11,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:09:11,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:09:11,899 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2020-07-01 13:09:11,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:09:11,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:09:11,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:09:11,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:09:11,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:09:11,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:09:11,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:09:11,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:09:11,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:09:11,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:09:11,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 13:09:12,276 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 13:09:12,282 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:09:12,288 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 13:09:12,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:09:12,291 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 13:09:12,292 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:09:12,292 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:09:12,292 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:09:12,295 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 13:09:12,295 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 13:09:12,297 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:09:12,331 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 13:09:12,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:09:12,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:09:12,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:09:12,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:09:12,340 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 13:09:12,340 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 13:09:12,346 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:09:12,380 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 13:09:12,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 13:09:12,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 13:09:12,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 13:09:12,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 13:09:12,392 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 13:09:12,393 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 13:09:12,405 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 13:09:12,423 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-07-01 13:09:12,423 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 13:09:12,431 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 13:09:12,435 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-01 13:09:12,435 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 13:09:12,436 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 - 1 >= 0] [2020-07-01 13:09:12,512 INFO L297 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2020-07-01 13:09:12,517 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:09:12,517 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:09:12,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:09:12,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:09:12,575 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 13:09:12,576 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:09:12,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:09:12,617 INFO L264 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 13:09:12,618 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:09:12,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:09:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:09:12,929 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 13:09:12,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:09:12,941 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 13:09:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:09:12,954 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 13:09:12,954 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 7 predicates after loop cannibalization [2020-07-01 13:09:12,959 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2020-07-01 13:09:12,960 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 34 states. Second operand 8 states. [2020-07-01 13:09:13,287 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 34 states.. Second operand 8 states. Result 53 states and 97 transitions. Complement of second has 15 states. [2020-07-01 13:09:13,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2020-07-01 13:09:13,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-01 13:09:13,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 89 transitions. [2020-07-01 13:09:13,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 89 transitions. Stem has 6 letters. Loop has 6 letters. [2020-07-01 13:09:13,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:09:13,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 89 transitions. Stem has 12 letters. Loop has 6 letters. [2020-07-01 13:09:13,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:09:13,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 89 transitions. Stem has 6 letters. Loop has 12 letters. [2020-07-01 13:09:13,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 13:09:13,303 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 97 transitions. [2020-07-01 13:09:13,307 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-01 13:09:13,307 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 0 states and 0 transitions. [2020-07-01 13:09:13,308 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-01 13:09:13,308 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-01 13:09:13,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-01 13:09:13,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-01 13:09:13,309 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 13:09:13,309 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 13:09:13,310 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 13:09:13,310 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-01 13:09:13,310 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-01 13:09:13,310 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-01 13:09:13,310 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-01 13:09:13,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:09:13 BasicIcfg [2020-07-01 13:09:13,316 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-01 13:09:13,318 INFO L168 Benchmark]: Toolchain (without parser) took 4225.07 ms. Allocated memory was 649.6 MB in the beginning and 759.2 MB in the end (delta: 109.6 MB). Free memory was 557.0 MB in the beginning and 459.5 MB in the end (delta: 97.5 MB). Peak memory consumption was 207.1 MB. Max. memory is 50.3 GB. [2020-07-01 13:09:13,319 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 577.7 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:09:13,319 INFO L168 Benchmark]: CACSL2BoogieTranslator took 304.88 ms. Allocated memory was 649.6 MB in the beginning and 693.6 MB in the end (delta: 44.0 MB). Free memory was 557.0 MB in the beginning and 657.5 MB in the end (delta: -100.6 MB). Peak memory consumption was 28.9 MB. Max. memory is 50.3 GB. [2020-07-01 13:09:13,320 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.86 ms. Allocated memory is still 693.6 MB. Free memory was 657.5 MB in the beginning and 655.4 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-07-01 13:09:13,320 INFO L168 Benchmark]: Boogie Preprocessor took 23.79 ms. Allocated memory is still 693.6 MB. Free memory was 655.4 MB in the beginning and 653.2 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-07-01 13:09:13,321 INFO L168 Benchmark]: RCFGBuilder took 344.41 ms. Allocated memory is still 693.6 MB. Free memory was 653.2 MB in the beginning and 628.9 MB in the end (delta: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 50.3 GB. [2020-07-01 13:09:13,321 INFO L168 Benchmark]: BlockEncodingV2 took 117.19 ms. Allocated memory is still 693.6 MB. Free memory was 628.9 MB in the beginning and 619.1 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. [2020-07-01 13:09:13,322 INFO L168 Benchmark]: TraceAbstraction took 1177.48 ms. Allocated memory is still 693.6 MB. Free memory was 619.1 MB in the beginning and 499.4 MB in the end (delta: 119.7 MB). Peak memory consumption was 119.7 MB. Max. memory is 50.3 GB. [2020-07-01 13:09:13,323 INFO L168 Benchmark]: BuchiAutomizer took 2211.12 ms. Allocated memory was 693.6 MB in the beginning and 759.2 MB in the end (delta: 65.5 MB). Free memory was 499.4 MB in the beginning and 459.5 MB in the end (delta: 39.9 MB). Peak memory consumption was 105.5 MB. Max. memory is 50.3 GB. [2020-07-01 13:09:13,327 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 41 locations, 43 edges - StatisticsResult: Encoded RCFG 34 locations, 57 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 577.7 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 304.88 ms. Allocated memory was 649.6 MB in the beginning and 693.6 MB in the end (delta: 44.0 MB). Free memory was 557.0 MB in the beginning and 657.5 MB in the end (delta: -100.6 MB). Peak memory consumption was 28.9 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 39.86 ms. Allocated memory is still 693.6 MB. Free memory was 657.5 MB in the beginning and 655.4 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 23.79 ms. Allocated memory is still 693.6 MB. Free memory was 655.4 MB in the beginning and 653.2 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * RCFGBuilder took 344.41 ms. Allocated memory is still 693.6 MB. Free memory was 653.2 MB in the beginning and 628.9 MB in the end (delta: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 117.19 ms. Allocated memory is still 693.6 MB. Free memory was 628.9 MB in the beginning and 619.1 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1177.48 ms. Allocated memory is still 693.6 MB. Free memory was 619.1 MB in the beginning and 499.4 MB in the end (delta: 119.7 MB). Peak memory consumption was 119.7 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 2211.12 ms. Allocated memory was 693.6 MB in the beginning and 759.2 MB in the end (delta: 65.5 MB). Free memory was 499.4 MB in the beginning and 459.5 MB in the end (delta: 39.9 MB). Peak memory consumption was 105.5 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 20 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant [2020-07-01 13:09:13,337 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:09:13,338 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:09:13,338 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:09:13,338 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:09:13,339 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:09:13,339 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((1 == \valid[x_ref] && y_ref == 0) && 4 == unknown-#length-unknown[x_ref]) && 1 <= unknown-#StackHeapBarrier-unknown) && 4 == unknown-#length-unknown[y_ref]) && 1 == \valid[y_ref]) && 0 == x_ref - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 34 locations, 20 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.0s, OverallIterations: 7, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 37 SDtfs, 224 SDslu, 4 SDs, 0 SdLazy, 205 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 30 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 17 ConstructedInterpolants, 0 QuantifiedInterpolants, 159 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[y_ref][y_ref] + unknown-#memory_int-unknown[x_ref][x_ref] and consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.1s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 1.3s. Construction of modules took 0.2s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 10 SDtfs, 143 SDslu, 27 SDs, 0 SdLazy, 285 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital190 mio100 ax100 hnf100 lsp96 ukn69 mio100 lsp37 div100 bol100 ite100 ukn100 eq191 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 18ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-07-01 13:09:05.796 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp/BenchExec_run_N0Lk83/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 13:09:13.767 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check