/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/list-simple/sll2n_update_all_reverse.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 16:31:51,454 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 16:31:51,458 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 16:31:51,512 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 16:31:51,512 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 16:31:51,516 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 16:31:51,519 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 16:31:51,533 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 16:31:51,535 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 16:31:51,536 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 16:31:51,537 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 16:31:51,539 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 16:31:51,539 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 16:31:51,540 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 16:31:51,542 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 16:31:51,543 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 16:31:51,544 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 16:31:51,545 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 16:31:51,547 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 16:31:51,549 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 16:31:51,551 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 16:31:51,552 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 16:31:51,553 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 16:31:51,554 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 16:31:51,557 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 16:31:51,557 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 16:31:51,558 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 16:31:51,559 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 16:31:51,559 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 16:31:51,560 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 16:31:51,561 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 16:31:51,562 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 16:31:51,562 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 16:31:51,563 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 16:31:51,564 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 16:31:51,565 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 16:31:51,566 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 16:31:51,566 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 16:31:51,566 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 16:31:51,567 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 16:31:51,568 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 16:31:51,569 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:31:51,594 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 16:31:51,594 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 16:31:51,596 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 16:31:51,596 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 16:31:51,599 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 16:31:51,599 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 16:31:51,599 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 16:31:51,599 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 16:31:51,600 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 16:31:51,600 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 16:31:51,600 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 16:31:51,600 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 16:31:51,600 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 16:31:51,601 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 16:31:51,601 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 16:31:51,601 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 16:31:51,601 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 16:31:51,601 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 16:31:51,602 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 16:31:51,602 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 16:31:51,602 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 16:31:51,602 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 16:31:51,602 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 16:31:51,603 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 16:31:51,603 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 16:31:51,603 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:31:51,995 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 16:31:52,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 16:31:52,041 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 16:31:52,042 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 16:31:52,043 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 16:31:52,044 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2021-01-06 16:31:52,133 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/bbf12170f/df8151babcff42f8a3941d9ceee6640a/FLAG3e1e0299e [2021-01-06 16:31:52,784 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 16:31:52,784 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2021-01-06 16:31:52,807 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/bbf12170f/df8151babcff42f8a3941d9ceee6640a/FLAG3e1e0299e [2021-01-06 16:31:53,041 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/bbf12170f/df8151babcff42f8a3941d9ceee6640a [2021-01-06 16:31:53,044 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 16:31:53,047 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 16:31:53,048 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 16:31:53,048 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 16:31:53,054 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 16:31:53,055 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 04:31:53" (1/1) ... [2021-01-06 16:31:53,057 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e6e0a81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:31:53, skipping insertion in model container [2021-01-06 16:31:53,057 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 04:31:53" (1/1) ... [2021-01-06 16:31:53,066 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 16:31:53,130 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~temp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~temp~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~temp~0,],base],StructAccessExpression[IdentifierExpression[~temp~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~new_head~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~head~0,] left hand side expression in assignment: lhs: VariableLHS[~head,] left hand side expression in assignment: lhs: VariableLHS[~head,] left hand side expression in assignment: lhs: VariableLHS[~head,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head,],base],StructAccessExpression[IdentifierExpression[~head,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] [2021-01-06 16:31:53,431 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/list-simple/sll2n_update_all_reverse.i[24236,24249] [2021-01-06 16:31:53,435 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 16:31:53,444 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~temp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~temp~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~temp~0,],base],StructAccessExpression[IdentifierExpression[~temp~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~new_head~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~head~0,] left hand side expression in assignment: lhs: VariableLHS[~head,] left hand side expression in assignment: lhs: VariableLHS[~head,] left hand side expression in assignment: lhs: VariableLHS[~head,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head,],base],StructAccessExpression[IdentifierExpression[~head,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] [2021-01-06 16:31:53,511 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/list-simple/sll2n_update_all_reverse.i[24236,24249] [2021-01-06 16:31:53,512 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 16:31:53,592 INFO L208 MainTranslator]: Completed translation [2021-01-06 16:31:53,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:31:53 WrapperNode [2021-01-06 16:31:53,593 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 16:31:53,595 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 16:31:53,596 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 16:31:53,596 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 16:31:53,604 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:31:53" (1/1) ... [2021-01-06 16:31:53,646 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:31:53" (1/1) ... [2021-01-06 16:31:53,688 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 16:31:53,690 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 16:31:53,690 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 16:31:53,691 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 16:31:53,700 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:31:53" (1/1) ... [2021-01-06 16:31:53,701 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:31:53" (1/1) ... [2021-01-06 16:31:53,720 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:31:53" (1/1) ... [2021-01-06 16:31:53,721 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:31:53" (1/1) ... [2021-01-06 16:31:53,734 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:31:53" (1/1) ... [2021-01-06 16:31:53,757 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:31:53" (1/1) ... [2021-01-06 16:31:53,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:31:53" (1/1) ... [2021-01-06 16:31:53,770 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 16:31:53,771 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 16:31:53,771 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 16:31:53,771 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 16:31:53,772 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:31:53" (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:31:53,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-06 16:31:53,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-06 16:31:53,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-06 16:31:53,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-06 16:31:53,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 16:31:53,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-06 16:31:53,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-06 16:31:53,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 16:31:53,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 16:31:53,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 16:31:54,384 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 16:31:54,384 INFO L299 CfgBuilder]: Removed 22 assume(true) statements. [2021-01-06 16:31:54,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 04:31:54 BoogieIcfgContainer [2021-01-06 16:31:54,386 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 16:31:54,388 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 16:31:54,388 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 16:31:54,396 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 16:31:54,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 04:31:53" (1/3) ... [2021-01-06 16:31:54,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42fa03e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 04:31:54, skipping insertion in model container [2021-01-06 16:31:54,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:31:53" (2/3) ... [2021-01-06 16:31:54,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42fa03e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 04:31:54, skipping insertion in model container [2021-01-06 16:31:54,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 04:31:54" (3/3) ... [2021-01-06 16:31:54,403 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.i [2021-01-06 16:31:54,410 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 16:31:54,415 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 16:31:54,435 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 16:31:54,463 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 16:31:54,463 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 16:31:54,463 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 16:31:54,463 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 16:31:54,463 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 16:31:54,463 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 16:31:54,464 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 16:31:54,464 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 16:31:54,479 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2021-01-06 16:31:54,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-01-06 16:31:54,485 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:31:54,486 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:31:54,486 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:31:54,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:31:54,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1121238131, now seen corresponding path program 1 times [2021-01-06 16:31:54,503 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:31:54,503 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645173881] [2021-01-06 16:31:54,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:31:54,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:31:54,664 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:31:54,665 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645173881] [2021-01-06 16:31:54,665 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:31:54,666 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 16:31:54,666 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711189211] [2021-01-06 16:31:54,671 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-06 16:31:54,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:31:54,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-06 16:31:54,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 16:31:54,689 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2021-01-06 16:31:54,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:31:54,708 INFO L93 Difference]: Finished difference Result 50 states and 73 transitions. [2021-01-06 16:31:54,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-06 16:31:54,709 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2021-01-06 16:31:54,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:31:54,719 INFO L225 Difference]: With dead ends: 50 [2021-01-06 16:31:54,719 INFO L226 Difference]: Without dead ends: 22 [2021-01-06 16:31:54,722 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 16:31:54,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2021-01-06 16:31:54,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-01-06 16:31:54,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2021-01-06 16:31:54,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2021-01-06 16:31:54,759 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 13 [2021-01-06 16:31:54,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:31:54,759 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2021-01-06 16:31:54,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-06 16:31:54,760 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2021-01-06 16:31:54,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-01-06 16:31:54,760 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:31:54,761 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:31:54,761 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 16:31:54,761 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:31:54,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:31:54,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1860179837, now seen corresponding path program 1 times [2021-01-06 16:31:54,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:31:54,763 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038788089] [2021-01-06 16:31:54,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:31:54,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:31:54,859 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:31:54,859 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038788089] [2021-01-06 16:31:54,860 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:31:54,860 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 16:31:54,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697982838] [2021-01-06 16:31:54,861 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 16:31:54,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:31:54,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 16:31:54,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 16:31:54,863 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 3 states. [2021-01-06 16:31:54,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:31:54,880 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2021-01-06 16:31:54,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 16:31:54,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2021-01-06 16:31:54,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:31:54,882 INFO L225 Difference]: With dead ends: 42 [2021-01-06 16:31:54,882 INFO L226 Difference]: Without dead ends: 27 [2021-01-06 16:31:54,883 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:31:54,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-01-06 16:31:54,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2021-01-06 16:31:54,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2021-01-06 16:31:54,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2021-01-06 16:31:54,889 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 13 [2021-01-06 16:31:54,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:31:54,889 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2021-01-06 16:31:54,889 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 16:31:54,889 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2021-01-06 16:31:54,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-06 16:31:54,890 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:31:54,890 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:31:54,891 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 16:31:54,891 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:31:54,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:31:54,892 INFO L82 PathProgramCache]: Analyzing trace with hash -2027989739, now seen corresponding path program 1 times [2021-01-06 16:31:54,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:31:54,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336799419] [2021-01-06 16:31:54,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:31:54,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:31:54,963 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:31:54,963 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336799419] [2021-01-06 16:31:54,964 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616666482] [2021-01-06 16:31:54,964 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:31:55,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:31:55,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-06 16:31:55,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:31:55,136 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:31:55,137 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:31:55,137 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-01-06 16:31:55,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044986171] [2021-01-06 16:31:55,138 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 16:31:55,138 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:31:55,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 16:31:55,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:31:55,139 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 5 states. [2021-01-06 16:31:55,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:31:55,163 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2021-01-06 16:31:55,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 16:31:55,163 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2021-01-06 16:31:55,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:31:55,164 INFO L225 Difference]: With dead ends: 43 [2021-01-06 16:31:55,165 INFO L226 Difference]: Without dead ends: 28 [2021-01-06 16:31:55,165 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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:31:55,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-01-06 16:31:55,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-01-06 16:31:55,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2021-01-06 16:31:55,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2021-01-06 16:31:55,171 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 18 [2021-01-06 16:31:55,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:31:55,171 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-01-06 16:31:55,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 16:31:55,171 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2021-01-06 16:31:55,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-06 16:31:55,172 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:31:55,172 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:31:55,385 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-01-06 16:31:55,386 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:31:55,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:31:55,388 INFO L82 PathProgramCache]: Analyzing trace with hash -650193283, now seen corresponding path program 2 times [2021-01-06 16:31:55,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:31:55,389 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844271542] [2021-01-06 16:31:55,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:31:55,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:31:55,487 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 16:31:55,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844271542] [2021-01-06 16:31:55,488 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:31:55,488 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 16:31:55,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596177991] [2021-01-06 16:31:55,489 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 16:31:55,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:31:55,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 16:31:55,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 16:31:55,490 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 4 states. [2021-01-06 16:31:55,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:31:55,518 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2021-01-06 16:31:55,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 16:31:55,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2021-01-06 16:31:55,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:31:55,520 INFO L225 Difference]: With dead ends: 49 [2021-01-06 16:31:55,520 INFO L226 Difference]: Without dead ends: 40 [2021-01-06 16:31:55,521 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 16:31:55,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-01-06 16:31:55,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 29. [2021-01-06 16:31:55,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2021-01-06 16:31:55,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2021-01-06 16:31:55,527 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 23 [2021-01-06 16:31:55,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:31:55,528 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2021-01-06 16:31:55,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 16:31:55,528 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2021-01-06 16:31:55,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-06 16:31:55,529 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:31:55,529 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] [2021-01-06 16:31:55,531 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 16:31:55,531 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:31:55,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:31:55,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1288329753, now seen corresponding path program 1 times [2021-01-06 16:31:55,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:31:55,533 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16238360] [2021-01-06 16:31:55,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:31:55,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:31:55,739 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 16:31:55,740 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16238360] [2021-01-06 16:31:55,740 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:31:55,740 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 16:31:55,741 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130268130] [2021-01-06 16:31:55,741 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 16:31:55,741 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:31:55,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 16:31:55,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:31:55,742 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 5 states. [2021-01-06 16:31:55,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:31:55,790 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2021-01-06 16:31:55,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 16:31:55,790 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2021-01-06 16:31:55,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:31:55,791 INFO L225 Difference]: With dead ends: 54 [2021-01-06 16:31:55,791 INFO L226 Difference]: Without dead ends: 41 [2021-01-06 16:31:55,792 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-01-06 16:31:55,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-01-06 16:31:55,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 30. [2021-01-06 16:31:55,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2021-01-06 16:31:55,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2021-01-06 16:31:55,799 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 27 [2021-01-06 16:31:55,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:31:55,799 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2021-01-06 16:31:55,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 16:31:55,800 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2021-01-06 16:31:55,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-01-06 16:31:55,800 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:31:55,801 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] [2021-01-06 16:31:55,801 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 16:31:55,801 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:31:55,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:31:55,802 INFO L82 PathProgramCache]: Analyzing trace with hash 883328756, now seen corresponding path program 1 times [2021-01-06 16:31:55,802 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:31:55,802 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238818270] [2021-01-06 16:31:55,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:31:55,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:31:55,879 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-01-06 16:31:55,879 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238818270] [2021-01-06 16:31:55,880 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469643723] [2021-01-06 16:31:55,880 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:31:55,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:31:55,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-06 16:31:55,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:31:56,022 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-01-06 16:31:56,023 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:31:56,023 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-01-06 16:31:56,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049232334] [2021-01-06 16:31:56,024 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 16:31:56,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:31:56,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 16:31:56,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-01-06 16:31:56,025 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 8 states. [2021-01-06 16:31:56,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:31:56,065 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2021-01-06 16:31:56,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 16:31:56,066 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2021-01-06 16:31:56,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:31:56,067 INFO L225 Difference]: With dead ends: 52 [2021-01-06 16:31:56,067 INFO L226 Difference]: Without dead ends: 43 [2021-01-06 16:31:56,068 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-01-06 16:31:56,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-01-06 16:31:56,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2021-01-06 16:31:56,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2021-01-06 16:31:56,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2021-01-06 16:31:56,074 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 28 [2021-01-06 16:31:56,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:31:56,074 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2021-01-06 16:31:56,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 16:31:56,075 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2021-01-06 16:31:56,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-01-06 16:31:56,075 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:31:56,076 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] [2021-01-06 16:31:56,290 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:31:56,291 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:31:56,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:31:56,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1177402658, now seen corresponding path program 2 times [2021-01-06 16:31:56,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:31:56,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086417317] [2021-01-06 16:31:56,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:31:56,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:31:56,417 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-01-06 16:31:56,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086417317] [2021-01-06 16:31:56,418 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:31:56,418 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 16:31:56,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231571358] [2021-01-06 16:31:56,418 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 16:31:56,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:31:56,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 16:31:56,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:31:56,420 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 5 states. [2021-01-06 16:31:56,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:31:56,472 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2021-01-06 16:31:56,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 16:31:56,473 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2021-01-06 16:31:56,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:31:56,477 INFO L225 Difference]: With dead ends: 51 [2021-01-06 16:31:56,477 INFO L226 Difference]: Without dead ends: 43 [2021-01-06 16:31:56,478 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-06 16:31:56,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-01-06 16:31:56,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2021-01-06 16:31:56,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2021-01-06 16:31:56,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2021-01-06 16:31:56,492 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 32 [2021-01-06 16:31:56,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:31:56,493 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2021-01-06 16:31:56,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 16:31:56,493 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2021-01-06 16:31:56,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-01-06 16:31:56,496 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:31:56,496 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] [2021-01-06 16:31:56,496 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 16:31:56,496 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:31:56,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:31:56,497 INFO L82 PathProgramCache]: Analyzing trace with hash -2088089927, now seen corresponding path program 1 times [2021-01-06 16:31:56,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:31:56,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564951808] [2021-01-06 16:31:56,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:31:56,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:31:57,164 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:31:57,164 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564951808] [2021-01-06 16:31:57,165 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498528878] [2021-01-06 16:31:57,165 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:31:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:31:57,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 83 conjunts are in the unsatisfiable core [2021-01-06 16:31:57,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:31:57,332 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-01-06 16:31:57,333 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:31:57,337 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:31:57,338 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:31:57,338 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-01-06 16:31:57,414 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:31:57,415 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 15 [2021-01-06 16:31:57,418 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:31:57,422 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:31:57,424 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:31:57,424 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:31:57,425 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2021-01-06 16:31:57,501 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:31:57,501 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:31:57,509 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:31:57,512 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:31:57,513 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:31:57,520 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:31:57,522 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:31:57,522 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:10 [2021-01-06 16:31:57,763 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_11|], 2=[|v_#memory_$Pointer$.offset_12|, |v_#memory_$Pointer$.base_12|]} [2021-01-06 16:31:57,768 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 33 treesize of output 23 [2021-01-06 16:31:57,769 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:31:57,781 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:31:57,786 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 86 [2021-01-06 16:31:57,788 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:31:57,796 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:31:57,818 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:31:57,819 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 109 [2021-01-06 16:31:57,825 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 2, 1] term [2021-01-06 16:31:57,825 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 16:31:57,827 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 16:31:57,832 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:31:57,833 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:31:57,834 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:134, output treesize:34 [2021-01-06 16:31:57,979 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 35 treesize of output 34 [2021-01-06 16:31:57,981 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:31:57,997 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:31:58,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:31:58,005 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 39 treesize of output 27 [2021-01-06 16:31:58,009 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:31:58,024 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:31:58,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:31:58,032 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 49 treesize of output 31 [2021-01-06 16:31:58,035 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 16:31:58,044 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:31:58,048 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:31:58,048 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:78, output treesize:34 [2021-01-06 16:31:58,208 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 47 treesize of output 29 [2021-01-06 16:31:58,210 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:31:58,220 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:31:58,224 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 31 treesize of output 19 [2021-01-06 16:31:58,225 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:31:58,232 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:31:58,235 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:31:58,235 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:63, output treesize:23 [2021-01-06 16:31:58,324 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 23 treesize of output 15 [2021-01-06 16:31:58,325 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:31:58,331 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:31:58,332 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:31:58,333 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2021-01-06 16:31:58,488 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-06 16:31:58,489 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:31:58,489 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 35 [2021-01-06 16:31:58,489 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601357045] [2021-01-06 16:31:58,490 INFO L461 AbstractCegarLoop]: Interpolant automaton has 35 states [2021-01-06 16:31:58,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:31:58,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-01-06 16:31:58,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1108, Unknown=0, NotChecked=0, Total=1190 [2021-01-06 16:31:58,492 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 35 states. [2021-01-06 16:31:59,367 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2021-01-06 16:31:59,556 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2021-01-06 16:32:00,478 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 63 [2021-01-06 16:32:00,675 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 59 [2021-01-06 16:32:00,890 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 61 [2021-01-06 16:32:01,054 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 63 [2021-01-06 16:32:01,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:32:01,318 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2021-01-06 16:32:01,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-01-06 16:32:01,318 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 33 [2021-01-06 16:32:01,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:32:01,319 INFO L225 Difference]: With dead ends: 75 [2021-01-06 16:32:01,319 INFO L226 Difference]: Without dead ends: 73 [2021-01-06 16:32:01,321 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=414, Invalid=2666, Unknown=0, NotChecked=0, Total=3080 [2021-01-06 16:32:01,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-01-06 16:32:01,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 51. [2021-01-06 16:32:01,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2021-01-06 16:32:01,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2021-01-06 16:32:01,333 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 33 [2021-01-06 16:32:01,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:32:01,333 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2021-01-06 16:32:01,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2021-01-06 16:32:01,333 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2021-01-06 16:32:01,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-01-06 16:32:01,334 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:32:01,335 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:32:01,549 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:32:01,550 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:32:01,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:32:01,552 INFO L82 PathProgramCache]: Analyzing trace with hash -254624194, now seen corresponding path program 2 times [2021-01-06 16:32:01,552 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:32:01,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97907064] [2021-01-06 16:32:01,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:32:01,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:32:01,651 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-01-06 16:32:01,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97907064] [2021-01-06 16:32:01,652 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:32:01,652 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 16:32:01,652 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685821711] [2021-01-06 16:32:01,652 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 16:32:01,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:32:01,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 16:32:01,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 16:32:01,654 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. Second operand 6 states. [2021-01-06 16:32:01,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:32:01,702 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2021-01-06 16:32:01,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 16:32:01,703 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2021-01-06 16:32:01,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:32:01,705 INFO L225 Difference]: With dead ends: 60 [2021-01-06 16:32:01,705 INFO L226 Difference]: Without dead ends: 52 [2021-01-06 16:32:01,706 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-01-06 16:32:01,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-01-06 16:32:01,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2021-01-06 16:32:01,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2021-01-06 16:32:01,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2021-01-06 16:32:01,717 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 34 [2021-01-06 16:32:01,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:32:01,717 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2021-01-06 16:32:01,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 16:32:01,717 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2021-01-06 16:32:01,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-01-06 16:32:01,719 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:32:01,719 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:32:01,719 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 16:32:01,719 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:32:01,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:32:01,720 INFO L82 PathProgramCache]: Analyzing trace with hash 891797658, now seen corresponding path program 3 times [2021-01-06 16:32:01,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:32:01,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865938207] [2021-01-06 16:32:01,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:32:01,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:32:01,790 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 16:32:01,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865938207] [2021-01-06 16:32:01,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376164960] [2021-01-06 16:32:01,791 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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:32:01,958 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-01-06 16:32:01,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 16:32:01,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-06 16:32:01,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:32:02,033 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-01-06 16:32:02,033 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:32:02,034 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2021-01-06 16:32:02,034 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285450250] [2021-01-06 16:32:02,034 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 16:32:02,035 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:32:02,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 16:32:02,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-01-06 16:32:02,036 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand 9 states. [2021-01-06 16:32:02,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:32:02,168 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2021-01-06 16:32:02,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 16:32:02,169 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2021-01-06 16:32:02,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:32:02,170 INFO L225 Difference]: With dead ends: 63 [2021-01-06 16:32:02,170 INFO L226 Difference]: Without dead ends: 43 [2021-01-06 16:32:02,170 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-01-06 16:32:02,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-01-06 16:32:02,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2021-01-06 16:32:02,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2021-01-06 16:32:02,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2021-01-06 16:32:02,179 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 34 [2021-01-06 16:32:02,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:32:02,180 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2021-01-06 16:32:02,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 16:32:02,180 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2021-01-06 16:32:02,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-01-06 16:32:02,181 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:32:02,181 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:32:02,395 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:32:02,396 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:32:02,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:32:02,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1232245788, now seen corresponding path program 1 times [2021-01-06 16:32:02,398 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:32:02,398 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591463862] [2021-01-06 16:32:02,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:32:02,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:32:02,589 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 16:32:02,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591463862] [2021-01-06 16:32:02,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802513019] [2021-01-06 16:32:02,590 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:32:02,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:32:02,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 61 conjunts are in the unsatisfiable core [2021-01-06 16:32:02,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:32:02,821 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 11 treesize of output 7 [2021-01-06 16:32:02,824 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:02,832 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:02,834 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:32:02,834 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:22 [2021-01-06 16:32:02,995 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 22 treesize of output 10 [2021-01-06 16:32:03,000 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:32:03,009 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:32:03,010 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:32:03,010 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:13 [2021-01-06 16:32:03,075 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-06 16:32:03,075 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:32:03,075 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 22 [2021-01-06 16:32:03,075 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794613395] [2021-01-06 16:32:03,076 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-01-06 16:32:03,076 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:32:03,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-01-06 16:32:03,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2021-01-06 16:32:03,077 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 22 states. [2021-01-06 16:32:03,955 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2021-01-06 16:32:04,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:32:04,143 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2021-01-06 16:32:04,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-06 16:32:04,143 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 39 [2021-01-06 16:32:04,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:32:04,144 INFO L225 Difference]: With dead ends: 53 [2021-01-06 16:32:04,145 INFO L226 Difference]: Without dead ends: 51 [2021-01-06 16:32:04,146 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=291, Invalid=831, Unknown=0, NotChecked=0, Total=1122 [2021-01-06 16:32:04,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-01-06 16:32:04,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 41. [2021-01-06 16:32:04,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2021-01-06 16:32:04,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2021-01-06 16:32:04,157 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 39 [2021-01-06 16:32:04,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:32:04,158 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2021-01-06 16:32:04,158 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2021-01-06 16:32:04,158 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2021-01-06 16:32:04,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-01-06 16:32:04,159 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:32:04,159 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:32:04,373 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-01-06 16:32:04,374 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:32:04,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:32:04,375 INFO L82 PathProgramCache]: Analyzing trace with hash 506740339, now seen corresponding path program 2 times [2021-01-06 16:32:04,376 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:32:04,376 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029374102] [2021-01-06 16:32:04,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:32:04,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:32:04,484 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-01-06 16:32:04,484 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029374102] [2021-01-06 16:32:04,484 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040610875] [2021-01-06 16:32:04,484 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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:32:04,577 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-06 16:32:04,578 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 16:32:04,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 6 conjunts are in the unsatisfiable core [2021-01-06 16:32:04,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:32:04,650 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-01-06 16:32:04,651 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:32:04,651 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-01-06 16:32:04,651 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379847322] [2021-01-06 16:32:04,651 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 16:32:04,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:32:04,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 16:32:04,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-01-06 16:32:04,652 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 9 states. [2021-01-06 16:32:04,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:32:04,707 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2021-01-06 16:32:04,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 16:32:04,707 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2021-01-06 16:32:04,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:32:04,708 INFO L225 Difference]: With dead ends: 51 [2021-01-06 16:32:04,708 INFO L226 Difference]: Without dead ends: 0 [2021-01-06 16:32:04,708 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2021-01-06 16:32:04,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-01-06 16:32:04,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-01-06 16:32:04,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-01-06 16:32:04,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-01-06 16:32:04,709 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2021-01-06 16:32:04,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:32:04,709 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-01-06 16:32:04,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 16:32:04,709 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-01-06 16:32:04,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-01-06 16:32:04,922 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:32:04,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-01-06 16:32:05,457 WARN L197 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 93 [2021-01-06 16:32:05,873 WARN L197 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 86 [2021-01-06 16:32:06,205 WARN L197 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 92 [2021-01-06 16:32:06,811 WARN L197 SmtUtils]: Spent 602.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 104 [2021-01-06 16:32:07,156 WARN L197 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 71 [2021-01-06 16:32:07,201 INFO L192 CegarLoopUtils]: At program point L572(line 572) the Hoare annotation is: true [2021-01-06 16:32:07,201 INFO L189 CegarLoopUtils]: For program point L622-2(lines 622 627) no Hoare annotation was computed. [2021-01-06 16:32:07,201 INFO L185 CegarLoopUtils]: At program point L622-3(lines 622 627) the Hoare annotation is: (let ((.cse5 (select (select |#memory_int| ULTIMATE.start_main_~s~0.base) ULTIMATE.start_main_~s~0.offset)) (.cse15 (* 2 ULTIMATE.start_main_~len~0))) (let ((.cse0 (<= (+ ULTIMATE.start_sll_update_at_~index 2) ULTIMATE.start_main_~len~0)) (.cse1 (= ULTIMATE.start_main_~s~0.base ULTIMATE.start_sll_update_at_~head.base)) (.cse2 (= (select |#valid| ULTIMATE.start_sll_create_~head~0.base) 1)) (.cse4 (<= ULTIMATE.start_main_~len~0 ULTIMATE.start_sll_update_at_~data)) (.cse3 (= 2 ULTIMATE.start_main_~len~0)) (.cse6 (= ULTIMATE.start_main_~s~0.offset ULTIMATE.start_sll_update_at_~head.offset)) (.cse7 (= (select |#valid| ULTIMATE.start_node_create_~temp~0.base) 1)) (.cse9 (= |ULTIMATE.start_node_create_#res.offset| 0)) (.cse10 (= (select |#valid| |ULTIMATE.start_node_create_#res.base|) 1)) (.cse11 (<= (+ ULTIMATE.start_sll_update_at_~data 2) .cse15)) (.cse12 (<= ULTIMATE.start_main_~len~0 .cse5)) (.cse13 (= ULTIMATE.start_node_create_~temp~0.offset 0))) (or (let ((.cse8 (select |#memory_$Pointer$.base| ULTIMATE.start_main_~s~0.base))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~len~0) (<= (+ .cse5 1) (+ ULTIMATE.start_main_~len~0 ULTIMATE.start_main_~i~0)) .cse6 .cse7 (not (= ULTIMATE.start_main_~s~0.base (select .cse8 4))) .cse9 .cse10 .cse11 .cse12 .cse13 (= (* ULTIMATE.start_main_~len~0 2) (+ (let ((.cse14 (+ ULTIMATE.start_main_~s~0.offset 4))) (select (select |#memory_int| (select .cse8 .cse14)) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~s~0.base) .cse14))) 1)) (= ULTIMATE.start_main_~s~0.offset 0))) (and .cse0 (<= ULTIMATE.start_sll_get_data_at_~index 0) (<= (+ .cse5 2) .cse15) .cse1 .cse2 .cse4 .cse3 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 (<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0))))) [2021-01-06 16:32:07,202 INFO L189 CegarLoopUtils]: For program point L622-4(lines 622 627) no Hoare annotation was computed. [2021-01-06 16:32:07,202 INFO L185 CegarLoopUtils]: At program point L581(lines 574 582) the Hoare annotation is: (let ((.cse0 (= (select |#valid| ULTIMATE.start_node_create_~temp~0.base) 1)) (.cse1 (= |ULTIMATE.start_node_create_#res.offset| 0)) (.cse2 (= (select |#valid| |ULTIMATE.start_node_create_#res.base|) 1)) (.cse3 (= ULTIMATE.start_node_create_~temp~0.offset 0)) (.cse4 (= 2 ULTIMATE.start_main_~len~0))) (or (and .cse0 .cse1 .cse2 (= 2 ULTIMATE.start_sll_create_~len) .cse3 .cse4) (and .cse0 (<= 1 ULTIMATE.start_sll_create_~len) (not (= ULTIMATE.start_sll_create_~head~0.base ULTIMATE.start_node_create_~temp~0.base)) .cse1 .cse2 .cse3 (= (select |#valid| ULTIMATE.start_sll_create_~head~0.base) 1) (not (= |ULTIMATE.start_node_create_#res.base| ULTIMATE.start_sll_create_~head~0.base)) .cse4))) [2021-01-06 16:32:07,202 INFO L189 CegarLoopUtils]: For program point L606(lines 1 632) no Hoare annotation was computed. [2021-01-06 16:32:07,202 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-01-06 16:32:07,202 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-01-06 16:32:07,202 INFO L192 CegarLoopUtils]: At program point L631(lines 613 632) the Hoare annotation is: true [2021-01-06 16:32:07,202 INFO L185 CegarLoopUtils]: At program point L590(lines 583 591) the Hoare annotation is: (and (= (select |#valid| ULTIMATE.start_node_create_~temp~0.base) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res.base|) 4) |ULTIMATE.start_sll_create_#res.base|)) (= ULTIMATE.start_sll_create_~head~0.offset 0) (= |ULTIMATE.start_node_create_#res.offset| 0) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_sll_create_~head~0.base) 4) ULTIMATE.start_sll_create_~head~0.base)) (= (select |#valid| |ULTIMATE.start_node_create_#res.base|) 1) (= ULTIMATE.start_node_create_~temp~0.offset 0) (= (select |#valid| ULTIMATE.start_sll_create_~head~0.base) 1) (= 2 ULTIMATE.start_main_~len~0) (= |ULTIMATE.start_sll_create_#res.offset| 0)) [2021-01-06 16:32:07,202 INFO L185 CegarLoopUtils]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse20 (select |#memory_$Pointer$.base| ULTIMATE.start_main_~s~0.base))) (let ((.cse14 (select .cse20 4)) (.cse18 (+ ULTIMATE.start_main_~i~0 1)) (.cse23 (+ ULTIMATE.start_sll_update_at_~data 1)) (.cse19 (* 2 ULTIMATE.start_main_~len~0))) (let ((.cse16 (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~s~0.base)) (.cse0 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res.base|) 4) |ULTIMATE.start_sll_create_#res.base|))) (.cse1 (= ULTIMATE.start_sll_create_~head~0.offset 0)) (.cse2 (<= .cse23 .cse19)) (.cse13 (= ULTIMATE.start_main_~s~0.base ULTIMATE.start_sll_update_at_~head.base)) (.cse3 (= (select |#valid| ULTIMATE.start_sll_create_~head~0.base) 1)) (.cse4 (<= .cse19 .cse23)) (.cse5 (= 2 ULTIMATE.start_main_~len~0)) (.cse6 (<= .cse18 ULTIMATE.start_main_~len~0)) (.cse7 (= |ULTIMATE.start_sll_create_#res.offset| 0)) (.cse8 (= (select |#valid| ULTIMATE.start_node_create_~temp~0.base) 1)) (.cse17 (not (= ULTIMATE.start_main_~s~0.base .cse14))) (.cse9 (= |ULTIMATE.start_node_create_#res.offset| 0)) (.cse10 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_sll_create_~head~0.base) 4) ULTIMATE.start_sll_create_~head~0.base))) (.cse11 (= (select |#valid| |ULTIMATE.start_node_create_#res.base|) 1)) (.cse12 (= ULTIMATE.start_node_create_~temp~0.offset 0)) (.cse15 (= ULTIMATE.start_main_~s~0.offset 0)) (.cse22 (<= ULTIMATE.start_sll_update_at_~index ULTIMATE.start_main_~i~0))) (or (and .cse0 .cse1 (<= (+ ULTIMATE.start_sll_update_at_~index 2) ULTIMATE.start_main_~len~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not .cse13) (= ULTIMATE.start_sll_update_at_~head.base .cse14) .cse15 (= (select .cse16 4) ULTIMATE.start_sll_update_at_~head.offset) (< 0 ULTIMATE.start_main_~i~0)) (and .cse13 .cse3 (<= ULTIMATE.start_main_~len~0 ULTIMATE.start_sll_update_at_~data) .cse5 (= ULTIMATE.start_main_~s~0.offset ULTIMATE.start_sll_update_at_~head.offset) .cse8 .cse17 .cse9 .cse11 (< 0 .cse18) (<= (+ ULTIMATE.start_sll_update_at_~data 2) .cse19) .cse12 (= (* ULTIMATE.start_main_~len~0 2) (+ (let ((.cse21 (+ ULTIMATE.start_main_~s~0.offset 4))) (select (select |#memory_int| (select .cse20 .cse21)) (select .cse16 .cse21))) 1)) .cse15 .cse22 (<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0)) (and .cse0 (<= ULTIMATE.start_main_~len~0 (+ ULTIMATE.start_sll_update_at_~index 1)) .cse1 .cse2 .cse13 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 (= ULTIMATE.start_sll_update_at_~head.offset 0) .cse12 .cse15 .cse22))))) [2021-01-06 16:32:07,202 INFO L189 CegarLoopUtils]: For program point L607-3(lines 607 610) no Hoare annotation was computed. [2021-01-06 16:32:07,203 INFO L189 CegarLoopUtils]: For program point L624(lines 624 626) no Hoare annotation was computed. [2021-01-06 16:32:07,203 INFO L185 CegarLoopUtils]: At program point L600-2(lines 600 603) the Hoare annotation is: (let ((.cse27 (select |#memory_$Pointer$.base| ULTIMATE.start_main_~s~0.base)) (.cse25 (select (select |#memory_int| ULTIMATE.start_main_~s~0.base) ULTIMATE.start_main_~s~0.offset)) (.cse26 (+ ULTIMATE.start_main_~len~0 ULTIMATE.start_main_~i~0)) (.cse24 (+ ULTIMATE.start_main_~i~0 2))) (let ((.cse12 (<= ULTIMATE.start_main_~len~0 .cse24)) (.cse0 (<= (+ ULTIMATE.start_sll_update_at_~index 2) ULTIMATE.start_main_~len~0)) (.cse23 (select (select |#memory_int| ULTIMATE.start_sll_get_data_at_~head.base) ULTIMATE.start_sll_get_data_at_~head.offset)) (.cse22 (<= ULTIMATE.start_sll_get_data_at_~index 0)) (.cse1 (= ULTIMATE.start_main_~s~0.base ULTIMATE.start_sll_update_at_~head.base)) (.cse11 (= (select |#valid| ULTIMATE.start_sll_create_~head~0.base) 1)) (.cse2 (= 2 ULTIMATE.start_main_~len~0)) (.cse13 (<= ULTIMATE.start_main_~len~0 ULTIMATE.start_sll_update_at_~data)) (.cse14 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~len~0)) (.cse15 (<= (+ .cse25 1) .cse26)) (.cse3 (= ULTIMATE.start_main_~s~0.offset ULTIMATE.start_sll_update_at_~head.offset)) (.cse4 (= (select |#valid| ULTIMATE.start_node_create_~temp~0.base) 1)) (.cse5 (not (= ULTIMATE.start_main_~s~0.base (select .cse27 4)))) (.cse6 (= |ULTIMATE.start_node_create_#res.offset| 0)) (.cse7 (= (select |#valid| |ULTIMATE.start_node_create_#res.base|) 1)) (.cse8 (<= (+ ULTIMATE.start_sll_update_at_~data 2) (* 2 ULTIMATE.start_main_~len~0))) (.cse9 (<= ULTIMATE.start_main_~len~0 .cse25)) (.cse17 (= ULTIMATE.start_node_create_~temp~0.offset 0)) (.cse18 (= (* ULTIMATE.start_main_~len~0 2) (+ (let ((.cse28 (+ ULTIMATE.start_main_~s~0.offset 4))) (select (select |#memory_int| (select .cse27 .cse28)) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~s~0.base) .cse28))) 1))) (.cse19 (= (mod (+ ULTIMATE.start_main_~expected~0 1) 2) 0)) (.cse20 (= ULTIMATE.start_main_~s~0.offset 0))) (or (let ((.cse21 (+ ULTIMATE.start_sll_get_data_at_~head.offset 4))) (let ((.cse10 (select (select |#memory_$Pointer$.base| ULTIMATE.start_sll_get_data_at_~head.base) .cse21))) (let ((.cse16 (select (select |#memory_int| .cse10) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_sll_get_data_at_~head.base) .cse21)))) (and .cse0 .cse1 .cse2 (<= 1 ULTIMATE.start_sll_get_data_at_~index) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= ULTIMATE.start_sll_get_data_at_~head.base .cse10)) (<= ULTIMATE.start_sll_get_data_at_~index 1) .cse11 .cse12 .cse13 .cse14 .cse15 (<= ULTIMATE.start_main_~expected~0 .cse16) .cse17 .cse18 .cse19 .cse20 (<= .cse16 ULTIMATE.start_main_~expected~0) (= ULTIMATE.start_sll_get_data_at_~head.offset 0))))) (and (<= ULTIMATE.start_main_~expected~0 2) (<= 2 ULTIMATE.start_main_~expected~0) .cse22 .cse1 .cse11 .cse12 .cse2 .cse13 .cse3 .cse4 .cse6 .cse7 (<= .cse23 2) .cse8 .cse9 .cse17 (<= 2 .cse23) (<= ULTIMATE.start_sll_update_at_~index ULTIMATE.start_main_~i~0) (<= .cse24 ULTIMATE.start_main_~len~0) (<= .cse25 .cse26)) (and .cse0 (= (+ (* (div (+ ULTIMATE.start_main_~expected~0 (- 1)) 2) 2) 1) .cse23) .cse22 .cse1 .cse11 .cse2 .cse13 .cse14 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse18 .cse19 .cse20)))) [2021-01-06 16:32:07,203 INFO L189 CegarLoopUtils]: For program point L600-3(lines 600 603) no Hoare annotation was computed. [2021-01-06 16:32:07,203 INFO L185 CegarLoopUtils]: At program point L625(lines 613 632) the Hoare annotation is: false [2021-01-06 16:32:07,203 INFO L189 CegarLoopUtils]: For program point L592(lines 592 598) no Hoare annotation was computed. [2021-01-06 16:32:07,203 INFO L189 CegarLoopUtils]: For program point L576(lines 576 578) no Hoare annotation was computed. [2021-01-06 16:32:07,204 INFO L189 CegarLoopUtils]: For program point L576-1(lines 576 578) no Hoare annotation was computed. [2021-01-06 16:32:07,204 INFO L192 CegarLoopUtils]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2021-01-06 16:32:07,204 INFO L185 CegarLoopUtils]: At program point L618-2(lines 618 621) the Hoare annotation is: (let ((.cse12 (select |#memory_$Pointer$.base| ULTIMATE.start_main_~s~0.base))) (let ((.cse18 (select .cse12 4))) (let ((.cse4 (not (= ULTIMATE.start_main_~s~0.base .cse18))) (.cse0 (= (select |#valid| ULTIMATE.start_sll_create_~head~0.base) 1)) (.cse1 (= 2 ULTIMATE.start_main_~len~0)) (.cse3 (= (select |#valid| ULTIMATE.start_node_create_~temp~0.base) 1)) (.cse10 (* 2 ULTIMATE.start_main_~len~0)) (.cse5 (= |ULTIMATE.start_node_create_#res.offset| 0)) (.cse6 (= (select |#valid| |ULTIMATE.start_node_create_#res.base|) 1)) (.cse2 (+ ULTIMATE.start_main_~i~0 1)) (.cse7 (= ULTIMATE.start_node_create_~temp~0.offset 0)) (.cse11 (= ULTIMATE.start_main_~s~0.base ULTIMATE.start_sll_update_at_~head.base)) (.cse8 (= ULTIMATE.start_main_~s~0.offset 0)) (.cse15 (<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0)) (.cse14 (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~s~0.base))) (or (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res.base|) 4) |ULTIMATE.start_sll_create_#res.base|)) (= ULTIMATE.start_sll_create_~head~0.offset 0) .cse0 .cse1 (<= .cse2 ULTIMATE.start_main_~len~0) (= |ULTIMATE.start_sll_create_#res.offset| 0) .cse3 .cse4 .cse5 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_sll_create_~head~0.base) 4) ULTIMATE.start_sll_create_~head~0.base)) .cse6 .cse7 .cse8 (< 0 ULTIMATE.start_main_~i~0)) (let ((.cse9 (select (select |#memory_int| ULTIMATE.start_main_~s~0.base) ULTIMATE.start_main_~s~0.offset))) (and (<= (+ ULTIMATE.start_sll_update_at_~index 2) ULTIMATE.start_main_~len~0) (<= (+ .cse9 2) .cse10) .cse11 .cse0 (<= ULTIMATE.start_main_~len~0 ULTIMATE.start_sll_update_at_~data) .cse1 (= ULTIMATE.start_main_~s~0.offset ULTIMATE.start_sll_update_at_~head.offset) .cse3 .cse4 .cse5 .cse6 (<= (+ ULTIMATE.start_sll_update_at_~data 2) .cse10) (<= ULTIMATE.start_main_~len~0 .cse9) .cse7 (= (* ULTIMATE.start_main_~len~0 2) (+ (let ((.cse13 (+ ULTIMATE.start_main_~s~0.offset 4))) (select (select |#memory_int| (select .cse12 .cse13)) (select .cse14 .cse13))) 1)) .cse8 .cse15)) (let ((.cse19 (select .cse14 4))) (let ((.cse16 (+ ULTIMATE.start_sll_update_at_~data 1)) (.cse17 (+ (select (select |#memory_int| .cse18) .cse19) 1))) (and (<= .cse16 .cse10) .cse0 (<= .cse10 .cse16) .cse1 (<= .cse10 .cse17) .cse3 (<= .cse17 .cse10) .cse5 .cse6 (< 0 .cse2) .cse7 (not .cse11) (= ULTIMATE.start_sll_update_at_~head.base .cse18) .cse8 (= .cse19 ULTIMATE.start_sll_update_at_~head.offset) (<= ULTIMATE.start_sll_update_at_~index ULTIMATE.start_main_~i~0) .cse15))))))) [2021-01-06 16:32:07,204 INFO L189 CegarLoopUtils]: For program point L585-2(lines 585 589) no Hoare annotation was computed. [2021-01-06 16:32:07,204 INFO L189 CegarLoopUtils]: For program point L618-3(lines 618 621) no Hoare annotation was computed. [2021-01-06 16:32:07,204 INFO L185 CegarLoopUtils]: At program point L585-3(lines 585 589) the Hoare annotation is: (let ((.cse1 (= (select |#valid| ULTIMATE.start_node_create_~temp~0.base) 1)) (.cse2 (= |ULTIMATE.start_node_create_#res.offset| 0)) (.cse3 (= (select |#valid| |ULTIMATE.start_node_create_#res.base|) 1)) (.cse4 (= ULTIMATE.start_node_create_~temp~0.offset 0)) (.cse5 (= (select |#valid| ULTIMATE.start_sll_create_~head~0.base) 1)) (.cse0 (= 2 ULTIMATE.start_main_~len~0))) (or (and (= 2 ULTIMATE.start_sll_create_~len) .cse0) (and .cse1 (<= 1 ULTIMATE.start_sll_create_~len) .cse2 .cse3 .cse4 .cse5 .cse0) (and .cse1 (= ULTIMATE.start_sll_create_~head~0.offset 0) .cse2 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_sll_create_~head~0.base) 4) ULTIMATE.start_sll_create_~head~0.base)) .cse3 .cse4 .cse5 .cse0))) [2021-01-06 16:32:07,205 INFO L189 CegarLoopUtils]: For program point L585-4(lines 585 589) no Hoare annotation was computed. [2021-01-06 16:32:07,205 INFO L189 CegarLoopUtils]: For program point L-1(line -1) no Hoare annotation was computed. [2021-01-06 16:32:07,205 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 630) no Hoare annotation was computed. [2021-01-06 16:32:07,205 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-01-06 16:32:07,205 INFO L185 CegarLoopUtils]: At program point L604(lines 599 605) the Hoare annotation is: (and (<= ULTIMATE.start_sll_get_data_at_~index 0) (let ((.cse11 (select (select |#memory_int| ULTIMATE.start_main_~s~0.base) ULTIMATE.start_main_~s~0.offset))) (let ((.cse7 (select (select |#memory_int| ULTIMATE.start_sll_get_data_at_~head.base) ULTIMATE.start_sll_get_data_at_~head.offset)) (.cse0 (= ULTIMATE.start_main_~s~0.base ULTIMATE.start_sll_update_at_~head.base)) (.cse1 (= (select |#valid| ULTIMATE.start_sll_create_~head~0.base) 1)) (.cse2 (<= ULTIMATE.start_main_~len~0 ULTIMATE.start_sll_update_at_~data)) (.cse12 (+ ULTIMATE.start_main_~len~0 ULTIMATE.start_main_~i~0)) (.cse3 (= ULTIMATE.start_main_~s~0.offset ULTIMATE.start_sll_update_at_~head.offset)) (.cse4 (= (select |#valid| ULTIMATE.start_node_create_~temp~0.base) 1)) (.cse5 (= |ULTIMATE.start_node_create_#res.offset| 0)) (.cse6 (= (select |#valid| |ULTIMATE.start_node_create_#res.base|) 1)) (.cse8 (<= (+ ULTIMATE.start_sll_update_at_~data 2) (* 2 ULTIMATE.start_main_~len~0))) (.cse9 (<= ULTIMATE.start_main_~len~0 .cse11)) (.cse10 (= ULTIMATE.start_node_create_~temp~0.offset 0))) (or (and (<= ULTIMATE.start_main_~expected~0 2) (<= 2 ULTIMATE.start_main_~expected~0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 2 |ULTIMATE.start_sll_get_data_at_#res|) .cse5 .cse6 (<= .cse7 2) .cse8 .cse9 .cse10 (<= 2 .cse7) (<= ULTIMATE.start_sll_update_at_~index ULTIMATE.start_main_~i~0) (<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0) (<= .cse11 .cse12) (<= |ULTIMATE.start_sll_get_data_at_#res| 2)) (let ((.cse14 (select |#memory_$Pointer$.base| ULTIMATE.start_main_~s~0.base)) (.cse13 (+ (* (div (+ ULTIMATE.start_main_~expected~0 (- 1)) 2) 2) 1))) (and (<= (+ ULTIMATE.start_sll_update_at_~index 2) ULTIMATE.start_main_~len~0) (= .cse13 .cse7) .cse0 .cse1 .cse2 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~len~0) (<= (+ .cse11 1) .cse12) .cse3 .cse4 (not (= ULTIMATE.start_main_~s~0.base (select .cse14 4))) .cse5 .cse6 .cse8 .cse9 .cse10 (= (* ULTIMATE.start_main_~len~0 2) (+ (let ((.cse15 (+ ULTIMATE.start_main_~s~0.offset 4))) (select (select |#memory_int| (select .cse14 .cse15)) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~s~0.base) .cse15))) 1)) (= (mod (+ ULTIMATE.start_main_~expected~0 1) 2) 0) (= ULTIMATE.start_main_~s~0.offset 0) (= .cse13 |ULTIMATE.start_sll_get_data_at_#res|)))))) (= 2 ULTIMATE.start_main_~len~0)) [2021-01-06 16:32:07,215 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,216 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,220 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,220 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,223 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,223 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,223 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,224 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,224 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,224 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:32:07,225 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,225 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:32:07,225 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,225 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:32:07,226 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,226 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:32:07,229 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,229 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,230 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,230 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,231 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,231 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:32:07,231 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,231 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:32:07,232 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,232 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:32:07,232 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,232 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:32:07,236 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,236 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,237 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,237 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:32:07,237 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,238 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,238 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:32:07,238 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,239 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,239 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,241 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,242 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,242 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,242 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:32:07,242 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,243 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,243 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:32:07,243 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,244 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,244 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,247 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,248 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,248 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:32:07,250 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,250 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,251 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:32:07,253 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,254 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,255 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,256 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,256 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,256 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:32:07,257 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,257 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:32:07,257 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,257 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:32:07,258 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,259 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,259 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:32:07,262 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,262 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,263 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,263 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:32:07,263 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,263 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:32:07,264 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,264 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:32:07,265 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,265 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,265 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:32:07,268 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,269 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,269 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:32:07,271 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,271 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,272 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:32:07,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 04:32:07 BoogieIcfgContainer [2021-01-06 16:32:07,279 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 16:32:07,279 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 16:32:07,279 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 16:32:07,279 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 16:32:07,280 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 04:31:54" (3/4) ... [2021-01-06 16:32:07,289 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-01-06 16:32:07,310 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2021-01-06 16:32:07,311 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-01-06 16:32:07,312 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 16:32:07,312 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 16:32:07,337 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((2 == len && 2 == len) || ((((((\valid[temp] == 1 && 1 <= len) && \result == 0) && \valid[\result] == 1) && temp == 0) && \valid[head] == 1) && 2 == len)) || (((((((\valid[temp] == 1 && head == 0) && \result == 0) && !(#memory_$Pointer$[head][4] == head)) && \valid[\result] == 1) && temp == 0) && \valid[head] == 1) && 2 == len) [2021-01-06 16:32:07,338 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\valid[temp] == 1 && !(#memory_$Pointer$[\result][4] == \result)) && head == 0) && \result == 0) && !(#memory_$Pointer$[head][4] == head)) && \valid[\result] == 1) && temp == 0) && \valid[head] == 1) && 2 == len) && \result == 0 [2021-01-06 16:32:07,338 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(#memory_$Pointer$[\result][4] == \result) && head == 0) && \valid[head] == 1) && 2 == len) && i + 1 <= len) && \result == 0) && \valid[temp] == 1) && !(s == #memory_$Pointer$[s][4])) && \result == 0) && !(#memory_$Pointer$[head][4] == head)) && \valid[\result] == 1) && temp == 0) && s == 0) && 0 < i) || ((((((((((((((((index + 2 <= len && unknown-#memory_int-unknown[s][s] + 2 <= 2 * len) && s == head) && \valid[head] == 1) && len <= data) && 2 == len) && s == head) && \valid[temp] == 1) && !(s == #memory_$Pointer$[s][4])) && \result == 0) && \valid[\result] == 1) && data + 2 <= 2 * len) && len <= unknown-#memory_int-unknown[s][s]) && temp == 0) && len * 2 == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && s == 0) && i + 2 <= len)) || ((((((((((((((((data + 1 <= 2 * len && \valid[head] == 1) && 2 * len <= data + 1) && 2 == len) && 2 * len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] + 1) && \valid[temp] == 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] + 1 <= 2 * len) && \result == 0) && \valid[\result] == 1) && 0 < i + 1) && temp == 0) && !(s == head)) && head == #memory_$Pointer$[s][4]) && s == 0) && #memory_$Pointer$[s][4] == head) && index <= i) && i + 2 <= len) [2021-01-06 16:32:07,338 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((index + 2 <= len && s == head) && \valid[head] == 1) && 2 == len) && len <= data) && i + 1 <= len) && unknown-#memory_int-unknown[s][s] + 1 <= len + i) && s == head) && \valid[temp] == 1) && !(s == #memory_$Pointer$[s][4])) && \result == 0) && \valid[\result] == 1) && data + 2 <= 2 * len) && len <= unknown-#memory_int-unknown[s][s]) && temp == 0) && len * 2 == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && s == 0) || ((((((((((((((index + 2 <= len && index <= 0) && unknown-#memory_int-unknown[s][s] + 2 <= 2 * len) && s == head) && \valid[head] == 1) && len <= data) && 2 == len) && s == head) && \valid[temp] == 1) && \result == 0) && \valid[\result] == 1) && data + 2 <= 2 * len) && len <= unknown-#memory_int-unknown[s][s]) && temp == 0) && i + 2 <= len) [2021-01-06 16:32:07,338 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\valid[temp] == 1 && \result == 0) && \valid[\result] == 1) && 2 == len) && temp == 0) && 2 == len) || ((((((((\valid[temp] == 1 && 1 <= len) && !(head == temp)) && \result == 0) && \valid[\result] == 1) && temp == 0) && \valid[head] == 1) && !(\result == head)) && 2 == len) [2021-01-06 16:32:07,339 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((!(#memory_$Pointer$[\result][4] == \result) && head == 0) && index + 2 <= len) && data + 1 <= 2 * len) && \valid[head] == 1) && 2 * len <= data + 1) && 2 == len) && i + 1 <= len) && \result == 0) && \valid[temp] == 1) && \result == 0) && !(#memory_$Pointer$[head][4] == head)) && \valid[\result] == 1) && temp == 0) && !(s == head)) && head == #memory_$Pointer$[s][4]) && s == 0) && #memory_$Pointer$[s][4] == head) && 0 < i) || (((((((((((((((s == head && \valid[head] == 1) && len <= data) && 2 == len) && s == head) && \valid[temp] == 1) && !(s == #memory_$Pointer$[s][4])) && \result == 0) && \valid[\result] == 1) && 0 < i + 1) && data + 2 <= 2 * len) && temp == 0) && len * 2 == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && s == 0) && index <= i) && i + 2 <= len)) || ((((((((((((((((((!(#memory_$Pointer$[\result][4] == \result) && len <= index + 1) && head == 0) && data + 1 <= 2 * len) && s == head) && \valid[head] == 1) && 2 * len <= data + 1) && 2 == len) && i + 1 <= len) && \result == 0) && \valid[temp] == 1) && !(s == #memory_$Pointer$[s][4])) && \result == 0) && !(#memory_$Pointer$[head][4] == head)) && \valid[\result] == 1) && head == 0) && temp == 0) && s == 0) && index <= i) [2021-01-06 16:32:07,339 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((index + 2 <= len && s == head) && 2 == len) && 1 <= index) && s == head) && \valid[temp] == 1) && !(s == #memory_$Pointer$[s][4])) && \result == 0) && \valid[\result] == 1) && data + 2 <= 2 * len) && len <= unknown-#memory_int-unknown[s][s]) && !(head == #memory_$Pointer$[head][head + 4])) && index <= 1) && \valid[head] == 1) && len <= i + 2) && len <= data) && i + 1 <= len) && unknown-#memory_int-unknown[s][s] + 1 <= len + i) && expected <= unknown-#memory_int-unknown[#memory_$Pointer$[head][head + 4]][#memory_$Pointer$[head][head + 4]]) && temp == 0) && len * 2 == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && (expected + 1) % 2 == 0) && s == 0) && unknown-#memory_int-unknown[#memory_$Pointer$[head][head + 4]][#memory_$Pointer$[head][head + 4]] <= expected) && head == 0) || (((((((((((((((((((expected <= 2 && 2 <= expected) && index <= 0) && s == head) && \valid[head] == 1) && len <= i + 2) && 2 == len) && len <= data) && s == head) && \valid[temp] == 1) && \result == 0) && \valid[\result] == 1) && unknown-#memory_int-unknown[head][head] <= 2) && data + 2 <= 2 * len) && len <= unknown-#memory_int-unknown[s][s]) && temp == 0) && 2 <= unknown-#memory_int-unknown[head][head]) && index <= i) && i + 2 <= len) && unknown-#memory_int-unknown[s][s] <= len + i)) || (((((((((((((((((((index + 2 <= len && (expected + -1) / 2 * 2 + 1 == unknown-#memory_int-unknown[head][head]) && index <= 0) && s == head) && \valid[head] == 1) && 2 == len) && len <= data) && i + 1 <= len) && unknown-#memory_int-unknown[s][s] + 1 <= len + i) && s == head) && \valid[temp] == 1) && !(s == #memory_$Pointer$[s][4])) && \result == 0) && \valid[\result] == 1) && data + 2 <= 2 * len) && len <= unknown-#memory_int-unknown[s][s]) && temp == 0) && len * 2 == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && (expected + 1) % 2 == 0) && s == 0) [2021-01-06 16:32:07,340 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (index <= 0 && (((((((((((((((((((expected <= 2 && 2 <= expected) && s == head) && \valid[head] == 1) && len <= data) && s == head) && \valid[temp] == 1) && 2 <= \result) && \result == 0) && \valid[\result] == 1) && unknown-#memory_int-unknown[head][head] <= 2) && data + 2 <= 2 * len) && len <= unknown-#memory_int-unknown[s][s]) && temp == 0) && 2 <= unknown-#memory_int-unknown[head][head]) && index <= i) && i + 2 <= len) && unknown-#memory_int-unknown[s][s] <= len + i) && \result <= 2) || ((((((((((((((((((index + 2 <= len && (expected + -1) / 2 * 2 + 1 == unknown-#memory_int-unknown[head][head]) && s == head) && \valid[head] == 1) && len <= data) && i + 1 <= len) && unknown-#memory_int-unknown[s][s] + 1 <= len + i) && s == head) && \valid[temp] == 1) && !(s == #memory_$Pointer$[s][4])) && \result == 0) && \valid[\result] == 1) && data + 2 <= 2 * len) && len <= unknown-#memory_int-unknown[s][s]) && temp == 0) && len * 2 == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && (expected + 1) % 2 == 0) && s == 0) && (expected + -1) / 2 * 2 + 1 == \result))) && 2 == len [2021-01-06 16:32:07,371 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/list-simple/sll2n_update_all_reverse.i-witness.graphml [2021-01-06 16:32:07,372 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 16:32:07,373 INFO L168 Benchmark]: Toolchain (without parser) took 14326.46 ms. Allocated memory was 156.2 MB in the beginning and 285.2 MB in the end (delta: 129.0 MB). Free memory was 129.6 MB in the beginning and 163.0 MB in the end (delta: -33.4 MB). Peak memory consumption was 96.9 MB. Max. memory is 8.0 GB. [2021-01-06 16:32:07,373 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 156.2 MB. Free memory is still 127.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 16:32:07,373 INFO L168 Benchmark]: CACSL2BoogieTranslator took 545.09 ms. Allocated memory is still 156.2 MB. Free memory was 129.4 MB in the beginning and 106.3 MB in the end (delta: 23.0 MB). Peak memory consumption was 23.1 MB. Max. memory is 8.0 GB. [2021-01-06 16:32:07,374 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.51 ms. Allocated memory is still 156.2 MB. Free memory was 106.3 MB in the beginning and 104.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-06 16:32:07,374 INFO L168 Benchmark]: Boogie Preprocessor took 80.15 ms. Allocated memory is still 156.2 MB. Free memory was 104.2 MB in the beginning and 138.1 MB in the end (delta: -33.9 MB). Peak memory consumption was 5.1 MB. Max. memory is 8.0 GB. [2021-01-06 16:32:07,375 INFO L168 Benchmark]: RCFGBuilder took 615.30 ms. Allocated memory is still 156.2 MB. Free memory was 138.1 MB in the beginning and 115.9 MB in the end (delta: 22.2 MB). Peak memory consumption was 22.0 MB. Max. memory is 8.0 GB. [2021-01-06 16:32:07,375 INFO L168 Benchmark]: TraceAbstraction took 12890.61 ms. Allocated memory was 156.2 MB in the beginning and 285.2 MB in the end (delta: 129.0 MB). Free memory was 115.3 MB in the beginning and 166.7 MB in the end (delta: -51.3 MB). Peak memory consumption was 145.3 MB. Max. memory is 8.0 GB. [2021-01-06 16:32:07,375 INFO L168 Benchmark]: Witness Printer took 92.50 ms. Allocated memory is still 285.2 MB. Free memory was 166.7 MB in the beginning and 163.0 MB in the end (delta: 3.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2021-01-06 16:32:07,382 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.15 ms. Allocated memory is still 156.2 MB. Free memory is still 127.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 545.09 ms. Allocated memory is still 156.2 MB. Free memory was 129.4 MB in the beginning and 106.3 MB in the end (delta: 23.0 MB). Peak memory consumption was 23.1 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 94.51 ms. Allocated memory is still 156.2 MB. Free memory was 106.3 MB in the beginning and 104.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 80.15 ms. Allocated memory is still 156.2 MB. Free memory was 104.2 MB in the beginning and 138.1 MB in the end (delta: -33.9 MB). Peak memory consumption was 5.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 615.30 ms. Allocated memory is still 156.2 MB. Free memory was 138.1 MB in the beginning and 115.9 MB in the end (delta: 22.2 MB). Peak memory consumption was 22.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 12890.61 ms. Allocated memory was 156.2 MB in the beginning and 285.2 MB in the end (delta: 129.0 MB). Free memory was 115.3 MB in the beginning and 166.7 MB in the end (delta: -51.3 MB). Peak memory consumption was 145.3 MB. Max. memory is 8.0 GB. * Witness Printer took 92.50 ms. Allocated memory is still 285.2 MB. Free memory was 166.7 MB in the beginning and 163.0 MB in the end (delta: 3.7 MB). Peak memory consumption was 4.2 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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 630]: 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 1 specifications checked. All of them hold - InvariantResult [Line: 583]: Loop Invariant [2021-01-06 16:32:07,397 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,398 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,401 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,401 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((\valid[temp] == 1 && !(#memory_$Pointer$[\result][4] == \result)) && head == 0) && \result == 0) && !(#memory_$Pointer$[head][4] == head)) && \valid[\result] == 1) && temp == 0) && \valid[head] == 1) && 2 == len) && \result == 0 - InvariantResult [Line: 618]: Loop Invariant [2021-01-06 16:32:07,402 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,402 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,402 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,403 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,403 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,409 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:32:07,409 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,410 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:32:07,410 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,410 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:32:07,410 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,410 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:32:07,412 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,415 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,415 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,416 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,416 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,416 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:32:07,416 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,416 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:32:07,417 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,417 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:32:07,417 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,417 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$[\result][4] == \result) && head == 0) && \valid[head] == 1) && 2 == len) && i + 1 <= len) && \result == 0) && \valid[temp] == 1) && !(s == #memory_$Pointer$[s][4])) && \result == 0) && !(#memory_$Pointer$[head][4] == head)) && \valid[\result] == 1) && temp == 0) && s == 0) && 0 < i) || ((((((((((((((((index + 2 <= len && unknown-#memory_int-unknown[s][s] + 2 <= 2 * len) && s == head) && \valid[head] == 1) && len <= data) && 2 == len) && s == head) && \valid[temp] == 1) && !(s == #memory_$Pointer$[s][4])) && \result == 0) && \valid[\result] == 1) && data + 2 <= 2 * len) && len <= unknown-#memory_int-unknown[s][s]) && temp == 0) && len * 2 == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && s == 0) && i + 2 <= len)) || ((((((((((((((((data + 1 <= 2 * len && \valid[head] == 1) && 2 * len <= data + 1) && 2 == len) && 2 * len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] + 1) && \valid[temp] == 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] + 1 <= 2 * len) && \result == 0) && \valid[\result] == 1) && 0 < i + 1) && temp == 0) && !(s == head)) && head == #memory_$Pointer$[s][4]) && s == 0) && #memory_$Pointer$[s][4] == head) && index <= i) && i + 2 <= len) - InvariantResult [Line: 607]: Loop Invariant [2021-01-06 16:32:07,419 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,419 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,421 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,421 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:32:07,422 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,422 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,422 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:32:07,422 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,422 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,423 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,424 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,429 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,429 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,430 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:32:07,430 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,430 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,430 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:32:07,430 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,431 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,431 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$[\result][4] == \result) && head == 0) && index + 2 <= len) && data + 1 <= 2 * len) && \valid[head] == 1) && 2 * len <= data + 1) && 2 == len) && i + 1 <= len) && \result == 0) && \valid[temp] == 1) && \result == 0) && !(#memory_$Pointer$[head][4] == head)) && \valid[\result] == 1) && temp == 0) && !(s == head)) && head == #memory_$Pointer$[s][4]) && s == 0) && #memory_$Pointer$[s][4] == head) && 0 < i) || (((((((((((((((s == head && \valid[head] == 1) && len <= data) && 2 == len) && s == head) && \valid[temp] == 1) && !(s == #memory_$Pointer$[s][4])) && \result == 0) && \valid[\result] == 1) && 0 < i + 1) && data + 2 <= 2 * len) && temp == 0) && len * 2 == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && s == 0) && index <= i) && i + 2 <= len)) || ((((((((((((((((((!(#memory_$Pointer$[\result][4] == \result) && len <= index + 1) && head == 0) && data + 1 <= 2 * len) && s == head) && \valid[head] == 1) && 2 * len <= data + 1) && 2 == len) && i + 1 <= len) && \result == 0) && \valid[temp] == 1) && !(s == #memory_$Pointer$[s][4])) && \result == 0) && !(#memory_$Pointer$[head][4] == head)) && \valid[\result] == 1) && head == 0) && temp == 0) && s == 0) && index <= i) - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 599]: Loop Invariant [2021-01-06 16:32:07,432 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,433 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,433 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:32:07,437 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,437 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,437 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (index <= 0 && (((((((((((((((((((expected <= 2 && 2 <= expected) && s == head) && \valid[head] == 1) && len <= data) && s == head) && \valid[temp] == 1) && 2 <= \result) && \result == 0) && \valid[\result] == 1) && unknown-#memory_int-unknown[head][head] <= 2) && data + 2 <= 2 * len) && len <= unknown-#memory_int-unknown[s][s]) && temp == 0) && 2 <= unknown-#memory_int-unknown[head][head]) && index <= i) && i + 2 <= len) && unknown-#memory_int-unknown[s][s] <= len + i) && \result <= 2) || ((((((((((((((((((index + 2 <= len && (expected + -1) / 2 * 2 + 1 == unknown-#memory_int-unknown[head][head]) && s == head) && \valid[head] == 1) && len <= data) && i + 1 <= len) && unknown-#memory_int-unknown[s][s] + 1 <= len + i) && s == head) && \valid[temp] == 1) && !(s == #memory_$Pointer$[s][4])) && \result == 0) && \valid[\result] == 1) && data + 2 <= 2 * len) && len <= unknown-#memory_int-unknown[s][s]) && temp == 0) && len * 2 == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && (expected + 1) % 2 == 0) && s == 0) && (expected + -1) / 2 * 2 + 1 == \result))) && 2 == len - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 585]: Loop Invariant [2021-01-06 16:32:07,439 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,439 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((2 == len && 2 == len) || ((((((\valid[temp] == 1 && 1 <= len) && \result == 0) && \valid[\result] == 1) && temp == 0) && \valid[head] == 1) && 2 == len)) || (((((((\valid[temp] == 1 && head == 0) && \result == 0) && !(#memory_$Pointer$[head][4] == head)) && \valid[\result] == 1) && temp == 0) && \valid[head] == 1) && 2 == len) - InvariantResult [Line: 600]: Loop Invariant [2021-01-06 16:32:07,440 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,440 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,443 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,443 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:32:07,444 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,444 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:32:07,444 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,444 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:32:07,444 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,445 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,445 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:32:07,449 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,449 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,449 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,450 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:32:07,450 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,450 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:32:07,450 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,450 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:32:07,451 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,451 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,451 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((((((((((index + 2 <= len && s == head) && 2 == len) && 1 <= index) && s == head) && \valid[temp] == 1) && !(s == #memory_$Pointer$[s][4])) && \result == 0) && \valid[\result] == 1) && data + 2 <= 2 * len) && len <= unknown-#memory_int-unknown[s][s]) && !(head == #memory_$Pointer$[head][head + 4])) && index <= 1) && \valid[head] == 1) && len <= i + 2) && len <= data) && i + 1 <= len) && unknown-#memory_int-unknown[s][s] + 1 <= len + i) && expected <= unknown-#memory_int-unknown[#memory_$Pointer$[head][head + 4]][#memory_$Pointer$[head][head + 4]]) && temp == 0) && len * 2 == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && (expected + 1) % 2 == 0) && s == 0) && unknown-#memory_int-unknown[#memory_$Pointer$[head][head + 4]][#memory_$Pointer$[head][head + 4]] <= expected) && head == 0) || (((((((((((((((((((expected <= 2 && 2 <= expected) && index <= 0) && s == head) && \valid[head] == 1) && len <= i + 2) && 2 == len) && len <= data) && s == head) && \valid[temp] == 1) && \result == 0) && \valid[\result] == 1) && unknown-#memory_int-unknown[head][head] <= 2) && data + 2 <= 2 * len) && len <= unknown-#memory_int-unknown[s][s]) && temp == 0) && 2 <= unknown-#memory_int-unknown[head][head]) && index <= i) && i + 2 <= len) && unknown-#memory_int-unknown[s][s] <= len + i)) || (((((((((((((((((((index + 2 <= len && (expected + -1) / 2 * 2 + 1 == unknown-#memory_int-unknown[head][head]) && index <= 0) && s == head) && \valid[head] == 1) && 2 == len) && len <= data) && i + 1 <= len) && unknown-#memory_int-unknown[s][s] + 1 <= len + i) && s == head) && \valid[temp] == 1) && !(s == #memory_$Pointer$[s][4])) && \result == 0) && \valid[\result] == 1) && data + 2 <= 2 * len) && len <= unknown-#memory_int-unknown[s][s]) && temp == 0) && len * 2 == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && (expected + 1) % 2 == 0) && s == 0) - InvariantResult [Line: 622]: Loop Invariant [2021-01-06 16:32:07,452 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,453 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,453 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-01-06 16:32:07,454 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,454 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-01-06 16:32:07,454 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((((((index + 2 <= len && s == head) && \valid[head] == 1) && 2 == len) && len <= data) && i + 1 <= len) && unknown-#memory_int-unknown[s][s] + 1 <= len + i) && s == head) && \valid[temp] == 1) && !(s == #memory_$Pointer$[s][4])) && \result == 0) && \valid[\result] == 1) && data + 2 <= 2 * len) && len <= unknown-#memory_int-unknown[s][s]) && temp == 0) && len * 2 == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && s == 0) || ((((((((((((((index + 2 <= len && index <= 0) && unknown-#memory_int-unknown[s][s] + 2 <= 2 * len) && s == head) && \valid[head] == 1) && len <= data) && 2 == len) && s == head) && \valid[temp] == 1) && \result == 0) && \valid[\result] == 1) && data + 2 <= 2 * len) && len <= unknown-#memory_int-unknown[s][s]) && temp == 0) && i + 2 <= len) - InvariantResult [Line: 574]: Loop Invariant Derived loop invariant: (((((\valid[temp] == 1 && \result == 0) && \valid[\result] == 1) && 2 == len) && temp == 0) && 2 == len) || ((((((((\valid[temp] == 1 && 1 <= len) && !(head == temp)) && \result == 0) && \valid[\result] == 1) && temp == 0) && \valid[head] == 1) && !(\result == head)) && 2 == len) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 10.4s, OverallIterations: 12, TraceHistogramMax: 2, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 255 SDtfs, 716 SDslu, 769 SDs, 0 SdLazy, 1200 SolverSat, 244 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 315 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 76 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 31 NumberOfFragments, 1538 HoareAnnotationTreeSize, 12 FomulaSimplifications, 7287 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 12 FomulaSimplificationsInter, 544 FormulaSimplificationTreeSizeReductionInter, 2.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 526 NumberOfCodeBlocks, 526 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 508 ConstructedInterpolants, 0 QuantifiedInterpolants, 108674 SizeOfPredicates, 78 NumberOfNonLiveVariables, 1257 ConjunctsInSsa, 164 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 172/232 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...