/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/bubble_sort-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:50:08,130 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:50:08,132 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:50:08,151 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:50:08,152 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:50:08,153 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:50:08,154 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:50:08,164 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:50:08,167 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:50:08,170 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:50:08,172 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:50:08,174 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:50:08,175 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:50:08,176 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:50:08,178 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:50:08,180 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:50:08,181 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:50:08,182 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:50:08,183 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:50:08,188 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:50:08,192 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:50:08,195 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:50:08,196 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:50:08,197 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:50:08,199 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:50:08,199 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:50:08,199 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:50:08,202 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:50:08,202 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:50:08,203 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:50:08,203 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:50:08,204 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:50:08,205 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:50:08,206 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:50:08,207 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:50:08,207 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:50:08,207 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:50:08,208 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:50:08,208 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:50:08,209 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:50:08,210 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:50:08,211 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:50:08,242 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:50:08,242 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:50:08,244 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:50:08,248 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:50:08,248 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:50:08,248 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:50:08,248 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:50:08,249 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:50:08,249 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:50:08,249 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:50:08,249 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:50:08,249 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:50:08,249 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:50:08,249 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:50:08,250 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:50:08,250 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:50:08,250 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:50:08,250 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:50:08,252 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:50:08,252 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:50:08,253 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:50:08,253 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:50:08,253 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:50:08,253 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:50:08,254 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:50:08,254 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:50:08,254 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:50:08,254 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:50:08,257 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:50:08,257 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:50:08,550 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:50:08,561 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:50:08,565 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:50:08,566 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:50:08,567 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:50:08,567 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/bubble_sort-2.i [2020-07-17 22:50:08,629 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fc56788c/d5b3c11ea0954246811b3264c155cd99/FLAG58efdba4b [2020-07-17 22:50:09,077 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:50:09,078 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/bubble_sort-2.i [2020-07-17 22:50:09,090 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fc56788c/d5b3c11ea0954246811b3264c155cd99/FLAG58efdba4b [2020-07-17 22:50:09,444 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fc56788c/d5b3c11ea0954246811b3264c155cd99 [2020-07-17 22:50:09,452 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:50:09,455 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:50:09,456 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:50:09,456 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:50:09,459 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:50:09,461 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:50:09" (1/1) ... [2020-07-17 22:50:09,464 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48f7739a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:09, skipping insertion in model container [2020-07-17 22:50:09,464 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:50:09" (1/1) ... [2020-07-17 22:50:09,474 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:50:09,541 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:50:09,850 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:50:09,988 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:50:10,157 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:50:10,185 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:50:10,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:10 WrapperNode [2020-07-17 22:50:10,185 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:50:10,186 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:50:10,186 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:50:10,186 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:50:10,200 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:10" (1/1) ... [2020-07-17 22:50:10,201 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:10" (1/1) ... [2020-07-17 22:50:10,218 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:10" (1/1) ... [2020-07-17 22:50:10,219 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:10" (1/1) ... [2020-07-17 22:50:10,302 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:10" (1/1) ... [2020-07-17 22:50:10,317 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:10" (1/1) ... [2020-07-17 22:50:10,332 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:10" (1/1) ... [2020-07-17 22:50:10,342 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:50:10,343 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:50:10,343 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:50:10,343 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:50:10,344 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/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 [2020-07-17 22:50:10,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:50:10,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:50:10,416 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2020-07-17 22:50:10,417 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2020-07-17 22:50:10,417 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2020-07-17 22:50:10,417 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_del [2020-07-17 22:50:10,417 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2020-07-17 22:50:10,417 INFO L138 BoogieDeclarations]: Found implementation of procedure list_move [2020-07-17 22:50:10,417 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_insert [2020-07-17 22:50:10,418 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_read [2020-07-17 22:50:10,418 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_destroy [2020-07-17 22:50:10,418 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2020-07-17 22:50:10,419 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_sort_pass [2020-07-17 22:50:10,420 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_sort [2020-07-17 22:50:10,420 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:50:10,421 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:50:10,421 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-07-17 22:50:10,421 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-07-17 22:50:10,422 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-07-17 22:50:10,422 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-17 22:50:10,422 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-17 22:50:10,422 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:50:10,422 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:50:10,423 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2020-07-17 22:50:10,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-17 22:50:10,423 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2020-07-17 22:50:10,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-17 22:50:10,424 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2020-07-17 22:50:10,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-17 22:50:10,424 INFO L130 BoogieDeclarations]: Found specification of procedure __list_del [2020-07-17 22:50:10,424 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2020-07-17 22:50:10,424 INFO L130 BoogieDeclarations]: Found specification of procedure list_move [2020-07-17 22:50:10,425 INFO L130 BoogieDeclarations]: Found specification of procedure gl_insert [2020-07-17 22:50:10,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-17 22:50:10,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-17 22:50:10,425 INFO L130 BoogieDeclarations]: Found specification of procedure gl_read [2020-07-17 22:50:10,425 INFO L130 BoogieDeclarations]: Found specification of procedure gl_destroy [2020-07-17 22:50:10,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 22:50:10,425 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2020-07-17 22:50:10,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-17 22:50:10,426 INFO L130 BoogieDeclarations]: Found specification of procedure gl_sort_pass [2020-07-17 22:50:10,426 INFO L130 BoogieDeclarations]: Found specification of procedure gl_sort [2020-07-17 22:50:10,426 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:50:10,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:50:10,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-07-17 22:50:10,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-07-17 22:50:10,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:50:11,038 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint failFINAL: assume true; [2020-07-17 22:50:11,546 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:50:11,546 INFO L295 CfgBuilder]: Removed 23 assume(true) statements. [2020-07-17 22:50:11,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:50:11 BoogieIcfgContainer [2020-07-17 22:50:11,551 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:50:11,552 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:50:11,552 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:50:11,556 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:50:11,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:50:09" (1/3) ... [2020-07-17 22:50:11,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63ae1446 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:50:11, skipping insertion in model container [2020-07-17 22:50:11,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:10" (2/3) ... [2020-07-17 22:50:11,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63ae1446 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:50:11, skipping insertion in model container [2020-07-17 22:50:11,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:50:11" (3/3) ... [2020-07-17 22:50:11,559 INFO L109 eAbstractionObserver]: Analyzing ICFG bubble_sort-2.i [2020-07-17 22:50:11,569 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:50:11,577 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:50:11,591 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:50:11,615 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:50:11,615 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:50:11,615 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:50:11,615 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:50:11,616 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:50:11,616 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:50:11,616 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:50:11,616 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:50:11,638 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states. [2020-07-17 22:50:11,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-17 22:50:11,645 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:11,646 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:11,646 INFO L427 AbstractCegarLoop]: === Iteration 1 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:11,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:11,652 INFO L82 PathProgramCache]: Analyzing trace with hash 699938347, now seen corresponding path program 1 times [2020-07-17 22:50:11,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:11,662 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966168859] [2020-07-17 22:50:11,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:11,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:11,921 INFO L280 TraceCheckUtils]: 0: Hoare triple {168#(and (= |#t~string0.base| |old(#t~string0.base)|) (= |#t~string1.offset| |old(#t~string1.offset)|) (= |#t~string0.offset| |old(#t~string0.offset)|) (= |#valid| |old(#valid)|) (= |~#gl_list~0.offset| |old(~#gl_list~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#gl_list~0.base| |old(~#gl_list~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#t~string1.base| |old(#t~string1.base)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(12);call ~#gl_list~0.base, ~#gl_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#gl_list~0.base, ~#gl_list~0.offset, ~#gl_list~0.base, ~#gl_list~0.offset, 4);call write~init~$Pointer$(~#gl_list~0.base, ~#gl_list~0.offset, ~#gl_list~0.base, 4 + ~#gl_list~0.offset, 4); {159#true} is VALID [2020-07-17 22:50:11,921 INFO L280 TraceCheckUtils]: 1: Hoare triple {159#true} assume true; {159#true} is VALID [2020-07-17 22:50:11,922 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {159#true} {159#true} #586#return; {159#true} is VALID [2020-07-17 22:50:11,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:11,950 INFO L280 TraceCheckUtils]: 0: Hoare triple {169#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} havoc ~tmp~1;havoc ~tmp___0~0; {159#true} is VALID [2020-07-17 22:50:11,951 INFO L280 TraceCheckUtils]: 1: Hoare triple {159#true} assume !true; {160#false} is VALID [2020-07-17 22:50:11,952 INFO L280 TraceCheckUtils]: 2: Hoare triple {160#false} assume true; {160#false} is VALID [2020-07-17 22:50:11,952 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {160#false} {159#true} #532#return; {160#false} is VALID [2020-07-17 22:50:11,954 INFO L263 TraceCheckUtils]: 0: Hoare triple {159#true} call ULTIMATE.init(); {168#(and (= |#t~string0.base| |old(#t~string0.base)|) (= |#t~string1.offset| |old(#t~string1.offset)|) (= |#t~string0.offset| |old(#t~string0.offset)|) (= |#valid| |old(#valid)|) (= |~#gl_list~0.offset| |old(~#gl_list~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#gl_list~0.base| |old(~#gl_list~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#t~string1.base| |old(#t~string1.base)|) (= |old(#length)| |#length|))} is VALID [2020-07-17 22:50:11,955 INFO L280 TraceCheckUtils]: 1: Hoare triple {168#(and (= |#t~string0.base| |old(#t~string0.base)|) (= |#t~string1.offset| |old(#t~string1.offset)|) (= |#t~string0.offset| |old(#t~string0.offset)|) (= |#valid| |old(#valid)|) (= |~#gl_list~0.offset| |old(~#gl_list~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#gl_list~0.base| |old(~#gl_list~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#t~string1.base| |old(#t~string1.base)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(12);call ~#gl_list~0.base, ~#gl_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#gl_list~0.base, ~#gl_list~0.offset, ~#gl_list~0.base, ~#gl_list~0.offset, 4);call write~init~$Pointer$(~#gl_list~0.base, ~#gl_list~0.offset, ~#gl_list~0.base, 4 + ~#gl_list~0.offset, 4); {159#true} is VALID [2020-07-17 22:50:11,955 INFO L280 TraceCheckUtils]: 2: Hoare triple {159#true} assume true; {159#true} is VALID [2020-07-17 22:50:11,956 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {159#true} {159#true} #586#return; {159#true} is VALID [2020-07-17 22:50:11,956 INFO L263 TraceCheckUtils]: 4: Hoare triple {159#true} call #t~ret32 := main(); {159#true} is VALID [2020-07-17 22:50:11,956 INFO L280 TraceCheckUtils]: 5: Hoare triple {159#true} havoc ~__cil_tmp1~0.base, ~__cil_tmp1~0.offset;havoc ~__cil_tmp2~1.base, ~__cil_tmp2~1.offset; {159#true} is VALID [2020-07-17 22:50:11,958 INFO L263 TraceCheckUtils]: 6: Hoare triple {159#true} call gl_read(); {169#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:50:11,958 INFO L280 TraceCheckUtils]: 7: Hoare triple {169#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} havoc ~tmp~1;havoc ~tmp___0~0; {159#true} is VALID [2020-07-17 22:50:11,959 INFO L280 TraceCheckUtils]: 8: Hoare triple {159#true} assume !true; {160#false} is VALID [2020-07-17 22:50:11,960 INFO L280 TraceCheckUtils]: 9: Hoare triple {160#false} assume true; {160#false} is VALID [2020-07-17 22:50:11,960 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {160#false} {159#true} #532#return; {160#false} is VALID [2020-07-17 22:50:11,960 INFO L280 TraceCheckUtils]: 11: Hoare triple {160#false} ~__cil_tmp1~0.base, ~__cil_tmp1~0.offset := ~#gl_list~0.base, ~#gl_list~0.offset; {160#false} is VALID [2020-07-17 22:50:11,961 INFO L263 TraceCheckUtils]: 12: Hoare triple {160#false} call inspect(~__cil_tmp1~0.base, ~__cil_tmp1~0.offset); {160#false} is VALID [2020-07-17 22:50:11,962 INFO L280 TraceCheckUtils]: 13: Hoare triple {160#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;havoc ~node~0.base, ~node~0.offset;havoc ~__cil_tmp3~0;havoc ~__cil_tmp4~0.base, ~__cil_tmp4~0.offset;havoc ~__cil_tmp5~0;havoc ~__cil_tmp6~0;havoc ~__cil_tmp7~0;havoc ~__cil_tmp8~0;havoc ~__cil_tmp9~0;havoc ~__cil_tmp10~0.base, ~__cil_tmp10~0.offset;havoc ~__cil_tmp11~0;havoc ~__cil_tmp12~0;havoc ~__cil_tmp13~0;havoc ~__cil_tmp14~0;havoc ~__cil_tmp15~0.base, ~__cil_tmp15~0.offset;havoc ~__cil_tmp16~0;havoc ~__cil_tmp17~0.base, ~__cil_tmp17~0.offset;havoc ~__cil_tmp18~0;havoc ~__cil_tmp19~0;havoc ~__cil_tmp20~0;havoc ~__cil_tmp21~0;havoc ~__cil_tmp22~0;havoc ~__cil_tmp23~0.base, ~__cil_tmp23~0.offset;havoc ~__cil_tmp24~0;havoc ~__cil_tmp25~0;havoc ~__cil_tmp26~0.base, ~__cil_tmp26~0.offset;havoc ~__cil_tmp27~0;havoc ~__cil_tmp28~0;havoc ~__cil_tmp29~0.base, ~__cil_tmp29~0.offset;havoc ~__cil_tmp30~0;havoc ~__cil_tmp31~0.base, ~__cil_tmp31~0.offset;havoc ~__cil_tmp32~0.base, ~__cil_tmp32~0.offset;havoc ~__cil_tmp33~0.base, ~__cil_tmp33~0.offset;havoc ~__cil_tmp34~0;havoc ~__cil_tmp35~0;havoc ~__cil_tmp36~0.base, ~__cil_tmp36~0.offset;havoc ~__cil_tmp37~0;havoc ~__cil_tmp38~0;havoc ~__cil_tmp39~0;havoc ~__cil_tmp40~0.base, ~__cil_tmp40~0.offset;havoc ~__cil_tmp41~0;havoc ~__cil_tmp42~0;havoc ~__cil_tmp43~0;havoc ~__cil_tmp44~0;havoc ~__cil_tmp45~0.base, ~__cil_tmp45~0.offset;havoc ~__cil_tmp46~0;havoc ~__cil_tmp47~0;havoc ~__cil_tmp48~0;havoc ~__cil_tmp49~0;havoc ~__cil_tmp50~0.base, ~__cil_tmp50~0.offset;havoc ~__cil_tmp51~0;havoc ~__cil_tmp52~0;havoc ~__cil_tmp53~0;havoc ~__cil_tmp54~0;havoc ~__cil_tmp55~0.base, ~__cil_tmp55~0.offset;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0.base, ~__cil_tmp59~0.offset;havoc ~__cil_tmp60~0;havoc ~__cil_tmp61~0;havoc ~__cil_tmp62~0;havoc ~__cil_tmp63~0;havoc ~__cil_tmp64~0.base, ~__cil_tmp64~0.offset;havoc ~__cil_tmp65~0;havoc ~__cil_tmp66~0;havoc ~__cil_tmp67~0;havoc ~__cil_tmp68~0;havoc ~__cil_tmp69~0.base, ~__cil_tmp69~0.offset;havoc ~__cil_tmp70~0;havoc ~__cil_tmp71~0;havoc ~__cil_tmp72~0.base, ~__cil_tmp72~0.offset;havoc ~__cil_tmp73~0;havoc ~__cil_tmp74~0;havoc ~__cil_tmp75~0;havoc ~__cil_tmp76~0;havoc ~__cil_tmp77~0;havoc ~__cil_tmp78~0.base, ~__cil_tmp78~0.offset;havoc ~__cil_tmp79~0.base, ~__cil_tmp79~0.offset;havoc ~__cil_tmp80~0;havoc ~__cil_tmp81~0;havoc ~__cil_tmp82~0;havoc ~__cil_tmp83~0.base, ~__cil_tmp83~0.offset;havoc ~__cil_tmp84~0.base, ~__cil_tmp84~0.offset;havoc ~__cil_tmp85~0;havoc ~__cil_tmp86~0;havoc ~__cil_tmp87~0;havoc ~__cil_tmp88~0;havoc ~__cil_tmp89~0;havoc ~__cil_tmp90~0.base, ~__cil_tmp90~0.offset;havoc ~__cil_tmp91~0;havoc ~__cil_tmp92~0;havoc ~__cil_tmp93~0.base, ~__cil_tmp93~0.offset;havoc ~__cil_tmp94~0;havoc ~__cil_tmp95~0;havoc ~__cil_tmp96~0;havoc ~__cil_tmp97~0;havoc ~__cil_tmp98~0;havoc ~__cil_tmp99~0;havoc ~__cil_tmp100~0.base, ~__cil_tmp100~0.offset;havoc ~__cil_tmp101~0.base, ~__cil_tmp101~0.offset;havoc ~__cil_tmp102~0;havoc ~__cil_tmp103~0;havoc ~__cil_tmp104~0;havoc ~__cil_tmp105~0.base, ~__cil_tmp105~0.offset;havoc ~__cil_tmp106~0;havoc ~__cil_tmp107~0;havoc ~__cil_tmp108~0;havoc ~__cil_tmp109~0.base, ~__cil_tmp109~0.offset;havoc ~__cil_tmp110~0;havoc ~__cil_tmp111~0.base, ~__cil_tmp111~0.offset;havoc ~__cil_tmp112~0;havoc ~__cil_tmp113~0.base, ~__cil_tmp113~0.offset;havoc ~__cil_tmp114~0;havoc ~__cil_tmp115~0;havoc ~__cil_tmp116~0.base, ~__cil_tmp116~0.offset;havoc ~__cil_tmp117~0;havoc ~__cil_tmp118~0.base, ~__cil_tmp118~0.offset;havoc ~__cil_tmp119~0.base, ~__cil_tmp119~0.offset;havoc ~__cil_tmp120~0.base, ~__cil_tmp120~0.offset;havoc ~__cil_tmp121~0;havoc ~__cil_tmp122~0; {160#false} is VALID [2020-07-17 22:50:11,962 INFO L280 TraceCheckUtils]: 14: Hoare triple {160#false} assume !false; {160#false} is VALID [2020-07-17 22:50:11,962 INFO L280 TraceCheckUtils]: 15: Hoare triple {160#false} assume ~head.base == 0 && ~head.offset == 0; {160#false} is VALID [2020-07-17 22:50:11,963 INFO L263 TraceCheckUtils]: 16: Hoare triple {160#false} call fail(); {160#false} is VALID [2020-07-17 22:50:11,963 INFO L280 TraceCheckUtils]: 17: Hoare triple {160#false} assume !false; {160#false} is VALID [2020-07-17 22:50:11,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:11,966 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966168859] [2020-07-17 22:50:11,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:50:11,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-17 22:50:11,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977890770] [2020-07-17 22:50:11,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-07-17 22:50:11,977 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:11,981 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:50:12,015 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:12,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:50:12,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:12,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:50:12,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:50:12,031 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 4 states. [2020-07-17 22:50:14,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:14,272 INFO L93 Difference]: Finished difference Result 331 states and 501 transitions. [2020-07-17 22:50:14,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:50:14,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-07-17 22:50:14,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:14,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:50:14,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 501 transitions. [2020-07-17 22:50:14,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:50:14,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 501 transitions. [2020-07-17 22:50:14,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 501 transitions. [2020-07-17 22:50:15,145 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 501 edges. 501 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:15,168 INFO L225 Difference]: With dead ends: 331 [2020-07-17 22:50:15,169 INFO L226 Difference]: Without dead ends: 164 [2020-07-17 22:50:15,175 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:50:15,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2020-07-17 22:50:15,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 143. [2020-07-17 22:50:15,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:15,554 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand 143 states. [2020-07-17 22:50:15,555 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand 143 states. [2020-07-17 22:50:15,555 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 143 states. [2020-07-17 22:50:15,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:15,568 INFO L93 Difference]: Finished difference Result 164 states and 196 transitions. [2020-07-17 22:50:15,568 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 196 transitions. [2020-07-17 22:50:15,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:15,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:15,572 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand 164 states. [2020-07-17 22:50:15,572 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 164 states. [2020-07-17 22:50:15,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:15,589 INFO L93 Difference]: Finished difference Result 164 states and 196 transitions. [2020-07-17 22:50:15,589 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 196 transitions. [2020-07-17 22:50:15,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:15,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:15,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:15,596 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:15,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-07-17 22:50:15,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 166 transitions. [2020-07-17 22:50:15,616 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 166 transitions. Word has length 18 [2020-07-17 22:50:15,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:15,617 INFO L479 AbstractCegarLoop]: Abstraction has 143 states and 166 transitions. [2020-07-17 22:50:15,617 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:50:15,617 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 166 transitions. [2020-07-17 22:50:15,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-17 22:50:15,619 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:15,619 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:15,620 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:50:15,620 INFO L427 AbstractCegarLoop]: === Iteration 2 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:15,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:15,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1874770036, now seen corresponding path program 1 times [2020-07-17 22:50:15,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:15,621 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210952910] [2020-07-17 22:50:15,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:15,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:15,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:15,929 INFO L280 TraceCheckUtils]: 0: Hoare triple {1252#(and (= |#t~string0.base| |old(#t~string0.base)|) (= |#t~string1.offset| |old(#t~string1.offset)|) (= |#t~string0.offset| |old(#t~string0.offset)|) (= |#valid| |old(#valid)|) (= |~#gl_list~0.offset| |old(~#gl_list~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#gl_list~0.base| |old(~#gl_list~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#t~string1.base| |old(#t~string1.base)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(12);call ~#gl_list~0.base, ~#gl_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#gl_list~0.base, ~#gl_list~0.offset, ~#gl_list~0.base, ~#gl_list~0.offset, 4);call write~init~$Pointer$(~#gl_list~0.base, ~#gl_list~0.offset, ~#gl_list~0.base, 4 + ~#gl_list~0.offset, 4); {1225#(not (= 0 |~#gl_list~0.base|))} is VALID [2020-07-17 22:50:15,930 INFO L280 TraceCheckUtils]: 1: Hoare triple {1225#(not (= 0 |~#gl_list~0.base|))} assume true; {1225#(not (= 0 |~#gl_list~0.base|))} is VALID [2020-07-17 22:50:15,931 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1225#(not (= 0 |~#gl_list~0.base|))} {1220#true} #586#return; {1225#(not (= 0 |~#gl_list~0.base|))} is VALID [2020-07-17 22:50:15,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:16,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:16,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:16,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:16,137 INFO L280 TraceCheckUtils]: 0: Hoare triple {1276#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset;havoc ~__cil_tmp4~1;havoc ~__cil_tmp5~1;havoc ~__cil_tmp6~1;havoc ~__cil_tmp7~1;~__cil_tmp4~1 := ~next.base + ~next.offset;~__cil_tmp5~1 := 4 + ~__cil_tmp4~1;call write~$Pointer$(~new.base, ~new.offset, 0, (if ~__cil_tmp5~1 % 4294967296 % 4294967296 <= 2147483647 then ~__cil_tmp5~1 % 4294967296 % 4294967296 else ~__cil_tmp5~1 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(~next.base, ~next.offset, ~new.base, ~new.offset, 4);~__cil_tmp6~1 := ~new.base + ~new.offset;~__cil_tmp7~1 := 4 + ~__cil_tmp6~1;call write~$Pointer$(~prev.base, ~prev.offset, 0, (if ~__cil_tmp7~1 % 4294967296 % 4294967296 <= 2147483647 then ~__cil_tmp7~1 % 4294967296 % 4294967296 else ~__cil_tmp7~1 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(~new.base, ~new.offset, ~prev.base, ~prev.offset, 4); {1220#true} is VALID [2020-07-17 22:50:16,137 INFO L280 TraceCheckUtils]: 1: Hoare triple {1220#true} assume true; {1220#true} is VALID [2020-07-17 22:50:16,138 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1220#true} {1220#true} #584#return; {1220#true} is VALID [2020-07-17 22:50:16,138 INFO L280 TraceCheckUtils]: 0: Hoare triple {1276#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset;havoc ~__cil_tmp3~2.base, ~__cil_tmp3~2.offset;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~head.base, ~head.offset, 4);~__cil_tmp3~2.base, ~__cil_tmp3~2.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset; {1220#true} is VALID [2020-07-17 22:50:16,140 INFO L263 TraceCheckUtils]: 1: Hoare triple {1220#true} call __list_add(~new.base, ~new.offset, ~head.base, ~head.offset, ~__cil_tmp3~2.base, ~__cil_tmp3~2.offset); {1276#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:50:16,140 INFO L280 TraceCheckUtils]: 2: Hoare triple {1276#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset;havoc ~__cil_tmp4~1;havoc ~__cil_tmp5~1;havoc ~__cil_tmp6~1;havoc ~__cil_tmp7~1;~__cil_tmp4~1 := ~next.base + ~next.offset;~__cil_tmp5~1 := 4 + ~__cil_tmp4~1;call write~$Pointer$(~new.base, ~new.offset, 0, (if ~__cil_tmp5~1 % 4294967296 % 4294967296 <= 2147483647 then ~__cil_tmp5~1 % 4294967296 % 4294967296 else ~__cil_tmp5~1 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(~next.base, ~next.offset, ~new.base, ~new.offset, 4);~__cil_tmp6~1 := ~new.base + ~new.offset;~__cil_tmp7~1 := 4 + ~__cil_tmp6~1;call write~$Pointer$(~prev.base, ~prev.offset, 0, (if ~__cil_tmp7~1 % 4294967296 % 4294967296 <= 2147483647 then ~__cil_tmp7~1 % 4294967296 % 4294967296 else ~__cil_tmp7~1 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(~new.base, ~new.offset, ~prev.base, ~prev.offset, 4); {1220#true} is VALID [2020-07-17 22:50:16,141 INFO L280 TraceCheckUtils]: 3: Hoare triple {1220#true} assume true; {1220#true} is VALID [2020-07-17 22:50:16,141 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1220#true} {1220#true} #584#return; {1220#true} is VALID [2020-07-17 22:50:16,141 INFO L280 TraceCheckUtils]: 5: Hoare triple {1220#true} assume true; {1220#true} is VALID [2020-07-17 22:50:16,141 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1220#true} {1220#true} #590#return; {1220#true} is VALID [2020-07-17 22:50:16,142 INFO L280 TraceCheckUtils]: 0: Hoare triple {1253#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~value := #in~value;havoc ~node~1.base, ~node~1.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~__cil_tmp4~4;havoc ~__cil_tmp5~3;havoc ~__cil_tmp6~3;havoc ~__cil_tmp7~2.base, ~__cil_tmp7~2.offset;havoc ~__cil_tmp8~1;havoc ~__cil_tmp9~1;havoc ~__cil_tmp10~1;havoc ~__cil_tmp11~1;havoc ~__cil_tmp12~1;havoc ~__cil_tmp13~1;havoc ~__cil_tmp14~1;havoc ~__cil_tmp15~1;~__cil_tmp4~4 := 20;call #t~malloc21.base, #t~malloc21.offset := #Ultimate.allocOnHeap(~__cil_tmp4~4);~tmp~0.base, ~tmp~0.offset := #t~malloc21.base, #t~malloc21.offset;~node~1.base, ~node~1.offset := ~tmp~0.base, ~tmp~0.offset; {1220#true} is VALID [2020-07-17 22:50:16,142 INFO L280 TraceCheckUtils]: 1: Hoare triple {1220#true} assume !(~node~1.base == 0 && ~node~1.offset == 0); {1220#true} is VALID [2020-07-17 22:50:16,143 INFO L280 TraceCheckUtils]: 2: Hoare triple {1220#true} call write~int(~value, ~node~1.base, ~node~1.offset, 4);~__cil_tmp5~3 := ~node~1.base + ~node~1.offset;~__cil_tmp6~3 := 4 + ~__cil_tmp5~3;~__cil_tmp7~2.base, ~__cil_tmp7~2.offset := 0, (if ~__cil_tmp6~3 % 4294967296 % 4294967296 <= 2147483647 then ~__cil_tmp6~3 % 4294967296 % 4294967296 else ~__cil_tmp6~3 % 4294967296 % 4294967296 - 4294967296); {1220#true} is VALID [2020-07-17 22:50:16,144 INFO L263 TraceCheckUtils]: 3: Hoare triple {1220#true} call list_add(~__cil_tmp7~2.base, ~__cil_tmp7~2.offset, ~#gl_list~0.base, ~#gl_list~0.offset); {1276#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:50:16,145 INFO L280 TraceCheckUtils]: 4: Hoare triple {1276#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset;havoc ~__cil_tmp3~2.base, ~__cil_tmp3~2.offset;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~head.base, ~head.offset, 4);~__cil_tmp3~2.base, ~__cil_tmp3~2.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset; {1220#true} is VALID [2020-07-17 22:50:16,146 INFO L263 TraceCheckUtils]: 5: Hoare triple {1220#true} call __list_add(~new.base, ~new.offset, ~head.base, ~head.offset, ~__cil_tmp3~2.base, ~__cil_tmp3~2.offset); {1276#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:50:16,146 INFO L280 TraceCheckUtils]: 6: Hoare triple {1276#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset;havoc ~__cil_tmp4~1;havoc ~__cil_tmp5~1;havoc ~__cil_tmp6~1;havoc ~__cil_tmp7~1;~__cil_tmp4~1 := ~next.base + ~next.offset;~__cil_tmp5~1 := 4 + ~__cil_tmp4~1;call write~$Pointer$(~new.base, ~new.offset, 0, (if ~__cil_tmp5~1 % 4294967296 % 4294967296 <= 2147483647 then ~__cil_tmp5~1 % 4294967296 % 4294967296 else ~__cil_tmp5~1 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(~next.base, ~next.offset, ~new.base, ~new.offset, 4);~__cil_tmp6~1 := ~new.base + ~new.offset;~__cil_tmp7~1 := 4 + ~__cil_tmp6~1;call write~$Pointer$(~prev.base, ~prev.offset, 0, (if ~__cil_tmp7~1 % 4294967296 % 4294967296 <= 2147483647 then ~__cil_tmp7~1 % 4294967296 % 4294967296 else ~__cil_tmp7~1 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(~new.base, ~new.offset, ~prev.base, ~prev.offset, 4); {1220#true} is VALID [2020-07-17 22:50:16,147 INFO L280 TraceCheckUtils]: 7: Hoare triple {1220#true} assume true; {1220#true} is VALID [2020-07-17 22:50:16,147 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {1220#true} {1220#true} #584#return; {1220#true} is VALID [2020-07-17 22:50:16,147 INFO L280 TraceCheckUtils]: 9: Hoare triple {1220#true} assume true; {1220#true} is VALID [2020-07-17 22:50:16,148 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1220#true} {1220#true} #590#return; {1220#true} is VALID [2020-07-17 22:50:16,148 INFO L280 TraceCheckUtils]: 11: Hoare triple {1220#true} assume !false; {1220#true} is VALID [2020-07-17 22:50:16,148 INFO L280 TraceCheckUtils]: 12: Hoare triple {1220#true} ~__cil_tmp8~1 := ~node~1.base + ~node~1.offset;~__cil_tmp9~1 := 12 + ~__cil_tmp8~1;~__cil_tmp10~1 := ~node~1.base + ~node~1.offset;~__cil_tmp11~1 := 12 + ~__cil_tmp10~1;call write~$Pointer$(0, (if ~__cil_tmp11~1 % 4294967296 % 4294967296 <= 2147483647 then ~__cil_tmp11~1 % 4294967296 % 4294967296 else ~__cil_tmp11~1 % 4294967296 % 4294967296 - 4294967296), 0, (if ~__cil_tmp9~1 % 4294967296 % 4294967296 <= 2147483647 then ~__cil_tmp9~1 % 4294967296 % 4294967296 else ~__cil_tmp9~1 % 4294967296 % 4294967296 - 4294967296), 4);~__cil_tmp12~1 := ~node~1.base + ~node~1.offset;~__cil_tmp13~1 := 12 + ~__cil_tmp12~1;~__cil_tmp14~1 := ~node~1.base + ~node~1.offset;~__cil_tmp15~1 := 12 + ~__cil_tmp14~1;call write~$Pointer$(0, (if ~__cil_tmp15~1 % 4294967296 % 4294967296 <= 2147483647 then ~__cil_tmp15~1 % 4294967296 % 4294967296 else ~__cil_tmp15~1 % 4294967296 % 4294967296 - 4294967296), 0, (if ~__cil_tmp13~1 % 4294967296 % 4294967296 <= 2147483647 then ~__cil_tmp13~1 % 4294967296 % 4294967296 else ~__cil_tmp13~1 % 4294967296 % 4294967296 - 4294967296), 4); {1220#true} is VALID [2020-07-17 22:50:16,149 INFO L280 TraceCheckUtils]: 13: Hoare triple {1220#true} assume true; {1220#true} is VALID [2020-07-17 22:50:16,149 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1220#true} {1220#true} #548#return; {1220#true} is VALID [2020-07-17 22:50:16,150 INFO L280 TraceCheckUtils]: 0: Hoare triple {1253#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} havoc ~tmp~1;havoc ~tmp___0~0; {1220#true} is VALID [2020-07-17 22:50:16,150 INFO L280 TraceCheckUtils]: 1: Hoare triple {1220#true} assume !false; {1220#true} is VALID [2020-07-17 22:50:16,151 INFO L280 TraceCheckUtils]: 2: Hoare triple {1220#true} assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp~1 := #t~nondet22;havoc #t~nondet22; {1220#true} is VALID [2020-07-17 22:50:16,152 INFO L263 TraceCheckUtils]: 3: Hoare triple {1220#true} call gl_insert(~tmp~1); {1253#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:50:16,152 INFO L280 TraceCheckUtils]: 4: Hoare triple {1253#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~value := #in~value;havoc ~node~1.base, ~node~1.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~__cil_tmp4~4;havoc ~__cil_tmp5~3;havoc ~__cil_tmp6~3;havoc ~__cil_tmp7~2.base, ~__cil_tmp7~2.offset;havoc ~__cil_tmp8~1;havoc ~__cil_tmp9~1;havoc ~__cil_tmp10~1;havoc ~__cil_tmp11~1;havoc ~__cil_tmp12~1;havoc ~__cil_tmp13~1;havoc ~__cil_tmp14~1;havoc ~__cil_tmp15~1;~__cil_tmp4~4 := 20;call #t~malloc21.base, #t~malloc21.offset := #Ultimate.allocOnHeap(~__cil_tmp4~4);~tmp~0.base, ~tmp~0.offset := #t~malloc21.base, #t~malloc21.offset;~node~1.base, ~node~1.offset := ~tmp~0.base, ~tmp~0.offset; {1220#true} is VALID [2020-07-17 22:50:16,152 INFO L280 TraceCheckUtils]: 5: Hoare triple {1220#true} assume !(~node~1.base == 0 && ~node~1.offset == 0); {1220#true} is VALID [2020-07-17 22:50:16,153 INFO L280 TraceCheckUtils]: 6: Hoare triple {1220#true} call write~int(~value, ~node~1.base, ~node~1.offset, 4);~__cil_tmp5~3 := ~node~1.base + ~node~1.offset;~__cil_tmp6~3 := 4 + ~__cil_tmp5~3;~__cil_tmp7~2.base, ~__cil_tmp7~2.offset := 0, (if ~__cil_tmp6~3 % 4294967296 % 4294967296 <= 2147483647 then ~__cil_tmp6~3 % 4294967296 % 4294967296 else ~__cil_tmp6~3 % 4294967296 % 4294967296 - 4294967296); {1220#true} is VALID [2020-07-17 22:50:16,154 INFO L263 TraceCheckUtils]: 7: Hoare triple {1220#true} call list_add(~__cil_tmp7~2.base, ~__cil_tmp7~2.offset, ~#gl_list~0.base, ~#gl_list~0.offset); {1276#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:50:16,154 INFO L280 TraceCheckUtils]: 8: Hoare triple {1276#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset;havoc ~__cil_tmp3~2.base, ~__cil_tmp3~2.offset;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~head.base, ~head.offset, 4);~__cil_tmp3~2.base, ~__cil_tmp3~2.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset; {1220#true} is VALID [2020-07-17 22:50:16,156 INFO L263 TraceCheckUtils]: 9: Hoare triple {1220#true} call __list_add(~new.base, ~new.offset, ~head.base, ~head.offset, ~__cil_tmp3~2.base, ~__cil_tmp3~2.offset); {1276#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:50:16,156 INFO L280 TraceCheckUtils]: 10: Hoare triple {1276#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset;havoc ~__cil_tmp4~1;havoc ~__cil_tmp5~1;havoc ~__cil_tmp6~1;havoc ~__cil_tmp7~1;~__cil_tmp4~1 := ~next.base + ~next.offset;~__cil_tmp5~1 := 4 + ~__cil_tmp4~1;call write~$Pointer$(~new.base, ~new.offset, 0, (if ~__cil_tmp5~1 % 4294967296 % 4294967296 <= 2147483647 then ~__cil_tmp5~1 % 4294967296 % 4294967296 else ~__cil_tmp5~1 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(~next.base, ~next.offset, ~new.base, ~new.offset, 4);~__cil_tmp6~1 := ~new.base + ~new.offset;~__cil_tmp7~1 := 4 + ~__cil_tmp6~1;call write~$Pointer$(~prev.base, ~prev.offset, 0, (if ~__cil_tmp7~1 % 4294967296 % 4294967296 <= 2147483647 then ~__cil_tmp7~1 % 4294967296 % 4294967296 else ~__cil_tmp7~1 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(~new.base, ~new.offset, ~prev.base, ~prev.offset, 4); {1220#true} is VALID [2020-07-17 22:50:16,157 INFO L280 TraceCheckUtils]: 11: Hoare triple {1220#true} assume true; {1220#true} is VALID [2020-07-17 22:50:16,157 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1220#true} {1220#true} #584#return; {1220#true} is VALID [2020-07-17 22:50:16,157 INFO L280 TraceCheckUtils]: 13: Hoare triple {1220#true} assume true; {1220#true} is VALID [2020-07-17 22:50:16,158 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1220#true} {1220#true} #590#return; {1220#true} is VALID [2020-07-17 22:50:16,158 INFO L280 TraceCheckUtils]: 15: Hoare triple {1220#true} assume !false; {1220#true} is VALID [2020-07-17 22:50:16,158 INFO L280 TraceCheckUtils]: 16: Hoare triple {1220#true} ~__cil_tmp8~1 := ~node~1.base + ~node~1.offset;~__cil_tmp9~1 := 12 + ~__cil_tmp8~1;~__cil_tmp10~1 := ~node~1.base + ~node~1.offset;~__cil_tmp11~1 := 12 + ~__cil_tmp10~1;call write~$Pointer$(0, (if ~__cil_tmp11~1 % 4294967296 % 4294967296 <= 2147483647 then ~__cil_tmp11~1 % 4294967296 % 4294967296 else ~__cil_tmp11~1 % 4294967296 % 4294967296 - 4294967296), 0, (if ~__cil_tmp9~1 % 4294967296 % 4294967296 <= 2147483647 then ~__cil_tmp9~1 % 4294967296 % 4294967296 else ~__cil_tmp9~1 % 4294967296 % 4294967296 - 4294967296), 4);~__cil_tmp12~1 := ~node~1.base + ~node~1.offset;~__cil_tmp13~1 := 12 + ~__cil_tmp12~1;~__cil_tmp14~1 := ~node~1.base + ~node~1.offset;~__cil_tmp15~1 := 12 + ~__cil_tmp14~1;call write~$Pointer$(0, (if ~__cil_tmp15~1 % 4294967296 % 4294967296 <= 2147483647 then ~__cil_tmp15~1 % 4294967296 % 4294967296 else ~__cil_tmp15~1 % 4294967296 % 4294967296 - 4294967296), 0, (if ~__cil_tmp13~1 % 4294967296 % 4294967296 <= 2147483647 then ~__cil_tmp13~1 % 4294967296 % 4294967296 else ~__cil_tmp13~1 % 4294967296 % 4294967296 - 4294967296), 4); {1220#true} is VALID [2020-07-17 22:50:16,159 INFO L280 TraceCheckUtils]: 17: Hoare triple {1220#true} assume true; {1220#true} is VALID [2020-07-17 22:50:16,159 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1220#true} {1220#true} #548#return; {1220#true} is VALID [2020-07-17 22:50:16,159 INFO L280 TraceCheckUtils]: 19: Hoare triple {1220#true} assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___0~0 := #t~nondet23;havoc #t~nondet23; {1220#true} is VALID [2020-07-17 22:50:16,159 INFO L280 TraceCheckUtils]: 20: Hoare triple {1220#true} assume !(0 != ~tmp___0~0); {1220#true} is VALID [2020-07-17 22:50:16,160 INFO L280 TraceCheckUtils]: 21: Hoare triple {1220#true} assume true; {1220#true} is VALID [2020-07-17 22:50:16,161 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1220#true} {1225#(not (= 0 |~#gl_list~0.base|))} #532#return; {1225#(not (= 0 |~#gl_list~0.base|))} is VALID [2020-07-17 22:50:16,163 INFO L263 TraceCheckUtils]: 0: Hoare triple {1220#true} call ULTIMATE.init(); {1252#(and (= |#t~string0.base| |old(#t~string0.base)|) (= |#t~string1.offset| |old(#t~string1.offset)|) (= |#t~string0.offset| |old(#t~string0.offset)|) (= |#valid| |old(#valid)|) (= |~#gl_list~0.offset| |old(~#gl_list~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#gl_list~0.base| |old(~#gl_list~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#t~string1.base| |old(#t~string1.base)|) (= |old(#length)| |#length|))} is VALID [2020-07-17 22:50:16,164 INFO L280 TraceCheckUtils]: 1: Hoare triple {1252#(and (= |#t~string0.base| |old(#t~string0.base)|) (= |#t~string1.offset| |old(#t~string1.offset)|) (= |#t~string0.offset| |old(#t~string0.offset)|) (= |#valid| |old(#valid)|) (= |~#gl_list~0.offset| |old(~#gl_list~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#gl_list~0.base| |old(~#gl_list~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#t~string1.base| |old(#t~string1.base)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(12);call ~#gl_list~0.base, ~#gl_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#gl_list~0.base, ~#gl_list~0.offset, ~#gl_list~0.base, ~#gl_list~0.offset, 4);call write~init~$Pointer$(~#gl_list~0.base, ~#gl_list~0.offset, ~#gl_list~0.base, 4 + ~#gl_list~0.offset, 4); {1225#(not (= 0 |~#gl_list~0.base|))} is VALID [2020-07-17 22:50:16,164 INFO L280 TraceCheckUtils]: 2: Hoare triple {1225#(not (= 0 |~#gl_list~0.base|))} assume true; {1225#(not (= 0 |~#gl_list~0.base|))} is VALID [2020-07-17 22:50:16,165 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1225#(not (= 0 |~#gl_list~0.base|))} {1220#true} #586#return; {1225#(not (= 0 |~#gl_list~0.base|))} is VALID [2020-07-17 22:50:16,166 INFO L263 TraceCheckUtils]: 4: Hoare triple {1225#(not (= 0 |~#gl_list~0.base|))} call #t~ret32 := main(); {1225#(not (= 0 |~#gl_list~0.base|))} is VALID [2020-07-17 22:50:16,166 INFO L280 TraceCheckUtils]: 5: Hoare triple {1225#(not (= 0 |~#gl_list~0.base|))} havoc ~__cil_tmp1~0.base, ~__cil_tmp1~0.offset;havoc ~__cil_tmp2~1.base, ~__cil_tmp2~1.offset; {1225#(not (= 0 |~#gl_list~0.base|))} is VALID [2020-07-17 22:50:16,167 INFO L263 TraceCheckUtils]: 6: Hoare triple {1225#(not (= 0 |~#gl_list~0.base|))} call gl_read(); {1253#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:50:16,168 INFO L280 TraceCheckUtils]: 7: Hoare triple {1253#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} havoc ~tmp~1;havoc ~tmp___0~0; {1220#true} is VALID [2020-07-17 22:50:16,168 INFO L280 TraceCheckUtils]: 8: Hoare triple {1220#true} assume !false; {1220#true} is VALID [2020-07-17 22:50:16,168 INFO L280 TraceCheckUtils]: 9: Hoare triple {1220#true} assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp~1 := #t~nondet22;havoc #t~nondet22; {1220#true} is VALID [2020-07-17 22:50:16,169 INFO L263 TraceCheckUtils]: 10: Hoare triple {1220#true} call gl_insert(~tmp~1); {1253#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:50:16,170 INFO L280 TraceCheckUtils]: 11: Hoare triple {1253#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~value := #in~value;havoc ~node~1.base, ~node~1.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~__cil_tmp4~4;havoc ~__cil_tmp5~3;havoc ~__cil_tmp6~3;havoc ~__cil_tmp7~2.base, ~__cil_tmp7~2.offset;havoc ~__cil_tmp8~1;havoc ~__cil_tmp9~1;havoc ~__cil_tmp10~1;havoc ~__cil_tmp11~1;havoc ~__cil_tmp12~1;havoc ~__cil_tmp13~1;havoc ~__cil_tmp14~1;havoc ~__cil_tmp15~1;~__cil_tmp4~4 := 20;call #t~malloc21.base, #t~malloc21.offset := #Ultimate.allocOnHeap(~__cil_tmp4~4);~tmp~0.base, ~tmp~0.offset := #t~malloc21.base, #t~malloc21.offset;~node~1.base, ~node~1.offset := ~tmp~0.base, ~tmp~0.offset; {1220#true} is VALID [2020-07-17 22:50:16,170 INFO L280 TraceCheckUtils]: 12: Hoare triple {1220#true} assume !(~node~1.base == 0 && ~node~1.offset == 0); {1220#true} is VALID [2020-07-17 22:50:16,170 INFO L280 TraceCheckUtils]: 13: Hoare triple {1220#true} call write~int(~value, ~node~1.base, ~node~1.offset, 4);~__cil_tmp5~3 := ~node~1.base + ~node~1.offset;~__cil_tmp6~3 := 4 + ~__cil_tmp5~3;~__cil_tmp7~2.base, ~__cil_tmp7~2.offset := 0, (if ~__cil_tmp6~3 % 4294967296 % 4294967296 <= 2147483647 then ~__cil_tmp6~3 % 4294967296 % 4294967296 else ~__cil_tmp6~3 % 4294967296 % 4294967296 - 4294967296); {1220#true} is VALID [2020-07-17 22:50:16,171 INFO L263 TraceCheckUtils]: 14: Hoare triple {1220#true} call list_add(~__cil_tmp7~2.base, ~__cil_tmp7~2.offset, ~#gl_list~0.base, ~#gl_list~0.offset); {1276#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:50:16,172 INFO L280 TraceCheckUtils]: 15: Hoare triple {1276#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset;havoc ~__cil_tmp3~2.base, ~__cil_tmp3~2.offset;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~head.base, ~head.offset, 4);~__cil_tmp3~2.base, ~__cil_tmp3~2.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset; {1220#true} is VALID [2020-07-17 22:50:16,173 INFO L263 TraceCheckUtils]: 16: Hoare triple {1220#true} call __list_add(~new.base, ~new.offset, ~head.base, ~head.offset, ~__cil_tmp3~2.base, ~__cil_tmp3~2.offset); {1276#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:50:16,174 INFO L280 TraceCheckUtils]: 17: Hoare triple {1276#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset;havoc ~__cil_tmp4~1;havoc ~__cil_tmp5~1;havoc ~__cil_tmp6~1;havoc ~__cil_tmp7~1;~__cil_tmp4~1 := ~next.base + ~next.offset;~__cil_tmp5~1 := 4 + ~__cil_tmp4~1;call write~$Pointer$(~new.base, ~new.offset, 0, (if ~__cil_tmp5~1 % 4294967296 % 4294967296 <= 2147483647 then ~__cil_tmp5~1 % 4294967296 % 4294967296 else ~__cil_tmp5~1 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(~next.base, ~next.offset, ~new.base, ~new.offset, 4);~__cil_tmp6~1 := ~new.base + ~new.offset;~__cil_tmp7~1 := 4 + ~__cil_tmp6~1;call write~$Pointer$(~prev.base, ~prev.offset, 0, (if ~__cil_tmp7~1 % 4294967296 % 4294967296 <= 2147483647 then ~__cil_tmp7~1 % 4294967296 % 4294967296 else ~__cil_tmp7~1 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(~new.base, ~new.offset, ~prev.base, ~prev.offset, 4); {1220#true} is VALID [2020-07-17 22:50:16,174 INFO L280 TraceCheckUtils]: 18: Hoare triple {1220#true} assume true; {1220#true} is VALID [2020-07-17 22:50:16,174 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {1220#true} {1220#true} #584#return; {1220#true} is VALID [2020-07-17 22:50:16,174 INFO L280 TraceCheckUtils]: 20: Hoare triple {1220#true} assume true; {1220#true} is VALID [2020-07-17 22:50:16,175 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1220#true} {1220#true} #590#return; {1220#true} is VALID [2020-07-17 22:50:16,175 INFO L280 TraceCheckUtils]: 22: Hoare triple {1220#true} assume !false; {1220#true} is VALID [2020-07-17 22:50:16,175 INFO L280 TraceCheckUtils]: 23: Hoare triple {1220#true} ~__cil_tmp8~1 := ~node~1.base + ~node~1.offset;~__cil_tmp9~1 := 12 + ~__cil_tmp8~1;~__cil_tmp10~1 := ~node~1.base + ~node~1.offset;~__cil_tmp11~1 := 12 + ~__cil_tmp10~1;call write~$Pointer$(0, (if ~__cil_tmp11~1 % 4294967296 % 4294967296 <= 2147483647 then ~__cil_tmp11~1 % 4294967296 % 4294967296 else ~__cil_tmp11~1 % 4294967296 % 4294967296 - 4294967296), 0, (if ~__cil_tmp9~1 % 4294967296 % 4294967296 <= 2147483647 then ~__cil_tmp9~1 % 4294967296 % 4294967296 else ~__cil_tmp9~1 % 4294967296 % 4294967296 - 4294967296), 4);~__cil_tmp12~1 := ~node~1.base + ~node~1.offset;~__cil_tmp13~1 := 12 + ~__cil_tmp12~1;~__cil_tmp14~1 := ~node~1.base + ~node~1.offset;~__cil_tmp15~1 := 12 + ~__cil_tmp14~1;call write~$Pointer$(0, (if ~__cil_tmp15~1 % 4294967296 % 4294967296 <= 2147483647 then ~__cil_tmp15~1 % 4294967296 % 4294967296 else ~__cil_tmp15~1 % 4294967296 % 4294967296 - 4294967296), 0, (if ~__cil_tmp13~1 % 4294967296 % 4294967296 <= 2147483647 then ~__cil_tmp13~1 % 4294967296 % 4294967296 else ~__cil_tmp13~1 % 4294967296 % 4294967296 - 4294967296), 4); {1220#true} is VALID [2020-07-17 22:50:16,176 INFO L280 TraceCheckUtils]: 24: Hoare triple {1220#true} assume true; {1220#true} is VALID [2020-07-17 22:50:16,176 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1220#true} {1220#true} #548#return; {1220#true} is VALID [2020-07-17 22:50:16,176 INFO L280 TraceCheckUtils]: 26: Hoare triple {1220#true} assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___0~0 := #t~nondet23;havoc #t~nondet23; {1220#true} is VALID [2020-07-17 22:50:16,177 INFO L280 TraceCheckUtils]: 27: Hoare triple {1220#true} assume !(0 != ~tmp___0~0); {1220#true} is VALID [2020-07-17 22:50:16,177 INFO L280 TraceCheckUtils]: 28: Hoare triple {1220#true} assume true; {1220#true} is VALID [2020-07-17 22:50:16,183 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1220#true} {1225#(not (= 0 |~#gl_list~0.base|))} #532#return; {1225#(not (= 0 |~#gl_list~0.base|))} is VALID [2020-07-17 22:50:16,185 INFO L280 TraceCheckUtils]: 30: Hoare triple {1225#(not (= 0 |~#gl_list~0.base|))} ~__cil_tmp1~0.base, ~__cil_tmp1~0.offset := ~#gl_list~0.base, ~#gl_list~0.offset; {1249#(not (= 0 main_~__cil_tmp1~0.base))} is VALID [2020-07-17 22:50:16,187 INFO L263 TraceCheckUtils]: 31: Hoare triple {1249#(not (= 0 main_~__cil_tmp1~0.base))} call inspect(~__cil_tmp1~0.base, ~__cil_tmp1~0.offset); {1250#(not (= |inspect_#in~head.base| 0))} is VALID [2020-07-17 22:50:16,191 INFO L280 TraceCheckUtils]: 32: Hoare triple {1250#(not (= |inspect_#in~head.base| 0))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;havoc ~node~0.base, ~node~0.offset;havoc ~__cil_tmp3~0;havoc ~__cil_tmp4~0.base, ~__cil_tmp4~0.offset;havoc ~__cil_tmp5~0;havoc ~__cil_tmp6~0;havoc ~__cil_tmp7~0;havoc ~__cil_tmp8~0;havoc ~__cil_tmp9~0;havoc ~__cil_tmp10~0.base, ~__cil_tmp10~0.offset;havoc ~__cil_tmp11~0;havoc ~__cil_tmp12~0;havoc ~__cil_tmp13~0;havoc ~__cil_tmp14~0;havoc ~__cil_tmp15~0.base, ~__cil_tmp15~0.offset;havoc ~__cil_tmp16~0;havoc ~__cil_tmp17~0.base, ~__cil_tmp17~0.offset;havoc ~__cil_tmp18~0;havoc ~__cil_tmp19~0;havoc ~__cil_tmp20~0;havoc ~__cil_tmp21~0;havoc ~__cil_tmp22~0;havoc ~__cil_tmp23~0.base, ~__cil_tmp23~0.offset;havoc ~__cil_tmp24~0;havoc ~__cil_tmp25~0;havoc ~__cil_tmp26~0.base, ~__cil_tmp26~0.offset;havoc ~__cil_tmp27~0;havoc ~__cil_tmp28~0;havoc ~__cil_tmp29~0.base, ~__cil_tmp29~0.offset;havoc ~__cil_tmp30~0;havoc ~__cil_tmp31~0.base, ~__cil_tmp31~0.offset;havoc ~__cil_tmp32~0.base, ~__cil_tmp32~0.offset;havoc ~__cil_tmp33~0.base, ~__cil_tmp33~0.offset;havoc ~__cil_tmp34~0;havoc ~__cil_tmp35~0;havoc ~__cil_tmp36~0.base, ~__cil_tmp36~0.offset;havoc ~__cil_tmp37~0;havoc ~__cil_tmp38~0;havoc ~__cil_tmp39~0;havoc ~__cil_tmp40~0.base, ~__cil_tmp40~0.offset;havoc ~__cil_tmp41~0;havoc ~__cil_tmp42~0;havoc ~__cil_tmp43~0;havoc ~__cil_tmp44~0;havoc ~__cil_tmp45~0.base, ~__cil_tmp45~0.offset;havoc ~__cil_tmp46~0;havoc ~__cil_tmp47~0;havoc ~__cil_tmp48~0;havoc ~__cil_tmp49~0;havoc ~__cil_tmp50~0.base, ~__cil_tmp50~0.offset;havoc ~__cil_tmp51~0;havoc ~__cil_tmp52~0;havoc ~__cil_tmp53~0;havoc ~__cil_tmp54~0;havoc ~__cil_tmp55~0.base, ~__cil_tmp55~0.offset;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0.base, ~__cil_tmp59~0.offset;havoc ~__cil_tmp60~0;havoc ~__cil_tmp61~0;havoc ~__cil_tmp62~0;havoc ~__cil_tmp63~0;havoc ~__cil_tmp64~0.base, ~__cil_tmp64~0.offset;havoc ~__cil_tmp65~0;havoc ~__cil_tmp66~0;havoc ~__cil_tmp67~0;havoc ~__cil_tmp68~0;havoc ~__cil_tmp69~0.base, ~__cil_tmp69~0.offset;havoc ~__cil_tmp70~0;havoc ~__cil_tmp71~0;havoc ~__cil_tmp72~0.base, ~__cil_tmp72~0.offset;havoc ~__cil_tmp73~0;havoc ~__cil_tmp74~0;havoc ~__cil_tmp75~0;havoc ~__cil_tmp76~0;havoc ~__cil_tmp77~0;havoc ~__cil_tmp78~0.base, ~__cil_tmp78~0.offset;havoc ~__cil_tmp79~0.base, ~__cil_tmp79~0.offset;havoc ~__cil_tmp80~0;havoc ~__cil_tmp81~0;havoc ~__cil_tmp82~0;havoc ~__cil_tmp83~0.base, ~__cil_tmp83~0.offset;havoc ~__cil_tmp84~0.base, ~__cil_tmp84~0.offset;havoc ~__cil_tmp85~0;havoc ~__cil_tmp86~0;havoc ~__cil_tmp87~0;havoc ~__cil_tmp88~0;havoc ~__cil_tmp89~0;havoc ~__cil_tmp90~0.base, ~__cil_tmp90~0.offset;havoc ~__cil_tmp91~0;havoc ~__cil_tmp92~0;havoc ~__cil_tmp93~0.base, ~__cil_tmp93~0.offset;havoc ~__cil_tmp94~0;havoc ~__cil_tmp95~0;havoc ~__cil_tmp96~0;havoc ~__cil_tmp97~0;havoc ~__cil_tmp98~0;havoc ~__cil_tmp99~0;havoc ~__cil_tmp100~0.base, ~__cil_tmp100~0.offset;havoc ~__cil_tmp101~0.base, ~__cil_tmp101~0.offset;havoc ~__cil_tmp102~0;havoc ~__cil_tmp103~0;havoc ~__cil_tmp104~0;havoc ~__cil_tmp105~0.base, ~__cil_tmp105~0.offset;havoc ~__cil_tmp106~0;havoc ~__cil_tmp107~0;havoc ~__cil_tmp108~0;havoc ~__cil_tmp109~0.base, ~__cil_tmp109~0.offset;havoc ~__cil_tmp110~0;havoc ~__cil_tmp111~0.base, ~__cil_tmp111~0.offset;havoc ~__cil_tmp112~0;havoc ~__cil_tmp113~0.base, ~__cil_tmp113~0.offset;havoc ~__cil_tmp114~0;havoc ~__cil_tmp115~0;havoc ~__cil_tmp116~0.base, ~__cil_tmp116~0.offset;havoc ~__cil_tmp117~0;havoc ~__cil_tmp118~0.base, ~__cil_tmp118~0.offset;havoc ~__cil_tmp119~0.base, ~__cil_tmp119~0.offset;havoc ~__cil_tmp120~0.base, ~__cil_tmp120~0.offset;havoc ~__cil_tmp121~0;havoc ~__cil_tmp122~0; {1251#(not (= 0 inspect_~head.base))} is VALID [2020-07-17 22:50:16,193 INFO L280 TraceCheckUtils]: 33: Hoare triple {1251#(not (= 0 inspect_~head.base))} assume !false; {1251#(not (= 0 inspect_~head.base))} is VALID [2020-07-17 22:50:16,196 INFO L280 TraceCheckUtils]: 34: Hoare triple {1251#(not (= 0 inspect_~head.base))} assume ~head.base == 0 && ~head.offset == 0; {1221#false} is VALID [2020-07-17 22:50:16,197 INFO L263 TraceCheckUtils]: 35: Hoare triple {1221#false} call fail(); {1221#false} is VALID [2020-07-17 22:50:16,197 INFO L280 TraceCheckUtils]: 36: Hoare triple {1221#false} assume !false; {1221#false} is VALID [2020-07-17 22:50:16,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:16,203 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210952910] [2020-07-17 22:50:16,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:50:16,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-17 22:50:16,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670721143] [2020-07-17 22:50:16,208 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2020-07-17 22:50:16,210 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:16,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-17 22:50:16,259 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:16,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-17 22:50:16,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:16,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-17 22:50:16,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-17 22:50:16,260 INFO L87 Difference]: Start difference. First operand 143 states and 166 transitions. Second operand 9 states. [2020-07-17 22:50:21,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:21,175 INFO L93 Difference]: Finished difference Result 241 states and 289 transitions. [2020-07-17 22:50:21,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-17 22:50:21,175 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2020-07-17 22:50:21,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:21,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-17 22:50:21,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 289 transitions. [2020-07-17 22:50:21,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-17 22:50:21,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 289 transitions. [2020-07-17 22:50:21,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 289 transitions. [2020-07-17 22:50:21,788 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 289 edges. 289 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:21,798 INFO L225 Difference]: With dead ends: 241 [2020-07-17 22:50:21,798 INFO L226 Difference]: Without dead ends: 236 [2020-07-17 22:50:21,799 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2020-07-17 22:50:21,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2020-07-17 22:50:22,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 199. [2020-07-17 22:50:22,308 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:22,309 INFO L82 GeneralOperation]: Start isEquivalent. First operand 236 states. Second operand 199 states. [2020-07-17 22:50:22,309 INFO L74 IsIncluded]: Start isIncluded. First operand 236 states. Second operand 199 states. [2020-07-17 22:50:22,309 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 199 states. [2020-07-17 22:50:22,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:22,325 INFO L93 Difference]: Finished difference Result 236 states and 284 transitions. [2020-07-17 22:50:22,325 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 284 transitions. [2020-07-17 22:50:22,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:22,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:22,327 INFO L74 IsIncluded]: Start isIncluded. First operand 199 states. Second operand 236 states. [2020-07-17 22:50:22,329 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 236 states. [2020-07-17 22:50:22,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:22,342 INFO L93 Difference]: Finished difference Result 236 states and 284 transitions. [2020-07-17 22:50:22,343 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 284 transitions. [2020-07-17 22:50:22,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:22,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:22,345 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:22,345 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:22,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2020-07-17 22:50:22,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 238 transitions. [2020-07-17 22:50:22,355 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 238 transitions. Word has length 37 [2020-07-17 22:50:22,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:22,356 INFO L479 AbstractCegarLoop]: Abstraction has 199 states and 238 transitions. [2020-07-17 22:50:22,356 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-17 22:50:22,356 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 238 transitions. [2020-07-17 22:50:22,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-17 22:50:22,357 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:22,357 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:22,357 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:50:22,358 INFO L427 AbstractCegarLoop]: === Iteration 3 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:22,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:22,358 INFO L82 PathProgramCache]: Analyzing trace with hash -755462125, now seen corresponding path program 1 times [2020-07-17 22:50:22,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:22,359 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172617858] [2020-07-17 22:50:22,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:22,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:50:23,044 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 22:50:23,045 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.TableauxRow.(TableauxRow.java:45) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.generateLinVar(LinArSolve.java:275) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.createEquality(LinArSolve.java:1974) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createLAEquality(EqualityProxy.java:83) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createAtom(EqualityProxy.java:165) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.getLiteral(EqualityProxy.java:186) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createCCEquality(EqualityProxy.java:109) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.mbtc(LinArSolve.java:1891) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.computeConflictClause(LinArSolve.java:664) at de.uni_freiburg.informatik.ultimate.smtinterpol.dpll.DPLLEngine.checkConsistency(DPLLEngine.java:1010) at de.uni_freiburg.informatik.ultimate.smtinterpol.dpll.DPLLEngine.solve(DPLLEngine.java:1157) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol$CheckType$1.check(SMTInterpol.java:117) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.checkSatAssuming(SMTInterpol.java:494) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.checkSat(SMTInterpol.java:446) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAsserter.buildAnnotatedSsaAndAssertTerms(AnnotateAndAsserter.java:130) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.checkTrace(TraceCheck.java:300) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:214) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:96) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-17 22:50:23,054 INFO L168 Benchmark]: Toolchain (without parser) took 13599.61 ms. Allocated memory was 147.3 MB in the beginning and 382.7 MB in the end (delta: 235.4 MB). Free memory was 104.3 MB in the beginning and 255.5 MB in the end (delta: -151.2 MB). Peak memory consumption was 84.2 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:23,056 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 147.3 MB. Free memory was 123.6 MB in the beginning and 123.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-17 22:50:23,056 INFO L168 Benchmark]: CACSL2BoogieTranslator took 729.78 ms. Allocated memory was 147.3 MB in the beginning and 207.1 MB in the end (delta: 59.8 MB). Free memory was 103.8 MB in the beginning and 176.7 MB in the end (delta: -72.8 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:23,057 INFO L168 Benchmark]: Boogie Preprocessor took 156.41 ms. Allocated memory is still 207.1 MB. Free memory was 176.7 MB in the beginning and 171.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:23,059 INFO L168 Benchmark]: RCFGBuilder took 1208.48 ms. Allocated memory was 207.1 MB in the beginning and 232.8 MB in the end (delta: 25.7 MB). Free memory was 170.6 MB in the beginning and 164.6 MB in the end (delta: 5.9 MB). Peak memory consumption was 79.7 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:23,064 INFO L168 Benchmark]: TraceAbstraction took 11498.79 ms. Allocated memory was 232.8 MB in the beginning and 382.7 MB in the end (delta: 149.9 MB). Free memory was 164.6 MB in the beginning and 255.5 MB in the end (delta: -90.9 MB). Peak memory consumption was 59.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:23,072 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 147.3 MB. Free memory was 123.6 MB in the beginning and 123.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 729.78 ms. Allocated memory was 147.3 MB in the beginning and 207.1 MB in the end (delta: 59.8 MB). Free memory was 103.8 MB in the beginning and 176.7 MB in the end (delta: -72.8 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 156.41 ms. Allocated memory is still 207.1 MB. Free memory was 176.7 MB in the beginning and 171.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1208.48 ms. Allocated memory was 207.1 MB in the beginning and 232.8 MB in the end (delta: 25.7 MB). Free memory was 170.6 MB in the beginning and 164.6 MB in the end (delta: 5.9 MB). Peak memory consumption was 79.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11498.79 ms. Allocated memory was 232.8 MB in the beginning and 382.7 MB in the end (delta: 149.9 MB). Free memory was 164.6 MB in the beginning and 255.5 MB in the end (delta: -90.9 MB). Peak memory consumption was 59.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.TableauxRow.(TableauxRow.java:45) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...