./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0c9d47e5-18fd-4fbd-8a3c-2e9bbe9616c1/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0c9d47e5-18fd-4fbd-8a3c-2e9bbe9616c1/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0c9d47e5-18fd-4fbd-8a3c-2e9bbe9616c1/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0c9d47e5-18fd-4fbd-8a3c-2e9bbe9616c1/bin-2019/ukojak/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0c9d47e5-18fd-4fbd-8a3c-2e9bbe9616c1/bin-2019/ukojak/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0c9d47e5-18fd-4fbd-8a3c-2e9bbe9616c1/bin-2019/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0c9d47e5-18fd-4fbd-8a3c-2e9bbe9616c1/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0c9d47e5-18fd-4fbd-8a3c-2e9bbe9616c1/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0c9d47e5-18fd-4fbd-8a3c-2e9bbe9616c1/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0c9d47e5-18fd-4fbd-8a3c-2e9bbe9616c1/bin-2019/ukojak/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0c9d47e5-18fd-4fbd-8a3c-2e9bbe9616c1/bin-2019/ukojak/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0c9d47e5-18fd-4fbd-8a3c-2e9bbe9616c1/bin-2019/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 ................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalArgumentException: Indexed Sort BitVec undefined --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 01:45:24,573 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 01:45:24,575 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 01:45:24,581 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 01:45:24,581 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 01:45:24,582 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 01:45:24,583 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 01:45:24,584 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 01:45:24,585 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 01:45:24,586 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 01:45:24,586 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 01:45:24,586 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 01:45:24,587 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 01:45:24,588 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 01:45:24,588 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 01:45:24,589 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 01:45:24,589 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 01:45:24,590 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 01:45:24,591 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 01:45:24,592 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 01:45:24,593 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 01:45:24,594 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 01:45:24,595 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 01:45:24,596 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 01:45:24,596 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 01:45:24,596 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 01:45:24,597 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 01:45:24,598 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 01:45:24,598 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 01:45:24,599 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 01:45:24,599 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 01:45:24,600 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 01:45:24,600 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 01:45:24,600 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 01:45:24,600 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 01:45:24,601 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 01:45:24,601 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0c9d47e5-18fd-4fbd-8a3c-2e9bbe9616c1/bin-2019/ukojak/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf [2018-11-23 01:45:24,608 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 01:45:24,608 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 01:45:24,609 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 01:45:24,609 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 01:45:24,609 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 01:45:24,609 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 01:45:24,609 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 01:45:24,610 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 01:45:24,610 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 01:45:24,610 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 01:45:24,610 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-23 01:45:24,610 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-23 01:45:24,610 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-23 01:45:24,610 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 01:45:24,610 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 01:45:24,611 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 01:45:24,611 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 01:45:24,611 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 01:45:24,611 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 01:45:24,611 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 01:45:24,611 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 01:45:24,612 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 01:45:24,612 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 01:45:24,612 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 01:45:24,612 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 01:45:24,612 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_0c9d47e5-18fd-4fbd-8a3c-2e9bbe9616c1/bin-2019/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 [2018-11-23 01:45:24,635 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 01:45:24,645 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 01:45:24,648 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 01:45:24,649 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 01:45:24,649 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 01:45:24,649 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0c9d47e5-18fd-4fbd-8a3c-2e9bbe9616c1/bin-2019/ukojak/../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-11-23 01:45:24,694 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0c9d47e5-18fd-4fbd-8a3c-2e9bbe9616c1/bin-2019/ukojak/data/79343600e/d87e0c152c8a4b49a1c0b98dadc713b2/FLAGe86a748b8 [2018-11-23 01:45:25,108 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 01:45:25,109 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0c9d47e5-18fd-4fbd-8a3c-2e9bbe9616c1/sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-11-23 01:45:25,115 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0c9d47e5-18fd-4fbd-8a3c-2e9bbe9616c1/bin-2019/ukojak/data/79343600e/d87e0c152c8a4b49a1c0b98dadc713b2/FLAGe86a748b8 [2018-11-23 01:45:25,124 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0c9d47e5-18fd-4fbd-8a3c-2e9bbe9616c1/bin-2019/ukojak/data/79343600e/d87e0c152c8a4b49a1c0b98dadc713b2 [2018-11-23 01:45:25,126 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 01:45:25,127 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 01:45:25,128 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 01:45:25,128 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 01:45:25,130 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 01:45:25,130 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:45:25" (1/1) ... [2018-11-23 01:45:25,132 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fe0e01c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:45:25, skipping insertion in model container [2018-11-23 01:45:25,132 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:45:25" (1/1) ... [2018-11-23 01:45:25,138 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 01:45:25,166 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 01:45:25,350 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:45:25,357 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 01:45:25,427 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:45:25,460 INFO L195 MainTranslator]: Completed translation [2018-11-23 01:45:25,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:45:25 WrapperNode [2018-11-23 01:45:25,460 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 01:45:25,461 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 01:45:25,461 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 01:45:25,461 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 01:45:25,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:45:25" (1/1) ... [2018-11-23 01:45:25,481 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:45:25" (1/1) ... [2018-11-23 01:45:25,501 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 01:45:25,501 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 01:45:25,501 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 01:45:25,501 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 01:45:25,508 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:45:25" (1/1) ... [2018-11-23 01:45:25,508 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:45:25" (1/1) ... [2018-11-23 01:45:25,510 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:45:25" (1/1) ... [2018-11-23 01:45:25,510 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:45:25" (1/1) ... [2018-11-23 01:45:25,515 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:45:25" (1/1) ... [2018-11-23 01:45:25,520 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:45:25" (1/1) ... [2018-11-23 01:45:25,522 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:45:25" (1/1) ... [2018-11-23 01:45:25,524 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 01:45:25,524 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 01:45:25,524 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 01:45:25,525 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 01:45:25,525 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:45:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c9d47e5-18fd-4fbd-8a3c-2e9bbe9616c1/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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:10000 [2018-11-23 01:45:25,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 01:45:25,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 01:45:25,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 01:45:25,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 01:45:25,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 01:45:25,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 01:45:25,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 01:45:25,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 01:45:26,141 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 01:45:26,141 INFO L280 CfgBuilder]: Removed 21 assue(true) statements. [2018-11-23 01:45:26,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:45:26 BoogieIcfgContainer [2018-11-23 01:45:26,142 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 01:45:26,142 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 01:45:26,142 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 01:45:26,152 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 01:45:26,152 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:45:26" (1/1) ... [2018-11-23 01:45:26,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:45:26,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:26,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 124 states and 144 transitions. [2018-11-23 01:45:26,186 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 144 transitions. [2018-11-23 01:45:26,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-11-23 01:45:26,188 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:26,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:26,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:26,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:26,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 123 states and 143 transitions. [2018-11-23 01:45:26,319 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 143 transitions. [2018-11-23 01:45:26,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-11-23 01:45:26,319 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:26,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:26,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:26,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:26,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 122 states and 142 transitions. [2018-11-23 01:45:26,440 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 142 transitions. [2018-11-23 01:45:26,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-11-23 01:45:26,441 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:26,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:26,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:26,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:26,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 121 states and 141 transitions. [2018-11-23 01:45:26,469 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 141 transitions. [2018-11-23 01:45:26,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-11-23 01:45:26,469 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:26,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:26,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:26,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:26,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 120 states and 140 transitions. [2018-11-23 01:45:26,516 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 140 transitions. [2018-11-23 01:45:26,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-11-23 01:45:26,516 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:26,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:26,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:26,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:26,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 119 states and 139 transitions. [2018-11-23 01:45:26,553 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 139 transitions. [2018-11-23 01:45:26,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-11-23 01:45:26,553 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:26,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:26,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:26,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:26,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 118 states and 138 transitions. [2018-11-23 01:45:26,581 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 138 transitions. [2018-11-23 01:45:26,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-11-23 01:45:26,581 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:26,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:26,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:26,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:26,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 117 states and 137 transitions. [2018-11-23 01:45:26,642 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 137 transitions. [2018-11-23 01:45:26,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-11-23 01:45:26,642 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:26,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:26,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:26,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:26,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 116 states and 136 transitions. [2018-11-23 01:45:26,736 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 136 transitions. [2018-11-23 01:45:26,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-11-23 01:45:26,736 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:26,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:26,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:26,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:26,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 115 states and 135 transitions. [2018-11-23 01:45:26,772 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 135 transitions. [2018-11-23 01:45:26,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-11-23 01:45:26,772 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:26,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:26,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:26,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:26,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 114 states and 134 transitions. [2018-11-23 01:45:26,807 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 134 transitions. [2018-11-23 01:45:26,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 01:45:26,807 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:26,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:26,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:26,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:26,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 113 states and 133 transitions. [2018-11-23 01:45:26,857 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 133 transitions. [2018-11-23 01:45:26,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 01:45:26,858 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:26,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:26,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:26,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:26,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 112 states and 132 transitions. [2018-11-23 01:45:26,897 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 132 transitions. [2018-11-23 01:45:26,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 01:45:26,900 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:26,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:26,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:26,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:26,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 115 states and 136 transitions. [2018-11-23 01:45:26,998 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 136 transitions. [2018-11-23 01:45:26,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 01:45:26,999 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:27,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:27,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:27,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:27,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 118 states and 142 transitions. [2018-11-23 01:45:27,186 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 142 transitions. [2018-11-23 01:45:27,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 01:45:27,186 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:27,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:27,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:27,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:27,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 117 states and 141 transitions. [2018-11-23 01:45:27,222 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 141 transitions. [2018-11-23 01:45:27,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 01:45:27,223 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:27,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:27,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:27,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 116 states and 140 transitions. [2018-11-23 01:45:27,479 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 140 transitions. [2018-11-23 01:45:27,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 01:45:27,480 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:27,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:27,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:27,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:27,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 118 states and 143 transitions. [2018-11-23 01:45:27,830 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 143 transitions. [2018-11-23 01:45:27,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 01:45:27,831 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:27,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:27,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:28,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:28,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 120 states and 146 transitions. [2018-11-23 01:45:28,489 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2018-11-23 01:45:28,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 01:45:28,489 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:28,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:28,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:28,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:28,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 120 states and 142 transitions. [2018-11-23 01:45:28,502 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 142 transitions. [2018-11-23 01:45:28,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 01:45:28,504 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:28,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:28,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:28,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:28,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 121 states and 144 transitions. [2018-11-23 01:45:28,676 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 144 transitions. [2018-11-23 01:45:28,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 01:45:28,677 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:28,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:28,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:28,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:28,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 122 states and 145 transitions. [2018-11-23 01:45:28,871 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 145 transitions. [2018-11-23 01:45:28,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 01:45:28,871 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:28,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:28,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:29,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:29,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 128 states and 155 transitions. [2018-11-23 01:45:29,024 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 155 transitions. [2018-11-23 01:45:29,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 01:45:29,024 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:29,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:29,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:29,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 134 states and 165 transitions. [2018-11-23 01:45:29,238 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 165 transitions. [2018-11-23 01:45:29,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 01:45:29,238 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:29,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:29,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:30,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:30,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 139 states and 173 transitions. [2018-11-23 01:45:30,142 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 173 transitions. [2018-11-23 01:45:30,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 01:45:30,142 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:30,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:30,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:30,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:30,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 141 states and 177 transitions. [2018-11-23 01:45:30,845 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 177 transitions. [2018-11-23 01:45:30,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 01:45:30,846 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:30,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:30,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:30,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:30,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 140 states and 176 transitions. [2018-11-23 01:45:30,878 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 176 transitions. [2018-11-23 01:45:30,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 01:45:30,878 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:30,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:30,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:30,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:30,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 142 states and 179 transitions. [2018-11-23 01:45:30,978 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 179 transitions. [2018-11-23 01:45:30,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 01:45:30,978 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:30,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:30,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:30,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:30,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 141 states and 178 transitions. [2018-11-23 01:45:30,998 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 178 transitions. [2018-11-23 01:45:30,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 01:45:30,999 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:31,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:31,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:31,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 142 states and 179 transitions. [2018-11-23 01:45:31,070 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 179 transitions. [2018-11-23 01:45:31,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 01:45:31,071 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:31,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:31,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:31,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 144 states and 183 transitions. [2018-11-23 01:45:31,114 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 183 transitions. [2018-11-23 01:45:31,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 01:45:31,115 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:31,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:31,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:31,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 146 states and 186 transitions. [2018-11-23 01:45:31,452 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 186 transitions. [2018-11-23 01:45:31,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 01:45:31,452 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:31,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:31,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:31,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:31,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 145 states and 183 transitions. [2018-11-23 01:45:31,471 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 183 transitions. [2018-11-23 01:45:31,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 01:45:31,471 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:31,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:31,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:31,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:31,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 144 states and 182 transitions. [2018-11-23 01:45:31,629 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 182 transitions. [2018-11-23 01:45:31,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 01:45:31,630 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:31,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:31,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:31,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:31,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 143 states and 181 transitions. [2018-11-23 01:45:31,661 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 181 transitions. [2018-11-23 01:45:31,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 01:45:31,662 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:31,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:32,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:32,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:32,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 144 states and 182 transitions. [2018-11-23 01:45:32,303 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 182 transitions. [2018-11-23 01:45:32,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 01:45:32,304 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:32,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:32,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:33,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:33,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 152 states and 197 transitions. [2018-11-23 01:45:33,670 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 197 transitions. [2018-11-23 01:45:33,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 01:45:33,670 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:33,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:33,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:33,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:33,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 151 states and 196 transitions. [2018-11-23 01:45:33,697 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 196 transitions. [2018-11-23 01:45:33,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 01:45:33,697 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:33,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:33,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:33,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:33,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 150 states and 195 transitions. [2018-11-23 01:45:33,764 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 195 transitions. [2018-11-23 01:45:33,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 01:45:33,765 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:33,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:33,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:33,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:33,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 151 states and 196 transitions. [2018-11-23 01:45:33,806 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 196 transitions. [2018-11-23 01:45:33,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 01:45:33,806 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:33,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:34,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:34,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 156 states and 210 transitions. [2018-11-23 01:45:34,505 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 210 transitions. [2018-11-23 01:45:34,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 01:45:34,506 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:34,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:34,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:35,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:35,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 159 states and 216 transitions. [2018-11-23 01:45:35,449 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 216 transitions. [2018-11-23 01:45:35,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 01:45:35,450 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:35,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:35,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:35,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:35,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 158 states and 213 transitions. [2018-11-23 01:45:35,474 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 213 transitions. [2018-11-23 01:45:35,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 01:45:35,474 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:35,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:35,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:35,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:35,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 161 states and 217 transitions. [2018-11-23 01:45:35,743 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 217 transitions. [2018-11-23 01:45:35,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 01:45:35,743 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:35,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:35,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:36,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:36,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 163 states and 220 transitions. [2018-11-23 01:45:36,251 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 220 transitions. [2018-11-23 01:45:36,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 01:45:36,251 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:36,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:36,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:37,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:37,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 165 states and 223 transitions. [2018-11-23 01:45:37,041 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 223 transitions. [2018-11-23 01:45:37,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 01:45:37,041 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:37,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:37,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:37,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:37,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 166 states and 225 transitions. [2018-11-23 01:45:37,291 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 225 transitions. [2018-11-23 01:45:37,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 01:45:37,291 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:37,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:37,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:37,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:37,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 167 states and 226 transitions. [2018-11-23 01:45:37,710 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 226 transitions. [2018-11-23 01:45:37,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 01:45:37,711 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:37,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:38,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:41,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:41,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 179 states and 251 transitions. [2018-11-23 01:45:41,358 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 251 transitions. [2018-11-23 01:45:41,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 01:45:41,358 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:41,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:41,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:41,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:41,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 180 states and 252 transitions. [2018-11-23 01:45:41,765 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 252 transitions. [2018-11-23 01:45:41,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 01:45:41,765 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:41,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:42,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:43,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:43,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 184 states and 259 transitions. [2018-11-23 01:45:43,138 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 259 transitions. [2018-11-23 01:45:43,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 01:45:43,139 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:43,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:43,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:44,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:44,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 186 states and 263 transitions. [2018-11-23 01:45:44,279 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 263 transitions. [2018-11-23 01:45:44,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 01:45:44,279 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:44,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 01:45:46,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:46,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 196 states and 293 transitions. [2018-11-23 01:45:46,964 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 293 transitions. [2018-11-23 01:45:46,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 01:45:46,965 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:46,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:47,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 01:45:50,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:50,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 206 states and 320 transitions. [2018-11-23 01:45:50,666 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 320 transitions. [2018-11-23 01:45:50,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 01:45:50,666 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:50,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:50,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 01:45:50,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:50,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 207 states and 321 transitions. [2018-11-23 01:45:50,944 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 321 transitions. [2018-11-23 01:45:50,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 01:45:50,944 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:50,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:50,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 01:45:51,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:51,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 208 states and 327 transitions. [2018-11-23 01:45:51,390 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 327 transitions. [2018-11-23 01:45:51,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 01:45:51,390 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:51,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:51,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:55,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:55,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 217 states and 349 transitions. [2018-11-23 01:45:55,959 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 349 transitions. [2018-11-23 01:45:55,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 01:45:55,959 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:55,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:55,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 01:45:56,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:56,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 218 states and 350 transitions. [2018-11-23 01:45:56,289 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 350 transitions. [2018-11-23 01:45:56,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 01:45:56,289 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:56,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:56,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:56,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:56,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 219 states and 356 transitions. [2018-11-23 01:45:56,884 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 356 transitions. [2018-11-23 01:45:56,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 01:45:56,884 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:56,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:56,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 01:45:57,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:57,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 220 states and 357 transitions. [2018-11-23 01:45:57,335 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 357 transitions. [2018-11-23 01:45:57,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 01:45:57,335 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:57,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:57,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:57,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 219 states and 356 transitions. [2018-11-23 01:45:57,382 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 356 transitions. [2018-11-23 01:45:57,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 01:45:57,382 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:57,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:57,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:57,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:57,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 220 states and 357 transitions. [2018-11-23 01:45:57,714 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 357 transitions. [2018-11-23 01:45:57,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 01:45:57,714 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:57,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:57,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 01:45:57,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:57,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 219 states and 356 transitions. [2018-11-23 01:45:57,729 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 356 transitions. [2018-11-23 01:45:57,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 01:45:57,729 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:57,909 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:58,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:58,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 220 states and 358 transitions. [2018-11-23 01:45:58,420 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 358 transitions. [2018-11-23 01:45:58,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 01:45:58,420 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:58,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:58,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 01:45:58,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:58,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 219 states and 357 transitions. [2018-11-23 01:45:58,439 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 357 transitions. [2018-11-23 01:45:58,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 01:45:58,440 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:58,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:58,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 01:45:59,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:59,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 221 states and 360 transitions. [2018-11-23 01:45:59,235 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 360 transitions. [2018-11-23 01:45:59,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 01:45:59,235 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:59,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:59,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 01:45:59,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:59,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 220 states and 359 transitions. [2018-11-23 01:45:59,261 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 359 transitions. [2018-11-23 01:45:59,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 01:45:59,262 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:59,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:59,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 01:45:59,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:59,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 221 states and 359 transitions. [2018-11-23 01:45:59,317 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 359 transitions. [2018-11-23 01:45:59,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 01:45:59,317 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:59,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:59,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 01:45:59,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:59,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 224 states and 362 transitions. [2018-11-23 01:45:59,795 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 362 transitions. [2018-11-23 01:45:59,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 01:45:59,795 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:59,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:59,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 01:45:59,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:59,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 226 states and 363 transitions. [2018-11-23 01:45:59,840 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 363 transitions. [2018-11-23 01:45:59,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 01:45:59,840 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:59,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:45:59,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:45:59,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:45:59,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 221 states and 349 transitions. [2018-11-23 01:45:59,863 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 349 transitions. [2018-11-23 01:45:59,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 01:45:59,864 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:45:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:46:00,347 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:46:01,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:46:01,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 218 states and 343 transitions. [2018-11-23 01:46:01,392 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 343 transitions. [2018-11-23 01:46:01,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 01:46:01,392 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:46:01,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:46:01,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 01:46:01,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:46:01,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 217 states and 342 transitions. [2018-11-23 01:46:01,783 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 342 transitions. [2018-11-23 01:46:01,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 01:46:01,784 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:46:01,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:46:01,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 01:46:01,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:46:01,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 216 states and 341 transitions. [2018-11-23 01:46:01,807 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 341 transitions. [2018-11-23 01:46:01,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 01:46:01,807 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:46:01,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:46:02,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:46:09,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:46:09,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 229 states and 370 transitions. [2018-11-23 01:46:09,601 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 370 transitions. [2018-11-23 01:46:09,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 01:46:09,602 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:46:09,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:46:09,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:46:10,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:46:10,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 230 states and 371 transitions. [2018-11-23 01:46:10,020 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 371 transitions. [2018-11-23 01:46:10,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 01:46:10,020 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:46:10,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:46:10,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:46:10,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:46:10,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 231 states and 372 transitions. [2018-11-23 01:46:10,569 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 372 transitions. [2018-11-23 01:46:10,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 01:46:10,570 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:46:10,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:46:10,581 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 01:46:11,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:46:11,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 228 states and 368 transitions. [2018-11-23 01:46:11,112 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 368 transitions. [2018-11-23 01:46:11,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 01:46:11,112 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:46:11,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:46:11,124 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 01:46:11,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:46:11,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 184 states and 310 transitions. [2018-11-23 01:46:11,857 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 310 transitions. [2018-11-23 01:46:11,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 01:46:11,858 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:46:11,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:46:12,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:46:21,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:46:21,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 195 states and 340 transitions. [2018-11-23 01:46:21,372 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 340 transitions. [2018-11-23 01:46:21,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 01:46:21,373 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:46:21,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:46:21,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:46:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:46:21,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:46:21,482 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 80 iterations. ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];main_old_#valid := #valid;havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~nondet2, main_#t~mem12, main_#t~mem13, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_~null~0.base, main_~null~0.offset, main_~list~0.base, main_~list~0.offset, main_~end~0.base, main_~end~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(12);main_~null~0.base, main_~null~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; VAL [ULTIMATE.start_main_~null~0.base=3, ULTIMATE.start_main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0] [?] SUMMARY for call write~$Pointer$(0, 0, main_~null~0.base, main_~null~0.offset, 4); srcloc: L988 VAL [ULTIMATE.start_main_~null~0.base=3, ULTIMATE.start_main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0] [?] SUMMARY for call write~$Pointer$(0, 0, main_~null~0.base, 4 + main_~null~0.offset, 4); srcloc: L988-1 VAL [ULTIMATE.start_main_~null~0.base=3, ULTIMATE.start_main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0] [?] call write~int(~unnamed1~0~BLACK, main_~null~0.base, 8 + main_~null~0.offset, 4);call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.alloc(12);main_~list~0.base, main_~list~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset; VAL [ULTIMATE.start_main_~list~0.base=11, ULTIMATE.start_main_~list~0.offset=0, ULTIMATE.start_main_~null~0.base=3, ULTIMATE.start_main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc1.base|=11, |ULTIMATE.start_main_#t~malloc1.offset|=0] [?] SUMMARY for call write~$Pointer$(main_~null~0.base, main_~null~0.offset, main_~list~0.base, main_~list~0.offset, 4); srcloc: L993 VAL [ULTIMATE.start_main_~list~0.base=11, ULTIMATE.start_main_~list~0.offset=0, ULTIMATE.start_main_~null~0.base=3, ULTIMATE.start_main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc1.base|=11, |ULTIMATE.start_main_#t~malloc1.offset|=0] [?] SUMMARY for call write~$Pointer$(main_~null~0.base, main_~null~0.offset, main_~list~0.base, 4 + main_~list~0.offset, 4); srcloc: L993-1 VAL [ULTIMATE.start_main_~list~0.base=11, ULTIMATE.start_main_~list~0.offset=0, ULTIMATE.start_main_~null~0.base=3, ULTIMATE.start_main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc1.base|=11, |ULTIMATE.start_main_#t~malloc1.offset|=0] [?] call write~int(~unnamed1~0~BLACK, main_~list~0.base, 8 + main_~list~0.offset, 4);main_~end~0.base, main_~end~0.offset := main_~list~0.base, main_~list~0.offset; VAL [ULTIMATE.start_main_~end~0.base=11, ULTIMATE.start_main_~end~0.offset=0, ULTIMATE.start_main_~list~0.base=11, ULTIMATE.start_main_~list~0.offset=0, ULTIMATE.start_main_~null~0.base=3, ULTIMATE.start_main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc1.base|=11, |ULTIMATE.start_main_#t~malloc1.offset|=0] [?] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; VAL [ULTIMATE.start_main_~end~0.base=11, ULTIMATE.start_main_~end~0.offset=0, ULTIMATE.start_main_~list~0.base=11, ULTIMATE.start_main_~list~0.offset=0, ULTIMATE.start_main_~null~0.base=3, ULTIMATE.start_main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc1.base|=11, |ULTIMATE.start_main_#t~malloc1.offset|=0, |ULTIMATE.start_main_#t~nondet2|=0] [?] assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; VAL [ULTIMATE.start_main_~end~0.base=11, ULTIMATE.start_main_~end~0.offset=0, ULTIMATE.start_main_~list~0.base=11, ULTIMATE.start_main_~list~0.offset=0, ULTIMATE.start_main_~null~0.base=3, ULTIMATE.start_main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc1.base|=11, |ULTIMATE.start_main_#t~malloc1.offset|=0] [?] main_~end~0.base, main_~end~0.offset := main_~null~0.base, main_~null~0.offset;main_~end~0.base, main_~end~0.offset := main_~list~0.base, main_~list~0.offset; VAL [ULTIMATE.start_main_~end~0.base=11, ULTIMATE.start_main_~end~0.offset=0, ULTIMATE.start_main_~list~0.base=11, ULTIMATE.start_main_~list~0.offset=0, ULTIMATE.start_main_~null~0.base=3, ULTIMATE.start_main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc1.base|=11, |ULTIMATE.start_main_#t~malloc1.offset|=0] [?] BeginParallelComposition{ParallelCodeBlock0: assume !(main_~null~0.base != main_~end~0.base || main_~null~0.offset != main_~end~0.offset);assume false;ParallelCodeBlock1: assume !!(main_~null~0.base != main_~end~0.base || main_~null~0.offset != main_~end~0.offset);}EndParallelComposition VAL [ULTIMATE.start_main_~end~0.base=11, ULTIMATE.start_main_~end~0.offset=0, ULTIMATE.start_main_~list~0.base=11, ULTIMATE.start_main_~list~0.offset=0, ULTIMATE.start_main_~null~0.base=3, ULTIMATE.start_main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc1.base|=11, |ULTIMATE.start_main_#t~malloc1.offset|=0] [?] goto; VAL [ULTIMATE.start_main_~end~0.base=11, ULTIMATE.start_main_~end~0.offset=0, ULTIMATE.start_main_~list~0.base=11, ULTIMATE.start_main_~list~0.offset=0, ULTIMATE.start_main_~null~0.base=3, ULTIMATE.start_main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc1.base|=11, |ULTIMATE.start_main_#t~malloc1.offset|=0] [?] call main_#t~mem12 := read~int(main_~end~0.base, 8 + main_~end~0.offset, 4);BeginParallelComposition{ParallelCodeBlock0: assume !(~unnamed1~0~BLACK == main_#t~mem12);havoc main_#t~mem12;assume false;ParallelCodeBlock1: assume !!(~unnamed1~0~BLACK == main_#t~mem12);havoc main_#t~mem12;}EndParallelComposition VAL [ULTIMATE.start_main_~end~0.base=11, ULTIMATE.start_main_~end~0.offset=0, ULTIMATE.start_main_~list~0.base=11, ULTIMATE.start_main_~list~0.offset=0, ULTIMATE.start_main_~null~0.base=3, ULTIMATE.start_main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc1.base|=11, |ULTIMATE.start_main_#t~malloc1.offset|=0] [?] goto; VAL [ULTIMATE.start_main_~end~0.base=11, ULTIMATE.start_main_~end~0.offset=0, ULTIMATE.start_main_~list~0.base=11, ULTIMATE.start_main_~list~0.offset=0, ULTIMATE.start_main_~null~0.base=3, ULTIMATE.start_main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc1.base|=11, |ULTIMATE.start_main_#t~malloc1.offset|=0] [?] assume !!(main_~null~0.base != main_~end~0.base || main_~null~0.offset != main_~end~0.offset); VAL [ULTIMATE.start_main_~end~0.base=11, ULTIMATE.start_main_~end~0.offset=0, ULTIMATE.start_main_~list~0.base=11, ULTIMATE.start_main_~list~0.offset=0, ULTIMATE.start_main_~null~0.base=3, ULTIMATE.start_main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc1.base|=11, |ULTIMATE.start_main_#t~malloc1.offset|=0] [?] SUMMARY for call main_#t~mem13 := read~int(main_~end~0.base, 8 + main_~end~0.offset, 4); srcloc: L1034 VAL [ULTIMATE.start_main_~end~0.base=11, ULTIMATE.start_main_~end~0.offset=0, ULTIMATE.start_main_~list~0.base=11, ULTIMATE.start_main_~list~0.offset=0, ULTIMATE.start_main_~null~0.base=3, ULTIMATE.start_main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc1.base|=11, |ULTIMATE.start_main_#t~malloc1.offset|=0, |ULTIMATE.start_main_#t~mem13|=1] [?] assume !(~unnamed1~0~RED == main_#t~mem13);havoc main_#t~mem13; VAL [ULTIMATE.start_main_~end~0.base=11, ULTIMATE.start_main_~end~0.offset=0, ULTIMATE.start_main_~list~0.base=11, ULTIMATE.start_main_~list~0.offset=0, ULTIMATE.start_main_~null~0.base=3, ULTIMATE.start_main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc1.base|=11, |ULTIMATE.start_main_#t~malloc1.offset|=0] [?] call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~end~0.base, main_~end~0.offset, 4);main_~end~0.base, main_~end~0.offset := main_#t~mem16.base, main_#t~mem16.offset;havoc main_#t~mem16.base, main_#t~mem16.offset; VAL [ULTIMATE.start_main_~end~0.base=3, ULTIMATE.start_main_~end~0.offset=0, ULTIMATE.start_main_~list~0.base=11, ULTIMATE.start_main_~list~0.offset=0, ULTIMATE.start_main_~null~0.base=3, ULTIMATE.start_main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc1.base|=11, |ULTIMATE.start_main_#t~malloc1.offset|=0] [?] BeginParallelComposition{ParallelCodeBlock0: assume !true;ParallelCodeBlock1: assume !(main_~null~0.base != main_~end~0.base || main_~null~0.offset != main_~end~0.offset);}EndParallelComposition VAL [ULTIMATE.start_main_~end~0.base=3, ULTIMATE.start_main_~end~0.offset=0, ULTIMATE.start_main_~list~0.base=11, ULTIMATE.start_main_~list~0.offset=0, ULTIMATE.start_main_~null~0.base=3, ULTIMATE.start_main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc1.base|=11, |ULTIMATE.start_main_#t~malloc1.offset|=0] [?] assume !!(main_~null~0.base != main_~list~0.base || main_~null~0.offset != main_~list~0.offset); VAL [ULTIMATE.start_main_~end~0.base=3, ULTIMATE.start_main_~end~0.offset=0, ULTIMATE.start_main_~list~0.base=11, ULTIMATE.start_main_~list~0.offset=0, ULTIMATE.start_main_~null~0.base=3, ULTIMATE.start_main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc1.base|=11, |ULTIMATE.start_main_#t~malloc1.offset|=0] [?] SUMMARY for call main_#t~mem17 := read~int(main_~list~0.base, 8 + main_~list~0.offset, 4); srcloc: L1047 VAL [ULTIMATE.start_main_~end~0.base=3, ULTIMATE.start_main_~end~0.offset=0, ULTIMATE.start_main_~list~0.base=11, ULTIMATE.start_main_~list~0.offset=0, ULTIMATE.start_main_~null~0.base=3, ULTIMATE.start_main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc1.base|=11, |ULTIMATE.start_main_#t~malloc1.offset|=0, |ULTIMATE.start_main_#t~mem17|=1] [?] assume !(~unnamed1~0~RED == main_#t~mem17);havoc main_#t~mem17; VAL [ULTIMATE.start_main_~end~0.base=3, ULTIMATE.start_main_~end~0.offset=0, ULTIMATE.start_main_~list~0.base=11, ULTIMATE.start_main_~list~0.offset=0, ULTIMATE.start_main_~null~0.base=3, ULTIMATE.start_main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc1.base|=11, |ULTIMATE.start_main_#t~malloc1.offset|=0] [?] call main_#t~mem20.base, main_#t~mem20.offset := read~$Pointer$(main_~list~0.base, main_~list~0.offset, 4);main_~end~0.base, main_~end~0.offset := main_#t~mem20.base, main_#t~mem20.offset;havoc main_#t~mem20.base, main_#t~mem20.offset; VAL [ULTIMATE.start_main_~end~0.base=3, ULTIMATE.start_main_~end~0.offset=0, ULTIMATE.start_main_~list~0.base=11, ULTIMATE.start_main_~list~0.offset=0, ULTIMATE.start_main_~null~0.base=3, ULTIMATE.start_main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc1.base|=11, |ULTIMATE.start_main_#t~malloc1.offset|=0] [?] assume 0 == main_~list~0.offset; VAL [ULTIMATE.start_main_~end~0.base=3, ULTIMATE.start_main_~end~0.offset=0, ULTIMATE.start_main_~list~0.base=11, ULTIMATE.start_main_~list~0.offset=0, ULTIMATE.start_main_~null~0.base=3, ULTIMATE.start_main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc1.base|=11, |ULTIMATE.start_main_#t~malloc1.offset|=0] [?] assume 0 == main_~list~0.base || 1 == #valid[main_~list~0.base];call ULTIMATE.dealloc(main_~list~0.base, main_~list~0.offset);main_~list~0.base, main_~list~0.offset := main_~end~0.base, main_~end~0.offset; VAL [ULTIMATE.start_main_~end~0.base=3, ULTIMATE.start_main_~end~0.offset=0, ULTIMATE.start_main_~list~0.base=3, ULTIMATE.start_main_~list~0.offset=0, ULTIMATE.start_main_~null~0.base=3, ULTIMATE.start_main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc1.base|=11, |ULTIMATE.start_main_#t~malloc1.offset|=0] [?] BeginParallelComposition{ParallelCodeBlock0: assume !true;ParallelCodeBlock1: assume !(main_~null~0.base != main_~list~0.base || main_~null~0.offset != main_~list~0.offset);}EndParallelCompositionmain_#res := 0; VAL [ULTIMATE.start_main_~end~0.base=3, ULTIMATE.start_main_~end~0.offset=0, ULTIMATE.start_main_~list~0.base=3, ULTIMATE.start_main_~list~0.offset=0, ULTIMATE.start_main_~null~0.base=3, ULTIMATE.start_main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#res|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc1.base|=11, |ULTIMATE.start_main_#t~malloc1.offset|=0] [?] assume !(#valid == main_old_#valid); VAL [ULTIMATE.start_main_~end~0.base=3, ULTIMATE.start_main_~end~0.offset=0, ULTIMATE.start_main_~list~0.base=3, ULTIMATE.start_main_~list~0.offset=0, ULTIMATE.start_main_~null~0.base=3, ULTIMATE.start_main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#res|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc1.base|=11, |ULTIMATE.start_main_#t~malloc1.offset|=0] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~nondet2, main_#t~mem12, main_#t~mem13, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_~null~0.base, main_~null~0.offset, main_~list~0.base, main_~list~0.offset, main_~end~0.base, main_~end~0.offset; [L987] call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(12); [L987] main_~null~0.base, main_~null~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_~null~0.base=3, main_~null~0.offset=0] [L988] call write~$Pointer$(0, 0, main_~null~0.base, main_~null~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_~null~0.base=3, main_~null~0.offset=0] [L989] call write~$Pointer$(0, 0, main_~null~0.base, 4 + main_~null~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_~null~0.base=3, main_~null~0.offset=0] [L990] call write~int(~unnamed1~0~BLACK, main_~null~0.base, 8 + main_~null~0.offset, 4); [L992] call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.alloc(12); [L992] main_~list~0.base, main_~list~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc1.base=11, main_#t~malloc1.offset=0, main_~list~0.base=11, main_~list~0.offset=0, main_~null~0.base=3, main_~null~0.offset=0] [L993] call write~$Pointer$(main_~null~0.base, main_~null~0.offset, main_~list~0.base, main_~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc1.base=11, main_#t~malloc1.offset=0, main_~list~0.base=11, main_~list~0.offset=0, main_~null~0.base=3, main_~null~0.offset=0] [L994] call write~$Pointer$(main_~null~0.base, main_~null~0.offset, main_~list~0.base, 4 + main_~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc1.base=11, main_#t~malloc1.offset=0, main_~list~0.base=11, main_~list~0.offset=0, main_~null~0.base=3, main_~null~0.offset=0] [L995] call write~int(~unnamed1~0~BLACK, main_~list~0.base, 8 + main_~list~0.offset, 4); [L997] main_~end~0.base, main_~end~0.offset := main_~list~0.base, main_~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc1.base=11, main_#t~malloc1.offset=0, main_~end~0.base=11, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, main_~null~0.base=3, main_~null~0.offset=0] [L1000] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc1.base=11, main_#t~malloc1.offset=0, main_#t~nondet2=0, main_~end~0.base=11, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, main_~null~0.base=3, main_~null~0.offset=0] [L1000-L1024] assume !(0 != main_#t~nondet2); [L1000] havoc main_#t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc1.base=11, main_#t~malloc1.offset=0, main_~end~0.base=11, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, main_~null~0.base=3, main_~null~0.offset=0] [L1026] main_~end~0.base, main_~end~0.offset := main_~null~0.base, main_~null~0.offset; [L1027] main_~end~0.base, main_~end~0.offset := main_~list~0.base, main_~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc1.base=11, main_#t~malloc1.offset=0, main_~end~0.base=11, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, main_~null~0.base=3, main_~null~0.offset=0] [L1030] assume !!(main_~null~0.base != main_~end~0.base || main_~null~0.offset != main_~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc1.base=11, main_#t~malloc1.offset=0, main_~end~0.base=11, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, main_~null~0.base=3, main_~null~0.offset=0] [L1031] call main_#t~mem12 := read~int(main_~end~0.base, 8 + main_~end~0.offset, 4); [L1031] assume !!(~unnamed1~0~BLACK == main_#t~mem12); [L1031] havoc main_#t~mem12; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc1.base=11, main_#t~malloc1.offset=0, main_~end~0.base=11, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, main_~null~0.base=3, main_~null~0.offset=0] [L1032-L1042] assume !!(main_~null~0.base != main_~end~0.base || main_~null~0.offset != main_~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc1.base=11, main_#t~malloc1.offset=0, main_~end~0.base=11, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, main_~null~0.base=3, main_~null~0.offset=0] [L1034] call main_#t~mem13 := read~int(main_~end~0.base, 8 + main_~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc1.base=11, main_#t~malloc1.offset=0, main_#t~mem13=1, main_~end~0.base=11, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, main_~null~0.base=3, main_~null~0.offset=0] [L1034-L1039] assume !(~unnamed1~0~RED == main_#t~mem13); [L1034] havoc main_#t~mem13; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc1.base=11, main_#t~malloc1.offset=0, main_~end~0.base=11, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, main_~null~0.base=3, main_~null~0.offset=0] [L1041] call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~end~0.base, main_~end~0.offset, 4); [L1041] main_~end~0.base, main_~end~0.offset := main_#t~mem16.base, main_#t~mem16.offset; [L1041] havoc main_#t~mem16.base, main_#t~mem16.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc1.base=11, main_#t~malloc1.offset=0, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, main_~null~0.base=3, main_~null~0.offset=0] [L1032-L1042] assume !(main_~null~0.base != main_~end~0.base || main_~null~0.offset != main_~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc1.base=11, main_#t~malloc1.offset=0, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, main_~null~0.base=3, main_~null~0.offset=0] [L1045-L1060] assume !!(main_~null~0.base != main_~list~0.base || main_~null~0.offset != main_~list~0.offset); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc1.base=11, main_#t~malloc1.offset=0, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, main_~null~0.base=3, main_~null~0.offset=0] [L1047] call main_#t~mem17 := read~int(main_~list~0.base, 8 + main_~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc1.base=11, main_#t~malloc1.offset=0, main_#t~mem17=1, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, main_~null~0.base=3, main_~null~0.offset=0] [L1047-L1059] assume !(~unnamed1~0~RED == main_#t~mem17); [L1047] havoc main_#t~mem17; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc1.base=11, main_#t~malloc1.offset=0, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, main_~null~0.base=3, main_~null~0.offset=0] [L1056] call main_#t~mem20.base, main_#t~mem20.offset := read~$Pointer$(main_~list~0.base, main_~list~0.offset, 4); [L1056] main_~end~0.base, main_~end~0.offset := main_#t~mem20.base, main_#t~mem20.offset; [L1056] havoc main_#t~mem20.base, main_#t~mem20.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc1.base=11, main_#t~malloc1.offset=0, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, main_~null~0.base=3, main_~null~0.offset=0] [L1057] assert 0 == main_~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc1.base=11, main_#t~malloc1.offset=0, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, main_~null~0.base=3, main_~null~0.offset=0] [L1057] assert 0 == main_~list~0.base || 1 == #valid[main_~list~0.base]; [L1057] call ULTIMATE.dealloc(main_~list~0.base, main_~list~0.offset); [L1058] main_~list~0.base, main_~list~0.offset := main_~end~0.base, main_~end~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc1.base=11, main_#t~malloc1.offset=0, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=3, main_~list~0.offset=0, main_~null~0.base=3, main_~null~0.offset=0] [L1045-L1060] assume !(main_~null~0.base != main_~list~0.base || main_~null~0.offset != main_~list~0.offset); [L1062] main_#res := 0; VAL [#NULL.base=0, #NULL.offset=0, main_#res=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc1.base=11, main_#t~malloc1.offset=0, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=3, main_~list~0.offset=0, main_~null~0.base=3, main_~null~0.offset=0] [L985-L1063] assert #valid == main_old_#valid; VAL [#NULL.base=0, #NULL.offset=0, main_#res=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc1.base=11, main_#t~malloc1.offset=0, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=3, main_~list~0.offset=0, main_~null~0.base=3, main_~null~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~nondet2, main_#t~mem12, main_#t~mem13, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_~null~0.base, main_~null~0.offset, main_~list~0.base, main_~list~0.offset, main_~end~0.base, main_~end~0.offset; [L987] call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(12); [L987] main_~null~0.base, main_~null~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_~null~0.base=3, main_~null~0.offset=0] [L988] call write~$Pointer$(0, 0, main_~null~0.base, main_~null~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_~null~0.base=3, main_~null~0.offset=0] [L989] call write~$Pointer$(0, 0, main_~null~0.base, 4 + main_~null~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_~null~0.base=3, main_~null~0.offset=0] [L990] call write~int(~unnamed1~0~BLACK, main_~null~0.base, 8 + main_~null~0.offset, 4); [L992] call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.alloc(12); [L992] main_~list~0.base, main_~list~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc1.base=11, main_#t~malloc1.offset=0, main_~list~0.base=11, main_~list~0.offset=0, main_~null~0.base=3, main_~null~0.offset=0] [L993] call write~$Pointer$(main_~null~0.base, main_~null~0.offset, main_~list~0.base, main_~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc1.base=11, main_#t~malloc1.offset=0, main_~list~0.base=11, main_~list~0.offset=0, main_~null~0.base=3, main_~null~0.offset=0] [L994] call write~$Pointer$(main_~null~0.base, main_~null~0.offset, main_~list~0.base, 4 + main_~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc1.base=11, main_#t~malloc1.offset=0, main_~list~0.base=11, main_~list~0.offset=0, main_~null~0.base=3, main_~null~0.offset=0] [L995] call write~int(~unnamed1~0~BLACK, main_~list~0.base, 8 + main_~list~0.offset, 4); [L997] main_~end~0.base, main_~end~0.offset := main_~list~0.base, main_~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc1.base=11, main_#t~malloc1.offset=0, main_~end~0.base=11, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, main_~null~0.base=3, main_~null~0.offset=0] [L1000] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc1.base=11, main_#t~malloc1.offset=0, main_#t~nondet2=0, main_~end~0.base=11, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, main_~null~0.base=3, main_~null~0.offset=0] [L1000-L1024] assume !(0 != main_#t~nondet2); [L1000] havoc main_#t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc1.base=11, main_#t~malloc1.offset=0, main_~end~0.base=11, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, main_~null~0.base=3, main_~null~0.offset=0] [L1026] main_~end~0.base, main_~end~0.offset := main_~null~0.base, main_~null~0.offset; [L1027] main_~end~0.base, main_~end~0.offset := main_~list~0.base, main_~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc1.base=11, main_#t~malloc1.offset=0, main_~end~0.base=11, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, main_~null~0.base=3, main_~null~0.offset=0] [L1030] assume !!(main_~null~0.base != main_~end~0.base || main_~null~0.offset != main_~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc1.base=11, main_#t~malloc1.offset=0, main_~end~0.base=11, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, main_~null~0.base=3, main_~null~0.offset=0] [L1031] call main_#t~mem12 := read~int(main_~end~0.base, 8 + main_~end~0.offset, 4); [L1031] assume !!(~unnamed1~0~BLACK == main_#t~mem12); [L1031] havoc main_#t~mem12; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc1.base=11, main_#t~malloc1.offset=0, main_~end~0.base=11, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, main_~null~0.base=3, main_~null~0.offset=0] [L1032-L1042] assume !!(main_~null~0.base != main_~end~0.base || main_~null~0.offset != main_~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc1.base=11, main_#t~malloc1.offset=0, main_~end~0.base=11, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, main_~null~0.base=3, main_~null~0.offset=0] [L1034] call main_#t~mem13 := read~int(main_~end~0.base, 8 + main_~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc1.base=11, main_#t~malloc1.offset=0, main_#t~mem13=1, main_~end~0.base=11, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, main_~null~0.base=3, main_~null~0.offset=0] [L1034-L1039] assume !(~unnamed1~0~RED == main_#t~mem13); [L1034] havoc main_#t~mem13; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc1.base=11, main_#t~malloc1.offset=0, main_~end~0.base=11, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, main_~null~0.base=3, main_~null~0.offset=0] [L1041] call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~end~0.base, main_~end~0.offset, 4); [L1041] main_~end~0.base, main_~end~0.offset := main_#t~mem16.base, main_#t~mem16.offset; [L1041] havoc main_#t~mem16.base, main_#t~mem16.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc1.base=11, main_#t~malloc1.offset=0, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, main_~null~0.base=3, main_~null~0.offset=0] [L1032-L1042] assume !(main_~null~0.base != main_~end~0.base || main_~null~0.offset != main_~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc1.base=11, main_#t~malloc1.offset=0, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, main_~null~0.base=3, main_~null~0.offset=0] [L1045-L1060] assume !!(main_~null~0.base != main_~list~0.base || main_~null~0.offset != main_~list~0.offset); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc1.base=11, main_#t~malloc1.offset=0, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, main_~null~0.base=3, main_~null~0.offset=0] [L1047] call main_#t~mem17 := read~int(main_~list~0.base, 8 + main_~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc1.base=11, main_#t~malloc1.offset=0, main_#t~mem17=1, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, main_~null~0.base=3, main_~null~0.offset=0] [L1047-L1059] assume !(~unnamed1~0~RED == main_#t~mem17); [L1047] havoc main_#t~mem17; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc1.base=11, main_#t~malloc1.offset=0, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, main_~null~0.base=3, main_~null~0.offset=0] [L1056] call main_#t~mem20.base, main_#t~mem20.offset := read~$Pointer$(main_~list~0.base, main_~list~0.offset, 4); [L1056] main_~end~0.base, main_~end~0.offset := main_#t~mem20.base, main_#t~mem20.offset; [L1056] havoc main_#t~mem20.base, main_#t~mem20.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc1.base=11, main_#t~malloc1.offset=0, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, main_~null~0.base=3, main_~null~0.offset=0] [L1057] assert 0 == main_~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc1.base=11, main_#t~malloc1.offset=0, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=11, main_~list~0.offset=0, main_~null~0.base=3, main_~null~0.offset=0] [L1057] assert 0 == main_~list~0.base || 1 == #valid[main_~list~0.base]; [L1057] call ULTIMATE.dealloc(main_~list~0.base, main_~list~0.offset); [L1058] main_~list~0.base, main_~list~0.offset := main_~end~0.base, main_~end~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc1.base=11, main_#t~malloc1.offset=0, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=3, main_~list~0.offset=0, main_~null~0.base=3, main_~null~0.offset=0] [L1045-L1060] assume !(main_~null~0.base != main_~list~0.base || main_~null~0.offset != main_~list~0.offset); [L1062] main_#res := 0; VAL [#NULL.base=0, #NULL.offset=0, main_#res=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc1.base=11, main_#t~malloc1.offset=0, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=3, main_~list~0.offset=0, main_~null~0.base=3, main_~null~0.offset=0] [L985-L1063] assert #valid == main_old_#valid; VAL [#NULL.base=0, #NULL.offset=0, main_#res=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc1.base=11, main_#t~malloc1.offset=0, main_~end~0.base=3, main_~end~0.offset=0, main_~list~0.base=3, main_~list~0.offset=0, main_~null~0.base=3, main_~null~0.offset=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~malloc0, main_#t~malloc1, main_#t~malloc3, main_#t~mem4, main_#t~mem5, main_#t~nondet6, main_#t~malloc7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~nondet2, main_#t~mem12, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem20, main_~null~0, main_~list~0, main_~end~0; [L987] FCALL call main_#t~malloc0 := #Ultimate.alloc(12); [L987] main_~null~0 := main_#t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_~null~0!base=3, main_~null~0!offset=0] [L988] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~null~0!base, offset: main_~null~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_~null~0!base=3, main_~null~0!offset=0] [L989] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~null~0!base, offset: 4 + main_~null~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_~null~0!base=3, main_~null~0!offset=0] [L990] FCALL call write~int(~unnamed1~0~BLACK, { base: main_~null~0!base, offset: 8 + main_~null~0!offset }, 4); [L992] FCALL call main_#t~malloc1 := #Ultimate.alloc(12); [L992] main_~list~0 := main_#t~malloc1; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc1!base=11, main_#t~malloc1!offset=0, main_~list~0!base=11, main_~list~0!offset=0, main_~null~0!base=3, main_~null~0!offset=0] [L993] FCALL call write~$Pointer$(main_~null~0, { base: main_~list~0!base, offset: main_~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc1!base=11, main_#t~malloc1!offset=0, main_~list~0!base=11, main_~list~0!offset=0, main_~null~0!base=3, main_~null~0!offset=0] [L994] FCALL call write~$Pointer$(main_~null~0, { base: main_~list~0!base, offset: 4 + main_~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc1!base=11, main_#t~malloc1!offset=0, main_~list~0!base=11, main_~list~0!offset=0, main_~null~0!base=3, main_~null~0!offset=0] [L995] FCALL call write~int(~unnamed1~0~BLACK, { base: main_~list~0!base, offset: 8 + main_~list~0!offset }, 4); [L997] main_~end~0 := main_~list~0; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc1!base=11, main_#t~malloc1!offset=0, main_~end~0!base=11, main_~end~0!offset=0, main_~list~0!base=11, main_~list~0!offset=0, main_~null~0!base=3, main_~null~0!offset=0] [L1000] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc1!base=11, main_#t~malloc1!offset=0, main_#t~nondet2=0, main_~end~0!base=11, main_~end~0!offset=0, main_~list~0!base=11, main_~list~0!offset=0, main_~null~0!base=3, main_~null~0!offset=0] [L1000-L1024] COND TRUE !(0 != main_#t~nondet2) [L1000] havoc main_#t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc1!base=11, main_#t~malloc1!offset=0, main_~end~0!base=11, main_~end~0!offset=0, main_~list~0!base=11, main_~list~0!offset=0, main_~null~0!base=3, main_~null~0!offset=0] [L1026] main_~end~0 := main_~null~0; [L1027] main_~end~0 := main_~list~0; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc1!base=11, main_#t~malloc1!offset=0, main_~end~0!base=11, main_~end~0!offset=0, main_~list~0!base=11, main_~list~0!offset=0, main_~null~0!base=3, main_~null~0!offset=0] [L1030] COND FALSE !(!(main_~null~0 != main_~end~0)) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc1!base=11, main_#t~malloc1!offset=0, main_~end~0!base=11, main_~end~0!offset=0, main_~list~0!base=11, main_~list~0!offset=0, main_~null~0!base=3, main_~null~0!offset=0] [L1031] FCALL call main_#t~mem12 := read~int({ base: main_~end~0!base, offset: 8 + main_~end~0!offset }, 4); [L1031] COND FALSE !(!(~unnamed1~0~BLACK == main_#t~mem12)) [L1031] havoc main_#t~mem12; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc1!base=11, main_#t~malloc1!offset=0, main_~end~0!base=11, main_~end~0!offset=0, main_~list~0!base=11, main_~list~0!offset=0, main_~null~0!base=3, main_~null~0!offset=0] [L1032-L1042] COND FALSE !(!(main_~null~0 != main_~end~0)) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc1!base=11, main_#t~malloc1!offset=0, main_~end~0!base=11, main_~end~0!offset=0, main_~list~0!base=11, main_~list~0!offset=0, main_~null~0!base=3, main_~null~0!offset=0] [L1034] FCALL call main_#t~mem13 := read~int({ base: main_~end~0!base, offset: 8 + main_~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc1!base=11, main_#t~malloc1!offset=0, main_#t~mem13=1, main_~end~0!base=11, main_~end~0!offset=0, main_~list~0!base=11, main_~list~0!offset=0, main_~null~0!base=3, main_~null~0!offset=0] [L1034] COND FALSE !(~unnamed1~0~RED == main_#t~mem13) [L1034] havoc main_#t~mem13; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc1!base=11, main_#t~malloc1!offset=0, main_~end~0!base=11, main_~end~0!offset=0, main_~list~0!base=11, main_~list~0!offset=0, main_~null~0!base=3, main_~null~0!offset=0] [L1041] FCALL call main_#t~mem16 := read~$Pointer$({ base: main_~end~0!base, offset: main_~end~0!offset }, 4); [L1041] main_~end~0 := main_#t~mem16; [L1041] havoc main_#t~mem16; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc1!base=11, main_#t~malloc1!offset=0, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=11, main_~list~0!offset=0, main_~null~0!base=3, main_~null~0!offset=0] [L1032-L1042] COND TRUE !(main_~null~0 != main_~end~0) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc1!base=11, main_#t~malloc1!offset=0, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=11, main_~list~0!offset=0, main_~null~0!base=3, main_~null~0!offset=0] [L1045-L1060] COND FALSE !(!(main_~null~0 != main_~list~0)) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc1!base=11, main_#t~malloc1!offset=0, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=11, main_~list~0!offset=0, main_~null~0!base=3, main_~null~0!offset=0] [L1047] FCALL call main_#t~mem17 := read~int({ base: main_~list~0!base, offset: 8 + main_~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc1!base=11, main_#t~malloc1!offset=0, main_#t~mem17=1, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=11, main_~list~0!offset=0, main_~null~0!base=3, main_~null~0!offset=0] [L1047] COND FALSE !(~unnamed1~0~RED == main_#t~mem17) [L1047] havoc main_#t~mem17; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc1!base=11, main_#t~malloc1!offset=0, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=11, main_~list~0!offset=0, main_~null~0!base=3, main_~null~0!offset=0] [L1056] FCALL call main_#t~mem20 := read~$Pointer$({ base: main_~list~0!base, offset: main_~list~0!offset }, 4); [L1056] main_~end~0 := main_#t~mem20; [L1056] havoc main_#t~mem20; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc1!base=11, main_#t~malloc1!offset=0, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=11, main_~list~0!offset=0, main_~null~0!base=3, main_~null~0!offset=0] [L1057] assert 0 == main_~list~0!offset; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc1!base=11, main_#t~malloc1!offset=0, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=11, main_~list~0!offset=0, main_~null~0!base=3, main_~null~0!offset=0] [L1057] assert 0 == main_~list~0!base || 1 == #valid[main_~list~0!base]; [L1057] FCALL call ULTIMATE.dealloc(main_~list~0); [L1058] main_~list~0 := main_~end~0; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc1!base=11, main_#t~malloc1!offset=0, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=3, main_~list~0!offset=0, main_~null~0!base=3, main_~null~0!offset=0] [L1045-L1060] COND TRUE !(main_~null~0 != main_~list~0) [L1062] main_#res := 0; VAL [#NULL!base=0, #NULL!offset=0, main_#res=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc1!base=11, main_#t~malloc1!offset=0, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=3, main_~list~0!offset=0, main_~null~0!base=3, main_~null~0!offset=0] [L985-L1063] assert #valid == main_old_#valid; VAL [#NULL!base=0, #NULL!offset=0, main_#res=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc1!base=11, main_#t~malloc1!offset=0, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=3, main_~list~0!offset=0, main_~null~0!base=3, main_~null~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~malloc0, main_#t~malloc1, main_#t~malloc3, main_#t~mem4, main_#t~mem5, main_#t~nondet6, main_#t~malloc7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~nondet2, main_#t~mem12, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem20, main_~null~0, main_~list~0, main_~end~0; [L987] FCALL call main_#t~malloc0 := #Ultimate.alloc(12); [L987] main_~null~0 := main_#t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_~null~0!base=3, main_~null~0!offset=0] [L988] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~null~0!base, offset: main_~null~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_~null~0!base=3, main_~null~0!offset=0] [L989] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~null~0!base, offset: 4 + main_~null~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_~null~0!base=3, main_~null~0!offset=0] [L990] FCALL call write~int(~unnamed1~0~BLACK, { base: main_~null~0!base, offset: 8 + main_~null~0!offset }, 4); [L992] FCALL call main_#t~malloc1 := #Ultimate.alloc(12); [L992] main_~list~0 := main_#t~malloc1; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc1!base=11, main_#t~malloc1!offset=0, main_~list~0!base=11, main_~list~0!offset=0, main_~null~0!base=3, main_~null~0!offset=0] [L993] FCALL call write~$Pointer$(main_~null~0, { base: main_~list~0!base, offset: main_~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc1!base=11, main_#t~malloc1!offset=0, main_~list~0!base=11, main_~list~0!offset=0, main_~null~0!base=3, main_~null~0!offset=0] [L994] FCALL call write~$Pointer$(main_~null~0, { base: main_~list~0!base, offset: 4 + main_~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc1!base=11, main_#t~malloc1!offset=0, main_~list~0!base=11, main_~list~0!offset=0, main_~null~0!base=3, main_~null~0!offset=0] [L995] FCALL call write~int(~unnamed1~0~BLACK, { base: main_~list~0!base, offset: 8 + main_~list~0!offset }, 4); [L997] main_~end~0 := main_~list~0; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc1!base=11, main_#t~malloc1!offset=0, main_~end~0!base=11, main_~end~0!offset=0, main_~list~0!base=11, main_~list~0!offset=0, main_~null~0!base=3, main_~null~0!offset=0] [L1000] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc1!base=11, main_#t~malloc1!offset=0, main_#t~nondet2=0, main_~end~0!base=11, main_~end~0!offset=0, main_~list~0!base=11, main_~list~0!offset=0, main_~null~0!base=3, main_~null~0!offset=0] [L1000-L1024] COND TRUE !(0 != main_#t~nondet2) [L1000] havoc main_#t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc1!base=11, main_#t~malloc1!offset=0, main_~end~0!base=11, main_~end~0!offset=0, main_~list~0!base=11, main_~list~0!offset=0, main_~null~0!base=3, main_~null~0!offset=0] [L1026] main_~end~0 := main_~null~0; [L1027] main_~end~0 := main_~list~0; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc1!base=11, main_#t~malloc1!offset=0, main_~end~0!base=11, main_~end~0!offset=0, main_~list~0!base=11, main_~list~0!offset=0, main_~null~0!base=3, main_~null~0!offset=0] [L1030] COND FALSE !(!(main_~null~0 != main_~end~0)) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc1!base=11, main_#t~malloc1!offset=0, main_~end~0!base=11, main_~end~0!offset=0, main_~list~0!base=11, main_~list~0!offset=0, main_~null~0!base=3, main_~null~0!offset=0] [L1031] FCALL call main_#t~mem12 := read~int({ base: main_~end~0!base, offset: 8 + main_~end~0!offset }, 4); [L1031] COND FALSE !(!(~unnamed1~0~BLACK == main_#t~mem12)) [L1031] havoc main_#t~mem12; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc1!base=11, main_#t~malloc1!offset=0, main_~end~0!base=11, main_~end~0!offset=0, main_~list~0!base=11, main_~list~0!offset=0, main_~null~0!base=3, main_~null~0!offset=0] [L1032-L1042] COND FALSE !(!(main_~null~0 != main_~end~0)) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc1!base=11, main_#t~malloc1!offset=0, main_~end~0!base=11, main_~end~0!offset=0, main_~list~0!base=11, main_~list~0!offset=0, main_~null~0!base=3, main_~null~0!offset=0] [L1034] FCALL call main_#t~mem13 := read~int({ base: main_~end~0!base, offset: 8 + main_~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc1!base=11, main_#t~malloc1!offset=0, main_#t~mem13=1, main_~end~0!base=11, main_~end~0!offset=0, main_~list~0!base=11, main_~list~0!offset=0, main_~null~0!base=3, main_~null~0!offset=0] [L1034] COND FALSE !(~unnamed1~0~RED == main_#t~mem13) [L1034] havoc main_#t~mem13; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc1!base=11, main_#t~malloc1!offset=0, main_~end~0!base=11, main_~end~0!offset=0, main_~list~0!base=11, main_~list~0!offset=0, main_~null~0!base=3, main_~null~0!offset=0] [L1041] FCALL call main_#t~mem16 := read~$Pointer$({ base: main_~end~0!base, offset: main_~end~0!offset }, 4); [L1041] main_~end~0 := main_#t~mem16; [L1041] havoc main_#t~mem16; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc1!base=11, main_#t~malloc1!offset=0, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=11, main_~list~0!offset=0, main_~null~0!base=3, main_~null~0!offset=0] [L1032-L1042] COND TRUE !(main_~null~0 != main_~end~0) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc1!base=11, main_#t~malloc1!offset=0, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=11, main_~list~0!offset=0, main_~null~0!base=3, main_~null~0!offset=0] [L1045-L1060] COND FALSE !(!(main_~null~0 != main_~list~0)) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc1!base=11, main_#t~malloc1!offset=0, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=11, main_~list~0!offset=0, main_~null~0!base=3, main_~null~0!offset=0] [L1047] FCALL call main_#t~mem17 := read~int({ base: main_~list~0!base, offset: 8 + main_~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc1!base=11, main_#t~malloc1!offset=0, main_#t~mem17=1, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=11, main_~list~0!offset=0, main_~null~0!base=3, main_~null~0!offset=0] [L1047] COND FALSE !(~unnamed1~0~RED == main_#t~mem17) [L1047] havoc main_#t~mem17; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc1!base=11, main_#t~malloc1!offset=0, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=11, main_~list~0!offset=0, main_~null~0!base=3, main_~null~0!offset=0] [L1056] FCALL call main_#t~mem20 := read~$Pointer$({ base: main_~list~0!base, offset: main_~list~0!offset }, 4); [L1056] main_~end~0 := main_#t~mem20; [L1056] havoc main_#t~mem20; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc1!base=11, main_#t~malloc1!offset=0, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=11, main_~list~0!offset=0, main_~null~0!base=3, main_~null~0!offset=0] [L1057] assert 0 == main_~list~0!offset; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc1!base=11, main_#t~malloc1!offset=0, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=11, main_~list~0!offset=0, main_~null~0!base=3, main_~null~0!offset=0] [L1057] assert 0 == main_~list~0!base || 1 == #valid[main_~list~0!base]; [L1057] FCALL call ULTIMATE.dealloc(main_~list~0); [L1058] main_~list~0 := main_~end~0; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc1!base=11, main_#t~malloc1!offset=0, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=3, main_~list~0!offset=0, main_~null~0!base=3, main_~null~0!offset=0] [L1045-L1060] COND TRUE !(main_~null~0 != main_~list~0) [L1062] main_#res := 0; VAL [#NULL!base=0, #NULL!offset=0, main_#res=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc1!base=11, main_#t~malloc1!offset=0, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=3, main_~list~0!offset=0, main_~null~0!base=3, main_~null~0!offset=0] [L985-L1063] assert #valid == main_old_#valid; VAL [#NULL!base=0, #NULL!offset=0, main_#res=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc1!base=11, main_#t~malloc1!offset=0, main_~end~0!base=3, main_~end~0!offset=0, main_~list~0!base=3, main_~list~0!offset=0, main_~null~0!base=3, main_~null~0!offset=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L987] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L987] ~null~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0] [L988] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~null~0!base, offset: ~null~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L989] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~null~0!base, offset: 4 + ~null~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L990] FCALL call write~int(~unnamed1~0~BLACK, { base: ~null~0!base, offset: 8 + ~null~0!offset }, 4); [L992] FCALL call #t~malloc1 := #Ultimate.alloc(12); [L992] ~list~0 := #t~malloc1; VAL [#NULL!base=0, #NULL!offset=0] [L993] FCALL call write~$Pointer$(~null~0, { base: ~list~0!base, offset: ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L994] FCALL call write~$Pointer$(~null~0, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L995] FCALL call write~int(~unnamed1~0~BLACK, { base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); [L997] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0] [L1000] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] [L1000-L1024] COND TRUE !(0 != #t~nondet2) [L1000] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0] [L1026] ~end~0 := ~null~0; [L1027] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0] [L1030] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0] [L1031] FCALL call #t~mem12 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); [L1031] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem12)) [L1031] havoc #t~mem12; VAL [#NULL!base=0, #NULL!offset=0] [L1032-L1042] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0] [L1034] FCALL call #t~mem13 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L1034] COND FALSE !(~unnamed1~0~RED == #t~mem13) [L1034] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0] [L1041] FCALL call #t~mem16 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1041] ~end~0 := #t~mem16; [L1041] havoc #t~mem16; VAL [#NULL!base=0, #NULL!offset=0] [L1032-L1042] COND TRUE !(~null~0 != ~end~0) VAL [#NULL!base=0, #NULL!offset=0] [L1045-L1060] COND FALSE !(!(~null~0 != ~list~0)) VAL [#NULL!base=0, #NULL!offset=0] [L1047] FCALL call #t~mem17 := read~int({ base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L1047] COND FALSE !(~unnamed1~0~RED == #t~mem17) [L1047] havoc #t~mem17; VAL [#NULL!base=0, #NULL!offset=0] [L1056] FCALL call #t~mem20 := read~$Pointer$({ base: ~list~0!base, offset: ~list~0!offset }, 4); [L1056] ~end~0 := #t~mem20; [L1056] havoc #t~mem20; VAL [#NULL!base=0, #NULL!offset=0] [L1057] assert 0 == ~list~0!offset; VAL [#NULL!base=0, #NULL!offset=0] [L1057] assert 0 == ~list~0!base || 1 == #valid[~list~0!base]; [L1057] FCALL call ULTIMATE.dealloc(~list~0); [L1058] ~list~0 := ~end~0; VAL [#NULL!base=0, #NULL!offset=0] [L1045-L1060] COND TRUE !(~null~0 != ~list~0) [L1062] #res := 0; VAL [#NULL!base=0, #NULL!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L987] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L987] ~null~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0] [L988] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~null~0!base, offset: ~null~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L989] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~null~0!base, offset: 4 + ~null~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L990] FCALL call write~int(~unnamed1~0~BLACK, { base: ~null~0!base, offset: 8 + ~null~0!offset }, 4); [L992] FCALL call #t~malloc1 := #Ultimate.alloc(12); [L992] ~list~0 := #t~malloc1; VAL [#NULL!base=0, #NULL!offset=0] [L993] FCALL call write~$Pointer$(~null~0, { base: ~list~0!base, offset: ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L994] FCALL call write~$Pointer$(~null~0, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L995] FCALL call write~int(~unnamed1~0~BLACK, { base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); [L997] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0] [L1000] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] [L1000-L1024] COND TRUE !(0 != #t~nondet2) [L1000] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0] [L1026] ~end~0 := ~null~0; [L1027] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0] [L1030] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0] [L1031] FCALL call #t~mem12 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); [L1031] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem12)) [L1031] havoc #t~mem12; VAL [#NULL!base=0, #NULL!offset=0] [L1032-L1042] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0] [L1034] FCALL call #t~mem13 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L1034] COND FALSE !(~unnamed1~0~RED == #t~mem13) [L1034] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0] [L1041] FCALL call #t~mem16 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1041] ~end~0 := #t~mem16; [L1041] havoc #t~mem16; VAL [#NULL!base=0, #NULL!offset=0] [L1032-L1042] COND TRUE !(~null~0 != ~end~0) VAL [#NULL!base=0, #NULL!offset=0] [L1045-L1060] COND FALSE !(!(~null~0 != ~list~0)) VAL [#NULL!base=0, #NULL!offset=0] [L1047] FCALL call #t~mem17 := read~int({ base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L1047] COND FALSE !(~unnamed1~0~RED == #t~mem17) [L1047] havoc #t~mem17; VAL [#NULL!base=0, #NULL!offset=0] [L1056] FCALL call #t~mem20 := read~$Pointer$({ base: ~list~0!base, offset: ~list~0!offset }, 4); [L1056] ~end~0 := #t~mem20; [L1056] havoc #t~mem20; VAL [#NULL!base=0, #NULL!offset=0] [L1057] assert 0 == ~list~0!offset; VAL [#NULL!base=0, #NULL!offset=0] [L1057] assert 0 == ~list~0!base || 1 == #valid[~list~0!base]; [L1057] FCALL call ULTIMATE.dealloc(~list~0); [L1058] ~list~0 := ~end~0; VAL [#NULL!base=0, #NULL!offset=0] [L1045-L1060] COND TRUE !(~null~0 != ~list~0) [L1062] #res := 0; VAL [#NULL!base=0, #NULL!offset=0] [L987] struct TSLL* null = malloc(sizeof(struct TSLL)); [L988] null->next = ((void*)0) [L989] null->prev = ((void*)0) [L990] null->colour = BLACK [L992] struct TSLL* list = malloc(sizeof(struct TSLL)); [L993] list->next = null [L994] list->prev = null [L995] list->colour = BLACK [L997] struct TSLL* end = list; [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1026] end = null [L1027] end = list [L1030] COND FALSE !(!(null != end)) [L1031] EXPR end->colour [L1031] COND FALSE !(!(BLACK == end->colour)) [L1032] COND TRUE null != end [L1034] EXPR end->colour [L1034] COND FALSE !(RED == end->colour) [L1041] EXPR end->next [L1041] end = end->next [L1032] COND FALSE !(null != end) [L1045] COND TRUE null != list [L1047] EXPR list->colour [L1047] COND FALSE !(RED == list->colour) [L1056] EXPR list->next [L1056] end = list->next [L1057] free(list) [L1057] free(list) [L1058] list = end [L1045] COND FALSE !(null != list) [L1062] return 0; ----- [2018-11-23 01:46:21,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 01:46:21 ImpRootNode [2018-11-23 01:46:21,545 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 01:46:21,545 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 01:46:21,545 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 01:46:21,545 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 01:46:21,546 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:45:26" (3/4) ... [2018-11-23 01:46:21,549 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 01:46:21,549 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 01:46:21,549 INFO L168 Benchmark]: Toolchain (without parser) took 56422.90 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 663.2 MB). Free memory was 955.9 MB in the beginning and 847.6 MB in the end (delta: 108.3 MB). Peak memory consumption was 771.5 MB. Max. memory is 11.5 GB. [2018-11-23 01:46:21,551 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:46:21,551 INFO L168 Benchmark]: CACSL2BoogieTranslator took 332.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 955.9 MB in the beginning and 1.1 GB in the end (delta: -172.9 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. [2018-11-23 01:46:21,551 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 01:46:21,552 INFO L168 Benchmark]: Boogie Preprocessor took 22.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:46:21,552 INFO L168 Benchmark]: RCFGBuilder took 617.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 69.1 MB). Peak memory consumption was 69.1 MB. Max. memory is 11.5 GB. [2018-11-23 01:46:21,552 INFO L168 Benchmark]: CodeCheck took 55402.80 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 523.2 MB). Free memory was 1.1 GB in the beginning and 863.4 MB in the end (delta: 190.8 MB). Peak memory consumption was 714.1 MB. Max. memory is 11.5 GB. [2018-11-23 01:46:21,553 INFO L168 Benchmark]: Witness Printer took 3.73 ms. Allocated memory is still 1.7 GB. Free memory was 863.4 MB in the beginning and 847.6 MB in the end (delta: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-23 01:46:21,555 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 144 locations, 67 error locations. UNSAFE Result, 55.3s OverallTime, 80 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 33884352 SDtfs, -39366792 SDslu, 970053736 SDs, 0 SdLazy, -745482888 SolverSat, -1040839640 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 35.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10299 GetRequests, 9371 SyntacticMatches, 380 SemanticMatches, 548 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144827 ImplicationChecksByTransitivity, 52.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 1363 NumberOfCodeBlocks, 1363 NumberOfCodeBlocksAsserted, 80 NumberOfCheckSat, 1257 ConstructedInterpolants, 0 QuantifiedInterpolants, 133491 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 79 InterpolantComputations, 69 PerfectInterpolantSequences, 38/49 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - UnprovableResult [Line: 985]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 985. Possible FailurePath: [L987] struct TSLL* null = malloc(sizeof(struct TSLL)); [L988] null->next = ((void*)0) [L989] null->prev = ((void*)0) [L990] null->colour = BLACK [L992] struct TSLL* list = malloc(sizeof(struct TSLL)); [L993] list->next = null [L994] list->prev = null [L995] list->colour = BLACK [L997] struct TSLL* end = list; [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1026] end = null [L1027] end = list [L1030] COND FALSE !(!(null != end)) [L1031] EXPR end->colour [L1031] COND FALSE !(!(BLACK == end->colour)) [L1032] COND TRUE null != end [L1034] EXPR end->colour [L1034] COND FALSE !(RED == end->colour) [L1041] EXPR end->next [L1041] end = end->next [L1032] COND FALSE !(null != end) [L1045] COND TRUE null != list [L1047] EXPR list->colour [L1047] COND FALSE !(RED == list->colour) [L1056] EXPR list->next [L1056] end = list->next [L1057] free(list) [L1057] free(list) [L1058] list = end [L1045] COND FALSE !(null != list) [L1062] return 0; * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 332.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 955.9 MB in the beginning and 1.1 GB in the end (delta: -172.9 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 617.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 69.1 MB). Peak memory consumption was 69.1 MB. Max. memory is 11.5 GB. * CodeCheck took 55402.80 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 523.2 MB). Free memory was 1.1 GB in the beginning and 863.4 MB in the end (delta: 190.8 MB). Peak memory consumption was 714.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.73 ms. Allocated memory is still 1.7 GB. Free memory was 863.4 MB in the beginning and 847.6 MB in the end (delta: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-aa41828 [2018-11-23 01:46:22,994 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 01:46:22,996 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 01:46:23,004 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 01:46:23,004 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 01:46:23,005 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 01:46:23,006 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 01:46:23,007 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 01:46:23,008 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 01:46:23,009 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 01:46:23,010 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 01:46:23,010 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 01:46:23,010 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 01:46:23,011 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 01:46:23,012 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 01:46:23,013 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 01:46:23,013 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 01:46:23,014 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 01:46:23,016 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 01:46:23,017 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 01:46:23,018 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 01:46:23,019 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 01:46:23,020 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 01:46:23,021 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 01:46:23,021 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 01:46:23,021 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 01:46:23,022 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 01:46:23,022 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 01:46:23,024 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 01:46:23,024 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 01:46:23,024 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 01:46:23,025 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 01:46:23,025 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 01:46:23,025 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 01:46:23,026 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 01:46:23,026 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 01:46:23,026 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0c9d47e5-18fd-4fbd-8a3c-2e9bbe9616c1/bin-2019/ukojak/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Bitvector.epf [2018-11-23 01:46:23,036 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 01:46:23,037 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 01:46:23,037 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 01:46:23,038 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 01:46:23,038 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 01:46:23,038 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 01:46:23,038 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 01:46:23,038 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 01:46:23,038 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 01:46:23,038 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 01:46:23,039 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-23 01:46:23,039 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-23 01:46:23,039 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-23 01:46:23,039 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 01:46:23,040 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 01:46:23,040 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 01:46:23,040 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 01:46:23,040 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 01:46:23,041 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 01:46:23,041 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 01:46:23,041 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 01:46:23,041 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 01:46:23,041 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 01:46:23,041 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 01:46:23,041 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 01:46:23,042 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-11-23 01:46:23,042 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 01:46:23,042 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 01:46:23,042 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 01:46:23,042 INFO L133 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_0c9d47e5-18fd-4fbd-8a3c-2e9bbe9616c1/bin-2019/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 [2018-11-23 01:46:23,072 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 01:46:23,081 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 01:46:23,084 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 01:46:23,085 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 01:46:23,086 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 01:46:23,086 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0c9d47e5-18fd-4fbd-8a3c-2e9bbe9616c1/bin-2019/ukojak/../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-11-23 01:46:23,126 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0c9d47e5-18fd-4fbd-8a3c-2e9bbe9616c1/bin-2019/ukojak/data/43d0a313e/22948169a8094ae9b32c1b3289d7f9f2/FLAG2213837fc [2018-11-23 01:46:23,489 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 01:46:23,489 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0c9d47e5-18fd-4fbd-8a3c-2e9bbe9616c1/sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-11-23 01:46:23,496 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0c9d47e5-18fd-4fbd-8a3c-2e9bbe9616c1/bin-2019/ukojak/data/43d0a313e/22948169a8094ae9b32c1b3289d7f9f2/FLAG2213837fc [2018-11-23 01:46:23,889 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0c9d47e5-18fd-4fbd-8a3c-2e9bbe9616c1/bin-2019/ukojak/data/43d0a313e/22948169a8094ae9b32c1b3289d7f9f2 [2018-11-23 01:46:23,891 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 01:46:23,892 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 01:46:23,893 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 01:46:23,893 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 01:46:23,895 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 01:46:23,896 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:46:23" (1/1) ... [2018-11-23 01:46:23,897 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a8eb79d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:23, skipping insertion in model container [2018-11-23 01:46:23,897 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:46:23" (1/1) ... [2018-11-23 01:46:23,904 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 01:46:23,935 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 01:46:24,149 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:46:24,159 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 01:46:24,195 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:46:24,221 INFO L195 MainTranslator]: Completed translation [2018-11-23 01:46:24,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:24 WrapperNode [2018-11-23 01:46:24,222 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 01:46:24,222 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 01:46:24,222 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 01:46:24,222 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 01:46:24,227 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:24" (1/1) ... [2018-11-23 01:46:24,278 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:24" (1/1) ... [2018-11-23 01:46:24,293 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 01:46:24,293 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 01:46:24,293 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 01:46:24,293 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 01:46:24,298 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:24" (1/1) ... [2018-11-23 01:46:24,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:24" (1/1) ... [2018-11-23 01:46:24,301 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:24" (1/1) ... [2018-11-23 01:46:24,301 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:24" (1/1) ... [2018-11-23 01:46:24,308 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:24" (1/1) ... [2018-11-23 01:46:24,312 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:24" (1/1) ... [2018-11-23 01:46:24,313 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:24" (1/1) ... [2018-11-23 01:46:24,315 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 01:46:24,315 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 01:46:24,315 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 01:46:24,315 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 01:46:24,316 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c9d47e5-18fd-4fbd-8a3c-2e9bbe9616c1/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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:10000 [2018-11-23 01:46:24,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 01:46:24,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 01:46:24,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 01:46:24,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 01:46:24,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 01:46:24,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 01:46:24,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 01:46:24,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 01:46:25,056 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 01:46:25,056 INFO L280 CfgBuilder]: Removed 21 assue(true) statements. [2018-11-23 01:46:25,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:46:25 BoogieIcfgContainer [2018-11-23 01:46:25,057 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 01:46:25,057 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 01:46:25,057 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 01:46:25,064 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 01:46:25,064 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:46:25" (1/1) ... [2018-11-23 01:46:25,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:46:25,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:46:25,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 122 states and 141 transitions. [2018-11-23 01:46:25,096 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 141 transitions. [2018-11-23 01:46:25,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-11-23 01:46:25,098 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:46:25,125 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck has thrown an exception: java.lang.IllegalArgumentException: Indexed Sort BitVec undefined at de.uni_freiburg.informatik.ultimate.logic.SortSymbol.checkArity(SortSymbol.java:153) at de.uni_freiburg.informatik.ultimate.logic.SortSymbol.getSort(SortSymbol.java:177) at de.uni_freiburg.informatik.ultimate.logic.Theory.getSort(Theory.java:1243) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:287) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.TermTransferrer.transferSort(TermTransferrer.java:128) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.TermTransferrer.convertApplicationTerm(TermTransferrer.java:162) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:320) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:253) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.cfg.SmtSymbols.transferSymbols(SmtSymbols.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.CodeCheckObserver.process(CodeCheckObserver.java:449) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.CFGWalker.runObserver(CFGWalker.java:57) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.BaseWalker.runObserver(BaseWalker.java:93) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.BaseWalker.run(BaseWalker.java:86) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) 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:316) 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) [2018-11-23 01:46:25,127 INFO L168 Benchmark]: Toolchain (without parser) took 1235.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 944.4 MB in the beginning and 1.0 GB in the end (delta: -101.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. [2018-11-23 01:46:25,129 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:46:25,129 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.83 ms. Allocated memory is still 1.0 GB. Free memory was 944.4 MB in the beginning and 922.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-23 01:46:25,129 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 922.9 MB in the beginning and 1.1 GB in the end (delta: -195.2 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. [2018-11-23 01:46:25,130 INFO L168 Benchmark]: Boogie Preprocessor took 21.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:46:25,131 INFO L168 Benchmark]: RCFGBuilder took 741.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 65.3 MB). Peak memory consumption was 65.3 MB. Max. memory is 11.5 GB. [2018-11-23 01:46:25,131 INFO L168 Benchmark]: CodeCheck took 69.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-11-23 01:46:25,133 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - ExceptionOrErrorResult: IllegalArgumentException: Indexed Sort BitVec undefined de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: IllegalArgumentException: Indexed Sort BitVec undefined: de.uni_freiburg.informatik.ultimate.logic.SortSymbol.checkArity(SortSymbol.java:153) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 328.83 ms. Allocated memory is still 1.0 GB. Free memory was 944.4 MB in the beginning and 922.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 70.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 922.9 MB in the beginning and 1.1 GB in the end (delta: -195.2 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 741.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 65.3 MB). Peak memory consumption was 65.3 MB. Max. memory is 11.5 GB. * CodeCheck took 69.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...