./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/sll-rb-sentinel_false-unreach-call_false-valid-memcleanup.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8cfab3c6-995e-41c0-9c17-2085d33443a2/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8cfab3c6-995e-41c0-9c17-2085d33443a2/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8cfab3c6-995e-41c0-9c17-2085d33443a2/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8cfab3c6-995e-41c0-9c17-2085d33443a2/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/forester-heap/sll-rb-sentinel_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_8cfab3c6-995e-41c0-9c17-2085d33443a2/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8cfab3c6-995e-41c0-9c17-2085d33443a2/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d9f9c3b0fdd5428a38e0eab9236fadbdbb3aa880 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 00:21:34,657 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 00:21:34,658 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 00:21:34,666 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 00:21:34,667 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 00:21:34,667 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 00:21:34,668 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 00:21:34,669 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 00:21:34,670 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 00:21:34,671 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 00:21:34,671 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 00:21:34,671 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 00:21:34,672 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 00:21:34,673 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 00:21:34,673 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 00:21:34,674 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 00:21:34,674 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 00:21:34,675 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 00:21:34,676 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 00:21:34,677 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 00:21:34,678 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 00:21:34,679 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 00:21:34,680 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 00:21:34,680 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 00:21:34,680 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 00:21:34,681 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 00:21:34,682 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 00:21:34,682 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 00:21:34,683 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 00:21:34,684 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 00:21:34,684 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 00:21:34,684 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 00:21:34,684 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 00:21:34,685 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 00:21:34,685 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 00:21:34,686 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 00:21:34,686 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8cfab3c6-995e-41c0-9c17-2085d33443a2/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 00:21:34,693 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 00:21:34,693 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 00:21:34,693 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 00:21:34,693 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 00:21:34,694 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 00:21:34,694 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 00:21:34,694 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 00:21:34,694 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 00:21:34,694 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 00:21:34,694 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 00:21:34,695 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 00:21:34,695 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 00:21:34,695 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 00:21:34,695 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 00:21:34,695 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 00:21:34,695 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 00:21:34,695 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 00:21:34,695 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 00:21:34,695 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 00:21:34,696 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 00:21:34,696 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 00:21:34,696 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 00:21:34,696 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 00:21:34,696 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 00:21:34,696 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 00:21:34,696 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 00:21:34,696 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 00:21:34,697 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 00:21:34,697 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 00:21:34,697 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 00:21:34,697 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_8cfab3c6-995e-41c0-9c17-2085d33443a2/bin-2019/uautomizer 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 ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer 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 -> d9f9c3b0fdd5428a38e0eab9236fadbdbb3aa880 [2018-11-23 00:21:34,720 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 00:21:34,729 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 00:21:34,731 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 00:21:34,732 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 00:21:34,732 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 00:21:34,733 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8cfab3c6-995e-41c0-9c17-2085d33443a2/bin-2019/uautomizer/../../sv-benchmarks/c/forester-heap/sll-rb-sentinel_false-unreach-call_false-valid-memcleanup.i [2018-11-23 00:21:34,773 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8cfab3c6-995e-41c0-9c17-2085d33443a2/bin-2019/uautomizer/data/2e20d089a/57df8171c0424bd1a208aacedd769c10/FLAG59a7ab9f3 [2018-11-23 00:21:35,194 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 00:21:35,194 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8cfab3c6-995e-41c0-9c17-2085d33443a2/sv-benchmarks/c/forester-heap/sll-rb-sentinel_false-unreach-call_false-valid-memcleanup.i [2018-11-23 00:21:35,201 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8cfab3c6-995e-41c0-9c17-2085d33443a2/bin-2019/uautomizer/data/2e20d089a/57df8171c0424bd1a208aacedd769c10/FLAG59a7ab9f3 [2018-11-23 00:21:35,210 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8cfab3c6-995e-41c0-9c17-2085d33443a2/bin-2019/uautomizer/data/2e20d089a/57df8171c0424bd1a208aacedd769c10 [2018-11-23 00:21:35,213 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 00:21:35,214 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 00:21:35,215 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 00:21:35,215 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 00:21:35,218 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 00:21:35,218 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:21:35" (1/1) ... [2018-11-23 00:21:35,220 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32ed6b13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:35, skipping insertion in model container [2018-11-23 00:21:35,221 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:21:35" (1/1) ... [2018-11-23 00:21:35,226 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 00:21:35,256 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 00:21:35,439 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:21:35,446 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 00:21:35,520 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:21:35,543 INFO L195 MainTranslator]: Completed translation [2018-11-23 00:21:35,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:35 WrapperNode [2018-11-23 00:21:35,544 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 00:21:35,544 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 00:21:35,544 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 00:21:35,545 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 00:21:35,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:35" (1/1) ... [2018-11-23 00:21:35,560 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:35" (1/1) ... [2018-11-23 00:21:35,565 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 00:21:35,565 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 00:21:35,565 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 00:21:35,565 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 00:21:35,571 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:35" (1/1) ... [2018-11-23 00:21:35,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:35" (1/1) ... [2018-11-23 00:21:35,573 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:35" (1/1) ... [2018-11-23 00:21:35,574 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:35" (1/1) ... [2018-11-23 00:21:35,582 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:35" (1/1) ... [2018-11-23 00:21:35,587 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:35" (1/1) ... [2018-11-23 00:21:35,589 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:35" (1/1) ... [2018-11-23 00:21:35,591 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 00:21:35,591 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 00:21:35,591 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 00:21:35,591 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 00:21:35,592 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cfab3c6-995e-41c0-9c17-2085d33443a2/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 00:21:35,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 00:21:35,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 00:21:35,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 00:21:35,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 00:21:35,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 00:21:35,635 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 00:21:35,635 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 00:21:35,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 00:21:35,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 00:21:35,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 00:21:35,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 00:21:35,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 00:21:35,935 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 00:21:35,935 INFO L280 CfgBuilder]: Removed 11 assue(true) statements. [2018-11-23 00:21:35,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:21:35 BoogieIcfgContainer [2018-11-23 00:21:35,935 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 00:21:35,936 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 00:21:35,936 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 00:21:35,939 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 00:21:35,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:21:35" (1/3) ... [2018-11-23 00:21:35,940 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cef0303 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:21:35, skipping insertion in model container [2018-11-23 00:21:35,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:35" (2/3) ... [2018-11-23 00:21:35,940 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cef0303 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:21:35, skipping insertion in model container [2018-11-23 00:21:35,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:21:35" (3/3) ... [2018-11-23 00:21:35,942 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-rb-sentinel_false-unreach-call_false-valid-memcleanup.i [2018-11-23 00:21:35,950 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 00:21:35,956 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-11-23 00:21:35,970 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-11-23 00:21:35,995 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 00:21:35,995 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 00:21:35,996 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 00:21:35,996 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 00:21:35,996 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 00:21:35,996 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 00:21:35,996 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 00:21:35,996 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 00:21:35,996 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 00:21:36,010 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-11-23 00:21:36,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 00:21:36,014 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:21:36,015 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:21:36,017 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:21:36,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:21:36,021 INFO L82 PathProgramCache]: Analyzing trace with hash -739689888, now seen corresponding path program 1 times [2018-11-23 00:21:36,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:21:36,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:21:36,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:36,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:21:36,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:36,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:21:36,123 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 00:21:36,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:21:36,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 00:21:36,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 00:21:36,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 00:21:36,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 00:21:36,137 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2018-11-23 00:21:36,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:21:36,149 INFO L93 Difference]: Finished difference Result 67 states and 104 transitions. [2018-11-23 00:21:36,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 00:21:36,150 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 00:21:36,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:21:36,155 INFO L225 Difference]: With dead ends: 67 [2018-11-23 00:21:36,155 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 00:21:36,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 00:21:36,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 00:21:36,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-23 00:21:36,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 00:21:36,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-11-23 00:21:36,178 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 10 [2018-11-23 00:21:36,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:21:36,179 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-11-23 00:21:36,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 00:21:36,179 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-23 00:21:36,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 00:21:36,179 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:21:36,179 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:21:36,179 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:21:36,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:21:36,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1467919078, now seen corresponding path program 1 times [2018-11-23 00:21:36,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:21:36,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:21:36,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:36,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:21:36,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:36,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:21:36,238 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 00:21:36,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:21:36,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 00:21:36,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 00:21:36,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 00:21:36,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 00:21:36,240 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 4 states. [2018-11-23 00:21:36,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:21:36,304 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-11-23 00:21:36,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 00:21:36,304 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-23 00:21:36,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:21:36,305 INFO L225 Difference]: With dead ends: 37 [2018-11-23 00:21:36,305 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 00:21:36,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:21:36,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 00:21:36,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2018-11-23 00:21:36,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 00:21:36,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-11-23 00:21:36,310 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 11 [2018-11-23 00:21:36,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:21:36,311 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-23 00:21:36,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 00:21:36,311 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-23 00:21:36,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 00:21:36,311 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:21:36,311 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:21:36,311 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:21:36,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:21:36,312 INFO L82 PathProgramCache]: Analyzing trace with hash 583703570, now seen corresponding path program 1 times [2018-11-23 00:21:36,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:21:36,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:21:36,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:36,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:21:36,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:36,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:21:36,391 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 00:21:36,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:21:36,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 00:21:36,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 00:21:36,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 00:21:36,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:21:36,392 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 5 states. [2018-11-23 00:21:36,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:21:36,474 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2018-11-23 00:21:36,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 00:21:36,474 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 00:21:36,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:21:36,475 INFO L225 Difference]: With dead ends: 54 [2018-11-23 00:21:36,475 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 00:21:36,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 00:21:36,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 00:21:36,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 36. [2018-11-23 00:21:36,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 00:21:36,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-11-23 00:21:36,481 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 14 [2018-11-23 00:21:36,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:21:36,481 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-11-23 00:21:36,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 00:21:36,481 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-23 00:21:36,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 00:21:36,482 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:21:36,482 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:21:36,482 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:21:36,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:21:36,482 INFO L82 PathProgramCache]: Analyzing trace with hash -375576027, now seen corresponding path program 1 times [2018-11-23 00:21:36,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:21:36,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:21:36,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:36,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:21:36,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:21:36,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:21:36,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:21:36,636 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cfab3c6-995e-41c0-9c17-2085d33443a2/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:21:36,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:21:36,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:21:36,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:21:36,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-23 00:21:36,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 00:21:36,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:36,719 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:36,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 00:21:36,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 00:21:36,736 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:36,738 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:36,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:21:36,746 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:26 [2018-11-23 00:21:36,789 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:36,797 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:36,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 00:21:36,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:36,820 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:21:36,825 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:21:36,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2018-11-23 00:21:36,839 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:36,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 00:21:36,841 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:36,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-11-23 00:21:36,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-11-23 00:21:36,857 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:36,862 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:36,866 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:36,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:36,885 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:53, output treesize:14 [2018-11-23 00:21:36,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-11-23 00:21:36,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 00:21:36,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:36,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:36,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 00:21:36,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:23 [2018-11-23 00:21:36,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-11-23 00:21:36,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-23 00:21:36,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:36,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 00:21:36,968 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:36,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:36,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:36,972 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2018-11-23 00:21:36,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:21:36,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:21:36,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-11-23 00:21:36,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 00:21:36,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 00:21:36,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-11-23 00:21:36,993 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 11 states. [2018-11-23 00:21:37,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:21:37,393 INFO L93 Difference]: Finished difference Result 96 states and 112 transitions. [2018-11-23 00:21:37,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 00:21:37,394 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2018-11-23 00:21:37,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:21:37,395 INFO L225 Difference]: With dead ends: 96 [2018-11-23 00:21:37,395 INFO L226 Difference]: Without dead ends: 94 [2018-11-23 00:21:37,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2018-11-23 00:21:37,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-23 00:21:37,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 42. [2018-11-23 00:21:37,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 00:21:37,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2018-11-23 00:21:37,402 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 17 [2018-11-23 00:21:37,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:21:37,403 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2018-11-23 00:21:37,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 00:21:37,403 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2018-11-23 00:21:37,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 00:21:37,403 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:21:37,404 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:21:37,405 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:21:37,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:21:37,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1282457529, now seen corresponding path program 1 times [2018-11-23 00:21:37,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:21:37,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:21:37,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:37,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:21:37,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:37,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:21:37,481 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 00:21:37,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:21:37,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 00:21:37,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 00:21:37,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 00:21:37,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:21:37,482 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand 5 states. [2018-11-23 00:21:37,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:21:37,524 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2018-11-23 00:21:37,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 00:21:37,525 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-23 00:21:37,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:21:37,525 INFO L225 Difference]: With dead ends: 57 [2018-11-23 00:21:37,525 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 00:21:37,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 00:21:37,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 00:21:37,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-11-23 00:21:37,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 00:21:37,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2018-11-23 00:21:37,531 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 18 [2018-11-23 00:21:37,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:21:37,531 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2018-11-23 00:21:37,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 00:21:37,531 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-11-23 00:21:37,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 00:21:37,532 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:21:37,532 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:21:37,532 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:21:37,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:21:37,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1118395700, now seen corresponding path program 1 times [2018-11-23 00:21:37,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:21:37,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:21:37,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:37,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:21:37,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:21:37,692 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:21:37,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:21:37,693 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cfab3c6-995e-41c0-9c17-2085d33443a2/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:21:37,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:21:37,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:21:37,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:21:37,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-23 00:21:37,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 00:21:37,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:37,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:37,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 00:21:37,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 00:21:37,747 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:37,749 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:37,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:21:37,755 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:26 [2018-11-23 00:21:37,780 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:37,781 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:37,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-23 00:21:37,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:37,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-11-23 00:21:37,798 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:37,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-23 00:21:37,800 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:37,804 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:37,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-11-23 00:21:37,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-11-23 00:21:37,837 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:37,840 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:37,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:37,846 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:59, output treesize:24 [2018-11-23 00:21:37,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-11-23 00:21:37,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 00:21:37,866 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:37,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:37,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:37,877 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2018-11-23 00:21:37,893 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:37,894 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:37,895 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:37,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-11-23 00:21:37,896 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:37,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-11-23 00:21:37,917 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:37,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-23 00:21:37,919 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:37,923 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:37,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 43 [2018-11-23 00:21:37,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-11-23 00:21:37,940 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:37,945 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:37,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 00:21:37,952 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:74, output treesize:46 [2018-11-23 00:21:37,975 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:37,976 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:37,977 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:37,978 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:37,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-11-23 00:21:37,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:38,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 48 [2018-11-23 00:21:38,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-11-23 00:21:38,015 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:38,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-23 00:21:38,016 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:38,020 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:38,027 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:38,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 64 [2018-11-23 00:21:38,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-11-23 00:21:38,053 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:38,061 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:38,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 62 [2018-11-23 00:21:38,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 00:21:38,082 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:38,091 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:38,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-11-23 00:21:38,101 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 10 variables, input treesize:99, output treesize:61 [2018-11-23 00:21:38,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 60 [2018-11-23 00:21:38,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 00:21:38,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:38,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 00:21:38,181 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:38,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 00:21:38,186 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:38,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-23 00:21:38,191 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:38,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:38,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:38,200 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 9 variables, input treesize:70, output treesize:3 [2018-11-23 00:21:38,201 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:21:38,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:21:38,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2018-11-23 00:21:38,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 00:21:38,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 00:21:38,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-11-23 00:21:38,218 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 14 states. [2018-11-23 00:21:38,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:21:38,833 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2018-11-23 00:21:38,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 00:21:38,833 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-11-23 00:21:38,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:21:38,835 INFO L225 Difference]: With dead ends: 73 [2018-11-23 00:21:38,835 INFO L226 Difference]: Without dead ends: 71 [2018-11-23 00:21:38,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2018-11-23 00:21:38,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-23 00:21:38,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 29. [2018-11-23 00:21:38,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 00:21:38,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-11-23 00:21:38,841 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 20 [2018-11-23 00:21:38,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:21:38,841 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-23 00:21:38,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 00:21:38,841 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-23 00:21:38,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 00:21:38,842 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:21:38,842 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:21:38,842 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:21:38,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:21:38,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1217737546, now seen corresponding path program 1 times [2018-11-23 00:21:38,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:21:38,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:21:38,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:38,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:21:38,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:38,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:21:38,904 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 00:21:38,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:21:38,904 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cfab3c6-995e-41c0-9c17-2085d33443a2/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:21:38,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:21:38,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:21:38,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:21:38,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-11-23 00:21:38,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 00:21:38,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:38,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 42 [2018-11-23 00:21:38,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2018-11-23 00:21:38,992 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:38,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-23 00:21:38,994 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:39,001 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:39,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2018-11-23 00:21:39,024 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:39,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-11-23 00:21:39,025 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:39,039 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:39,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 30 [2018-11-23 00:21:39,048 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-23 00:21:39,066 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 00:21:39,083 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 00:21:39,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 00:21:39,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-11-23 00:21:39,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 00:21:39,120 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:39,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 42 [2018-11-23 00:21:39,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2018-11-23 00:21:39,149 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:39,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-11-23 00:21:39,151 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:39,165 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:39,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 30 [2018-11-23 00:21:39,173 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-11-23 00:21:39,185 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 00:21:39,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2018-11-23 00:21:39,207 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:39,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-23 00:21:39,209 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:39,212 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:39,226 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 00:21:39,237 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 00:21:39,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 9 xjuncts. [2018-11-23 00:21:39,258 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 2 variables, input treesize:77, output treesize:242 [2018-11-23 00:21:39,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 45 [2018-11-23 00:21:39,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2018-11-23 00:21:39,343 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 00:21:39,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2018-11-23 00:21:39,367 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:39,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-11-23 00:21:39,388 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:39,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 00:21:39,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-11-23 00:21:39,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 00:21:39,472 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:39,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 00:21:39,480 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:39,483 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:39,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2018-11-23 00:21:39,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2018-11-23 00:21:39,491 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:39,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2018-11-23 00:21:39,507 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-23 00:21:39,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-11-23 00:21:39,522 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:39,535 INFO L267 ElimStorePlain]: Start of recursive call 9: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 00:21:39,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2018-11-23 00:21:39,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2018-11-23 00:21:39,546 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:39,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 15 [2018-11-23 00:21:39,560 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:39,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2018-11-23 00:21:39,572 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:39,579 INFO L267 ElimStorePlain]: Start of recursive call 13: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:39,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-11-23 00:21:39,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-23 00:21:39,609 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:39,612 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:39,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-11-23 00:21:39,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-23 00:21:39,633 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:39,635 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:39,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:39,645 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 8 variables, input treesize:110, output treesize:7 [2018-11-23 00:21:39,654 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 00:21:39,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:21:39,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-23 00:21:39,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 00:21:39,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 00:21:39,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-23 00:21:39,679 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 8 states. [2018-11-23 00:21:39,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:21:39,864 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-11-23 00:21:39,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 00:21:39,864 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-11-23 00:21:39,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:21:39,864 INFO L225 Difference]: With dead ends: 53 [2018-11-23 00:21:39,865 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 00:21:39,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-23 00:21:39,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 00:21:39,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-23 00:21:39,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 00:21:39,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-11-23 00:21:39,870 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 21 [2018-11-23 00:21:39,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:21:39,870 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-11-23 00:21:39,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 00:21:39,870 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-23 00:21:39,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 00:21:39,870 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:21:39,870 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:21:39,870 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:21:39,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:21:39,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1661807805, now seen corresponding path program 1 times [2018-11-23 00:21:39,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:21:39,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:21:39,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:39,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:21:39,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:39,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:21:40,039 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:21:40,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:21:40,039 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cfab3c6-995e-41c0-9c17-2085d33443a2/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:21:40,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:21:40,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:21:40,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:21:40,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-23 00:21:40,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 00:21:40,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:40,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:40,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:21:40,086 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:17 [2018-11-23 00:21:40,115 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:40,117 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:40,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 00:21:40,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:40,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-23 00:21:40,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 00:21:40,139 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:40,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-23 00:21:40,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 00:21:40,155 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:40,164 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:40,168 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:40,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-23 00:21:40,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 00:21:40,179 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:40,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-11-23 00:21:40,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-23 00:21:40,197 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:40,203 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:40,207 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:40,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:40,215 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:65, output treesize:19 [2018-11-23 00:21:40,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 108 [2018-11-23 00:21:40,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 1 [2018-11-23 00:21:40,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:40,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:40,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 66 [2018-11-23 00:21:40,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 1 [2018-11-23 00:21:40,253 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:40,255 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:40,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2018-11-23 00:21:40,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-11-23 00:21:40,261 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:40,262 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:40,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:40,265 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:112, output treesize:26 [2018-11-23 00:21:40,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-11-23 00:21:40,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2018-11-23 00:21:40,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:40,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:40,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-23 00:21:40,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2018-11-23 00:21:40,301 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:40,302 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:40,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:40,304 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:40, output treesize:9 [2018-11-23 00:21:40,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-23 00:21:40,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-23 00:21:40,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:40,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:40,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:40,319 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-23 00:21:40,329 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:21:40,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:21:40,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2018-11-23 00:21:40,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 00:21:40,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 00:21:40,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-11-23 00:21:40,345 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 18 states. [2018-11-23 00:21:40,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:21:40,721 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2018-11-23 00:21:40,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 00:21:40,721 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2018-11-23 00:21:40,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:21:40,722 INFO L225 Difference]: With dead ends: 70 [2018-11-23 00:21:40,722 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 00:21:40,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=566, Unknown=0, NotChecked=0, Total=702 [2018-11-23 00:21:40,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 00:21:40,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 43. [2018-11-23 00:21:40,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 00:21:40,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-11-23 00:21:40,729 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 24 [2018-11-23 00:21:40,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:21:40,729 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-11-23 00:21:40,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 00:21:40,730 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-23 00:21:40,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 00:21:40,730 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:21:40,730 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:21:40,730 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:21:40,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:21:40,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1612091137, now seen corresponding path program 1 times [2018-11-23 00:21:40,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:21:40,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:21:40,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:40,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:21:40,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:40,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:21:40,900 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:21:40,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:21:40,900 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cfab3c6-995e-41c0-9c17-2085d33443a2/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:21:40,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:21:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:21:40,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:21:40,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-23 00:21:40,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 00:21:40,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:40,938 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:40,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:40,944 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:20 [2018-11-23 00:21:40,964 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:40,965 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:40,968 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:40,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2018-11-23 00:21:40,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:40,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-23 00:21:40,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 00:21:40,991 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:40,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-23 00:21:41,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 00:21:41,001 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:41,004 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:41,008 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:41,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-23 00:21:41,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 00:21:41,024 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:41,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-11-23 00:21:41,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 00:21:41,032 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:41,036 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:41,039 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:41,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:41,049 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:82, output treesize:62 [2018-11-23 00:21:41,080 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:41,082 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:41,084 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:41,088 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:41,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 33 [2018-11-23 00:21:41,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:41,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2018-11-23 00:21:41,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-11-23 00:21:41,147 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:41,155 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:41,191 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:21:41,195 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:21:41,228 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:41,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 145 [2018-11-23 00:21:41,245 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 41 [2018-11-23 00:21:41,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-11-23 00:21:41,273 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:41,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2018-11-23 00:21:41,292 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:41,300 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:41,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 134 [2018-11-23 00:21:41,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-11-23 00:21:41,330 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:41,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-23 00:21:41,332 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:41,336 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:41,350 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:41,362 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:41,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 55 [2018-11-23 00:21:41,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-11-23 00:21:41,388 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:41,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 66 [2018-11-23 00:21:41,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-11-23 00:21:41,406 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:41,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 45 [2018-11-23 00:21:41,408 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:41,412 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:41,419 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:41,423 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:41,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:21:41,436 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 8 variables, input treesize:232, output treesize:94 [2018-11-23 00:21:41,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-11-23 00:21:41,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 00:21:41,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:41,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 00:21:41,499 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:41,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:41,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-23 00:21:41,510 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:108, output treesize:82 [2018-11-23 00:21:41,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 48 [2018-11-23 00:21:41,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-11-23 00:21:41,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:41,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 00:21:41,538 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:41,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-23 00:21:41,542 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:41,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:41,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:41,546 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:83, output treesize:4 [2018-11-23 00:21:41,550 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:21:41,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:21:41,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2018-11-23 00:21:41,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 00:21:41,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 00:21:41,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-11-23 00:21:41,565 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 14 states. [2018-11-23 00:21:42,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:21:42,038 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2018-11-23 00:21:42,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 00:21:42,039 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-11-23 00:21:42,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:21:42,039 INFO L225 Difference]: With dead ends: 88 [2018-11-23 00:21:42,039 INFO L226 Difference]: Without dead ends: 86 [2018-11-23 00:21:42,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-11-23 00:21:42,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-23 00:21:42,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 57. [2018-11-23 00:21:42,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 00:21:42,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2018-11-23 00:21:42,047 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 24 [2018-11-23 00:21:42,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:21:42,048 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2018-11-23 00:21:42,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 00:21:42,048 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2018-11-23 00:21:42,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 00:21:42,048 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:21:42,049 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:21:42,049 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:21:42,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:21:42,049 INFO L82 PathProgramCache]: Analyzing trace with hash -2004183828, now seen corresponding path program 2 times [2018-11-23 00:21:42,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:21:42,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:21:42,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:42,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:21:42,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:42,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:21:42,177 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:21:42,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:21:42,177 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cfab3c6-995e-41c0-9c17-2085d33443a2/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:21:42,186 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 00:21:42,212 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 00:21:42,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 00:21:42,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:21:42,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-23 00:21:42,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 00:21:42,222 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:42,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:42,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:21:42,234 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:23 [2018-11-23 00:21:42,256 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:42,257 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:42,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 00:21:42,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:42,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-23 00:21:42,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 00:21:42,276 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:42,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-23 00:21:42,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 00:21:42,286 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:42,290 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:42,294 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:42,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-23 00:21:42,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 00:21:42,308 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:42,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-11-23 00:21:42,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 00:21:42,326 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:42,330 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:42,333 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:42,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:42,341 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:74, output treesize:46 [2018-11-23 00:21:42,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 75 [2018-11-23 00:21:42,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-11-23 00:21:42,394 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:42,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:42,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2018-11-23 00:21:42,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-11-23 00:21:42,422 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:42,427 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:42,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:42,436 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:98, output treesize:44 [2018-11-23 00:21:42,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 48 [2018-11-23 00:21:42,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 00:21:42,485 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:42,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-11-23 00:21:42,491 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:21:42,496 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:21:42,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-11-23 00:21:42,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-23 00:21:42,505 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:42,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 00:21:42,509 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:42,511 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:42,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:42,515 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:71, output treesize:10 [2018-11-23 00:21:42,521 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:21:42,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:21:42,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-11-23 00:21:42,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 00:21:42,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 00:21:42,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-11-23 00:21:42,537 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 13 states. [2018-11-23 00:21:42,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:21:42,807 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2018-11-23 00:21:42,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 00:21:42,807 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-11-23 00:21:42,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:21:42,807 INFO L225 Difference]: With dead ends: 73 [2018-11-23 00:21:42,807 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 00:21:42,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2018-11-23 00:21:42,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 00:21:42,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-23 00:21:42,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 00:21:42,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-11-23 00:21:42,814 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 27 [2018-11-23 00:21:42,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:21:42,814 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-11-23 00:21:42,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 00:21:42,814 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-23 00:21:42,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 00:21:42,814 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:21:42,815 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:21:42,815 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:21:42,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:21:42,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1835345302, now seen corresponding path program 3 times [2018-11-23 00:21:42,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:21:42,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:21:42,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:42,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:21:42,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:21:43,062 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:21:43,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:21:43,063 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cfab3c6-995e-41c0-9c17-2085d33443a2/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:21:43,074 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 00:21:43,116 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 00:21:43,116 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 00:21:43,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:21:43,132 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:43,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-11-23 00:21:43,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-23 00:21:43,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:43,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:43,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:43,149 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:27 [2018-11-23 00:21:43,179 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:43,181 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:43,182 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:43,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-11-23 00:21:43,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:43,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-23 00:21:43,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 00:21:43,211 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:43,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-23 00:21:43,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 00:21:43,223 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:43,228 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:43,232 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:43,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-23 00:21:43,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 00:21:43,253 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:43,260 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:43,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 29 [2018-11-23 00:21:43,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-11-23 00:21:43,263 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:43,267 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:43,271 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:43,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:43,285 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:89, output treesize:61 [2018-11-23 00:21:43,312 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:43,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2018-11-23 00:21:43,319 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:43,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2018-11-23 00:21:43,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:43,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:43,365 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:43,366 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:43,367 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:43,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 67 [2018-11-23 00:21:43,371 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:43,380 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 43 [2018-11-23 00:21:43,381 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 00:21:43,392 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:43,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:43,406 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:99, output treesize:65 [2018-11-23 00:21:43,426 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:43,427 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:43,431 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:43,433 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:43,435 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:43,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 37 [2018-11-23 00:21:43,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:43,473 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:43,475 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:43,477 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:43,478 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:43,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 131 [2018-11-23 00:21:43,492 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 59 [2018-11-23 00:21:43,493 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 00:21:43,515 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:43,517 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:43,518 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:43,521 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:43,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 131 [2018-11-23 00:21:43,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 28 [2018-11-23 00:21:43,523 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:43,537 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:43,551 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:43,570 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:43,572 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 00:21:43,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 49 [2018-11-23 00:21:43,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-23 00:21:43,575 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:43,583 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:43,584 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:43,584 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:43,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 55 [2018-11-23 00:21:43,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-23 00:21:43,591 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:43,597 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:43,601 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:43,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:43,619 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:161, output treesize:77 [2018-11-23 00:21:43,645 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:43,665 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:43,666 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:43,667 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:43,668 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:43,669 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:43,670 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:43,670 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:43,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 11 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 183 [2018-11-23 00:21:43,697 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 96 treesize of output 118 [2018-11-23 00:21:43,700 INFO L267 ElimStorePlain]: Start of recursive call 3: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 7 xjuncts. [2018-11-23 00:21:43,744 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:43,759 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:43,761 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:43,762 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:43,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 88 [2018-11-23 00:21:43,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 15 [2018-11-23 00:21:43,770 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:43,776 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:43,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:43,795 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:157, output treesize:79 [2018-11-23 00:21:43,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-23 00:21:43,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-23 00:21:43,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:43,902 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:43,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:43,913 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:97, output treesize:82 [2018-11-23 00:21:43,959 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:43,960 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:43,961 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:43,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 57 [2018-11-23 00:21:43,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 5 [2018-11-23 00:21:43,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:43,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 00:21:43,974 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:43,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 00:21:43,979 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:43,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:43,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:21:43,989 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:90, output treesize:53 [2018-11-23 00:21:44,038 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:44,038 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:44,039 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:44,039 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:44,040 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:44,041 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:44,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 60 [2018-11-23 00:21:44,054 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 51 [2018-11-23 00:21:44,056 INFO L267 ElimStorePlain]: Start of recursive call 3: 10 dim-0 vars, End of recursive call: 10 dim-0 vars, and 7 xjuncts. [2018-11-23 00:21:44,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-11-23 00:21:44,074 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:44,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 00:21:44,078 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:44,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:44,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:44,082 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:4 [2018-11-23 00:21:44,093 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:21:44,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:21:44,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 22 [2018-11-23 00:21:44,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 00:21:44,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 00:21:44,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2018-11-23 00:21:44,109 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 22 states. [2018-11-23 00:21:44,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:21:44,834 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2018-11-23 00:21:44,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 00:21:44,834 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 27 [2018-11-23 00:21:44,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:21:44,835 INFO L225 Difference]: With dead ends: 91 [2018-11-23 00:21:44,835 INFO L226 Difference]: Without dead ends: 89 [2018-11-23 00:21:44,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=181, Invalid=689, Unknown=0, NotChecked=0, Total=870 [2018-11-23 00:21:44,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-23 00:21:44,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 49. [2018-11-23 00:21:44,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 00:21:44,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-11-23 00:21:44,843 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 27 [2018-11-23 00:21:44,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:21:44,843 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-11-23 00:21:44,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 00:21:44,843 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-11-23 00:21:44,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 00:21:44,844 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:21:44,844 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:21:44,844 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:21:44,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:21:44,844 INFO L82 PathProgramCache]: Analyzing trace with hash 814276948, now seen corresponding path program 1 times [2018-11-23 00:21:44,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:21:44,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:21:44,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:44,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:21:44,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:44,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:21:45,095 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:21:45,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:21:45,095 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cfab3c6-995e-41c0-9c17-2085d33443a2/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:21:45,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:21:45,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:21:45,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:21:45,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-23 00:21:45,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 00:21:45,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:45,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:45,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:45,138 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:17 [2018-11-23 00:21:45,159 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:45,160 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:45,162 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:45,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2018-11-23 00:21:45,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:45,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-23 00:21:45,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 00:21:45,197 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:45,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-23 00:21:45,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 00:21:45,213 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:45,220 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:45,227 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:45,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-23 00:21:45,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 00:21:45,251 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:45,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-11-23 00:21:45,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 00:21:45,259 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:45,263 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:45,265 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:45,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:45,275 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:79, output treesize:59 [2018-11-23 00:21:45,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-11-23 00:21:45,301 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:45,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-23 00:21:45,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:45,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:45,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 44 [2018-11-23 00:21:45,333 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:45,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2018-11-23 00:21:45,334 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:45,339 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:45,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:45,348 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:97, output treesize:59 [2018-11-23 00:21:45,355 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:45,356 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:45,357 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:45,360 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:45,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 79 [2018-11-23 00:21:45,361 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:45,402 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:45,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 132 [2018-11-23 00:21:45,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2018-11-23 00:21:45,407 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:45,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 114 [2018-11-23 00:21:45,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 00:21:45,434 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:45,445 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:45,456 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:45,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 44 [2018-11-23 00:21:45,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-11-23 00:21:45,481 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:45,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 55 [2018-11-23 00:21:45,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-23 00:21:45,493 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:45,499 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:45,502 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:45,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:45,517 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:162, output treesize:97 [2018-11-23 00:21:45,565 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:45,569 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:45,573 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:45,577 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:45,586 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:45,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 85 [2018-11-23 00:21:45,587 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:45,644 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:21:45,648 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:21:45,700 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:21:45,704 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:21:45,753 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:45,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 264 treesize of output 199 [2018-11-23 00:21:45,767 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:45,777 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 55 [2018-11-23 00:21:45,802 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:45,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 46 [2018-11-23 00:21:45,807 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:45,826 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:45,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 39 [2018-11-23 00:21:45,830 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:45,842 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:45,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 186 [2018-11-23 00:21:45,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-11-23 00:21:45,889 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:45,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-23 00:21:45,891 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:45,896 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:45,919 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:45,941 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:45,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 65 [2018-11-23 00:21:45,977 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:45,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2018-11-23 00:21:45,981 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:45,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 61 [2018-11-23 00:21:45,984 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:21:45,991 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:21:46,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 99 [2018-11-23 00:21:46,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 34 [2018-11-23 00:21:46,011 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:21:46,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 53 [2018-11-23 00:21:46,012 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:46,016 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:46,024 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:46,029 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:46,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 00:21:46,047 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 9 variables, input treesize:354, output treesize:159 [2018-11-23 00:21:46,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 00:21:46,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 00:21:46,132 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:46,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:46,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-23 00:21:46,156 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:173, output treesize:162 [2018-11-23 00:21:46,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 81 [2018-11-23 00:21:46,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-11-23 00:21:46,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:46,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-11-23 00:21:46,219 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:46,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 00:21:46,224 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:46,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-23 00:21:46,229 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 00:21:46,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:46,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:21:46,234 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:163, output treesize:4 [2018-11-23 00:21:46,253 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:21:46,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:21:46,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2018-11-23 00:21:46,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 00:21:46,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 00:21:46,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2018-11-23 00:21:46,268 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 18 states. [2018-11-23 00:21:47,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:21:47,756 INFO L93 Difference]: Finished difference Result 128 states and 147 transitions. [2018-11-23 00:21:47,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 00:21:47,757 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2018-11-23 00:21:47,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:21:47,758 INFO L225 Difference]: With dead ends: 128 [2018-11-23 00:21:47,758 INFO L226 Difference]: Without dead ends: 126 [2018-11-23 00:21:47,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=238, Invalid=1093, Unknown=1, NotChecked=0, Total=1332 [2018-11-23 00:21:47,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-23 00:21:47,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 52. [2018-11-23 00:21:47,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 00:21:47,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2018-11-23 00:21:47,766 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 27 [2018-11-23 00:21:47,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:21:47,766 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2018-11-23 00:21:47,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 00:21:47,766 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2018-11-23 00:21:47,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 00:21:47,767 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:21:47,767 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:21:47,767 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:21:47,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:21:47,768 INFO L82 PathProgramCache]: Analyzing trace with hash -513246438, now seen corresponding path program 1 times [2018-11-23 00:21:47,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:21:47,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:21:47,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:47,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:21:47,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:47,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:21:47,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:21:47,805 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=17, |#NULL.offset|=9, |old(#NULL.base)|=17, |old(#NULL.offset)|=9] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=17, |old(#NULL.offset)|=9] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=17, |old(#NULL.offset)|=9] [?] RET #136#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret17 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~int(~unnamed1~0~BLACK, ~null~0.base, 4 + ~null~0.offset, 4);call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8);~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4);call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [main_~end~0.base=25, main_~end~0.offset=0, main_~list~0.base=25, main_~list~0.offset=0, main_~null~0.base=15, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=25, |main_#t~malloc1.offset|=0] [?] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [main_~end~0.base=25, main_~end~0.offset=0, main_~list~0.base=25, main_~list~0.offset=0, main_~null~0.base=15, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=25, |main_#t~malloc1.offset|=0, |main_#t~nondet2|=1] [?] assume !!(0 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8);call write~$Pointer$(#t~malloc3.base, #t~malloc3.offset, ~end~0.base, ~end~0.offset, 4);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [main_~end~0.base=14, main_~end~0.offset=0, main_~list~0.base=25, main_~list~0.offset=0, main_~null~0.base=15, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=25, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=14, |main_#t~malloc3.offset|=0, |main_#t~nondet5|=0] [?] assume !(0 != #t~nondet5);havoc #t~nondet5;call write~int(~unnamed1~0~RED, ~end~0.base, 4 + ~end~0.offset, 4);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(8);call write~$Pointer$(#t~malloc6.base, #t~malloc6.offset, ~end~0.base, ~end~0.offset, 4);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4);call write~int(~unnamed1~0~BLACK, ~end~0.base, 4 + ~end~0.offset, 4); VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=25, main_~list~0.offset=0, main_~null~0.base=15, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=25, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=14, |main_#t~malloc3.offset|=0, |main_#t~malloc6.base|=26, |main_#t~malloc6.offset|=0] [?] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=25, main_~list~0.offset=0, main_~null~0.base=15, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=25, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=14, |main_#t~malloc3.offset|=0, |main_#t~malloc6.base|=26, |main_#t~malloc6.offset|=0, |main_#t~nondet2|=0] [?] assume !(0 != #t~nondet2);havoc #t~nondet2; VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=25, main_~list~0.offset=0, main_~null~0.base=15, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=25, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=14, |main_#t~malloc3.offset|=0, |main_#t~malloc6.base|=26, |main_#t~malloc6.offset|=0] [?] ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [main_~end~0.base=25, main_~end~0.offset=0, main_~list~0.base=25, main_~list~0.offset=0, main_~null~0.base=15, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=25, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=14, |main_#t~malloc3.offset|=0, |main_#t~malloc6.base|=26, |main_#t~malloc6.offset|=0] [?] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [main_~end~0.base=25, main_~end~0.offset=0, main_~list~0.base=25, main_~list~0.offset=0, main_~null~0.base=15, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=25, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=14, |main_#t~malloc3.offset|=0, |main_#t~malloc6.base|=26, |main_#t~malloc6.offset|=0] [?] goto; VAL [main_~end~0.base=25, main_~end~0.offset=0, main_~list~0.base=25, main_~list~0.offset=0, main_~null~0.base=15, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=25, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=14, |main_#t~malloc3.offset|=0, |main_#t~malloc6.base|=26, |main_#t~malloc6.offset|=0] [?] call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); VAL [main_~end~0.base=25, main_~end~0.offset=0, main_~list~0.base=25, main_~list~0.offset=0, main_~null~0.base=15, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=25, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=14, |main_#t~malloc3.offset|=0, |main_#t~malloc6.base|=26, |main_#t~malloc6.offset|=0, |main_#t~mem8|=1] [?] assume !!(~unnamed1~0~BLACK == #t~mem8);havoc #t~mem8; VAL [main_~end~0.base=25, main_~end~0.offset=0, main_~list~0.base=25, main_~list~0.offset=0, main_~null~0.base=15, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=25, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=14, |main_#t~malloc3.offset|=0, |main_#t~malloc6.base|=26, |main_#t~malloc6.offset|=0] [?] goto; VAL [main_~end~0.base=25, main_~end~0.offset=0, main_~list~0.base=25, main_~list~0.offset=0, main_~null~0.base=15, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=25, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=14, |main_#t~malloc3.offset|=0, |main_#t~malloc6.base|=26, |main_#t~malloc6.offset|=0] [?] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset);call #t~mem9 := read~int(~end~0.base, 4 + ~end~0.offset, 4); VAL [main_~end~0.base=25, main_~end~0.offset=0, main_~list~0.base=25, main_~list~0.offset=0, main_~null~0.base=15, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=25, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=14, |main_#t~malloc3.offset|=0, |main_#t~malloc6.base|=26, |main_#t~malloc6.offset|=0, |main_#t~mem9|=1] [?] assume !(~unnamed1~0~RED == #t~mem9);havoc #t~mem9; VAL [main_~end~0.base=25, main_~end~0.offset=0, main_~list~0.base=25, main_~list~0.offset=0, main_~null~0.base=15, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=25, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=14, |main_#t~malloc3.offset|=0, |main_#t~malloc6.base|=26, |main_#t~malloc6.offset|=0] [?] call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset; VAL [main_~end~0.base=14, main_~end~0.offset=0, main_~list~0.base=25, main_~list~0.offset=0, main_~null~0.base=15, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=25, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=14, |main_#t~malloc3.offset|=0, |main_#t~malloc6.base|=26, |main_#t~malloc6.offset|=0] [?] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset);call #t~mem9 := read~int(~end~0.base, 4 + ~end~0.offset, 4); VAL [main_~end~0.base=14, main_~end~0.offset=0, main_~list~0.base=25, main_~list~0.offset=0, main_~null~0.base=15, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=25, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=14, |main_#t~malloc3.offset|=0, |main_#t~malloc6.base|=26, |main_#t~malloc6.offset|=0, |main_#t~mem9|=0] [?] assume ~unnamed1~0~RED == #t~mem9;havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=25, main_~list~0.offset=0, main_~null~0.base=15, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=25, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=14, |main_#t~malloc3.offset|=0, |main_#t~malloc6.base|=26, |main_#t~malloc6.offset|=0] [?] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=25, main_~list~0.offset=0, main_~null~0.base=15, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=25, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=14, |main_#t~malloc3.offset|=0, |main_#t~malloc6.base|=26, |main_#t~malloc6.offset|=0] [?] goto; VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=25, main_~list~0.offset=0, main_~null~0.base=15, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=25, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=14, |main_#t~malloc3.offset|=0, |main_#t~malloc6.base|=26, |main_#t~malloc6.offset|=0] [?] call #t~mem11 := read~int(~end~0.base, 4 + ~end~0.offset, 4); VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=25, main_~list~0.offset=0, main_~null~0.base=15, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=25, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=14, |main_#t~malloc3.offset|=0, |main_#t~malloc6.base|=26, |main_#t~malloc6.offset|=0, |main_#t~mem11|=1] [?] assume !(~unnamed1~0~BLACK != #t~mem11);havoc #t~mem11; VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=25, main_~list~0.offset=0, main_~null~0.base=15, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=25, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=14, |main_#t~malloc3.offset|=0, |main_#t~malloc6.base|=26, |main_#t~malloc6.offset|=0] [?] assume !false; VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=25, main_~list~0.offset=0, main_~null~0.base=15, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=25, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=14, |main_#t~malloc3.offset|=0, |main_#t~malloc6.base|=26, |main_#t~malloc6.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=17, #NULL.offset=9, old(#NULL.base)=17, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=17, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=17, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L994] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L994] ~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset; [L995] call write~int(~unnamed1~0~BLACK, ~null~0.base, 4 + ~null~0.offset, 4); [L996] call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4); [L998] call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8); [L998] ~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset; [L999] call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4); [L1000] call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4); [L1002] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, ~end~0.base=25, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1005] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~nondet2=1, ~end~0.base=25, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1005-L1024] assume !!(0 != #t~nondet2); [L1005] havoc #t~nondet2; [L1008] call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8); [L1008] call write~$Pointer$(#t~malloc3.base, #t~malloc3.offset, ~end~0.base, ~end~0.offset, 4); [L1009] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); [L1009] ~end~0.base, ~end~0.offset := #t~mem4.base, #t~mem4.offset; [L1009] havoc #t~mem4.base, #t~mem4.offset; [L1010] call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4); [L1012] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~nondet5=0, ~end~0.base=14, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1012-L1023] assume !(0 != #t~nondet5); [L1012] havoc #t~nondet5; [L1018] call write~int(~unnamed1~0~RED, ~end~0.base, 4 + ~end~0.offset, 4); [L1019] call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(8); [L1019] call write~$Pointer$(#t~malloc6.base, #t~malloc6.offset, ~end~0.base, ~end~0.offset, 4); [L1020] call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); [L1020] ~end~0.base, ~end~0.offset := #t~mem7.base, #t~mem7.offset; [L1020] havoc #t~mem7.base, #t~mem7.offset; [L1021] call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4); [L1022] call write~int(~unnamed1~0~BLACK, ~end~0.base, 4 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1005] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, #t~nondet2=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1005-L1024] assume !(0 != #t~nondet2); [L1005] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1026] ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset; [L1027] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, ~end~0.base=25, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1030] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, ~end~0.base=25, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1031] call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, #t~mem8=1, ~end~0.base=25, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1031] assume !!(~unnamed1~0~BLACK == #t~mem8); [L1031] havoc #t~mem8; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, ~end~0.base=25, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1033-L1043] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); [L1035] call #t~mem9 := read~int(~end~0.base, 4 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, #t~mem9=1, ~end~0.base=25, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1035-L1040] assume !(~unnamed1~0~RED == #t~mem9); [L1035] havoc #t~mem9; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, ~end~0.base=25, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1042] call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); [L1042] ~end~0.base, ~end~0.offset := #t~mem12.base, #t~mem12.offset; [L1042] havoc #t~mem12.base, #t~mem12.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, ~end~0.base=14, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1033-L1043] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); [L1035] call #t~mem9 := read~int(~end~0.base, 4 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, #t~mem9=0, ~end~0.base=14, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1035-L1040] assume ~unnamed1~0~RED == #t~mem9; [L1035] havoc #t~mem9; [L1037] call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); [L1037] ~end~0.base, ~end~0.offset := #t~mem10.base, #t~mem10.offset; [L1037] havoc #t~mem10.base, #t~mem10.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1038] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1039] call #t~mem11 := read~int(~end~0.base, 4 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, #t~mem11=1, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1039] assume !(~unnamed1~0~BLACK != #t~mem11); [L1039] havoc #t~mem11; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1039] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=17, #NULL.offset=9, old(#NULL.base)=17, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=17, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=17, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L994] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L994] ~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset; [L995] call write~int(~unnamed1~0~BLACK, ~null~0.base, 4 + ~null~0.offset, 4); [L996] call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4); [L998] call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8); [L998] ~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset; [L999] call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4); [L1000] call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4); [L1002] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, ~end~0.base=25, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1005] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~nondet2=1, ~end~0.base=25, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1005-L1024] assume !!(0 != #t~nondet2); [L1005] havoc #t~nondet2; [L1008] call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8); [L1008] call write~$Pointer$(#t~malloc3.base, #t~malloc3.offset, ~end~0.base, ~end~0.offset, 4); [L1009] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); [L1009] ~end~0.base, ~end~0.offset := #t~mem4.base, #t~mem4.offset; [L1009] havoc #t~mem4.base, #t~mem4.offset; [L1010] call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4); [L1012] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~nondet5=0, ~end~0.base=14, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1012-L1023] assume !(0 != #t~nondet5); [L1012] havoc #t~nondet5; [L1018] call write~int(~unnamed1~0~RED, ~end~0.base, 4 + ~end~0.offset, 4); [L1019] call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(8); [L1019] call write~$Pointer$(#t~malloc6.base, #t~malloc6.offset, ~end~0.base, ~end~0.offset, 4); [L1020] call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); [L1020] ~end~0.base, ~end~0.offset := #t~mem7.base, #t~mem7.offset; [L1020] havoc #t~mem7.base, #t~mem7.offset; [L1021] call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4); [L1022] call write~int(~unnamed1~0~BLACK, ~end~0.base, 4 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1005] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, #t~nondet2=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1005-L1024] assume !(0 != #t~nondet2); [L1005] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1026] ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset; [L1027] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, ~end~0.base=25, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1030] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, ~end~0.base=25, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1031] call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, #t~mem8=1, ~end~0.base=25, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1031] assume !!(~unnamed1~0~BLACK == #t~mem8); [L1031] havoc #t~mem8; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, ~end~0.base=25, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1033-L1043] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); [L1035] call #t~mem9 := read~int(~end~0.base, 4 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, #t~mem9=1, ~end~0.base=25, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1035-L1040] assume !(~unnamed1~0~RED == #t~mem9); [L1035] havoc #t~mem9; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, ~end~0.base=25, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1042] call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); [L1042] ~end~0.base, ~end~0.offset := #t~mem12.base, #t~mem12.offset; [L1042] havoc #t~mem12.base, #t~mem12.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, ~end~0.base=14, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1033-L1043] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); [L1035] call #t~mem9 := read~int(~end~0.base, 4 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, #t~mem9=0, ~end~0.base=14, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1035-L1040] assume ~unnamed1~0~RED == #t~mem9; [L1035] havoc #t~mem9; [L1037] call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); [L1037] ~end~0.base, ~end~0.offset := #t~mem10.base, #t~mem10.offset; [L1037] havoc #t~mem10.base, #t~mem10.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1038] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1039] call #t~mem11 := read~int(~end~0.base, 4 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, #t~mem11=1, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1039] assume !(~unnamed1~0~BLACK != #t~mem11); [L1039] havoc #t~mem11; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1039] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=17, #NULL!offset=9, old(#NULL!base)=17, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=17, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L994] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L994] ~null~0 := #t~malloc0; [L995] FCALL call write~int(~unnamed1~0~BLACK, { base: ~null~0!base, offset: 4 + ~null~0!offset }, 4); [L996] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~null~0!base, offset: ~null~0!offset }, 4); [L998] FCALL call #t~malloc1 := #Ultimate.alloc(8); [L998] ~list~0 := #t~malloc1; [L999] FCALL call write~$Pointer$(~null~0, { base: ~list~0!base, offset: ~list~0!offset }, 4); [L1000] FCALL call write~int(~unnamed1~0~BLACK, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L1002] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1005] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~nondet2=1, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1005-L1024] COND FALSE !(!(0 != #t~nondet2)) [L1005] havoc #t~nondet2; [L1008] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L1008] FCALL call write~$Pointer$(#t~malloc3, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1009] FCALL call #t~mem4 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1009] ~end~0 := #t~mem4; [L1009] havoc #t~mem4; [L1010] FCALL call write~$Pointer$(~null~0, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1012] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~nondet5=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1012-L1023] COND FALSE !(0 != #t~nondet5) [L1012] havoc #t~nondet5; [L1018] FCALL call write~int(~unnamed1~0~RED, { base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); [L1019] FCALL call #t~malloc6 := #Ultimate.alloc(8); [L1019] FCALL call write~$Pointer$(#t~malloc6, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1020] FCALL call #t~mem7 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1020] ~end~0 := #t~mem7; [L1020] havoc #t~mem7; [L1021] FCALL call write~$Pointer$(~null~0, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1022] FCALL call write~int(~unnamed1~0~BLACK, { base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1005] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, #t~nondet2=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1005-L1024] COND TRUE !(0 != #t~nondet2) [L1005] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1026] ~end~0 := ~null~0; [L1027] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1030] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1031] FCALL call #t~mem8 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, #t~mem8=1, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1031] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem8)) [L1031] havoc #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1033-L1043] COND FALSE !(!(~null~0 != ~end~0)) [L1035] FCALL call #t~mem9 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, #t~mem9=1, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1035] COND FALSE !(~unnamed1~0~RED == #t~mem9) [L1035] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1042] FCALL call #t~mem12 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1042] ~end~0 := #t~mem12; [L1042] havoc #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1033-L1043] COND FALSE !(!(~null~0 != ~end~0)) [L1035] FCALL call #t~mem9 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, #t~mem9=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1035] COND TRUE ~unnamed1~0~RED == #t~mem9 [L1035] havoc #t~mem9; [L1037] FCALL call #t~mem10 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1037] ~end~0 := #t~mem10; [L1037] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1038] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1039] FCALL call #t~mem11 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, #t~mem11=1, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1039] COND TRUE !(~unnamed1~0~BLACK != #t~mem11) [L1039] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1039] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=17, #NULL!offset=9, old(#NULL!base)=17, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=17, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L994] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L994] ~null~0 := #t~malloc0; [L995] FCALL call write~int(~unnamed1~0~BLACK, { base: ~null~0!base, offset: 4 + ~null~0!offset }, 4); [L996] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~null~0!base, offset: ~null~0!offset }, 4); [L998] FCALL call #t~malloc1 := #Ultimate.alloc(8); [L998] ~list~0 := #t~malloc1; [L999] FCALL call write~$Pointer$(~null~0, { base: ~list~0!base, offset: ~list~0!offset }, 4); [L1000] FCALL call write~int(~unnamed1~0~BLACK, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L1002] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1005] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~nondet2=1, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1005-L1024] COND FALSE !(!(0 != #t~nondet2)) [L1005] havoc #t~nondet2; [L1008] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L1008] FCALL call write~$Pointer$(#t~malloc3, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1009] FCALL call #t~mem4 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1009] ~end~0 := #t~mem4; [L1009] havoc #t~mem4; [L1010] FCALL call write~$Pointer$(~null~0, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1012] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~nondet5=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1012-L1023] COND FALSE !(0 != #t~nondet5) [L1012] havoc #t~nondet5; [L1018] FCALL call write~int(~unnamed1~0~RED, { base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); [L1019] FCALL call #t~malloc6 := #Ultimate.alloc(8); [L1019] FCALL call write~$Pointer$(#t~malloc6, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1020] FCALL call #t~mem7 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1020] ~end~0 := #t~mem7; [L1020] havoc #t~mem7; [L1021] FCALL call write~$Pointer$(~null~0, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1022] FCALL call write~int(~unnamed1~0~BLACK, { base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1005] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, #t~nondet2=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1005-L1024] COND TRUE !(0 != #t~nondet2) [L1005] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1026] ~end~0 := ~null~0; [L1027] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1030] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1031] FCALL call #t~mem8 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, #t~mem8=1, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1031] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem8)) [L1031] havoc #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1033-L1043] COND FALSE !(!(~null~0 != ~end~0)) [L1035] FCALL call #t~mem9 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, #t~mem9=1, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1035] COND FALSE !(~unnamed1~0~RED == #t~mem9) [L1035] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1042] FCALL call #t~mem12 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1042] ~end~0 := #t~mem12; [L1042] havoc #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1033-L1043] COND FALSE !(!(~null~0 != ~end~0)) [L1035] FCALL call #t~mem9 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, #t~mem9=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1035] COND TRUE ~unnamed1~0~RED == #t~mem9 [L1035] havoc #t~mem9; [L1037] FCALL call #t~mem10 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1037] ~end~0 := #t~mem10; [L1037] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1038] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1039] FCALL call #t~mem11 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, #t~mem11=1, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1039] COND TRUE !(~unnamed1~0~BLACK != #t~mem11) [L1039] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1039] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=17, #NULL!offset=9, old(#NULL!base)=17, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=17, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L994] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L994] ~null~0 := #t~malloc0; [L995] FCALL call write~int(~unnamed1~0~BLACK, { base: ~null~0!base, offset: 4 + ~null~0!offset }, 4); [L996] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~null~0!base, offset: ~null~0!offset }, 4); [L998] FCALL call #t~malloc1 := #Ultimate.alloc(8); [L998] ~list~0 := #t~malloc1; [L999] FCALL call write~$Pointer$(~null~0, { base: ~list~0!base, offset: ~list~0!offset }, 4); [L1000] FCALL call write~int(~unnamed1~0~BLACK, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L1002] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1005] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~nondet2=1, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1005-L1024] COND FALSE !(!(0 != #t~nondet2)) [L1005] havoc #t~nondet2; [L1008] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L1008] FCALL call write~$Pointer$(#t~malloc3, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1009] FCALL call #t~mem4 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1009] ~end~0 := #t~mem4; [L1009] havoc #t~mem4; [L1010] FCALL call write~$Pointer$(~null~0, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1012] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~nondet5=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1012-L1023] COND FALSE !(0 != #t~nondet5) [L1012] havoc #t~nondet5; [L1018] FCALL call write~int(~unnamed1~0~RED, { base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); [L1019] FCALL call #t~malloc6 := #Ultimate.alloc(8); [L1019] FCALL call write~$Pointer$(#t~malloc6, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1020] FCALL call #t~mem7 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1020] ~end~0 := #t~mem7; [L1020] havoc #t~mem7; [L1021] FCALL call write~$Pointer$(~null~0, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1022] FCALL call write~int(~unnamed1~0~BLACK, { base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1005] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, #t~nondet2=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1005-L1024] COND TRUE !(0 != #t~nondet2) [L1005] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1026] ~end~0 := ~null~0; [L1027] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1030] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1031] FCALL call #t~mem8 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, #t~mem8=1, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1031] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem8)) [L1031] havoc #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1033-L1043] COND FALSE !(!(~null~0 != ~end~0)) [L1035] FCALL call #t~mem9 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, #t~mem9=1, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1035] COND FALSE !(~unnamed1~0~RED == #t~mem9) [L1035] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1042] FCALL call #t~mem12 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1042] ~end~0 := #t~mem12; [L1042] havoc #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1033-L1043] COND FALSE !(!(~null~0 != ~end~0)) [L1035] FCALL call #t~mem9 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, #t~mem9=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1035] COND TRUE ~unnamed1~0~RED == #t~mem9 [L1035] havoc #t~mem9; [L1037] FCALL call #t~mem10 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1037] ~end~0 := #t~mem10; [L1037] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1038] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1039] FCALL call #t~mem11 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, #t~mem11=1, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1039] COND TRUE !(~unnamed1~0~BLACK != #t~mem11) [L1039] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1039] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=17, #NULL!offset=9, old(#NULL!base)=17, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=17, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L994] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L994] ~null~0 := #t~malloc0; [L995] FCALL call write~int(~unnamed1~0~BLACK, { base: ~null~0!base, offset: 4 + ~null~0!offset }, 4); [L996] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~null~0!base, offset: ~null~0!offset }, 4); [L998] FCALL call #t~malloc1 := #Ultimate.alloc(8); [L998] ~list~0 := #t~malloc1; [L999] FCALL call write~$Pointer$(~null~0, { base: ~list~0!base, offset: ~list~0!offset }, 4); [L1000] FCALL call write~int(~unnamed1~0~BLACK, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L1002] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1005] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~nondet2=1, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1005-L1024] COND FALSE !(!(0 != #t~nondet2)) [L1005] havoc #t~nondet2; [L1008] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L1008] FCALL call write~$Pointer$(#t~malloc3, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1009] FCALL call #t~mem4 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1009] ~end~0 := #t~mem4; [L1009] havoc #t~mem4; [L1010] FCALL call write~$Pointer$(~null~0, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1012] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~nondet5=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1012-L1023] COND FALSE !(0 != #t~nondet5) [L1012] havoc #t~nondet5; [L1018] FCALL call write~int(~unnamed1~0~RED, { base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); [L1019] FCALL call #t~malloc6 := #Ultimate.alloc(8); [L1019] FCALL call write~$Pointer$(#t~malloc6, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1020] FCALL call #t~mem7 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1020] ~end~0 := #t~mem7; [L1020] havoc #t~mem7; [L1021] FCALL call write~$Pointer$(~null~0, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1022] FCALL call write~int(~unnamed1~0~BLACK, { base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1005] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, #t~nondet2=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1005-L1024] COND TRUE !(0 != #t~nondet2) [L1005] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1026] ~end~0 := ~null~0; [L1027] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1030] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1031] FCALL call #t~mem8 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, #t~mem8=1, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1031] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem8)) [L1031] havoc #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1033-L1043] COND FALSE !(!(~null~0 != ~end~0)) [L1035] FCALL call #t~mem9 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, #t~mem9=1, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1035] COND FALSE !(~unnamed1~0~RED == #t~mem9) [L1035] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1042] FCALL call #t~mem12 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1042] ~end~0 := #t~mem12; [L1042] havoc #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1033-L1043] COND FALSE !(!(~null~0 != ~end~0)) [L1035] FCALL call #t~mem9 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, #t~mem9=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1035] COND TRUE ~unnamed1~0~RED == #t~mem9 [L1035] havoc #t~mem9; [L1037] FCALL call #t~mem10 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1037] ~end~0 := #t~mem10; [L1037] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1038] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1039] FCALL call #t~mem11 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, #t~mem11=1, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1039] COND TRUE !(~unnamed1~0~BLACK != #t~mem11) [L1039] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1039] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L994] SLL* null = malloc(sizeof(SLL)); [L995] null->colour = BLACK [L996] null->next = ((void*)0) [L998] SLL* list = malloc(sizeof(SLL)); [L999] list->next = null [L1000] list->colour = BLACK [L1002] SLL* end = list; VAL [end={25:0}, list={25:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={25:0}, null={15:0}] [L1005] COND TRUE __VERIFIER_nondet_int() [L1008] end->next = malloc(sizeof(SLL)) [L1009] EXPR end->next [L1009] end = end->next [L1010] end->next = null [L1012] COND FALSE !(__VERIFIER_nondet_int()) [L1018] end->colour = RED [L1019] end->next = malloc(sizeof(SLL)) [L1020] EXPR end->next [L1020] end = end->next [L1021] end->next = null [L1022] end->colour = BLACK VAL [end={26:0}, list={25:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={25:0}, malloc(sizeof(SLL))={26:0}, null={15:0}] [L1005] COND FALSE !(__VERIFIER_nondet_int()) [L1026] end = null [L1027] end = list VAL [end={25:0}, list={25:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={25:0}, malloc(sizeof(SLL))={26:0}, null={15:0}] [L1030] COND FALSE !(!(null != end)) VAL [end={25:0}, list={25:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={25:0}, malloc(sizeof(SLL))={26:0}, null={15:0}] [L1031] EXPR end->colour VAL [end={25:0}, end->colour=1, list={25:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={25:0}, malloc(sizeof(SLL))={26:0}, null={15:0}] [L1031] COND FALSE !(!(BLACK == end->colour)) [L1033] COND TRUE null != end [L1035] EXPR end->colour VAL [end={25:0}, end->colour=1, list={25:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={25:0}, malloc(sizeof(SLL))={26:0}, null={15:0}] [L1035] COND FALSE !(RED == end->colour) [L1042] EXPR end->next [L1042] end = end->next [L1033] COND TRUE null != end [L1035] EXPR end->colour VAL [end={14:0}, end->colour=0, list={25:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={25:0}, malloc(sizeof(SLL))={26:0}, null={15:0}] [L1035] COND TRUE RED == end->colour [L1037] EXPR end->next [L1037] end = end->next [L1038] COND FALSE !(!(null != end)) VAL [end={26:0}, list={25:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={25:0}, malloc(sizeof(SLL))={26:0}, null={15:0}] [L1039] EXPR end->colour VAL [end={26:0}, end->colour=1, list={25:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={25:0}, malloc(sizeof(SLL))={26:0}, null={15:0}] [L1039] COND TRUE !(BLACK != end->colour) [L1039] __VERIFIER_error() VAL [end={26:0}, list={25:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={25:0}, malloc(sizeof(SLL))={26:0}, null={15:0}] ----- [2018-11-23 00:21:47,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:21:47 BoogieIcfgContainer [2018-11-23 00:21:47,887 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 00:21:47,887 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 00:21:47,887 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 00:21:47,887 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 00:21:47,888 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:21:35" (3/4) ... [2018-11-23 00:21:47,895 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=17, |#NULL.offset|=9, |old(#NULL.base)|=17, |old(#NULL.offset)|=9] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=17, |old(#NULL.offset)|=9] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=17, |old(#NULL.offset)|=9] [?] RET #136#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret17 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~int(~unnamed1~0~BLACK, ~null~0.base, 4 + ~null~0.offset, 4);call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8);~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4);call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [main_~end~0.base=25, main_~end~0.offset=0, main_~list~0.base=25, main_~list~0.offset=0, main_~null~0.base=15, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=25, |main_#t~malloc1.offset|=0] [?] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [main_~end~0.base=25, main_~end~0.offset=0, main_~list~0.base=25, main_~list~0.offset=0, main_~null~0.base=15, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=25, |main_#t~malloc1.offset|=0, |main_#t~nondet2|=1] [?] assume !!(0 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8);call write~$Pointer$(#t~malloc3.base, #t~malloc3.offset, ~end~0.base, ~end~0.offset, 4);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [main_~end~0.base=14, main_~end~0.offset=0, main_~list~0.base=25, main_~list~0.offset=0, main_~null~0.base=15, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=25, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=14, |main_#t~malloc3.offset|=0, |main_#t~nondet5|=0] [?] assume !(0 != #t~nondet5);havoc #t~nondet5;call write~int(~unnamed1~0~RED, ~end~0.base, 4 + ~end~0.offset, 4);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(8);call write~$Pointer$(#t~malloc6.base, #t~malloc6.offset, ~end~0.base, ~end~0.offset, 4);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4);call write~int(~unnamed1~0~BLACK, ~end~0.base, 4 + ~end~0.offset, 4); VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=25, main_~list~0.offset=0, main_~null~0.base=15, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=25, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=14, |main_#t~malloc3.offset|=0, |main_#t~malloc6.base|=26, |main_#t~malloc6.offset|=0] [?] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=25, main_~list~0.offset=0, main_~null~0.base=15, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=25, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=14, |main_#t~malloc3.offset|=0, |main_#t~malloc6.base|=26, |main_#t~malloc6.offset|=0, |main_#t~nondet2|=0] [?] assume !(0 != #t~nondet2);havoc #t~nondet2; VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=25, main_~list~0.offset=0, main_~null~0.base=15, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=25, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=14, |main_#t~malloc3.offset|=0, |main_#t~malloc6.base|=26, |main_#t~malloc6.offset|=0] [?] ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [main_~end~0.base=25, main_~end~0.offset=0, main_~list~0.base=25, main_~list~0.offset=0, main_~null~0.base=15, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=25, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=14, |main_#t~malloc3.offset|=0, |main_#t~malloc6.base|=26, |main_#t~malloc6.offset|=0] [?] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [main_~end~0.base=25, main_~end~0.offset=0, main_~list~0.base=25, main_~list~0.offset=0, main_~null~0.base=15, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=25, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=14, |main_#t~malloc3.offset|=0, |main_#t~malloc6.base|=26, |main_#t~malloc6.offset|=0] [?] goto; VAL [main_~end~0.base=25, main_~end~0.offset=0, main_~list~0.base=25, main_~list~0.offset=0, main_~null~0.base=15, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=25, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=14, |main_#t~malloc3.offset|=0, |main_#t~malloc6.base|=26, |main_#t~malloc6.offset|=0] [?] call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); VAL [main_~end~0.base=25, main_~end~0.offset=0, main_~list~0.base=25, main_~list~0.offset=0, main_~null~0.base=15, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=25, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=14, |main_#t~malloc3.offset|=0, |main_#t~malloc6.base|=26, |main_#t~malloc6.offset|=0, |main_#t~mem8|=1] [?] assume !!(~unnamed1~0~BLACK == #t~mem8);havoc #t~mem8; VAL [main_~end~0.base=25, main_~end~0.offset=0, main_~list~0.base=25, main_~list~0.offset=0, main_~null~0.base=15, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=25, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=14, |main_#t~malloc3.offset|=0, |main_#t~malloc6.base|=26, |main_#t~malloc6.offset|=0] [?] goto; VAL [main_~end~0.base=25, main_~end~0.offset=0, main_~list~0.base=25, main_~list~0.offset=0, main_~null~0.base=15, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=25, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=14, |main_#t~malloc3.offset|=0, |main_#t~malloc6.base|=26, |main_#t~malloc6.offset|=0] [?] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset);call #t~mem9 := read~int(~end~0.base, 4 + ~end~0.offset, 4); VAL [main_~end~0.base=25, main_~end~0.offset=0, main_~list~0.base=25, main_~list~0.offset=0, main_~null~0.base=15, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=25, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=14, |main_#t~malloc3.offset|=0, |main_#t~malloc6.base|=26, |main_#t~malloc6.offset|=0, |main_#t~mem9|=1] [?] assume !(~unnamed1~0~RED == #t~mem9);havoc #t~mem9; VAL [main_~end~0.base=25, main_~end~0.offset=0, main_~list~0.base=25, main_~list~0.offset=0, main_~null~0.base=15, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=25, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=14, |main_#t~malloc3.offset|=0, |main_#t~malloc6.base|=26, |main_#t~malloc6.offset|=0] [?] call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset; VAL [main_~end~0.base=14, main_~end~0.offset=0, main_~list~0.base=25, main_~list~0.offset=0, main_~null~0.base=15, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=25, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=14, |main_#t~malloc3.offset|=0, |main_#t~malloc6.base|=26, |main_#t~malloc6.offset|=0] [?] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset);call #t~mem9 := read~int(~end~0.base, 4 + ~end~0.offset, 4); VAL [main_~end~0.base=14, main_~end~0.offset=0, main_~list~0.base=25, main_~list~0.offset=0, main_~null~0.base=15, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=25, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=14, |main_#t~malloc3.offset|=0, |main_#t~malloc6.base|=26, |main_#t~malloc6.offset|=0, |main_#t~mem9|=0] [?] assume ~unnamed1~0~RED == #t~mem9;havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=25, main_~list~0.offset=0, main_~null~0.base=15, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=25, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=14, |main_#t~malloc3.offset|=0, |main_#t~malloc6.base|=26, |main_#t~malloc6.offset|=0] [?] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=25, main_~list~0.offset=0, main_~null~0.base=15, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=25, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=14, |main_#t~malloc3.offset|=0, |main_#t~malloc6.base|=26, |main_#t~malloc6.offset|=0] [?] goto; VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=25, main_~list~0.offset=0, main_~null~0.base=15, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=25, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=14, |main_#t~malloc3.offset|=0, |main_#t~malloc6.base|=26, |main_#t~malloc6.offset|=0] [?] call #t~mem11 := read~int(~end~0.base, 4 + ~end~0.offset, 4); VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=25, main_~list~0.offset=0, main_~null~0.base=15, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=25, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=14, |main_#t~malloc3.offset|=0, |main_#t~malloc6.base|=26, |main_#t~malloc6.offset|=0, |main_#t~mem11|=1] [?] assume !(~unnamed1~0~BLACK != #t~mem11);havoc #t~mem11; VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=25, main_~list~0.offset=0, main_~null~0.base=15, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=25, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=14, |main_#t~malloc3.offset|=0, |main_#t~malloc6.base|=26, |main_#t~malloc6.offset|=0] [?] assume !false; VAL [main_~end~0.base=26, main_~end~0.offset=0, main_~list~0.base=25, main_~list~0.offset=0, main_~null~0.base=15, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=25, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=14, |main_#t~malloc3.offset|=0, |main_#t~malloc6.base|=26, |main_#t~malloc6.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=17, #NULL.offset=9, old(#NULL.base)=17, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=17, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=17, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L994] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L994] ~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset; [L995] call write~int(~unnamed1~0~BLACK, ~null~0.base, 4 + ~null~0.offset, 4); [L996] call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4); [L998] call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8); [L998] ~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset; [L999] call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4); [L1000] call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4); [L1002] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, ~end~0.base=25, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1005] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~nondet2=1, ~end~0.base=25, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1005-L1024] assume !!(0 != #t~nondet2); [L1005] havoc #t~nondet2; [L1008] call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8); [L1008] call write~$Pointer$(#t~malloc3.base, #t~malloc3.offset, ~end~0.base, ~end~0.offset, 4); [L1009] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); [L1009] ~end~0.base, ~end~0.offset := #t~mem4.base, #t~mem4.offset; [L1009] havoc #t~mem4.base, #t~mem4.offset; [L1010] call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4); [L1012] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~nondet5=0, ~end~0.base=14, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1012-L1023] assume !(0 != #t~nondet5); [L1012] havoc #t~nondet5; [L1018] call write~int(~unnamed1~0~RED, ~end~0.base, 4 + ~end~0.offset, 4); [L1019] call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(8); [L1019] call write~$Pointer$(#t~malloc6.base, #t~malloc6.offset, ~end~0.base, ~end~0.offset, 4); [L1020] call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); [L1020] ~end~0.base, ~end~0.offset := #t~mem7.base, #t~mem7.offset; [L1020] havoc #t~mem7.base, #t~mem7.offset; [L1021] call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4); [L1022] call write~int(~unnamed1~0~BLACK, ~end~0.base, 4 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1005] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, #t~nondet2=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1005-L1024] assume !(0 != #t~nondet2); [L1005] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1026] ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset; [L1027] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, ~end~0.base=25, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1030] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, ~end~0.base=25, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1031] call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, #t~mem8=1, ~end~0.base=25, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1031] assume !!(~unnamed1~0~BLACK == #t~mem8); [L1031] havoc #t~mem8; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, ~end~0.base=25, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1033-L1043] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); [L1035] call #t~mem9 := read~int(~end~0.base, 4 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, #t~mem9=1, ~end~0.base=25, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1035-L1040] assume !(~unnamed1~0~RED == #t~mem9); [L1035] havoc #t~mem9; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, ~end~0.base=25, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1042] call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); [L1042] ~end~0.base, ~end~0.offset := #t~mem12.base, #t~mem12.offset; [L1042] havoc #t~mem12.base, #t~mem12.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, ~end~0.base=14, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1033-L1043] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); [L1035] call #t~mem9 := read~int(~end~0.base, 4 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, #t~mem9=0, ~end~0.base=14, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1035-L1040] assume ~unnamed1~0~RED == #t~mem9; [L1035] havoc #t~mem9; [L1037] call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); [L1037] ~end~0.base, ~end~0.offset := #t~mem10.base, #t~mem10.offset; [L1037] havoc #t~mem10.base, #t~mem10.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1038] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1039] call #t~mem11 := read~int(~end~0.base, 4 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, #t~mem11=1, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1039] assume !(~unnamed1~0~BLACK != #t~mem11); [L1039] havoc #t~mem11; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1039] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=17, #NULL.offset=9, old(#NULL.base)=17, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=17, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=17, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L994] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L994] ~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset; [L995] call write~int(~unnamed1~0~BLACK, ~null~0.base, 4 + ~null~0.offset, 4); [L996] call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4); [L998] call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8); [L998] ~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset; [L999] call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4); [L1000] call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4); [L1002] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, ~end~0.base=25, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1005] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~nondet2=1, ~end~0.base=25, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1005-L1024] assume !!(0 != #t~nondet2); [L1005] havoc #t~nondet2; [L1008] call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8); [L1008] call write~$Pointer$(#t~malloc3.base, #t~malloc3.offset, ~end~0.base, ~end~0.offset, 4); [L1009] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); [L1009] ~end~0.base, ~end~0.offset := #t~mem4.base, #t~mem4.offset; [L1009] havoc #t~mem4.base, #t~mem4.offset; [L1010] call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4); [L1012] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~nondet5=0, ~end~0.base=14, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1012-L1023] assume !(0 != #t~nondet5); [L1012] havoc #t~nondet5; [L1018] call write~int(~unnamed1~0~RED, ~end~0.base, 4 + ~end~0.offset, 4); [L1019] call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(8); [L1019] call write~$Pointer$(#t~malloc6.base, #t~malloc6.offset, ~end~0.base, ~end~0.offset, 4); [L1020] call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); [L1020] ~end~0.base, ~end~0.offset := #t~mem7.base, #t~mem7.offset; [L1020] havoc #t~mem7.base, #t~mem7.offset; [L1021] call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4); [L1022] call write~int(~unnamed1~0~BLACK, ~end~0.base, 4 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1005] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, #t~nondet2=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1005-L1024] assume !(0 != #t~nondet2); [L1005] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1026] ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset; [L1027] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, ~end~0.base=25, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1030] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, ~end~0.base=25, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1031] call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, #t~mem8=1, ~end~0.base=25, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1031] assume !!(~unnamed1~0~BLACK == #t~mem8); [L1031] havoc #t~mem8; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, ~end~0.base=25, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1033-L1043] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); [L1035] call #t~mem9 := read~int(~end~0.base, 4 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, #t~mem9=1, ~end~0.base=25, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1035-L1040] assume !(~unnamed1~0~RED == #t~mem9); [L1035] havoc #t~mem9; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, ~end~0.base=25, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1042] call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); [L1042] ~end~0.base, ~end~0.offset := #t~mem12.base, #t~mem12.offset; [L1042] havoc #t~mem12.base, #t~mem12.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, ~end~0.base=14, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1033-L1043] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); [L1035] call #t~mem9 := read~int(~end~0.base, 4 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, #t~mem9=0, ~end~0.base=14, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1035-L1040] assume ~unnamed1~0~RED == #t~mem9; [L1035] havoc #t~mem9; [L1037] call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); [L1037] ~end~0.base, ~end~0.offset := #t~mem10.base, #t~mem10.offset; [L1037] havoc #t~mem10.base, #t~mem10.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1038] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1039] call #t~mem11 := read~int(~end~0.base, 4 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, #t~mem11=1, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1039] assume !(~unnamed1~0~BLACK != #t~mem11); [L1039] havoc #t~mem11; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [L1039] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc1.base=25, #t~malloc1.offset=0, #t~malloc3.base=14, #t~malloc3.offset=0, #t~malloc6.base=26, #t~malloc6.offset=0, ~end~0.base=26, ~end~0.offset=0, ~list~0.base=25, ~list~0.offset=0, ~null~0.base=15, ~null~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=17, #NULL!offset=9, old(#NULL!base)=17, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=17, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L994] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L994] ~null~0 := #t~malloc0; [L995] FCALL call write~int(~unnamed1~0~BLACK, { base: ~null~0!base, offset: 4 + ~null~0!offset }, 4); [L996] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~null~0!base, offset: ~null~0!offset }, 4); [L998] FCALL call #t~malloc1 := #Ultimate.alloc(8); [L998] ~list~0 := #t~malloc1; [L999] FCALL call write~$Pointer$(~null~0, { base: ~list~0!base, offset: ~list~0!offset }, 4); [L1000] FCALL call write~int(~unnamed1~0~BLACK, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L1002] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1005] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~nondet2=1, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1005-L1024] COND FALSE !(!(0 != #t~nondet2)) [L1005] havoc #t~nondet2; [L1008] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L1008] FCALL call write~$Pointer$(#t~malloc3, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1009] FCALL call #t~mem4 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1009] ~end~0 := #t~mem4; [L1009] havoc #t~mem4; [L1010] FCALL call write~$Pointer$(~null~0, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1012] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~nondet5=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1012-L1023] COND FALSE !(0 != #t~nondet5) [L1012] havoc #t~nondet5; [L1018] FCALL call write~int(~unnamed1~0~RED, { base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); [L1019] FCALL call #t~malloc6 := #Ultimate.alloc(8); [L1019] FCALL call write~$Pointer$(#t~malloc6, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1020] FCALL call #t~mem7 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1020] ~end~0 := #t~mem7; [L1020] havoc #t~mem7; [L1021] FCALL call write~$Pointer$(~null~0, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1022] FCALL call write~int(~unnamed1~0~BLACK, { base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1005] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, #t~nondet2=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1005-L1024] COND TRUE !(0 != #t~nondet2) [L1005] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1026] ~end~0 := ~null~0; [L1027] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1030] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1031] FCALL call #t~mem8 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, #t~mem8=1, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1031] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem8)) [L1031] havoc #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1033-L1043] COND FALSE !(!(~null~0 != ~end~0)) [L1035] FCALL call #t~mem9 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, #t~mem9=1, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1035] COND FALSE !(~unnamed1~0~RED == #t~mem9) [L1035] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1042] FCALL call #t~mem12 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1042] ~end~0 := #t~mem12; [L1042] havoc #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1033-L1043] COND FALSE !(!(~null~0 != ~end~0)) [L1035] FCALL call #t~mem9 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, #t~mem9=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1035] COND TRUE ~unnamed1~0~RED == #t~mem9 [L1035] havoc #t~mem9; [L1037] FCALL call #t~mem10 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1037] ~end~0 := #t~mem10; [L1037] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1038] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1039] FCALL call #t~mem11 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, #t~mem11=1, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1039] COND TRUE !(~unnamed1~0~BLACK != #t~mem11) [L1039] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1039] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=17, #NULL!offset=9, old(#NULL!base)=17, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=17, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L994] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L994] ~null~0 := #t~malloc0; [L995] FCALL call write~int(~unnamed1~0~BLACK, { base: ~null~0!base, offset: 4 + ~null~0!offset }, 4); [L996] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~null~0!base, offset: ~null~0!offset }, 4); [L998] FCALL call #t~malloc1 := #Ultimate.alloc(8); [L998] ~list~0 := #t~malloc1; [L999] FCALL call write~$Pointer$(~null~0, { base: ~list~0!base, offset: ~list~0!offset }, 4); [L1000] FCALL call write~int(~unnamed1~0~BLACK, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L1002] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1005] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~nondet2=1, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1005-L1024] COND FALSE !(!(0 != #t~nondet2)) [L1005] havoc #t~nondet2; [L1008] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L1008] FCALL call write~$Pointer$(#t~malloc3, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1009] FCALL call #t~mem4 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1009] ~end~0 := #t~mem4; [L1009] havoc #t~mem4; [L1010] FCALL call write~$Pointer$(~null~0, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1012] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~nondet5=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1012-L1023] COND FALSE !(0 != #t~nondet5) [L1012] havoc #t~nondet5; [L1018] FCALL call write~int(~unnamed1~0~RED, { base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); [L1019] FCALL call #t~malloc6 := #Ultimate.alloc(8); [L1019] FCALL call write~$Pointer$(#t~malloc6, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1020] FCALL call #t~mem7 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1020] ~end~0 := #t~mem7; [L1020] havoc #t~mem7; [L1021] FCALL call write~$Pointer$(~null~0, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1022] FCALL call write~int(~unnamed1~0~BLACK, { base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1005] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, #t~nondet2=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1005-L1024] COND TRUE !(0 != #t~nondet2) [L1005] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1026] ~end~0 := ~null~0; [L1027] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1030] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1031] FCALL call #t~mem8 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, #t~mem8=1, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1031] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem8)) [L1031] havoc #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1033-L1043] COND FALSE !(!(~null~0 != ~end~0)) [L1035] FCALL call #t~mem9 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, #t~mem9=1, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1035] COND FALSE !(~unnamed1~0~RED == #t~mem9) [L1035] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1042] FCALL call #t~mem12 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1042] ~end~0 := #t~mem12; [L1042] havoc #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1033-L1043] COND FALSE !(!(~null~0 != ~end~0)) [L1035] FCALL call #t~mem9 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, #t~mem9=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1035] COND TRUE ~unnamed1~0~RED == #t~mem9 [L1035] havoc #t~mem9; [L1037] FCALL call #t~mem10 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1037] ~end~0 := #t~mem10; [L1037] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1038] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1039] FCALL call #t~mem11 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, #t~mem11=1, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1039] COND TRUE !(~unnamed1~0~BLACK != #t~mem11) [L1039] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1039] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=17, #NULL!offset=9, old(#NULL!base)=17, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=17, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L994] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L994] ~null~0 := #t~malloc0; [L995] FCALL call write~int(~unnamed1~0~BLACK, { base: ~null~0!base, offset: 4 + ~null~0!offset }, 4); [L996] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~null~0!base, offset: ~null~0!offset }, 4); [L998] FCALL call #t~malloc1 := #Ultimate.alloc(8); [L998] ~list~0 := #t~malloc1; [L999] FCALL call write~$Pointer$(~null~0, { base: ~list~0!base, offset: ~list~0!offset }, 4); [L1000] FCALL call write~int(~unnamed1~0~BLACK, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L1002] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1005] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~nondet2=1, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1005-L1024] COND FALSE !(!(0 != #t~nondet2)) [L1005] havoc #t~nondet2; [L1008] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L1008] FCALL call write~$Pointer$(#t~malloc3, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1009] FCALL call #t~mem4 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1009] ~end~0 := #t~mem4; [L1009] havoc #t~mem4; [L1010] FCALL call write~$Pointer$(~null~0, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1012] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~nondet5=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1012-L1023] COND FALSE !(0 != #t~nondet5) [L1012] havoc #t~nondet5; [L1018] FCALL call write~int(~unnamed1~0~RED, { base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); [L1019] FCALL call #t~malloc6 := #Ultimate.alloc(8); [L1019] FCALL call write~$Pointer$(#t~malloc6, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1020] FCALL call #t~mem7 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1020] ~end~0 := #t~mem7; [L1020] havoc #t~mem7; [L1021] FCALL call write~$Pointer$(~null~0, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1022] FCALL call write~int(~unnamed1~0~BLACK, { base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1005] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, #t~nondet2=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1005-L1024] COND TRUE !(0 != #t~nondet2) [L1005] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1026] ~end~0 := ~null~0; [L1027] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1030] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1031] FCALL call #t~mem8 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, #t~mem8=1, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1031] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem8)) [L1031] havoc #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1033-L1043] COND FALSE !(!(~null~0 != ~end~0)) [L1035] FCALL call #t~mem9 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, #t~mem9=1, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1035] COND FALSE !(~unnamed1~0~RED == #t~mem9) [L1035] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1042] FCALL call #t~mem12 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1042] ~end~0 := #t~mem12; [L1042] havoc #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1033-L1043] COND FALSE !(!(~null~0 != ~end~0)) [L1035] FCALL call #t~mem9 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, #t~mem9=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1035] COND TRUE ~unnamed1~0~RED == #t~mem9 [L1035] havoc #t~mem9; [L1037] FCALL call #t~mem10 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1037] ~end~0 := #t~mem10; [L1037] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1038] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1039] FCALL call #t~mem11 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, #t~mem11=1, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1039] COND TRUE !(~unnamed1~0~BLACK != #t~mem11) [L1039] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1039] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=17, #NULL!offset=9, old(#NULL!base)=17, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=17, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L994] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L994] ~null~0 := #t~malloc0; [L995] FCALL call write~int(~unnamed1~0~BLACK, { base: ~null~0!base, offset: 4 + ~null~0!offset }, 4); [L996] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~null~0!base, offset: ~null~0!offset }, 4); [L998] FCALL call #t~malloc1 := #Ultimate.alloc(8); [L998] ~list~0 := #t~malloc1; [L999] FCALL call write~$Pointer$(~null~0, { base: ~list~0!base, offset: ~list~0!offset }, 4); [L1000] FCALL call write~int(~unnamed1~0~BLACK, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L1002] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1005] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~nondet2=1, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1005-L1024] COND FALSE !(!(0 != #t~nondet2)) [L1005] havoc #t~nondet2; [L1008] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L1008] FCALL call write~$Pointer$(#t~malloc3, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1009] FCALL call #t~mem4 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1009] ~end~0 := #t~mem4; [L1009] havoc #t~mem4; [L1010] FCALL call write~$Pointer$(~null~0, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1012] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~nondet5=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1012-L1023] COND FALSE !(0 != #t~nondet5) [L1012] havoc #t~nondet5; [L1018] FCALL call write~int(~unnamed1~0~RED, { base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); [L1019] FCALL call #t~malloc6 := #Ultimate.alloc(8); [L1019] FCALL call write~$Pointer$(#t~malloc6, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1020] FCALL call #t~mem7 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1020] ~end~0 := #t~mem7; [L1020] havoc #t~mem7; [L1021] FCALL call write~$Pointer$(~null~0, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1022] FCALL call write~int(~unnamed1~0~BLACK, { base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1005] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, #t~nondet2=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1005-L1024] COND TRUE !(0 != #t~nondet2) [L1005] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1026] ~end~0 := ~null~0; [L1027] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1030] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1031] FCALL call #t~mem8 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, #t~mem8=1, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1031] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem8)) [L1031] havoc #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1033-L1043] COND FALSE !(!(~null~0 != ~end~0)) [L1035] FCALL call #t~mem9 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, #t~mem9=1, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1035] COND FALSE !(~unnamed1~0~RED == #t~mem9) [L1035] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=25, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1042] FCALL call #t~mem12 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1042] ~end~0 := #t~mem12; [L1042] havoc #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1033-L1043] COND FALSE !(!(~null~0 != ~end~0)) [L1035] FCALL call #t~mem9 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, #t~mem9=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1035] COND TRUE ~unnamed1~0~RED == #t~mem9 [L1035] havoc #t~mem9; [L1037] FCALL call #t~mem10 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1037] ~end~0 := #t~mem10; [L1037] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1038] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1039] FCALL call #t~mem11 := read~int({ base: ~end~0!base, offset: 4 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, #t~mem11=1, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1039] COND TRUE !(~unnamed1~0~BLACK != #t~mem11) [L1039] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L1039] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc1!base=25, #t~malloc1!offset=0, #t~malloc3!base=14, #t~malloc3!offset=0, #t~malloc6!base=26, #t~malloc6!offset=0, ~end~0!base=26, ~end~0!offset=0, ~list~0!base=25, ~list~0!offset=0, ~null~0!base=15, ~null~0!offset=0] [L994] SLL* null = malloc(sizeof(SLL)); [L995] null->colour = BLACK [L996] null->next = ((void*)0) [L998] SLL* list = malloc(sizeof(SLL)); [L999] list->next = null [L1000] list->colour = BLACK [L1002] SLL* end = list; VAL [end={25:0}, list={25:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={25:0}, null={15:0}] [L1005] COND TRUE __VERIFIER_nondet_int() [L1008] end->next = malloc(sizeof(SLL)) [L1009] EXPR end->next [L1009] end = end->next [L1010] end->next = null [L1012] COND FALSE !(__VERIFIER_nondet_int()) [L1018] end->colour = RED [L1019] end->next = malloc(sizeof(SLL)) [L1020] EXPR end->next [L1020] end = end->next [L1021] end->next = null [L1022] end->colour = BLACK VAL [end={26:0}, list={25:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={25:0}, malloc(sizeof(SLL))={26:0}, null={15:0}] [L1005] COND FALSE !(__VERIFIER_nondet_int()) [L1026] end = null [L1027] end = list VAL [end={25:0}, list={25:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={25:0}, malloc(sizeof(SLL))={26:0}, null={15:0}] [L1030] COND FALSE !(!(null != end)) VAL [end={25:0}, list={25:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={25:0}, malloc(sizeof(SLL))={26:0}, null={15:0}] [L1031] EXPR end->colour VAL [end={25:0}, end->colour=1, list={25:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={25:0}, malloc(sizeof(SLL))={26:0}, null={15:0}] [L1031] COND FALSE !(!(BLACK == end->colour)) [L1033] COND TRUE null != end [L1035] EXPR end->colour VAL [end={25:0}, end->colour=1, list={25:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={25:0}, malloc(sizeof(SLL))={26:0}, null={15:0}] [L1035] COND FALSE !(RED == end->colour) [L1042] EXPR end->next [L1042] end = end->next [L1033] COND TRUE null != end [L1035] EXPR end->colour VAL [end={14:0}, end->colour=0, list={25:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={25:0}, malloc(sizeof(SLL))={26:0}, null={15:0}] [L1035] COND TRUE RED == end->colour [L1037] EXPR end->next [L1037] end = end->next [L1038] COND FALSE !(!(null != end)) VAL [end={26:0}, list={25:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={25:0}, malloc(sizeof(SLL))={26:0}, null={15:0}] [L1039] EXPR end->colour VAL [end={26:0}, end->colour=1, list={25:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={25:0}, malloc(sizeof(SLL))={26:0}, null={15:0}] [L1039] COND TRUE !(BLACK != end->colour) [L1039] __VERIFIER_error() VAL [end={26:0}, list={25:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={25:0}, malloc(sizeof(SLL))={26:0}, null={15:0}] ----- [2018-11-23 00:21:48,140 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8cfab3c6-995e-41c0-9c17-2085d33443a2/bin-2019/uautomizer/witness.graphml [2018-11-23 00:21:48,140 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 00:21:48,141 INFO L168 Benchmark]: Toolchain (without parser) took 12927.30 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 386.9 MB). Free memory was 956.6 MB in the beginning and 943.5 MB in the end (delta: 13.1 MB). Peak memory consumption was 400.0 MB. Max. memory is 11.5 GB. [2018-11-23 00:21:48,141 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:21:48,141 INFO L168 Benchmark]: CACSL2BoogieTranslator took 329.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -192.4 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. [2018-11-23 00:21:48,142 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.90 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 00:21:48,142 INFO L168 Benchmark]: Boogie Preprocessor took 25.42 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 00:21:48,142 INFO L168 Benchmark]: RCFGBuilder took 344.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: 34.8 MB). Peak memory consumption was 34.8 MB. Max. memory is 11.5 GB. [2018-11-23 00:21:48,142 INFO L168 Benchmark]: TraceAbstraction took 11951.09 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 225.4 MB). Free memory was 1.1 GB in the beginning and 953.5 MB in the end (delta: 157.3 MB). Peak memory consumption was 382.8 MB. Max. memory is 11.5 GB. [2018-11-23 00:21:48,142 INFO L168 Benchmark]: Witness Printer took 252.92 ms. Allocated memory is still 1.4 GB. Free memory was 953.5 MB in the beginning and 943.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. [2018-11-23 00:21:48,143 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * 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 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 329.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -192.4 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.90 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.42 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 344.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: 34.8 MB). Peak memory consumption was 34.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11951.09 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 225.4 MB). Free memory was 1.1 GB in the beginning and 953.5 MB in the end (delta: 157.3 MB). Peak memory consumption was 382.8 MB. Max. memory is 11.5 GB. * Witness Printer took 252.92 ms. Allocated memory is still 1.4 GB. Free memory was 953.5 MB in the beginning and 943.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1039]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L994] SLL* null = malloc(sizeof(SLL)); [L995] null->colour = BLACK [L996] null->next = ((void*)0) [L998] SLL* list = malloc(sizeof(SLL)); [L999] list->next = null [L1000] list->colour = BLACK [L1002] SLL* end = list; VAL [end={25:0}, list={25:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={25:0}, null={15:0}] [L1005] COND TRUE __VERIFIER_nondet_int() [L1008] end->next = malloc(sizeof(SLL)) [L1009] EXPR end->next [L1009] end = end->next [L1010] end->next = null [L1012] COND FALSE !(__VERIFIER_nondet_int()) [L1018] end->colour = RED [L1019] end->next = malloc(sizeof(SLL)) [L1020] EXPR end->next [L1020] end = end->next [L1021] end->next = null [L1022] end->colour = BLACK VAL [end={26:0}, list={25:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={25:0}, malloc(sizeof(SLL))={26:0}, null={15:0}] [L1005] COND FALSE !(__VERIFIER_nondet_int()) [L1026] end = null [L1027] end = list VAL [end={25:0}, list={25:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={25:0}, malloc(sizeof(SLL))={26:0}, null={15:0}] [L1030] COND FALSE !(!(null != end)) VAL [end={25:0}, list={25:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={25:0}, malloc(sizeof(SLL))={26:0}, null={15:0}] [L1031] EXPR end->colour VAL [end={25:0}, end->colour=1, list={25:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={25:0}, malloc(sizeof(SLL))={26:0}, null={15:0}] [L1031] COND FALSE !(!(BLACK == end->colour)) [L1033] COND TRUE null != end [L1035] EXPR end->colour VAL [end={25:0}, end->colour=1, list={25:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={25:0}, malloc(sizeof(SLL))={26:0}, null={15:0}] [L1035] COND FALSE !(RED == end->colour) [L1042] EXPR end->next [L1042] end = end->next [L1033] COND TRUE null != end [L1035] EXPR end->colour VAL [end={14:0}, end->colour=0, list={25:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={25:0}, malloc(sizeof(SLL))={26:0}, null={15:0}] [L1035] COND TRUE RED == end->colour [L1037] EXPR end->next [L1037] end = end->next [L1038] COND FALSE !(!(null != end)) VAL [end={26:0}, list={25:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={25:0}, malloc(sizeof(SLL))={26:0}, null={15:0}] [L1039] EXPR end->colour VAL [end={26:0}, end->colour=1, list={25:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={25:0}, malloc(sizeof(SLL))={26:0}, null={15:0}] [L1039] COND TRUE !(BLACK != end->colour) [L1039] __VERIFIER_error() VAL [end={26:0}, list={25:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={25:0}, malloc(sizeof(SLL))={26:0}, null={15:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 38 locations, 4 error locations. UNSAFE Result, 11.8s OverallTime, 13 OverallIterations, 3 TraceHistogramMax, 4.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 335 SDtfs, 843 SDslu, 1874 SDs, 0 SdLazy, 1749 SolverSat, 360 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 348 GetRequests, 152 SyntacticMatches, 12 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 671 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=9, traceCheckStatistics: No data available, 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: 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 275 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 454 NumberOfCodeBlocks, 454 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 407 ConstructedInterpolants, 44 QuantifiedInterpolants, 271204 SizeOfPredicates, 106 NumberOfNonLiveVariables, 1042 ConjunctsInSsa, 295 ConjunctsInUnsatCore, 20 InterpolantComputations, 4 PerfectInterpolantSequences, 7/92 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...