/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/ldv-regression/ex3_forlist.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 16:11:44,371 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 16:11:44,376 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 16:11:44,443 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 16:11:44,443 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 16:11:44,448 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 16:11:44,453 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 16:11:44,460 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 16:11:44,465 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 16:11:44,473 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 16:11:44,478 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 16:11:44,480 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 16:11:44,481 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 16:11:44,485 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 16:11:44,488 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 16:11:44,490 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 16:11:44,505 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 16:11:44,507 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 16:11:44,510 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 16:11:44,512 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 16:11:44,514 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 16:11:44,520 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 16:11:44,523 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 16:11:44,525 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 16:11:44,534 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 16:11:44,535 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 16:11:44,535 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 16:11:44,536 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 16:11:44,540 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 16:11:44,542 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 16:11:44,543 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 16:11:44,545 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 16:11:44,546 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 16:11:44,548 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 16:11:44,550 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 16:11:44,550 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 16:11:44,552 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 16:11:44,552 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 16:11:44,552 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 16:11:44,553 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 16:11:44,554 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 16:11:44,560 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 16:11:44,614 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 16:11:44,615 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 16:11:44,620 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 16:11:44,621 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 16:11:44,621 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 16:11:44,621 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 16:11:44,621 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 16:11:44,622 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 16:11:44,622 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 16:11:44,622 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 16:11:44,624 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 16:11:44,624 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 16:11:44,624 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 16:11:44,625 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 16:11:44,625 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 16:11:44,625 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 16:11:44,625 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 16:11:44,625 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 16:11:44,626 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 16:11:44,626 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 16:11:44,626 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 16:11:44,626 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 16:11:44,627 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 16:11:44,627 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 16:11:44,627 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 16:11:44,627 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 16:11:45,038 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 16:11:45,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 16:11:45,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 16:11:45,091 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 16:11:45,092 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 16:11:45,093 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/ex3_forlist.i [2021-01-06 16:11:45,201 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/069f14600/b15ebbbbcdfc4ea79525432a23cb486a/FLAGeca3ec81b [2021-01-06 16:11:45,926 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 16:11:45,927 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ldv-regression/ex3_forlist.i [2021-01-06 16:11:45,937 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/069f14600/b15ebbbbcdfc4ea79525432a23cb486a/FLAGeca3ec81b [2021-01-06 16:11:46,251 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/069f14600/b15ebbbbcdfc4ea79525432a23cb486a [2021-01-06 16:11:46,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 16:11:46,258 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 16:11:46,262 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 16:11:46,263 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 16:11:46,268 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 16:11:46,270 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 04:11:46" (1/1) ... [2021-01-06 16:11:46,273 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b36a4aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:11:46, skipping insertion in model container [2021-01-06 16:11:46,273 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 04:11:46" (1/1) ... [2021-01-06 16:11:46,284 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 16:11:46,308 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 16:11:46,490 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ldv-regression/ex3_forlist.i[293,306] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~pp~0,GLOBAL],[IdentifierExpression[~i~0,]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~pstate~0,GLOBAL],[IdentifierExpression[~i~0,]]] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~pp~0,GLOBAL],[IdentifierExpression[~i~1,]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~pstate~0,GLOBAL],[IdentifierExpression[~i~1,]]] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~pstate~0,GLOBAL],[IdentifierExpression[~i~2,]]] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~b~0,] [2021-01-06 16:11:46,526 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 16:11:46,539 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 16:11:46,554 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ldv-regression/ex3_forlist.i[293,306] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#pp~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#pp~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[~i~0,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#pstate~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#pstate~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~i~0,]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#pp~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#pp~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[~i~1,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#pstate~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#pstate~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~i~1,]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#pstate~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#pstate~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~i~2,]]]]] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~b~0,] [2021-01-06 16:11:46,570 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 16:11:46,593 INFO L208 MainTranslator]: Completed translation [2021-01-06 16:11:46,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:11:46 WrapperNode [2021-01-06 16:11:46,596 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 16:11:46,597 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 16:11:46,597 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 16:11:46,598 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 16:11:46,610 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:11:46" (1/1) ... [2021-01-06 16:11:46,621 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:11:46" (1/1) ... [2021-01-06 16:11:46,651 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 16:11:46,652 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 16:11:46,653 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 16:11:46,653 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 16:11:46,664 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:11:46" (1/1) ... [2021-01-06 16:11:46,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:11:46" (1/1) ... [2021-01-06 16:11:46,668 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:11:46" (1/1) ... [2021-01-06 16:11:46,669 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:11:46" (1/1) ... [2021-01-06 16:11:46,678 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:11:46" (1/1) ... [2021-01-06 16:11:46,684 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:11:46" (1/1) ... [2021-01-06 16:11:46,687 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:11:46" (1/1) ... [2021-01-06 16:11:46,691 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 16:11:46,692 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 16:11:46,692 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 16:11:46,692 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 16:11:46,693 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:11:46" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 16:11:46,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-06 16:11:46,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-01-06 16:11:46,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 16:11:46,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-06 16:11:46,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 16:11:46,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-06 16:11:46,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 16:11:46,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 16:11:46,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-06 16:11:47,357 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 16:11:47,357 INFO L299 CfgBuilder]: Removed 27 assume(true) statements. [2021-01-06 16:11:47,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 04:11:47 BoogieIcfgContainer [2021-01-06 16:11:47,359 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 16:11:47,361 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 16:11:47,362 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 16:11:47,366 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 16:11:47,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 04:11:46" (1/3) ... [2021-01-06 16:11:47,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17afccb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 04:11:47, skipping insertion in model container [2021-01-06 16:11:47,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:11:46" (2/3) ... [2021-01-06 16:11:47,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17afccb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 04:11:47, skipping insertion in model container [2021-01-06 16:11:47,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 04:11:47" (3/3) ... [2021-01-06 16:11:47,370 INFO L111 eAbstractionObserver]: Analyzing ICFG ex3_forlist.i [2021-01-06 16:11:47,378 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 16:11:47,388 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-01-06 16:11:47,435 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-01-06 16:11:47,483 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 16:11:47,484 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 16:11:47,484 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 16:11:47,484 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 16:11:47,485 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 16:11:47,485 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 16:11:47,485 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 16:11:47,485 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 16:11:47,511 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2021-01-06 16:11:47,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-01-06 16:11:47,526 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:11:47,528 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:11:47,529 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:11:47,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:11:47,538 INFO L82 PathProgramCache]: Analyzing trace with hash 409945024, now seen corresponding path program 1 times [2021-01-06 16:11:47,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:11:47,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718488373] [2021-01-06 16:11:47,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:11:47,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:11:47,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:11:47,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718488373] [2021-01-06 16:11:47,912 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:11:47,912 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 16:11:47,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183911329] [2021-01-06 16:11:47,919 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 16:11:47,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:11:47,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 16:11:47,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 16:11:47,947 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2021-01-06 16:11:48,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:11:48,028 INFO L93 Difference]: Finished difference Result 68 states and 100 transitions. [2021-01-06 16:11:48,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 16:11:48,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2021-01-06 16:11:48,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:11:48,057 INFO L225 Difference]: With dead ends: 68 [2021-01-06 16:11:48,058 INFO L226 Difference]: Without dead ends: 33 [2021-01-06 16:11:48,064 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 16:11:48,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-01-06 16:11:48,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2021-01-06 16:11:48,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2021-01-06 16:11:48,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2021-01-06 16:11:48,118 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 15 [2021-01-06 16:11:48,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:11:48,119 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2021-01-06 16:11:48,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 16:11:48,120 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2021-01-06 16:11:48,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-01-06 16:11:48,122 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:11:48,123 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:11:48,123 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 16:11:48,124 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:11:48,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:11:48,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1658708759, now seen corresponding path program 1 times [2021-01-06 16:11:48,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:11:48,129 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087281966] [2021-01-06 16:11:48,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:11:48,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:11:48,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:11:48,222 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087281966] [2021-01-06 16:11:48,223 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372476741] [2021-01-06 16:11:48,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:11:48,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:11:48,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 16:11:48,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:11:48,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 16:11:48,448 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 16:11:48,449 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-01-06 16:11:48,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665131604] [2021-01-06 16:11:48,451 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 16:11:48,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:11:48,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 16:11:48,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:11:48,464 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand 3 states. [2021-01-06 16:11:48,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:11:48,555 INFO L93 Difference]: Finished difference Result 75 states and 95 transitions. [2021-01-06 16:11:48,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 16:11:48,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2021-01-06 16:11:48,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:11:48,559 INFO L225 Difference]: With dead ends: 75 [2021-01-06 16:11:48,559 INFO L226 Difference]: Without dead ends: 55 [2021-01-06 16:11:48,560 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:11:48,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-01-06 16:11:48,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 34. [2021-01-06 16:11:48,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2021-01-06 16:11:48,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2021-01-06 16:11:48,569 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 17 [2021-01-06 16:11:48,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:11:48,570 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2021-01-06 16:11:48,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 16:11:48,570 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2021-01-06 16:11:48,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-01-06 16:11:48,572 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:11:48,572 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:11:48,785 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2021-01-06 16:11:48,786 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:11:48,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:11:48,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1382422530, now seen corresponding path program 1 times [2021-01-06 16:11:48,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:11:48,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417627175] [2021-01-06 16:11:48,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:11:48,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:11:48,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:11:48,855 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417627175] [2021-01-06 16:11:48,857 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614299090] [2021-01-06 16:11:48,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:11:49,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:11:49,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 16:11:49,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:11:49,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:11:49,185 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:11:49,186 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-01-06 16:11:49,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19412286] [2021-01-06 16:11:49,187 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 16:11:49,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:11:49,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 16:11:49,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:11:49,195 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand 5 states. [2021-01-06 16:11:49,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:11:49,266 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2021-01-06 16:11:49,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 16:11:49,267 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2021-01-06 16:11:49,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:11:49,268 INFO L225 Difference]: With dead ends: 65 [2021-01-06 16:11:49,268 INFO L226 Difference]: Without dead ends: 36 [2021-01-06 16:11:49,270 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:11:49,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-01-06 16:11:49,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2021-01-06 16:11:49,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2021-01-06 16:11:49,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2021-01-06 16:11:49,284 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 19 [2021-01-06 16:11:49,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:11:49,284 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2021-01-06 16:11:49,284 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 16:11:49,284 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2021-01-06 16:11:49,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-01-06 16:11:49,286 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:11:49,286 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:11:49,499 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:11:49,500 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:11:49,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:11:49,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1994936256, now seen corresponding path program 2 times [2021-01-06 16:11:49,503 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:11:49,503 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119542879] [2021-01-06 16:11:49,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:11:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:11:50,078 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 16:11:50,079 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119542879] [2021-01-06 16:11:50,079 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:11:50,080 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 16:11:50,080 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123808558] [2021-01-06 16:11:50,080 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 16:11:50,081 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:11:50,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 16:11:50,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-01-06 16:11:50,082 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand 9 states. [2021-01-06 16:11:50,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:11:50,551 INFO L93 Difference]: Finished difference Result 77 states and 95 transitions. [2021-01-06 16:11:50,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 16:11:50,552 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2021-01-06 16:11:50,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:11:50,553 INFO L225 Difference]: With dead ends: 77 [2021-01-06 16:11:50,553 INFO L226 Difference]: Without dead ends: 61 [2021-01-06 16:11:50,554 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-01-06 16:11:50,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-01-06 16:11:50,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 40. [2021-01-06 16:11:50,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2021-01-06 16:11:50,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2021-01-06 16:11:50,562 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 21 [2021-01-06 16:11:50,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:11:50,563 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2021-01-06 16:11:50,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 16:11:50,563 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2021-01-06 16:11:50,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-06 16:11:50,564 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:11:50,565 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:11:50,565 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 16:11:50,565 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:11:50,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:11:50,566 INFO L82 PathProgramCache]: Analyzing trace with hash 902320519, now seen corresponding path program 1 times [2021-01-06 16:11:50,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:11:50,567 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531032215] [2021-01-06 16:11:50,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:11:50,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:11:50,620 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 16:11:50,621 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531032215] [2021-01-06 16:11:50,621 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522440339] [2021-01-06 16:11:50,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:11:50,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:11:50,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 16:11:50,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:11:50,732 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 16:11:50,733 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:11:50,733 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-01-06 16:11:50,733 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343286511] [2021-01-06 16:11:50,734 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 16:11:50,734 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:11:50,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 16:11:50,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:11:50,735 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand 5 states. [2021-01-06 16:11:50,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:11:50,779 INFO L93 Difference]: Finished difference Result 99 states and 122 transitions. [2021-01-06 16:11:50,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 16:11:50,780 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2021-01-06 16:11:50,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:11:50,781 INFO L225 Difference]: With dead ends: 99 [2021-01-06 16:11:50,781 INFO L226 Difference]: Without dead ends: 78 [2021-01-06 16:11:50,782 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:11:50,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-01-06 16:11:50,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 45. [2021-01-06 16:11:50,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2021-01-06 16:11:50,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2021-01-06 16:11:50,790 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 23 [2021-01-06 16:11:50,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:11:50,791 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2021-01-06 16:11:50,791 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 16:11:50,791 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2021-01-06 16:11:50,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-01-06 16:11:50,792 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:11:50,792 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:11:51,006 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:11:51,007 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:11:51,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:11:51,009 INFO L82 PathProgramCache]: Analyzing trace with hash -554343156, now seen corresponding path program 1 times [2021-01-06 16:11:51,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:11:51,010 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303604208] [2021-01-06 16:11:51,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:11:51,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:11:51,316 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 16:11:51,317 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303604208] [2021-01-06 16:11:51,317 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789904688] [2021-01-06 16:11:51,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:11:51,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:11:51,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 15 conjunts are in the unsatisfiable core [2021-01-06 16:11:51,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:11:51,444 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 171 [2021-01-06 16:11:51,453 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:11:51,491 INFO L625 ElimStorePlain]: treesize reduction 14, result has 58.8 percent of original size [2021-01-06 16:11:51,499 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:11:51,499 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:24, output treesize:8 [2021-01-06 16:11:51,550 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-06 16:11:51,551 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:11:51,558 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:11:51,559 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:11:51,559 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2021-01-06 16:11:51,657 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:11:51,680 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:11:51,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:11:51,691 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2021-01-06 16:11:51,694 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:11:51,706 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:11:51,717 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:11:51,718 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:56, output treesize:25 [2021-01-06 16:11:55,336 WARN L197 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2021-01-06 16:11:55,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:11:55,368 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:11:55,368 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2021-01-06 16:11:55,371 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:11:55,375 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:11:55,377 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:11:55,378 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:3 [2021-01-06 16:11:55,385 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 16:11:55,386 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 16:11:55,386 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 15 [2021-01-06 16:11:55,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783462230] [2021-01-06 16:11:55,391 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 16:11:55,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:11:55,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 16:11:55,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=170, Unknown=3, NotChecked=0, Total=240 [2021-01-06 16:11:55,392 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand 10 states. [2021-01-06 16:12:00,747 WARN L197 SmtUtils]: Spent 484.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2021-01-06 16:12:02,217 WARN L197 SmtUtils]: Spent 853.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2021-01-06 16:12:07,146 WARN L197 SmtUtils]: Spent 1.13 s on a formula simplification that was a NOOP. DAG size: 26 [2021-01-06 16:12:31,132 WARN L197 SmtUtils]: Spent 768.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2021-01-06 16:12:37,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:12:37,385 INFO L93 Difference]: Finished difference Result 133 states and 162 transitions. [2021-01-06 16:12:37,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 16:12:37,385 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2021-01-06 16:12:37,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:12:37,388 INFO L225 Difference]: With dead ends: 133 [2021-01-06 16:12:37,388 INFO L226 Difference]: Without dead ends: 123 [2021-01-06 16:12:37,389 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=186, Invalid=406, Unknown=8, NotChecked=0, Total=600 [2021-01-06 16:12:37,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-01-06 16:12:37,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 61. [2021-01-06 16:12:37,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2021-01-06 16:12:37,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 77 transitions. [2021-01-06 16:12:37,401 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 77 transitions. Word has length 24 [2021-01-06 16:12:37,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:12:37,402 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 77 transitions. [2021-01-06 16:12:37,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 16:12:37,402 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions. [2021-01-06 16:12:37,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-01-06 16:12:37,403 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:12:37,403 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:12:37,604 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:12:37,605 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:12:37,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:12:37,606 INFO L82 PathProgramCache]: Analyzing trace with hash 964936531, now seen corresponding path program 1 times [2021-01-06 16:12:37,606 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:12:37,607 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346841124] [2021-01-06 16:12:37,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:12:37,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:12:37,756 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-06 16:12:37,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346841124] [2021-01-06 16:12:37,757 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:12:37,757 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 16:12:37,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540881058] [2021-01-06 16:12:37,757 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 16:12:37,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:12:37,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 16:12:37,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 16:12:37,759 INFO L87 Difference]: Start difference. First operand 61 states and 77 transitions. Second operand 7 states. [2021-01-06 16:12:37,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:12:37,993 INFO L93 Difference]: Finished difference Result 138 states and 173 transitions. [2021-01-06 16:12:37,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 16:12:37,994 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2021-01-06 16:12:37,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:12:37,995 INFO L225 Difference]: With dead ends: 138 [2021-01-06 16:12:37,995 INFO L226 Difference]: Without dead ends: 128 [2021-01-06 16:12:37,996 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2021-01-06 16:12:37,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-01-06 16:12:38,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 61. [2021-01-06 16:12:38,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2021-01-06 16:12:38,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 77 transitions. [2021-01-06 16:12:38,007 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 77 transitions. Word has length 24 [2021-01-06 16:12:38,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:12:38,007 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 77 transitions. [2021-01-06 16:12:38,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 16:12:38,007 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions. [2021-01-06 16:12:38,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-06 16:12:38,008 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:12:38,008 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:12:38,009 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 16:12:38,009 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:12:38,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:12:38,009 INFO L82 PathProgramCache]: Analyzing trace with hash 93482631, now seen corresponding path program 1 times [2021-01-06 16:12:38,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:12:38,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798786709] [2021-01-06 16:12:38,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:12:38,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:12:38,562 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 16:12:38,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798786709] [2021-01-06 16:12:38,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996547994] [2021-01-06 16:12:38,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:12:38,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:12:38,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 12 conjunts are in the unsatisfiable core [2021-01-06 16:12:38,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:12:38,682 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-06 16:12:38,683 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:12:38,685 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:12:38,686 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:12:38,686 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2021-01-06 16:12:38,768 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-01-06 16:12:38,770 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:12:38,772 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:12:38,773 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:12:38,774 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2021-01-06 16:12:38,794 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 16:12:38,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:12:38,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 18 [2021-01-06 16:12:38,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377543106] [2021-01-06 16:12:38,796 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-01-06 16:12:38,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:12:38,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-01-06 16:12:38,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2021-01-06 16:12:38,797 INFO L87 Difference]: Start difference. First operand 61 states and 77 transitions. Second operand 18 states. [2021-01-06 16:12:41,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:12:41,347 INFO L93 Difference]: Finished difference Result 297 states and 377 transitions. [2021-01-06 16:12:41,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-01-06 16:12:41,347 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2021-01-06 16:12:41,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:12:41,349 INFO L225 Difference]: With dead ends: 297 [2021-01-06 16:12:41,349 INFO L226 Difference]: Without dead ends: 275 [2021-01-06 16:12:41,351 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 698 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=656, Invalid=2314, Unknown=0, NotChecked=0, Total=2970 [2021-01-06 16:12:41,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-01-06 16:12:41,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 100. [2021-01-06 16:12:41,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2021-01-06 16:12:41,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 132 transitions. [2021-01-06 16:12:41,371 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 132 transitions. Word has length 27 [2021-01-06 16:12:41,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:12:41,372 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 132 transitions. [2021-01-06 16:12:41,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2021-01-06 16:12:41,372 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 132 transitions. [2021-01-06 16:12:41,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-06 16:12:41,373 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:12:41,373 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:12:41,588 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:12:41,589 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:12:41,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:12:41,590 INFO L82 PathProgramCache]: Analyzing trace with hash 589272800, now seen corresponding path program 1 times [2021-01-06 16:12:41,591 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:12:41,592 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539273113] [2021-01-06 16:12:41,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:12:41,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:12:41,828 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 16:12:41,828 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539273113] [2021-01-06 16:12:41,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648215093] [2021-01-06 16:12:41,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:12:41,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:12:41,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 16 conjunts are in the unsatisfiable core [2021-01-06 16:12:41,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:12:41,933 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 245 treesize of output 229 [2021-01-06 16:12:41,940 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:12:41,954 INFO L625 ElimStorePlain]: treesize reduction 14, result has 54.8 percent of original size [2021-01-06 16:12:41,962 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:12:41,963 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:20, output treesize:4 [2021-01-06 16:12:41,993 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-06 16:12:41,994 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:12:41,997 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:12:41,998 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:12:41,998 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2021-01-06 16:12:42,056 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:12:42,068 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:12:42,080 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:12:42,081 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 65 [2021-01-06 16:12:42,085 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:12:42,104 INFO L625 ElimStorePlain]: treesize reduction 22, result has 63.9 percent of original size [2021-01-06 16:12:42,108 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:12:42,109 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:55, output treesize:24 [2021-01-06 16:12:42,320 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:12:42,321 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 24 [2021-01-06 16:12:42,322 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:12:42,326 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:12:42,328 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:12:42,328 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:3 [2021-01-06 16:12:42,333 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 16:12:42,333 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:12:42,333 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 19 [2021-01-06 16:12:42,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268914125] [2021-01-06 16:12:42,334 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-01-06 16:12:42,334 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:12:42,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-01-06 16:12:42,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2021-01-06 16:12:42,336 INFO L87 Difference]: Start difference. First operand 100 states and 132 transitions. Second operand 20 states. [2021-01-06 16:12:44,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:12:44,199 INFO L93 Difference]: Finished difference Result 324 states and 426 transitions. [2021-01-06 16:12:44,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-01-06 16:12:44,200 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 27 [2021-01-06 16:12:44,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:12:44,202 INFO L225 Difference]: With dead ends: 324 [2021-01-06 16:12:44,202 INFO L226 Difference]: Without dead ends: 280 [2021-01-06 16:12:44,204 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=528, Invalid=2022, Unknown=0, NotChecked=0, Total=2550 [2021-01-06 16:12:44,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2021-01-06 16:12:44,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 110. [2021-01-06 16:12:44,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2021-01-06 16:12:44,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 142 transitions. [2021-01-06 16:12:44,226 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 142 transitions. Word has length 27 [2021-01-06 16:12:44,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:12:44,227 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 142 transitions. [2021-01-06 16:12:44,227 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2021-01-06 16:12:44,227 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 142 transitions. [2021-01-06 16:12:44,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-06 16:12:44,228 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:12:44,228 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:12:44,442 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:12:44,443 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:12:44,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:12:44,444 INFO L82 PathProgramCache]: Analyzing trace with hash -2029788007, now seen corresponding path program 1 times [2021-01-06 16:12:44,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:12:44,445 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182599760] [2021-01-06 16:12:44,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:12:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:12:44,704 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 16:12:44,705 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182599760] [2021-01-06 16:12:44,705 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230600355] [2021-01-06 16:12:44,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:12:44,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:12:44,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 26 conjunts are in the unsatisfiable core [2021-01-06 16:12:44,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:12:44,778 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 153 [2021-01-06 16:12:44,786 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:12:44,805 INFO L625 ElimStorePlain]: treesize reduction 14, result has 62.2 percent of original size [2021-01-06 16:12:44,811 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:12:44,812 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2021-01-06 16:12:44,955 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 9 [2021-01-06 16:12:44,955 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:12:44,961 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:12:44,962 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:12:44,963 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:13 [2021-01-06 16:12:45,036 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-01-06 16:12:45,038 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:12:45,039 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:12:45,039 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:12:45,040 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2021-01-06 16:12:45,061 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 16:12:45,061 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:12:45,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2021-01-06 16:12:45,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077956466] [2021-01-06 16:12:45,062 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-01-06 16:12:45,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:12:45,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-01-06 16:12:45,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2021-01-06 16:12:45,064 INFO L87 Difference]: Start difference. First operand 110 states and 142 transitions. Second operand 21 states. [2021-01-06 16:12:46,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:12:46,479 INFO L93 Difference]: Finished difference Result 316 states and 405 transitions. [2021-01-06 16:12:46,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-01-06 16:12:46,479 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 [2021-01-06 16:12:46,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:12:46,482 INFO L225 Difference]: With dead ends: 316 [2021-01-06 16:12:46,482 INFO L226 Difference]: Without dead ends: 260 [2021-01-06 16:12:46,488 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=244, Invalid=1088, Unknown=0, NotChecked=0, Total=1332 [2021-01-06 16:12:46,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-01-06 16:12:46,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 121. [2021-01-06 16:12:46,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2021-01-06 16:12:46,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 155 transitions. [2021-01-06 16:12:46,518 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 155 transitions. Word has length 27 [2021-01-06 16:12:46,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:12:46,519 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 155 transitions. [2021-01-06 16:12:46,519 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2021-01-06 16:12:46,519 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 155 transitions. [2021-01-06 16:12:46,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-01-06 16:12:46,520 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:12:46,520 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:12:46,733 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-01-06 16:12:46,734 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:12:46,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:12:46,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1387129824, now seen corresponding path program 1 times [2021-01-06 16:12:46,736 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:12:46,736 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429491567] [2021-01-06 16:12:46,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:12:46,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:12:47,596 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 16:12:47,596 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429491567] [2021-01-06 16:12:47,597 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764383264] [2021-01-06 16:12:47,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:12:47,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:12:47,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 30 conjunts are in the unsatisfiable core [2021-01-06 16:12:47,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:12:47,705 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2021-01-06 16:12:47,711 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-01-06 16:12:47,737 INFO L625 ElimStorePlain]: treesize reduction 26, result has 46.9 percent of original size [2021-01-06 16:12:47,741 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:12:47,742 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2021-01-06 16:12:47,813 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 11 [2021-01-06 16:12:47,814 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:12:47,824 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:12:47,832 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:12:47,833 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:61, output treesize:25 [2021-01-06 16:12:47,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:12:47,934 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 22 [2021-01-06 16:12:47,936 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:12:47,946 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:12:47,948 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:12:47,949 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:32 [2021-01-06 16:12:52,038 WARN L197 SmtUtils]: Spent 1.36 s on a formula simplification that was a NOOP. DAG size: 24 [2021-01-06 16:12:53,767 WARN L197 SmtUtils]: Spent 1.67 s on a formula simplification that was a NOOP. DAG size: 24 [2021-01-06 16:12:55,347 WARN L197 SmtUtils]: Spent 1.53 s on a formula simplification that was a NOOP. DAG size: 24 [2021-01-06 16:12:56,892 WARN L197 SmtUtils]: Spent 1.50 s on a formula simplification that was a NOOP. DAG size: 26 [2021-01-06 16:12:58,358 WARN L197 SmtUtils]: Spent 1.39 s on a formula simplification that was a NOOP. DAG size: 26 [2021-01-06 16:12:58,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:12:58,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:12:58,408 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:12:58,409 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 72 [2021-01-06 16:12:58,412 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:12:58,455 INFO L625 ElimStorePlain]: treesize reduction 20, result has 73.0 percent of original size [2021-01-06 16:12:58,462 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:12:58,469 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:12:58,470 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:12:58,471 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:82, output treesize:14 [2021-01-06 16:12:58,561 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-01-06 16:12:58,563 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:12:58,567 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:12:58,568 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:12:58,568 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2021-01-06 16:12:58,604 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-06 16:12:58,604 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:12:58,604 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 29 [2021-01-06 16:12:58,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390303923] [2021-01-06 16:12:58,605 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-01-06 16:12:58,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:12:58,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-01-06 16:12:58,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=748, Unknown=2, NotChecked=0, Total=870 [2021-01-06 16:12:58,607 INFO L87 Difference]: Start difference. First operand 121 states and 155 transitions. Second operand 30 states. [2021-01-06 16:13:01,141 WARN L197 SmtUtils]: Spent 2.47 s on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2021-01-06 16:13:02,655 WARN L197 SmtUtils]: Spent 1.43 s on a formula simplification that was a NOOP. DAG size: 24 [2021-01-06 16:13:05,962 WARN L197 SmtUtils]: Spent 3.19 s on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2021-01-06 16:13:08,759 WARN L197 SmtUtils]: Spent 2.75 s on a formula simplification. DAG size of input: 38 DAG size of output: 29 [2021-01-06 16:13:12,034 WARN L197 SmtUtils]: Spent 3.22 s on a formula simplification. DAG size of input: 40 DAG size of output: 31 [2021-01-06 16:13:15,105 WARN L197 SmtUtils]: Spent 3.03 s on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2021-01-06 16:13:18,410 WARN L197 SmtUtils]: Spent 3.24 s on a formula simplification. DAG size of input: 52 DAG size of output: 38 [2021-01-06 16:13:20,509 WARN L197 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 51 DAG size of output: 36 [2021-01-06 16:13:46,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:13:46,019 INFO L93 Difference]: Finished difference Result 239 states and 307 transitions. [2021-01-06 16:13:46,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-01-06 16:13:46,020 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2021-01-06 16:13:46,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:13:46,021 INFO L225 Difference]: With dead ends: 239 [2021-01-06 16:13:46,021 INFO L226 Difference]: Without dead ends: 185 [2021-01-06 16:13:46,023 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 53.4s TimeCoverageRelationStatistics Valid=351, Invalid=1796, Unknown=15, NotChecked=0, Total=2162 [2021-01-06 16:13:46,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-01-06 16:13:46,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 118. [2021-01-06 16:13:46,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2021-01-06 16:13:46,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 146 transitions. [2021-01-06 16:13:46,048 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 146 transitions. Word has length 29 [2021-01-06 16:13:46,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:13:46,049 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 146 transitions. [2021-01-06 16:13:46,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2021-01-06 16:13:46,049 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 146 transitions. [2021-01-06 16:13:46,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-01-06 16:13:46,050 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:13:46,050 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:13:46,265 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-01-06 16:13:46,266 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:13:46,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:13:46,267 INFO L82 PathProgramCache]: Analyzing trace with hash 386508261, now seen corresponding path program 1 times [2021-01-06 16:13:46,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:13:46,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663398538] [2021-01-06 16:13:46,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:13:46,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:13:46,666 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-06 16:13:46,666 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663398538] [2021-01-06 16:13:46,666 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840434896] [2021-01-06 16:13:46,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:13:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:13:46,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 33 conjunts are in the unsatisfiable core [2021-01-06 16:13:46,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:13:46,741 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2021-01-06 16:13:46,743 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-01-06 16:13:46,767 INFO L625 ElimStorePlain]: treesize reduction 26, result has 46.9 percent of original size [2021-01-06 16:13:46,769 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:13:46,769 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2021-01-06 16:13:46,866 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 9 [2021-01-06 16:13:46,867 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:13:46,874 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:13:46,874 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:13:46,875 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:20 [2021-01-06 16:13:47,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:13:47,025 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 24 [2021-01-06 16:13:47,026 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:13:47,035 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:13:47,037 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:13:47,037 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:70, output treesize:20 [2021-01-06 16:13:47,150 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2021-01-06 16:13:47,151 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:13:47,159 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:13:47,162 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:13:47,162 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:19 [2021-01-06 16:13:47,220 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-01-06 16:13:47,225 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:13:47,229 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:13:47,229 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:13:47,229 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2021-01-06 16:13:47,258 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 16:13:47,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:13:47,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2021-01-06 16:13:47,259 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315518063] [2021-01-06 16:13:47,259 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-01-06 16:13:47,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:13:47,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-01-06 16:13:47,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=564, Unknown=0, NotChecked=0, Total=650 [2021-01-06 16:13:47,260 INFO L87 Difference]: Start difference. First operand 118 states and 146 transitions. Second operand 26 states. [2021-01-06 16:13:48,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:13:48,108 INFO L93 Difference]: Finished difference Result 156 states and 192 transitions. [2021-01-06 16:13:48,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-06 16:13:48,108 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 31 [2021-01-06 16:13:48,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:13:48,109 INFO L225 Difference]: With dead ends: 156 [2021-01-06 16:13:48,109 INFO L226 Difference]: Without dead ends: 68 [2021-01-06 16:13:48,110 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=188, Invalid=1002, Unknown=0, NotChecked=0, Total=1190 [2021-01-06 16:13:48,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-01-06 16:13:48,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-01-06 16:13:48,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2021-01-06 16:13:48,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2021-01-06 16:13:48,120 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 31 [2021-01-06 16:13:48,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:13:48,121 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2021-01-06 16:13:48,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2021-01-06 16:13:48,121 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2021-01-06 16:13:48,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-01-06 16:13:48,122 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:13:48,122 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:13:48,337 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:13:48,338 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:13:48,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:13:48,339 INFO L82 PathProgramCache]: Analyzing trace with hash 591619839, now seen corresponding path program 1 times [2021-01-06 16:13:48,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:13:48,339 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397920966] [2021-01-06 16:13:48,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:13:48,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:13:48,735 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 16:13:48,735 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397920966] [2021-01-06 16:13:48,735 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908958276] [2021-01-06 16:13:48,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:13:48,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:13:48,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 38 conjunts are in the unsatisfiable core [2021-01-06 16:13:48,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:13:48,831 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 113 [2021-01-06 16:13:48,835 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:13:48,869 INFO L625 ElimStorePlain]: treesize reduction 18, result has 56.1 percent of original size [2021-01-06 16:13:48,871 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:13:48,871 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2021-01-06 16:13:49,104 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-01-06 16:13:49,105 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:13:49,118 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:13:49,120 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:13:49,121 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:17 [2021-01-06 16:13:49,198 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-01-06 16:13:49,199 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:13:49,205 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:13:49,206 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:13:49,209 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:7 [2021-01-06 16:13:49,240 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-01-06 16:13:49,241 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:13:49,241 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2021-01-06 16:13:49,241 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643844578] [2021-01-06 16:13:49,242 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-01-06 16:13:49,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:13:49,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-01-06 16:13:49,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2021-01-06 16:13:49,243 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand 22 states. [2021-01-06 16:13:49,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:13:49,863 INFO L93 Difference]: Finished difference Result 113 states and 134 transitions. [2021-01-06 16:13:49,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-06 16:13:49,864 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 34 [2021-01-06 16:13:49,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:13:49,866 INFO L225 Difference]: With dead ends: 113 [2021-01-06 16:13:49,866 INFO L226 Difference]: Without dead ends: 100 [2021-01-06 16:13:49,867 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=143, Invalid=669, Unknown=0, NotChecked=0, Total=812 [2021-01-06 16:13:49,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-01-06 16:13:49,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 85. [2021-01-06 16:13:49,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2021-01-06 16:13:49,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 100 transitions. [2021-01-06 16:13:49,877 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 100 transitions. Word has length 34 [2021-01-06 16:13:49,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:13:49,878 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 100 transitions. [2021-01-06 16:13:49,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2021-01-06 16:13:49,878 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 100 transitions. [2021-01-06 16:13:49,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-01-06 16:13:49,878 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:13:49,879 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:13:50,084 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:13:50,086 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:13:50,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:13:50,086 INFO L82 PathProgramCache]: Analyzing trace with hash 2098228492, now seen corresponding path program 1 times [2021-01-06 16:13:50,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:13:50,087 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586874161] [2021-01-06 16:13:50,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:13:50,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:13:50,135 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-06 16:13:50,136 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586874161] [2021-01-06 16:13:50,136 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358178868] [2021-01-06 16:13:50,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:13:50,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:13:50,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-06 16:13:50,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:13:50,249 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-06 16:13:50,249 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 16:13:50,249 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2021-01-06 16:13:50,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843678741] [2021-01-06 16:13:50,250 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 16:13:50,250 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:13:50,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 16:13:50,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-06 16:13:50,251 INFO L87 Difference]: Start difference. First operand 85 states and 100 transitions. Second operand 5 states. [2021-01-06 16:13:50,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:13:50,297 INFO L93 Difference]: Finished difference Result 132 states and 158 transitions. [2021-01-06 16:13:50,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 16:13:50,298 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2021-01-06 16:13:50,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:13:50,299 INFO L225 Difference]: With dead ends: 132 [2021-01-06 16:13:50,299 INFO L226 Difference]: Without dead ends: 74 [2021-01-06 16:13:50,300 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-06 16:13:50,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-01-06 16:13:50,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 69. [2021-01-06 16:13:50,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2021-01-06 16:13:50,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2021-01-06 16:13:50,311 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 34 [2021-01-06 16:13:50,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:13:50,311 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2021-01-06 16:13:50,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 16:13:50,311 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2021-01-06 16:13:50,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-06 16:13:50,312 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:13:50,312 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:13:50,522 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-01-06 16:13:50,523 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:13:50,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:13:50,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1728552776, now seen corresponding path program 1 times [2021-01-06 16:13:50,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:13:50,525 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395760085] [2021-01-06 16:13:50,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:13:50,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:13:51,168 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-06 16:13:51,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395760085] [2021-01-06 16:13:51,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744649796] [2021-01-06 16:13:51,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:13:51,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:13:51,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 34 conjunts are in the unsatisfiable core [2021-01-06 16:13:51,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:13:51,245 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2021-01-06 16:13:51,247 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-01-06 16:13:51,279 INFO L625 ElimStorePlain]: treesize reduction 26, result has 46.9 percent of original size [2021-01-06 16:13:51,287 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:13:51,288 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2021-01-06 16:13:51,341 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 11 [2021-01-06 16:13:51,342 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:13:51,351 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:13:51,352 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:13:51,353 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:61, output treesize:25 [2021-01-06 16:13:51,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:13:51,444 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 22 [2021-01-06 16:13:51,445 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:13:51,455 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:13:51,457 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:13:51,457 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:32 [2021-01-06 16:13:55,993 WARN L197 SmtUtils]: Spent 1.53 s on a formula simplification that was a NOOP. DAG size: 24 [2021-01-06 16:13:57,189 WARN L197 SmtUtils]: Spent 1.15 s on a formula simplification that was a NOOP. DAG size: 25 [2021-01-06 16:13:58,935 WARN L197 SmtUtils]: Spent 1.71 s on a formula simplification that was a NOOP. DAG size: 25 [2021-01-06 16:14:00,490 WARN L197 SmtUtils]: Spent 1.51 s on a formula simplification that was a NOOP. DAG size: 25 [2021-01-06 16:14:02,006 WARN L197 SmtUtils]: Spent 1.47 s on a formula simplification that was a NOOP. DAG size: 27 [2021-01-06 16:14:03,768 WARN L197 SmtUtils]: Spent 1.71 s on a formula simplification that was a NOOP. DAG size: 27 [2021-01-06 16:14:03,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:14:03,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:14:03,804 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:14:03,805 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 72 [2021-01-06 16:14:03,807 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:14:03,850 INFO L625 ElimStorePlain]: treesize reduction 20, result has 73.0 percent of original size [2021-01-06 16:14:03,864 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:14:03,866 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:14:03,867 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:14:03,868 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:82, output treesize:14 [2021-01-06 16:14:03,961 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-01-06 16:14:03,962 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:14:03,965 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:14:03,966 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:14:03,966 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2021-01-06 16:14:04,009 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-01-06 16:14:04,010 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:14:04,010 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2021-01-06 16:14:04,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307874813] [2021-01-06 16:14:04,011 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-01-06 16:14:04,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:14:04,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-01-06 16:14:04,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=650, Unknown=2, NotChecked=0, Total=756 [2021-01-06 16:14:04,012 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 28 states. [2021-01-06 16:14:06,842 WARN L197 SmtUtils]: Spent 2.77 s on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2021-01-06 16:14:09,861 WARN L197 SmtUtils]: Spent 2.95 s on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2021-01-06 16:14:11,356 WARN L197 SmtUtils]: Spent 1.42 s on a formula simplification that was a NOOP. DAG size: 24 [2021-01-06 16:14:14,391 WARN L197 SmtUtils]: Spent 2.99 s on a formula simplification. DAG size of input: 47 DAG size of output: 28 [2021-01-06 16:14:17,650 WARN L197 SmtUtils]: Spent 3.22 s on a formula simplification. DAG size of input: 48 DAG size of output: 28 [2021-01-06 16:14:20,971 WARN L197 SmtUtils]: Spent 3.29 s on a formula simplification. DAG size of input: 50 DAG size of output: 30 [2021-01-06 16:14:24,551 WARN L197 SmtUtils]: Spent 3.55 s on a formula simplification. DAG size of input: 52 DAG size of output: 32 [2021-01-06 16:14:26,652 WARN L197 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 62 DAG size of output: 34 [2021-01-06 16:14:54,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:14:54,943 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2021-01-06 16:14:54,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-01-06 16:14:54,944 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 37 [2021-01-06 16:14:54,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:14:54,945 INFO L225 Difference]: With dead ends: 83 [2021-01-06 16:14:54,945 INFO L226 Difference]: Without dead ends: 70 [2021-01-06 16:14:54,947 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 35.7s TimeCoverageRelationStatistics Valid=265, Invalid=1455, Unknown=2, NotChecked=0, Total=1722 [2021-01-06 16:14:54,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-01-06 16:14:54,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 54. [2021-01-06 16:14:54,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2021-01-06 16:14:54,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2021-01-06 16:14:54,955 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 37 [2021-01-06 16:14:54,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:14:54,955 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2021-01-06 16:14:54,956 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2021-01-06 16:14:54,956 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2021-01-06 16:14:54,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-01-06 16:14:54,956 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:14:54,957 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:14:55,159 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-01-06 16:14:55,161 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:14:55,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:14:55,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1631106707, now seen corresponding path program 1 times [2021-01-06 16:14:55,162 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:14:55,162 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654640153] [2021-01-06 16:14:55,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:14:55,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:14:55,700 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-06 16:14:55,701 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654640153] [2021-01-06 16:14:55,701 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318508817] [2021-01-06 16:14:55,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:14:55,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:14:55,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 42 conjunts are in the unsatisfiable core [2021-01-06 16:14:55,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:14:55,780 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 161 [2021-01-06 16:14:55,782 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:14:55,815 INFO L625 ElimStorePlain]: treesize reduction 14, result has 62.2 percent of original size [2021-01-06 16:14:55,818 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:14:55,819 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2021-01-06 16:14:56,166 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2021-01-06 16:14:56,168 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:14:56,176 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:14:56,178 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:14:56,178 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:16 [2021-01-06 16:14:56,317 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-01-06 16:14:56,318 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:14:56,321 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:14:56,322 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:14:56,322 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2021-01-06 16:14:56,368 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-06 16:14:56,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:14:56,368 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 29 [2021-01-06 16:14:56,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378091434] [2021-01-06 16:14:56,369 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-01-06 16:14:56,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:14:56,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-01-06 16:14:56,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=802, Unknown=0, NotChecked=0, Total=870 [2021-01-06 16:14:56,370 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 30 states. [2021-01-06 16:14:58,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:14:58,236 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2021-01-06 16:14:58,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-01-06 16:14:58,237 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 39 [2021-01-06 16:14:58,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:14:58,237 INFO L225 Difference]: With dead ends: 67 [2021-01-06 16:14:58,237 INFO L226 Difference]: Without dead ends: 0 [2021-01-06 16:14:58,239 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=267, Invalid=2385, Unknown=0, NotChecked=0, Total=2652 [2021-01-06 16:14:58,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-01-06 16:14:58,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-01-06 16:14:58,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-01-06 16:14:58,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-01-06 16:14:58,240 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2021-01-06 16:14:58,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:14:58,240 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-01-06 16:14:58,240 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2021-01-06 16:14:58,241 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-01-06 16:14:58,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-01-06 16:14:58,447 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-01-06 16:14:58,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-01-06 16:14:59,227 WARN L197 SmtUtils]: Spent 772.00 ms on a formula simplification. DAG size of input: 233 DAG size of output: 218 [2021-01-06 16:14:59,640 WARN L197 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 207 [2021-01-06 16:15:01,620 WARN L197 SmtUtils]: Spent 1.94 s on a formula simplification. DAG size of input: 215 DAG size of output: 77 [2021-01-06 16:15:01,793 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 30 [2021-01-06 16:15:02,097 WARN L197 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 50 [2021-01-06 16:15:03,376 WARN L197 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 203 DAG size of output: 103 [2021-01-06 16:15:03,805 WARN L197 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 69 [2021-01-06 16:15:03,810 INFO L189 CegarLoopUtils]: For program point L27-2(lines 27 33) no Hoare annotation was computed. [2021-01-06 16:15:03,811 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2021-01-06 16:15:03,811 INFO L185 CegarLoopUtils]: At program point L27-3(lines 27 33) the Hoare annotation is: (let ((.cse13 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse12 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse14 (+ |~#pp~0.offset| 8))) (let ((.cse0 (= (select .cse12 .cse14) 0)) (.cse1 (= (select .cse13 |~#pp~0.offset|) 0)) (.cse2 (= |ULTIMATE.start_malloc_#res.base| 0)) (.cse3 (= |ULTIMATE.start_malloc_#res.offset| 2)) (.cse4 (< 0 ULTIMATE.start_init_~i~0)) (.cse5 (= |~#pstate~0.offset| 0)) (.cse6 (= ULTIMATE.start_main_~b~0.offset (+ ULTIMATE.start_main_~a~0.offset 1))) (.cse7 (= ULTIMATE.start_f_~pointer.offset 1)) (.cse8 (not (= |~#pp~0.base| |~#pstate~0.base|))) (.cse9 (= ULTIMATE.start_main_~a~0.base 0)) (.cse10 (= (select .cse13 .cse14) 0)) (.cse11 (= |~#pp~0.offset| 0))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_f_~pointer.base ULTIMATE.start_main_~a~0.base) .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_f_~i~1 0) .cse7 .cse8 .cse9 .cse10 (= ULTIMATE.start_main_~a~0.offset ULTIMATE.start_f_~pointer.offset) .cse11) (and .cse0 (= ULTIMATE.start_main_~a~0.offset 1) .cse1 (= ULTIMATE.start_f_~i~1 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= (select .cse12 0) ULTIMATE.start_main_~a~0.base)) .cse11)))) [2021-01-06 16:15:03,811 INFO L189 CegarLoopUtils]: For program point L27-6(lines 27 33) no Hoare annotation was computed. [2021-01-06 16:15:03,812 INFO L185 CegarLoopUtils]: At program point L27-7(lines 27 33) the Hoare annotation is: (let ((.cse21 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse24 (+ |~#pp~0.offset| 8))) (let ((.cse13 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse22 (+ ULTIMATE.start_main_~a~0.offset 1)) (.cse20 (select .cse21 .cse24)) (.cse23 (select |#memory_int| |~#pstate~0.base|))) (let ((.cse0 (= (select .cse21 |~#pp~0.offset|) 0)) (.cse2 (= (select .cse23 (+ |~#pstate~0.offset| 4)) 1)) (.cse8 (= .cse20 1)) (.cse1 (= |ULTIMATE.start_malloc_#res.offset| .cse22)) (.cse15 (= (select .cse13 .cse24) 0)) (.cse16 (= (select .cse23 0) 1)) (.cse3 (= |ULTIMATE.start_malloc_#res.base| 0)) (.cse4 (= |ULTIMATE.start_malloc_#res.offset| 2)) (.cse5 (< 0 ULTIMATE.start_init_~i~0)) (.cse6 (= |~#pstate~0.offset| 0)) (.cse7 (= ULTIMATE.start_main_~b~0.offset .cse22)) (.cse14 (= ULTIMATE.start_f_~i~1 0)) (.cse17 (not (= ULTIMATE.start_f_~pointer.offset 1))) (.cse18 (= (select .cse21 0) ULTIMATE.start_main_~a~0.offset)) (.cse9 (not (= |~#pp~0.base| |~#pstate~0.base|))) (.cse10 (= ULTIMATE.start_main_~a~0.base 0)) (.cse19 (= .cse20 0)) (.cse11 (= (select .cse13 0) ULTIMATE.start_main_~a~0.base)) (.cse12 (= |~#pp~0.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (< 0 ULTIMATE.start_f_~i~1) .cse9 .cse10 (not .cse11) .cse12) (and .cse0 .cse1 (not (= (select .cse13 (+ |~#pp~0.offset| (* ULTIMATE.start_f_~i~1 8))) ULTIMATE.start_main_~a~0.base)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse8 .cse9 .cse10 .cse12) (and .cse15 .cse1 .cse16 .cse3 .cse4 .cse5 (<= ULTIMATE.start_f_~i~1 1) .cse6 .cse7 .cse17 .cse18 .cse9 (<= 1 ULTIMATE.start_f_~i~1) .cse10 .cse19 .cse11 .cse12) (and .cse15 (= ULTIMATE.start_main_~a~0.offset 1) .cse16 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse17 .cse18 .cse9 .cse10 .cse19 .cse11 .cse12))))) [2021-01-06 16:15:03,812 INFO L189 CegarLoopUtils]: For program point L19-2(lines 19 22) no Hoare annotation was computed. [2021-01-06 16:15:03,813 INFO L185 CegarLoopUtils]: At program point L19-3(lines 19 22) the Hoare annotation is: (let ((.cse7 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse8 (+ |~#pp~0.offset| 8))) (let ((.cse0 (= (select (select |#memory_$Pointer$.base| |~#pp~0.base|) .cse8) 0)) (.cse1 (= |~#pstate~0.offset| 0)) (.cse2 (= (select .cse7 |~#pp~0.offset|) 0)) (.cse3 (not (= |~#pp~0.base| |~#pstate~0.base|))) (.cse4 (= ~counter~0 1)) (.cse5 (= (select .cse7 .cse8) 0)) (.cse6 (= |~#pp~0.offset| 0))) (or (and .cse0 .cse1 (<= 1 ULTIMATE.start_init_~i~0) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (= ULTIMATE.start_init_~i~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6)))) [2021-01-06 16:15:03,813 INFO L189 CegarLoopUtils]: For program point L36(lines 36 45) no Hoare annotation was computed. [2021-01-06 16:15:03,813 INFO L189 CegarLoopUtils]: For program point L36-1(lines 36 45) no Hoare annotation was computed. [2021-01-06 16:15:03,813 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-01-06 16:15:03,813 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-01-06 16:15:03,813 INFO L189 CegarLoopUtils]: For program point L28(lines 28 32) no Hoare annotation was computed. [2021-01-06 16:15:03,813 INFO L189 CegarLoopUtils]: For program point L28-1(lines 28 32) no Hoare annotation was computed. [2021-01-06 16:15:03,814 INFO L192 CegarLoopUtils]: At program point L70(lines 53 71) the Hoare annotation is: true [2021-01-06 16:15:03,814 INFO L189 CegarLoopUtils]: For program point L38-2(lines 38 44) no Hoare annotation was computed. [2021-01-06 16:15:03,814 INFO L185 CegarLoopUtils]: At program point L38-3(lines 38 44) the Hoare annotation is: (let ((.cse22 (select |#memory_int| |~#pstate~0.base|)) (.cse25 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (let ((.cse28 (+ ULTIMATE.start_main_~a~0.offset 1)) (.cse10 (< 0 ULTIMATE.start_init_~i~0)) (.cse29 (= |~#pp~0.base| |~#pstate~0.base|)) (.cse30 (select .cse25 |~#pp~0.offset|)) (.cse13 (< 0 ULTIMATE.start_f_~i~1)) (.cse12 (= |~#pstate~0.offset| 0)) (.cse14 (= ULTIMATE.start_f_~i~1 0)) (.cse19 (= (select .cse22 (+ |~#pstate~0.offset| 4)) 1))) (let ((.cse4 (<= 2 ULTIMATE.start_g_~i~2)) (.cse0 (= ULTIMATE.start_main_~a~0.offset 1)) (.cse18 (let ((.cse31 (< 0 ULTIMATE.start_g_~i~2))) (or (and .cse12 .cse13 .cse31 .cse19) (and .cse12 .cse14 .cse31 .cse19)))) (.cse1 (select .cse25 (+ |~#pp~0.offset| 8))) (.cse21 (= ULTIMATE.start_g_~i~2 0)) (.cse8 (= .cse30 1)) (.cse9 (or .cse10 .cse29)) (.cse5 (= ULTIMATE.start_main_~b~0.offset .cse28)) (.cse11 (= .cse30 0)) (.cse2 (not .cse29)) (.cse6 (= ULTIMATE.start_main_~a~0.base 0)) (.cse17 (= |ULTIMATE.start_malloc_#res.offset| .cse28)) (.cse7 (= |ULTIMATE.start_malloc_#res.base| 0)) (.cse20 (= ULTIMATE.start_g_~pointer.offset 1)) (.cse15 (= |ULTIMATE.start_malloc_#res.offset| 2)) (.cse16 (= |~#pp~0.offset| 0))) (or (and .cse0 (= .cse1 1) .cse2 (let ((.cse3 (or (and .cse12 .cse13) (and .cse12 .cse14)))) (or (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse3 .cse4 .cse5 .cse11 .cse6 .cse7))) .cse15 .cse16) (and .cse4 .cse5 .cse0 .cse2 .cse6 .cse17 .cse18 .cse7 .cse8 .cse9 .cse16) (and .cse10 .cse4 .cse5 .cse0 .cse11 .cse2 .cse6 .cse17 .cse18 .cse7 .cse16) (and .cse11 .cse17 .cse19 .cse20 .cse7 .cse15 .cse10 .cse12 .cse5 .cse2 .cse13 .cse6 .cse21 .cse16) (let ((.cse24 (+ |~#pp~0.offset| (* ULTIMATE.start_g_~i~2 8))) (.cse23 (select |#memory_$Pointer$.base| |~#pp~0.base|))) (and (= ULTIMATE.start_f_~i~1 1) (= (select .cse22 0) 1) (= ULTIMATE.start_g_~pointer.base (select .cse23 .cse24)) .cse19 .cse7 .cse20 .cse9 .cse15 (= ULTIMATE.start_g_~pointer.offset (select .cse25 .cse24)) .cse5 .cse12 (not (= ULTIMATE.start_f_~pointer.offset 1)) (= (select .cse25 0) ULTIMATE.start_main_~a~0.offset) .cse2 .cse6 (not (= ULTIMATE.start_g_~pointer.offset .cse1)) (= (select .cse23 0) ULTIMATE.start_main_~a~0.base) .cse21 .cse16)) (and (let ((.cse26 (let ((.cse27 (= (* ULTIMATE.start_g_~i~2 4) 4))) (or (and .cse27 .cse12 .cse14 .cse19) (and .cse27 .cse12 .cse13 .cse19))))) (or (and .cse5 .cse26 .cse2 .cse6 .cse17 .cse7 .cse8 .cse9) (and .cse10 .cse5 .cse26 .cse11 .cse2 .cse6 .cse17 .cse7))) .cse20 .cse15 .cse16))))) [2021-01-06 16:15:03,814 INFO L189 CegarLoopUtils]: For program point L38-6(lines 38 44) no Hoare annotation was computed. [2021-01-06 16:15:03,815 INFO L185 CegarLoopUtils]: At program point L38-7(lines 38 44) the Hoare annotation is: (let ((.cse23 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse20 (= |~#pp~0.base| |~#pstate~0.base|))) (let ((.cse21 (+ ULTIMATE.start_main_~a~0.offset 1)) (.cse19 (= ULTIMATE.start_f_~i~1 0)) (.cse13 (= |~#pstate~0.offset| 0)) (.cse15 (not .cse20)) (.cse14 (< 0 ULTIMATE.start_f_~i~1)) (.cse16 (= ULTIMATE.start_main_~a~0.base 0)) (.cse18 (= (select (select |#memory_int| |~#pstate~0.base|) (+ |~#pstate~0.offset| 4)) 1)) (.cse12 (= ULTIMATE.start_g_~i~2 0)) (.cse22 (select .cse23 |~#pp~0.offset|))) (let ((.cse2 (= (select .cse23 (+ |~#pp~0.offset| 8)) 1)) (.cse10 (= .cse22 1)) (.cse11 (= .cse22 0)) (.cse9 (or (and .cse19 .cse13 .cse15 .cse16 .cse18 .cse12) (and .cse13 .cse15 .cse14 .cse16 .cse18 .cse12))) (.cse4 (= ULTIMATE.start_g_~pointer.offset 2)) (.cse7 (or (and .cse13 .cse14 .cse15 .cse16) (and .cse19 .cse13 .cse15 .cse16))) (.cse0 (= ULTIMATE.start_main_~b~0.offset .cse21)) (.cse1 (= ULTIMATE.start_main_~a~0.offset 1)) (.cse3 (= |ULTIMATE.start_malloc_#res.offset| .cse21)) (.cse5 (= |ULTIMATE.start_malloc_#res.base| 0)) (.cse6 (or (< 0 ULTIMATE.start_init_~i~0) .cse20)) (.cse8 (= |~#pp~0.offset| 0))) (or (and (<= 1 ULTIMATE.start_g_~i~2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse9 .cse4 .cse5 .cse6 .cse10 .cse8) (and .cse2 (or (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse10 .cse7 .cse8) (and .cse0 .cse1 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)) .cse12 (= |ULTIMATE.start_malloc_#res.offset| 2)) (and .cse0 .cse1 .cse11 .cse3 .cse9 .cse4 .cse5 .cse6 .cse8) (and .cse0 (<= 2 ULTIMATE.start_g_~i~2) .cse1 .cse3 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 (let ((.cse17 (< 0 ULTIMATE.start_g_~i~2))) (or (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse13 .cse15 .cse16 .cse17 .cse18))) .cse3 .cse5 .cse6 .cse8))))) [2021-01-06 16:15:03,815 INFO L189 CegarLoopUtils]: For program point L39(lines 39 43) no Hoare annotation was computed. [2021-01-06 16:15:03,815 INFO L189 CegarLoopUtils]: For program point L6(lines 1 71) no Hoare annotation was computed. [2021-01-06 16:15:03,815 INFO L189 CegarLoopUtils]: For program point L39-2(lines 39 43) no Hoare annotation was computed. [2021-01-06 16:15:03,815 INFO L189 CegarLoopUtils]: For program point L6-1(lines 1 71) no Hoare annotation was computed. [2021-01-06 16:15:03,815 INFO L189 CegarLoopUtils]: For program point L-1(line -1) no Hoare annotation was computed. [2021-01-06 16:15:03,815 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2021-01-06 16:15:03,816 INFO L185 CegarLoopUtils]: At program point L49(lines 48 51) the Hoare annotation is: (let ((.cse1 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse0 (+ |~#pp~0.offset| 8))) (and (< 0 ULTIMATE.start_init_~i~0) (= (select (select |#memory_$Pointer$.base| |~#pp~0.base|) .cse0) 0) (= |~#pstate~0.offset| 0) (= ~counter~0 (+ |ULTIMATE.start_malloc_#res.offset| 1)) (= |ULTIMATE.start_malloc_#res.offset| 1) (= (select .cse1 |~#pp~0.offset|) 0) (not (= |~#pp~0.base| |~#pstate~0.base|)) (= (select .cse1 .cse0) 0) (= |ULTIMATE.start_malloc_#res.base| 0) (= |~#pp~0.offset| 0))) [2021-01-06 16:15:03,816 INFO L185 CegarLoopUtils]: At program point L49-1(lines 48 51) the Hoare annotation is: (let ((.cse1 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse0 (+ |~#pp~0.offset| 8))) (and (< 0 ULTIMATE.start_init_~i~0) (= (select (select |#memory_$Pointer$.base| |~#pp~0.base|) .cse0) 0) (= |~#pstate~0.offset| 0) (= (select .cse1 |~#pp~0.offset|) 0) (not (= |~#pp~0.base| |~#pstate~0.base|)) (= |ULTIMATE.start_malloc_#res.offset| (+ ULTIMATE.start_main_~a~0.offset 1)) (= ULTIMATE.start_main_~a~0.base 0) (= (select .cse1 .cse0) 0) (= |ULTIMATE.start_malloc_#res.base| 0) (= |ULTIMATE.start_malloc_#res.offset| 2) (= |~#pp~0.offset| 0))) [2021-01-06 16:15:03,816 INFO L189 CegarLoopUtils]: For program point L41(line 41) no Hoare annotation was computed. [2021-01-06 16:15:03,816 INFO L189 CegarLoopUtils]: For program point L8(line 8) no Hoare annotation was computed. [2021-01-06 16:15:03,816 INFO L189 CegarLoopUtils]: For program point L41-2(line 41) no Hoare annotation was computed. [2021-01-06 16:15:03,816 INFO L189 CegarLoopUtils]: For program point L8-1(line 8) no Hoare annotation was computed. [2021-01-06 16:15:03,817 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-01-06 16:15:03,817 INFO L189 CegarLoopUtils]: For program point L25(lines 25 34) no Hoare annotation was computed. [2021-01-06 16:15:03,817 INFO L189 CegarLoopUtils]: For program point L25-1(lines 25 34) no Hoare annotation was computed. [2021-01-06 16:15:03,817 INFO L189 CegarLoopUtils]: For program point L17(lines 17 23) no Hoare annotation was computed. [2021-01-06 16:15:03,817 INFO L189 CegarLoopUtils]: For program point L59(lines 59 60) no Hoare annotation was computed. [2021-01-06 16:15:03,830 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,832 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,833 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,833 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,834 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,834 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,851 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,852 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,852 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,852 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,853 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,855 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,867 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:03,868 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,871 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,872 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:03,873 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,876 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,877 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:03,877 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,878 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,878 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:03,878 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,878 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,883 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:03,883 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,883 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,884 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:03,884 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,884 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,888 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:03,889 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,889 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,890 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:03,890 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,890 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,894 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:03,895 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,895 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,895 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:03,896 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,896 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,896 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:03,899 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:03,900 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,900 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,900 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:03,901 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,901 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,901 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:03,906 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,906 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,907 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,909 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,910 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,910 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,912 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:03,912 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,912 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,913 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,913 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:03,913 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,914 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,919 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,920 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,920 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,920 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,921 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,921 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,922 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:03,922 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,922 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,922 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,923 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:03,923 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,923 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,933 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,934 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,934 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:03,934 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,934 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:03,934 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,935 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:03,938 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,938 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,938 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:03,938 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:03,939 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,941 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,942 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:03,943 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,943 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,943 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:03,944 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,944 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:03,944 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,944 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:03,945 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,945 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,945 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:03,945 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:03,946 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,946 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:03,946 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:03,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 04:15:03 BoogieIcfgContainer [2021-01-06 16:15:03,951 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 16:15:03,954 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 16:15:03,954 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 16:15:03,954 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 16:15:03,955 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 04:11:47" (3/4) ... [2021-01-06 16:15:03,958 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-01-06 16:15:03,984 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-01-06 16:15:03,984 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-01-06 16:15:03,985 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 16:15:03,985 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 16:15:04,020 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((0 < i && #memory_$Pointer$[pp][pp + 8] == 0) && pstate == 0) && counter == \result + 1) && \result == 1) && #memory_$Pointer$[pp][pp] == 0) && !(pp == pstate)) && #memory_$Pointer$[pp][pp + 8] == 0) && \result == 0) && pp == 0 [2021-01-06 16:15:04,023 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((0 < i && #memory_$Pointer$[pp][pp + 8] == 0) && pstate == 0) && #memory_$Pointer$[pp][pp] == 0) && !(pp == pstate)) && \result == a + 1) && a == 0) && #memory_$Pointer$[pp][pp + 8] == 0) && \result == 0) && \result == 2) && pp == 0 [2021-01-06 16:15:04,024 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((#memory_$Pointer$[pp][pp + 8] == 0 && #memory_$Pointer$[pp][pp] == 0) && \result == 0) && pointer == a) && \result == 2) && 0 < i) && pstate == 0) && b == a + 1) && i == 0) && pointer == 1) && !(pp == pstate)) && a == 0) && #memory_$Pointer$[pp][pp + 8] == 0) && a == pointer) && pp == 0) || ((((((((((((((#memory_$Pointer$[pp][pp + 8] == 0 && a == 1) && #memory_$Pointer$[pp][pp] == 0) && i == 1) && \result == 0) && \result == 2) && 0 < i) && pstate == 0) && b == a + 1) && pointer == 1) && !(pp == pstate)) && a == 0) && #memory_$Pointer$[pp][pp + 8] == 0) && !(#memory_$Pointer$[pp][0] == a)) && pp == 0) [2021-01-06 16:15:04,024 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((#memory_$Pointer$[pp][pp] == 0 && \result == a + 1) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) && \result == 0) && \result == 2) && 0 < i) && pstate == 0) && b == a + 1) && #memory_$Pointer$[pp][pp + 8] == 1) && 0 < i) && !(pp == pstate)) && a == 0) && !(#memory_$Pointer$[pp][0] == a)) && pp == 0) || (((((((((((((#memory_$Pointer$[pp][pp] == 0 && \result == a + 1) && !(#memory_$Pointer$[pp][pp + i * 8] == a)) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) && \result == 0) && \result == 2) && 0 < i) && pstate == 0) && b == a + 1) && i == 0) && #memory_$Pointer$[pp][pp + 8] == 1) && !(pp == pstate)) && a == 0) && pp == 0)) || ((((((((((((((((#memory_$Pointer$[pp][pp + 8] == 0 && \result == a + 1) && unknown-#memory_int-unknown[pstate][0] == 1) && \result == 0) && \result == 2) && 0 < i) && i <= 1) && pstate == 0) && b == a + 1) && !(pointer == 1)) && #memory_$Pointer$[pp][0] == a) && !(pp == pstate)) && 1 <= i) && a == 0) && #memory_$Pointer$[pp][pp + 8] == 0) && #memory_$Pointer$[pp][0] == a) && pp == 0)) || (((((((((((((((#memory_$Pointer$[pp][pp + 8] == 0 && a == 1) && unknown-#memory_int-unknown[pstate][0] == 1) && \result == 0) && \result == 2) && 0 < i) && pstate == 0) && b == a + 1) && i == 0) && !(pointer == 1)) && #memory_$Pointer$[pp][0] == a) && !(pp == pstate)) && a == 0) && #memory_$Pointer$[pp][pp + 8] == 0) && #memory_$Pointer$[pp][0] == a) && pp == 0) [2021-01-06 16:15:04,025 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((a == 1 && #memory_$Pointer$[pp][pp + 8] == 1) && !(pp == pstate)) && (((((((((pstate == 0 && 0 < i) || (pstate == 0 && i == 0)) && 2 <= i) && b == a + 1) && a == 0) && \result == 0) && #memory_$Pointer$[pp][pp] == 1) && (0 < i || pp == pstate)) || ((((((0 < i && ((pstate == 0 && 0 < i) || (pstate == 0 && i == 0))) && 2 <= i) && b == a + 1) && #memory_$Pointer$[pp][pp] == 0) && a == 0) && \result == 0))) && \result == 2) && pp == 0) || ((((((((((2 <= i && b == a + 1) && a == 1) && !(pp == pstate)) && a == 0) && \result == a + 1) && ((((pstate == 0 && 0 < i) && 0 < i) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) || (((pstate == 0 && i == 0) && 0 < i) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1))) && \result == 0) && #memory_$Pointer$[pp][pp] == 1) && (0 < i || pp == pstate)) && pp == 0)) || ((((((((((0 < i && 2 <= i) && b == a + 1) && a == 1) && #memory_$Pointer$[pp][pp] == 0) && !(pp == pstate)) && a == 0) && \result == a + 1) && ((((pstate == 0 && 0 < i) && 0 < i) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) || (((pstate == 0 && i == 0) && 0 < i) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1))) && \result == 0) && pp == 0)) || (((((((((((((#memory_$Pointer$[pp][pp] == 0 && \result == a + 1) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) && pointer == 1) && \result == 0) && \result == 2) && 0 < i) && pstate == 0) && b == a + 1) && !(pp == pstate)) && 0 < i) && a == 0) && i == 0) && pp == 0)) || ((((((((((((((((((i == 1 && unknown-#memory_int-unknown[pstate][0] == 1) && pointer == #memory_$Pointer$[pp][pp + i * 8]) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) && \result == 0) && pointer == 1) && (0 < i || pp == pstate)) && \result == 2) && pointer == #memory_$Pointer$[pp][pp + i * 8]) && b == a + 1) && pstate == 0) && !(pointer == 1)) && #memory_$Pointer$[pp][0] == a) && !(pp == pstate)) && a == 0) && !(pointer == #memory_$Pointer$[pp][pp + 8])) && #memory_$Pointer$[pp][0] == a) && i == 0) && pp == 0)) || (((((((((((b == a + 1 && ((((i * 4 == 4 && pstate == 0) && i == 0) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) || (((i * 4 == 4 && pstate == 0) && 0 < i) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1))) && !(pp == pstate)) && a == 0) && \result == a + 1) && \result == 0) && #memory_$Pointer$[pp][pp] == 1) && (0 < i || pp == pstate)) || (((((((0 < i && b == a + 1) && ((((i * 4 == 4 && pstate == 0) && i == 0) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) || (((i * 4 == 4 && pstate == 0) && 0 < i) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1))) && #memory_$Pointer$[pp][pp] == 0) && !(pp == pstate)) && a == 0) && \result == a + 1) && \result == 0)) && pointer == 1) && \result == 2) && pp == 0) [2021-01-06 16:15:04,026 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((1 <= i && b == a + 1) && a == 1) && #memory_$Pointer$[pp][pp + 8] == 1) && \result == a + 1) && pointer == 2) && \result == 0) && (0 < i || pp == pstate)) && ((((pstate == 0 && 0 < i) && !(pp == pstate)) && a == 0) || (((i == 0 && pstate == 0) && !(pp == pstate)) && a == 0))) && pp == 0) || ((((((((b == a + 1 && a == 1) && \result == a + 1) && ((((((i == 0 && pstate == 0) && !(pp == pstate)) && a == 0) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) && i == 0) || (((((pstate == 0 && !(pp == pstate)) && 0 < i) && a == 0) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) && i == 0))) && pointer == 2) && \result == 0) && (0 < i || pp == pstate)) && #memory_$Pointer$[pp][pp] == 1) && pp == 0)) || (((#memory_$Pointer$[pp][pp + 8] == 1 && ((((((((b == a + 1 && a == 1) && pointer == 2) && \result == 0) && (0 < i || pp == pstate)) && #memory_$Pointer$[pp][pp] == 1) && ((((pstate == 0 && 0 < i) && !(pp == pstate)) && a == 0) || (((i == 0 && pstate == 0) && !(pp == pstate)) && a == 0))) && pp == 0) || ((((((((b == a + 1 && a == 1) && #memory_$Pointer$[pp][pp] == 0) && \result == a + 1) && pointer == 2) && \result == 0) && (0 < i || pp == pstate)) && ((((pstate == 0 && 0 < i) && !(pp == pstate)) && a == 0) || (((i == 0 && pstate == 0) && !(pp == pstate)) && a == 0))) && pp == 0))) && i == 0) && \result == 2)) || ((((((((b == a + 1 && a == 1) && #memory_$Pointer$[pp][pp] == 0) && \result == a + 1) && ((((((i == 0 && pstate == 0) && !(pp == pstate)) && a == 0) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) && i == 0) || (((((pstate == 0 && !(pp == pstate)) && 0 < i) && a == 0) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) && i == 0))) && pointer == 2) && \result == 0) && (0 < i || pp == pstate)) && pp == 0)) || (((((((b == a + 1 && 2 <= i) && a == 1) && \result == a + 1) && \result == 0) && (0 < i || pp == pstate)) && ((((pstate == 0 && 0 < i) && !(pp == pstate)) && a == 0) || (((i == 0 && pstate == 0) && !(pp == pstate)) && a == 0))) && pp == 0)) || ((((((b == a + 1 && a == 1) && ((((((pstate == 0 && 0 < i) && !(pp == pstate)) && a == 0) && 0 < i) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) || (((((i == 0 && pstate == 0) && !(pp == pstate)) && a == 0) && 0 < i) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1))) && \result == a + 1) && \result == 0) && (0 < i || pp == pstate)) && pp == 0) [2021-01-06 16:15:04,065 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/ldv-regression/ex3_forlist.i-witness.graphml [2021-01-06 16:15:04,066 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 16:15:04,067 INFO L168 Benchmark]: Toolchain (without parser) took 197809.49 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 126.5 MB in the beginning and 157.9 MB in the end (delta: -31.3 MB). Peak memory consumption was 103.8 MB. Max. memory is 8.0 GB. [2021-01-06 16:15:04,067 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 151.0 MB. Free memory was 123.9 MB in the beginning and 123.8 MB in the end (delta: 80.1 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 16:15:04,068 INFO L168 Benchmark]: CACSL2BoogieTranslator took 333.76 ms. Allocated memory is still 151.0 MB. Free memory was 126.4 MB in the beginning and 116.2 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2021-01-06 16:15:04,068 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.51 ms. Allocated memory is still 151.0 MB. Free memory was 116.2 MB in the beginning and 114.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-06 16:15:04,068 INFO L168 Benchmark]: Boogie Preprocessor took 38.61 ms. Allocated memory is still 151.0 MB. Free memory was 114.3 MB in the beginning and 112.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-01-06 16:15:04,069 INFO L168 Benchmark]: RCFGBuilder took 667.74 ms. Allocated memory is still 151.0 MB. Free memory was 112.7 MB in the beginning and 123.3 MB in the end (delta: -10.6 MB). Peak memory consumption was 14.9 MB. Max. memory is 8.0 GB. [2021-01-06 16:15:04,070 INFO L168 Benchmark]: TraceAbstraction took 196589.77 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 122.8 MB in the beginning and 55.9 MB in the end (delta: 66.9 MB). Peak memory consumption was 100.5 MB. Max. memory is 8.0 GB. [2021-01-06 16:15:04,071 INFO L168 Benchmark]: Witness Printer took 112.15 ms. Allocated memory is still 181.4 MB. Free memory was 55.9 MB in the beginning and 157.9 MB in the end (delta: -102.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-06 16:15:04,074 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 151.0 MB. Free memory was 123.9 MB in the beginning and 123.8 MB in the end (delta: 80.1 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 333.76 ms. Allocated memory is still 151.0 MB. Free memory was 126.4 MB in the beginning and 116.2 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 54.51 ms. Allocated memory is still 151.0 MB. Free memory was 116.2 MB in the beginning and 114.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 38.61 ms. Allocated memory is still 151.0 MB. Free memory was 114.3 MB in the beginning and 112.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 667.74 ms. Allocated memory is still 151.0 MB. Free memory was 112.7 MB in the beginning and 123.3 MB in the end (delta: -10.6 MB). Peak memory consumption was 14.9 MB. Max. memory is 8.0 GB. * TraceAbstraction took 196589.77 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 122.8 MB in the beginning and 55.9 MB in the end (delta: 66.9 MB). Peak memory consumption was 100.5 MB. Max. memory is 8.0 GB. * Witness Printer took 112.15 ms. Allocated memory is still 181.4 MB. Free memory was 55.9 MB in the beginning and 157.9 MB in the end (delta: -102.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 8]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 38]: Loop Invariant [2021-01-06 16:15:04,096 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,096 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,097 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,097 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,097 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,097 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,100 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,100 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,100 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,101 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,101 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,101 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((1 <= i && b == a + 1) && a == 1) && #memory_$Pointer$[pp][pp + 8] == 1) && \result == a + 1) && pointer == 2) && \result == 0) && (0 < i || pp == pstate)) && ((((pstate == 0 && 0 < i) && !(pp == pstate)) && a == 0) || (((i == 0 && pstate == 0) && !(pp == pstate)) && a == 0))) && pp == 0) || ((((((((b == a + 1 && a == 1) && \result == a + 1) && ((((((i == 0 && pstate == 0) && !(pp == pstate)) && a == 0) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) && i == 0) || (((((pstate == 0 && !(pp == pstate)) && 0 < i) && a == 0) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) && i == 0))) && pointer == 2) && \result == 0) && (0 < i || pp == pstate)) && #memory_$Pointer$[pp][pp] == 1) && pp == 0)) || (((#memory_$Pointer$[pp][pp + 8] == 1 && ((((((((b == a + 1 && a == 1) && pointer == 2) && \result == 0) && (0 < i || pp == pstate)) && #memory_$Pointer$[pp][pp] == 1) && ((((pstate == 0 && 0 < i) && !(pp == pstate)) && a == 0) || (((i == 0 && pstate == 0) && !(pp == pstate)) && a == 0))) && pp == 0) || ((((((((b == a + 1 && a == 1) && #memory_$Pointer$[pp][pp] == 0) && \result == a + 1) && pointer == 2) && \result == 0) && (0 < i || pp == pstate)) && ((((pstate == 0 && 0 < i) && !(pp == pstate)) && a == 0) || (((i == 0 && pstate == 0) && !(pp == pstate)) && a == 0))) && pp == 0))) && i == 0) && \result == 2)) || ((((((((b == a + 1 && a == 1) && #memory_$Pointer$[pp][pp] == 0) && \result == a + 1) && ((((((i == 0 && pstate == 0) && !(pp == pstate)) && a == 0) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) && i == 0) || (((((pstate == 0 && !(pp == pstate)) && 0 < i) && a == 0) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) && i == 0))) && pointer == 2) && \result == 0) && (0 < i || pp == pstate)) && pp == 0)) || (((((((b == a + 1 && 2 <= i) && a == 1) && \result == a + 1) && \result == 0) && (0 < i || pp == pstate)) && ((((pstate == 0 && 0 < i) && !(pp == pstate)) && a == 0) || (((i == 0 && pstate == 0) && !(pp == pstate)) && a == 0))) && pp == 0)) || ((((((b == a + 1 && a == 1) && ((((((pstate == 0 && 0 < i) && !(pp == pstate)) && a == 0) && 0 < i) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) || (((((i == 0 && pstate == 0) && !(pp == pstate)) && a == 0) && 0 < i) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1))) && \result == a + 1) && \result == 0) && (0 < i || pp == pstate)) && pp == 0) - InvariantResult [Line: 48]: Loop Invariant [2021-01-06 16:15:04,103 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:04,104 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,104 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,105 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:04,105 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,105 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((0 < i && #memory_$Pointer$[pp][pp + 8] == 0) && pstate == 0) && #memory_$Pointer$[pp][pp] == 0) && !(pp == pstate)) && \result == a + 1) && a == 0) && #memory_$Pointer$[pp][pp + 8] == 0) && \result == 0) && \result == 2) && pp == 0 - InvariantResult [Line: 19]: Loop Invariant [2021-01-06 16:15:04,106 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:04,106 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,106 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,107 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:04,107 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,107 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,107 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:04,108 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,108 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,108 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:04,108 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,108 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((#memory_$Pointer$[pp][pp + 8] == 0 && pstate == 0) && 1 <= i) && #memory_$Pointer$[pp][pp] == 0) && !(pp == pstate)) && counter == 1) && #memory_$Pointer$[pp][pp + 8] == 0) && pp == 0) || (((((((#memory_$Pointer$[pp][pp + 8] == 0 && i == 0) && pstate == 0) && #memory_$Pointer$[pp][pp] == 0) && !(pp == pstate)) && counter == 1) && #memory_$Pointer$[pp][pp + 8] == 0) && pp == 0) - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 48]: Loop Invariant [2021-01-06 16:15:04,110 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:04,111 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,111 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,112 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:04,112 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,112 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((0 < i && #memory_$Pointer$[pp][pp + 8] == 0) && pstate == 0) && counter == \result + 1) && \result == 1) && #memory_$Pointer$[pp][pp] == 0) && !(pp == pstate)) && #memory_$Pointer$[pp][pp + 8] == 0) && \result == 0) && pp == 0 - InvariantResult [Line: 27]: Loop Invariant [2021-01-06 16:15:04,113 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:04,113 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,113 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,113 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:04,114 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,114 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,114 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:04,115 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:04,115 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,115 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,115 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:04,116 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,116 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,116 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((#memory_$Pointer$[pp][pp + 8] == 0 && #memory_$Pointer$[pp][pp] == 0) && \result == 0) && pointer == a) && \result == 2) && 0 < i) && pstate == 0) && b == a + 1) && i == 0) && pointer == 1) && !(pp == pstate)) && a == 0) && #memory_$Pointer$[pp][pp + 8] == 0) && a == pointer) && pp == 0) || ((((((((((((((#memory_$Pointer$[pp][pp + 8] == 0 && a == 1) && #memory_$Pointer$[pp][pp] == 0) && i == 1) && \result == 0) && \result == 2) && 0 < i) && pstate == 0) && b == a + 1) && pointer == 1) && !(pp == pstate)) && a == 0) && #memory_$Pointer$[pp][pp + 8] == 0) && !(#memory_$Pointer$[pp][0] == a)) && pp == 0) - InvariantResult [Line: 38]: Loop Invariant [2021-01-06 16:15:04,117 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,117 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,117 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,118 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,118 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,118 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,118 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:04,119 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,119 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,119 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,119 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:04,119 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,120 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,121 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,122 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,122 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,122 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,122 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,123 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,123 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:04,123 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,123 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,124 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,124 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:04,125 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,125 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((a == 1 && #memory_$Pointer$[pp][pp + 8] == 1) && !(pp == pstate)) && (((((((((pstate == 0 && 0 < i) || (pstate == 0 && i == 0)) && 2 <= i) && b == a + 1) && a == 0) && \result == 0) && #memory_$Pointer$[pp][pp] == 1) && (0 < i || pp == pstate)) || ((((((0 < i && ((pstate == 0 && 0 < i) || (pstate == 0 && i == 0))) && 2 <= i) && b == a + 1) && #memory_$Pointer$[pp][pp] == 0) && a == 0) && \result == 0))) && \result == 2) && pp == 0) || ((((((((((2 <= i && b == a + 1) && a == 1) && !(pp == pstate)) && a == 0) && \result == a + 1) && ((((pstate == 0 && 0 < i) && 0 < i) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) || (((pstate == 0 && i == 0) && 0 < i) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1))) && \result == 0) && #memory_$Pointer$[pp][pp] == 1) && (0 < i || pp == pstate)) && pp == 0)) || ((((((((((0 < i && 2 <= i) && b == a + 1) && a == 1) && #memory_$Pointer$[pp][pp] == 0) && !(pp == pstate)) && a == 0) && \result == a + 1) && ((((pstate == 0 && 0 < i) && 0 < i) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) || (((pstate == 0 && i == 0) && 0 < i) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1))) && \result == 0) && pp == 0)) || (((((((((((((#memory_$Pointer$[pp][pp] == 0 && \result == a + 1) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) && pointer == 1) && \result == 0) && \result == 2) && 0 < i) && pstate == 0) && b == a + 1) && !(pp == pstate)) && 0 < i) && a == 0) && i == 0) && pp == 0)) || ((((((((((((((((((i == 1 && unknown-#memory_int-unknown[pstate][0] == 1) && pointer == #memory_$Pointer$[pp][pp + i * 8]) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) && \result == 0) && pointer == 1) && (0 < i || pp == pstate)) && \result == 2) && pointer == #memory_$Pointer$[pp][pp + i * 8]) && b == a + 1) && pstate == 0) && !(pointer == 1)) && #memory_$Pointer$[pp][0] == a) && !(pp == pstate)) && a == 0) && !(pointer == #memory_$Pointer$[pp][pp + 8])) && #memory_$Pointer$[pp][0] == a) && i == 0) && pp == 0)) || (((((((((((b == a + 1 && ((((i * 4 == 4 && pstate == 0) && i == 0) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) || (((i * 4 == 4 && pstate == 0) && 0 < i) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1))) && !(pp == pstate)) && a == 0) && \result == a + 1) && \result == 0) && #memory_$Pointer$[pp][pp] == 1) && (0 < i || pp == pstate)) || (((((((0 < i && b == a + 1) && ((((i * 4 == 4 && pstate == 0) && i == 0) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) || (((i * 4 == 4 && pstate == 0) && 0 < i) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1))) && #memory_$Pointer$[pp][pp] == 0) && !(pp == pstate)) && a == 0) && \result == a + 1) && \result == 0)) && pointer == 1) && \result == 2) && pp == 0) - InvariantResult [Line: 27]: Loop Invariant [2021-01-06 16:15:04,127 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,127 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,128 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:04,129 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,130 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:04,130 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,130 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:04,130 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,131 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,131 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:04,132 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:04,132 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,132 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,132 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:04,133 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,134 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,134 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:04,134 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,134 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:04,134 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,135 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:04,135 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,135 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,136 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:04,136 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:15:04,137 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,137 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:15:04,137 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((#memory_$Pointer$[pp][pp] == 0 && \result == a + 1) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) && \result == 0) && \result == 2) && 0 < i) && pstate == 0) && b == a + 1) && #memory_$Pointer$[pp][pp + 8] == 1) && 0 < i) && !(pp == pstate)) && a == 0) && !(#memory_$Pointer$[pp][0] == a)) && pp == 0) || (((((((((((((#memory_$Pointer$[pp][pp] == 0 && \result == a + 1) && !(#memory_$Pointer$[pp][pp + i * 8] == a)) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) && \result == 0) && \result == 2) && 0 < i) && pstate == 0) && b == a + 1) && i == 0) && #memory_$Pointer$[pp][pp + 8] == 1) && !(pp == pstate)) && a == 0) && pp == 0)) || ((((((((((((((((#memory_$Pointer$[pp][pp + 8] == 0 && \result == a + 1) && unknown-#memory_int-unknown[pstate][0] == 1) && \result == 0) && \result == 2) && 0 < i) && i <= 1) && pstate == 0) && b == a + 1) && !(pointer == 1)) && #memory_$Pointer$[pp][0] == a) && !(pp == pstate)) && 1 <= i) && a == 0) && #memory_$Pointer$[pp][pp + 8] == 0) && #memory_$Pointer$[pp][0] == a) && pp == 0)) || (((((((((((((((#memory_$Pointer$[pp][pp + 8] == 0 && a == 1) && unknown-#memory_int-unknown[pstate][0] == 1) && \result == 0) && \result == 2) && 0 < i) && pstate == 0) && b == a + 1) && i == 0) && !(pointer == 1)) && #memory_$Pointer$[pp][0] == a) && !(pp == pstate)) && a == 0) && #memory_$Pointer$[pp][pp + 8] == 0) && #memory_$Pointer$[pp][0] == a) && pp == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 35 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 190.9s, OverallIterations: 16, TraceHistogramMax: 3, AutomataDifference: 150.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 585 SDtfs, 3097 SDslu, 3193 SDs, 0 SdLazy, 5019 SolverSat, 995 SolverUnsat, 65 SolverUnknown, 0 SolverNotchecked, 70.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 702 GetRequests, 299 SyntacticMatches, 8 SemanticMatches, 395 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3264 ImplicationChecksByTransitivity, 109.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=121occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 792 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 34 NumberOfFragments, 1761 HoareAnnotationTreeSize, 8 FomulaSimplifications, 21170443 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 8 FomulaSimplificationsInter, 13931982 FormulaSimplificationTreeSizeReductionInter, 4.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 34.9s InterpolantComputationTime, 796 NumberOfCodeBlocks, 796 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 767 ConstructedInterpolants, 31 QuantifiedInterpolants, 281527 SizeOfPredicates, 126 NumberOfNonLiveVariables, 2488 ConjunctsInSsa, 258 ConjunctsInUnsatCore, 29 InterpolantComputations, 6 PerfectInterpolantSequences, 142/248 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...