./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/dll-queue_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_7e0bba0c-d1cd-402d-a96d-e8b314a0df98/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7e0bba0c-d1cd-402d-a96d-e8b314a0df98/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7e0bba0c-d1cd-402d-a96d-e8b314a0df98/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7e0bba0c-d1cd-402d-a96d-e8b314a0df98/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/forester-heap/dll-queue_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_7e0bba0c-d1cd-402d-a96d-e8b314a0df98/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7e0bba0c-d1cd-402d-a96d-e8b314a0df98/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 39996758d4a4793ed5619e696b4574ccdffaa666 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 05:30:46,886 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 05:30:46,887 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 05:30:46,895 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 05:30:46,895 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 05:30:46,896 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 05:30:46,897 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 05:30:46,898 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 05:30:46,899 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 05:30:46,900 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 05:30:46,900 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 05:30:46,900 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 05:30:46,901 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 05:30:46,902 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 05:30:46,902 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 05:30:46,903 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 05:30:46,904 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 05:30:46,905 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 05:30:46,906 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 05:30:46,908 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 05:30:46,908 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 05:30:46,909 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 05:30:46,911 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 05:30:46,911 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 05:30:46,911 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 05:30:46,912 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 05:30:46,913 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 05:30:46,913 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 05:30:46,914 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 05:30:46,914 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 05:30:46,915 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 05:30:46,915 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 05:30:46,915 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 05:30:46,915 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 05:30:46,916 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 05:30:46,917 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 05:30:46,917 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7e0bba0c-d1cd-402d-a96d-e8b314a0df98/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 05:30:46,925 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 05:30:46,925 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 05:30:46,926 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 05:30:46,926 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 05:30:46,926 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 05:30:46,926 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 05:30:46,927 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 05:30:46,927 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 05:30:46,927 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 05:30:46,927 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 05:30:46,927 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 05:30:46,927 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 05:30:46,928 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 05:30:46,928 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 05:30:46,928 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 05:30:46,928 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 05:30:46,928 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 05:30:46,928 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 05:30:46,928 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 05:30:46,929 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 05:30:46,929 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 05:30:46,929 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 05:30:46,929 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 05:30:46,929 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 05:30:46,929 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 05:30:46,930 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 05:30:46,930 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 05:30:46,930 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 05:30:46,930 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 05:30:46,930 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 05:30:46,930 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_7e0bba0c-d1cd-402d-a96d-e8b314a0df98/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 -> 39996758d4a4793ed5619e696b4574ccdffaa666 [2018-11-23 05:30:46,953 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 05:30:46,962 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 05:30:46,965 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 05:30:46,966 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 05:30:46,966 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 05:30:46,967 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7e0bba0c-d1cd-402d-a96d-e8b314a0df98/bin-2019/uautomizer/../../sv-benchmarks/c/forester-heap/dll-queue_false-unreach-call_false-valid-memcleanup.i [2018-11-23 05:30:47,006 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7e0bba0c-d1cd-402d-a96d-e8b314a0df98/bin-2019/uautomizer/data/b1dd9355a/f5e2514e3d3f44aeb1142a04df4c2d28/FLAG57b47d858 [2018-11-23 05:30:47,429 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 05:30:47,430 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7e0bba0c-d1cd-402d-a96d-e8b314a0df98/sv-benchmarks/c/forester-heap/dll-queue_false-unreach-call_false-valid-memcleanup.i [2018-11-23 05:30:47,438 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7e0bba0c-d1cd-402d-a96d-e8b314a0df98/bin-2019/uautomizer/data/b1dd9355a/f5e2514e3d3f44aeb1142a04df4c2d28/FLAG57b47d858 [2018-11-23 05:30:47,446 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7e0bba0c-d1cd-402d-a96d-e8b314a0df98/bin-2019/uautomizer/data/b1dd9355a/f5e2514e3d3f44aeb1142a04df4c2d28 [2018-11-23 05:30:47,448 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 05:30:47,449 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 05:30:47,449 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 05:30:47,449 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 05:30:47,452 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 05:30:47,453 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:30:47" (1/1) ... [2018-11-23 05:30:47,455 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78e1a27c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:30:47, skipping insertion in model container [2018-11-23 05:30:47,456 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:30:47" (1/1) ... [2018-11-23 05:30:47,462 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 05:30:47,492 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 05:30:47,684 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:30:47,691 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 05:30:47,761 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:30:47,794 INFO L195 MainTranslator]: Completed translation [2018-11-23 05:30:47,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:30:47 WrapperNode [2018-11-23 05:30:47,794 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 05:30:47,795 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 05:30:47,795 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 05:30:47,795 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 05:30:47,800 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:30:47" (1/1) ... [2018-11-23 05:30:47,809 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:30:47" (1/1) ... [2018-11-23 05:30:47,814 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 05:30:47,814 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 05:30:47,814 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 05:30:47,815 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 05:30:47,822 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:30:47" (1/1) ... [2018-11-23 05:30:47,822 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:30:47" (1/1) ... [2018-11-23 05:30:47,825 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:30:47" (1/1) ... [2018-11-23 05:30:47,825 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:30:47" (1/1) ... [2018-11-23 05:30:47,836 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:30:47" (1/1) ... [2018-11-23 05:30:47,844 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:30:47" (1/1) ... [2018-11-23 05:30:47,846 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:30:47" (1/1) ... [2018-11-23 05:30:47,848 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 05:30:47,849 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 05:30:47,849 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 05:30:47,849 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 05:30:47,849 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:30:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e0bba0c-d1cd-402d-a96d-e8b314a0df98/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 05:30:47,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 05:30:47,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 05:30:47,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 05:30:47,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 05:30:47,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 05:30:47,888 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 05:30:47,888 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 05:30:47,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 05:30:47,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 05:30:47,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 05:30:47,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 05:30:47,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 05:30:48,236 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 05:30:48,236 INFO L280 CfgBuilder]: Removed 31 assue(true) statements. [2018-11-23 05:30:48,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:30:48 BoogieIcfgContainer [2018-11-23 05:30:48,237 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 05:30:48,237 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 05:30:48,237 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 05:30:48,240 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 05:30:48,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 05:30:47" (1/3) ... [2018-11-23 05:30:48,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eb7f5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 05:30:48, skipping insertion in model container [2018-11-23 05:30:48,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:30:47" (2/3) ... [2018-11-23 05:30:48,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eb7f5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 05:30:48, skipping insertion in model container [2018-11-23 05:30:48,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:30:48" (3/3) ... [2018-11-23 05:30:48,242 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-queue_false-unreach-call_false-valid-memcleanup.i [2018-11-23 05:30:48,249 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 05:30:48,254 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2018-11-23 05:30:48,264 INFO L257 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2018-11-23 05:30:48,285 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 05:30:48,286 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 05:30:48,286 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 05:30:48,286 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 05:30:48,286 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 05:30:48,286 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 05:30:48,286 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 05:30:48,286 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 05:30:48,286 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 05:30:48,300 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2018-11-23 05:30:48,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 05:30:48,304 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:30:48,305 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:30:48,307 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:30:48,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:30:48,312 INFO L82 PathProgramCache]: Analyzing trace with hash 786723767, now seen corresponding path program 1 times [2018-11-23 05:30:48,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:30:48,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:30:48,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:30:48,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:30:48,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:30:48,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:30:48,403 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 05:30:48,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:30:48,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 05:30:48,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 05:30:48,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 05:30:48,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 05:30:48,417 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 2 states. [2018-11-23 05:30:48,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:30:48,436 INFO L93 Difference]: Finished difference Result 174 states and 284 transitions. [2018-11-23 05:30:48,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 05:30:48,437 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-11-23 05:30:48,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:30:48,445 INFO L225 Difference]: With dead ends: 174 [2018-11-23 05:30:48,445 INFO L226 Difference]: Without dead ends: 84 [2018-11-23 05:30:48,448 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 05:30:48,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-23 05:30:48,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-11-23 05:30:48,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-23 05:30:48,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2018-11-23 05:30:48,476 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 9 [2018-11-23 05:30:48,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:30:48,476 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2018-11-23 05:30:48,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 05:30:48,476 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2018-11-23 05:30:48,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 05:30:48,476 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:30:48,476 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:30:48,477 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:30:48,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:30:48,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1383122703, now seen corresponding path program 1 times [2018-11-23 05:30:48,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:30:48,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:30:48,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:30:48,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:30:48,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:30:48,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:30:48,525 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 05:30:48,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:30:48,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:30:48,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:30:48,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:30:48,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:30:48,528 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand 3 states. [2018-11-23 05:30:48,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:30:48,562 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2018-11-23 05:30:48,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:30:48,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 05:30:48,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:30:48,563 INFO L225 Difference]: With dead ends: 84 [2018-11-23 05:30:48,563 INFO L226 Difference]: Without dead ends: 74 [2018-11-23 05:30:48,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:30:48,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-23 05:30:48,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-11-23 05:30:48,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-23 05:30:48,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2018-11-23 05:30:48,570 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 10 [2018-11-23 05:30:48,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:30:48,570 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2018-11-23 05:30:48,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:30:48,570 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2018-11-23 05:30:48,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 05:30:48,571 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:30:48,571 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:30:48,571 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:30:48,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:30:48,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1313288485, now seen corresponding path program 1 times [2018-11-23 05:30:48,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:30:48,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:30:48,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:30:48,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:30:48,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:30:48,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:30:48,627 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 05:30:48,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:30:48,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 05:30:48,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 05:30:48,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 05:30:48,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 05:30:48,629 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand 4 states. [2018-11-23 05:30:48,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:30:48,663 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2018-11-23 05:30:48,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:30:48,663 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-23 05:30:48,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:30:48,664 INFO L225 Difference]: With dead ends: 74 [2018-11-23 05:30:48,664 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 05:30:48,664 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 05:30:48,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 05:30:48,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-11-23 05:30:48,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 05:30:48,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2018-11-23 05:30:48,669 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 13 [2018-11-23 05:30:48,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:30:48,670 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2018-11-23 05:30:48,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 05:30:48,670 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2018-11-23 05:30:48,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 05:30:48,670 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:30:48,670 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:30:48,671 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:30:48,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:30:48,671 INFO L82 PathProgramCache]: Analyzing trace with hash -577581690, now seen corresponding path program 1 times [2018-11-23 05:30:48,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:30:48,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:30:48,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:30:48,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:30:48,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:30:48,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:30:48,704 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 05:30:48,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:30:48,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:30:48,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:30:48,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:30:48,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:30:48,705 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand 3 states. [2018-11-23 05:30:48,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:30:48,736 INFO L93 Difference]: Finished difference Result 157 states and 182 transitions. [2018-11-23 05:30:48,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:30:48,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 05:30:48,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:30:48,737 INFO L225 Difference]: With dead ends: 157 [2018-11-23 05:30:48,738 INFO L226 Difference]: Without dead ends: 91 [2018-11-23 05:30:48,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:30:48,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-23 05:30:48,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 80. [2018-11-23 05:30:48,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-23 05:30:48,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2018-11-23 05:30:48,745 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 16 [2018-11-23 05:30:48,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:30:48,745 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2018-11-23 05:30:48,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:30:48,745 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2018-11-23 05:30:48,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 05:30:48,746 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:30:48,746 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:30:48,748 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:30:48,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:30:48,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1346327205, now seen corresponding path program 1 times [2018-11-23 05:30:48,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:30:48,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:30:48,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:30:48,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:30:48,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:30:48,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:30:48,783 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 05:30:48,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:30:48,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:30:48,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:30:48,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:30:48,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:30:48,784 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 3 states. [2018-11-23 05:30:48,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:30:48,796 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2018-11-23 05:30:48,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:30:48,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 05:30:48,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:30:48,797 INFO L225 Difference]: With dead ends: 83 [2018-11-23 05:30:48,797 INFO L226 Difference]: Without dead ends: 81 [2018-11-23 05:30:48,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:30:48,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-23 05:30:48,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-11-23 05:30:48,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-23 05:30:48,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2018-11-23 05:30:48,803 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 21 [2018-11-23 05:30:48,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:30:48,803 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2018-11-23 05:30:48,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:30:48,804 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2018-11-23 05:30:48,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 05:30:48,804 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:30:48,804 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:30:48,805 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:30:48,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:30:48,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1346325283, now seen corresponding path program 1 times [2018-11-23 05:30:48,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:30:48,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:30:48,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:30:48,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:30:48,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:30:48,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:30:48,852 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 05:30:48,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:30:48,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 05:30:48,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 05:30:48,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 05:30:48,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 05:30:48,853 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand 4 states. [2018-11-23 05:30:48,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:30:48,894 INFO L93 Difference]: Finished difference Result 101 states and 115 transitions. [2018-11-23 05:30:48,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 05:30:48,895 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-23 05:30:48,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:30:48,896 INFO L225 Difference]: With dead ends: 101 [2018-11-23 05:30:48,896 INFO L226 Difference]: Without dead ends: 76 [2018-11-23 05:30:48,896 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 05:30:48,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-23 05:30:48,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-11-23 05:30:48,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-23 05:30:48,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2018-11-23 05:30:48,900 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 21 [2018-11-23 05:30:48,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:30:48,901 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2018-11-23 05:30:48,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 05:30:48,901 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2018-11-23 05:30:48,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 05:30:48,901 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:30:48,901 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, 1, 1] [2018-11-23 05:30:48,902 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:30:48,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:30:48,902 INFO L82 PathProgramCache]: Analyzing trace with hash -2021783647, now seen corresponding path program 1 times [2018-11-23 05:30:48,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:30:48,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:30:48,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:30:48,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:30:48,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:30:48,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:30:48,982 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 05:30:48,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:30:48,982 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e0bba0c-d1cd-402d-a96d-e8b314a0df98/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 05:30:48,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:30:49,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:30:49,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:30:49,047 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 6 treesize of output 5 [2018-11-23 05:30:49,048 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:49,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:49,061 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-23 05:30:49,071 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:49,072 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:49,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 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 05:30:49,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:49,087 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 97 treesize of output 57 [2018-11-23 05:30:49,140 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 05:30:49,140 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:49,158 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-11-23 05:30:49,162 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 10 treesize of output 9 [2018-11-23 05:30:49,163 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:49,197 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 35 treesize of output 37 [2018-11-23 05:30:49,218 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 2 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 05:30:49,219 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-23 05:30:49,244 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:30:49,274 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:30:49,300 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:30:49,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 05:30:49,322 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:111, output treesize:84 [2018-11-23 05:30:49,362 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 49 [2018-11-23 05:30:49,365 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:49,367 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 18 [2018-11-23 05:30:49,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:49,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:49,384 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 05:30:49,384 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:28 [2018-11-23 05:30:49,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2018-11-23 05:30:49,415 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 05:30:49,415 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:49,420 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 05:30:49,421 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:49,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:49,427 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 05:30:49,427 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:4 [2018-11-23 05:30:49,431 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 05:30:49,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:30:49,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-11-23 05:30:49,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 05:30:49,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 05:30:49,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 05:30:49,462 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand 8 states. [2018-11-23 05:30:49,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:30:49,647 INFO L93 Difference]: Finished difference Result 151 states and 168 transitions. [2018-11-23 05:30:49,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 05:30:49,648 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-11-23 05:30:49,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:30:49,649 INFO L225 Difference]: With dead ends: 151 [2018-11-23 05:30:49,649 INFO L226 Difference]: Without dead ends: 149 [2018-11-23 05:30:49,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-23 05:30:49,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-11-23 05:30:49,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 89. [2018-11-23 05:30:49,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-23 05:30:49,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2018-11-23 05:30:49,666 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 23 [2018-11-23 05:30:49,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:30:49,667 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2018-11-23 05:30:49,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 05:30:49,667 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2018-11-23 05:30:49,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 05:30:49,668 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:30:49,668 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, 1, 1, 1] [2018-11-23 05:30:49,668 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:30:49,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:30:49,671 INFO L82 PathProgramCache]: Analyzing trace with hash 2066926113, now seen corresponding path program 1 times [2018-11-23 05:30:49,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:30:49,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:30:49,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:30:49,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:30:49,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:30:49,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:30:49,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:30:49,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:30:49,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:30:49,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:30:49,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:30:49,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:30:49,699 INFO L87 Difference]: Start difference. First operand 89 states and 100 transitions. Second operand 3 states. [2018-11-23 05:30:49,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:30:49,732 INFO L93 Difference]: Finished difference Result 181 states and 209 transitions. [2018-11-23 05:30:49,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:30:49,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 05:30:49,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:30:49,734 INFO L225 Difference]: With dead ends: 181 [2018-11-23 05:30:49,734 INFO L226 Difference]: Without dead ends: 114 [2018-11-23 05:30:49,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:30:49,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-23 05:30:49,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2018-11-23 05:30:49,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-23 05:30:49,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 113 transitions. [2018-11-23 05:30:49,739 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 113 transitions. Word has length 24 [2018-11-23 05:30:49,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:30:49,739 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 113 transitions. [2018-11-23 05:30:49,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:30:49,739 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2018-11-23 05:30:49,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 05:30:49,740 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:30:49,740 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:30:49,741 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:30:49,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:30:49,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1129078447, now seen corresponding path program 1 times [2018-11-23 05:30:49,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:30:49,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:30:49,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:30:49,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:30:49,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:30:49,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:30:49,774 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 05:30:49,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:30:49,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:30:49,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:30:49,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:30:49,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:30:49,775 INFO L87 Difference]: Start difference. First operand 102 states and 113 transitions. Second operand 3 states. [2018-11-23 05:30:49,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:30:49,816 INFO L93 Difference]: Finished difference Result 179 states and 201 transitions. [2018-11-23 05:30:49,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:30:49,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 05:30:49,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:30:49,818 INFO L225 Difference]: With dead ends: 179 [2018-11-23 05:30:49,818 INFO L226 Difference]: Without dead ends: 99 [2018-11-23 05:30:49,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:30:49,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-23 05:30:49,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 87. [2018-11-23 05:30:49,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-23 05:30:49,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2018-11-23 05:30:49,826 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 31 [2018-11-23 05:30:49,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:30:49,826 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2018-11-23 05:30:49,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:30:49,826 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2018-11-23 05:30:49,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 05:30:49,827 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:30:49,827 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:30:49,827 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:30:49,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:30:49,828 INFO L82 PathProgramCache]: Analyzing trace with hash -323983759, now seen corresponding path program 1 times [2018-11-23 05:30:49,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:30:49,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:30:49,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:30:49,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:30:49,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:30:49,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:30:49,938 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:30:49,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:30:49,938 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e0bba0c-d1cd-402d-a96d-e8b314a0df98/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 05:30:49,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:30:49,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:30:49,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:30:49,981 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 6 treesize of output 5 [2018-11-23 05:30:49,981 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:49,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:49,988 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-23 05:30:50,000 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:50,002 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:50,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 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 05:30:50,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:50,025 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 97 treesize of output 57 [2018-11-23 05:30:50,062 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 05:30:50,062 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:50,078 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-11-23 05:30:50,081 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 10 treesize of output 9 [2018-11-23 05:30:50,082 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:50,098 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 35 treesize of output 37 [2018-11-23 05:30:50,112 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 2 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 05:30:50,113 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-23 05:30:50,127 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:30:50,141 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:30:50,156 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:30:50,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 05:30:50,185 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:117, output treesize:112 [2018-11-23 05:30:50,256 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 63 treesize of output 54 [2018-11-23 05:30:50,263 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:50,265 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 05:30:50,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:50,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:50,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:50,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:45 [2018-11-23 05:30:50,290 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:50,292 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:50,294 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:50,294 INFO L478 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-11-23 05:30:50,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:50,317 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 196 treesize of output 109 [2018-11-23 05:30:50,361 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-11-23 05:30:50,361 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:50,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 75 [2018-11-23 05:30:50,380 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 14 treesize of output 13 [2018-11-23 05:30:50,381 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:50,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 72 [2018-11-23 05:30:50,405 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:50,411 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 2 case distinctions, treesize of input 42 treesize of output 57 [2018-11-23 05:30:50,411 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-23 05:30:50,430 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:30:50,448 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:30:50,467 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:30:50,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 05:30:50,493 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:207, output treesize:108 [2018-11-23 05:30:50,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 76 [2018-11-23 05:30:50,546 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:50,547 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 38 treesize of output 22 [2018-11-23 05:30:50,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:50,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:50,560 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 05:30:50,560 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:103, output treesize:60 [2018-11-23 05:30:50,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 42 [2018-11-23 05:30:50,594 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 05:30:50,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:50,600 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 05:30:50,601 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:50,605 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 05:30:50,605 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:50,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:50,610 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 05:30:50,610 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:67, output treesize:4 [2018-11-23 05:30:50,614 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:30:50,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:30:50,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2018-11-23 05:30:50,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 05:30:50,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 05:30:50,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-23 05:30:50,639 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand 12 states. [2018-11-23 05:30:50,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:30:50,935 INFO L93 Difference]: Finished difference Result 165 states and 181 transitions. [2018-11-23 05:30:50,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 05:30:50,935 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-11-23 05:30:50,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:30:50,936 INFO L225 Difference]: With dead ends: 165 [2018-11-23 05:30:50,936 INFO L226 Difference]: Without dead ends: 163 [2018-11-23 05:30:50,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2018-11-23 05:30:50,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-11-23 05:30:50,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 85. [2018-11-23 05:30:50,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-23 05:30:50,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2018-11-23 05:30:50,942 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 32 [2018-11-23 05:30:50,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:30:50,943 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2018-11-23 05:30:50,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 05:30:50,943 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2018-11-23 05:30:50,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 05:30:50,943 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:30:50,943 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:30:50,944 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:30:50,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:30:50,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1584673033, now seen corresponding path program 1 times [2018-11-23 05:30:50,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:30:50,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:30:50,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:30:50,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:30:50,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:30:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:30:51,272 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 05:30:51,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:30:51,272 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e0bba0c-d1cd-402d-a96d-e8b314a0df98/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 05:30:51,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:30:51,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:30:51,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:30:51,296 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 6 treesize of output 5 [2018-11-23 05:30:51,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:51,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:51,309 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-23 05:30:51,323 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:51,325 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:51,325 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 05:30:51,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:51,344 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 91 treesize of output 51 [2018-11-23 05:30:51,359 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 05:30:51,360 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:51,376 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 42 treesize of output 38 [2018-11-23 05:30:51,379 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 05:30:51,379 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:51,389 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:51,390 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:30:51,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2018-11-23 05:30:51,400 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:51,401 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 42 treesize of output 79 [2018-11-23 05:30:51,402 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:51,414 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:51,421 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 05:30:51,428 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 05:30:51,442 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 165 treesize of output 93 [2018-11-23 05:30:51,479 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 05:30:51,479 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:51,489 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 68 treesize of output 64 [2018-11-23 05:30:51,491 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 05:30:51,491 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:51,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 61 [2018-11-23 05:30:51,507 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:51,508 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 14 treesize of output 23 [2018-11-23 05:30:51,509 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:51,518 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:51,525 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:51,532 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:51,542 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 05:30:51,542 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 4 variables, input treesize:191, output treesize:82 [2018-11-23 05:30:51,571 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 164 treesize of output 148 [2018-11-23 05:30:51,574 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:51,575 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:51,576 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:51,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 59 [2018-11-23 05:30:51,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:51,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:51,612 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 113 treesize of output 102 [2018-11-23 05:30:51,614 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:51,615 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:51,615 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:51,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 59 [2018-11-23 05:30:51,618 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:51,628 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:51,643 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 05:30:51,645 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 05:30:51,645 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:51,647 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:51,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:51,657 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:171, output treesize:85 [2018-11-23 05:30:51,705 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 85 treesize of output 63 [2018-11-23 05:30:51,709 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 49 treesize of output 36 [2018-11-23 05:30:51,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:51,728 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:51,730 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 15 treesize of output 16 [2018-11-23 05:30:51,731 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:51,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:51,757 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 46 treesize of output 38 [2018-11-23 05:30:51,760 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 18 [2018-11-23 05:30:51,760 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:51,781 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:51,783 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 11 treesize of output 8 [2018-11-23 05:30:51,784 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:51,788 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:51,792 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 05:30:51,792 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:99, output treesize:13 [2018-11-23 05:30:51,828 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 05:30:51,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:30:51,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 16 [2018-11-23 05:30:51,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 05:30:51,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 05:30:51,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-11-23 05:30:51,845 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand 16 states. [2018-11-23 05:30:52,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:30:52,676 INFO L93 Difference]: Finished difference Result 130 states and 145 transitions. [2018-11-23 05:30:52,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 05:30:52,676 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2018-11-23 05:30:52,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:30:52,676 INFO L225 Difference]: With dead ends: 130 [2018-11-23 05:30:52,677 INFO L226 Difference]: Without dead ends: 128 [2018-11-23 05:30:52,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=254, Invalid=802, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 05:30:52,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-23 05:30:52,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 99. [2018-11-23 05:30:52,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-23 05:30:52,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2018-11-23 05:30:52,684 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 33 [2018-11-23 05:30:52,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:30:52,684 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2018-11-23 05:30:52,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 05:30:52,684 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2018-11-23 05:30:52,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 05:30:52,684 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:30:52,684 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:30:52,685 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:30:52,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:30:52,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1808152883, now seen corresponding path program 1 times [2018-11-23 05:30:52,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:30:52,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:30:52,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:30:52,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:30:52,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:30:52,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:30:52,713 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 05:30:52,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:30:52,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:30:52,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:30:52,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:30:52,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:30:52,714 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand 3 states. [2018-11-23 05:30:52,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:30:52,750 INFO L93 Difference]: Finished difference Result 166 states and 186 transitions. [2018-11-23 05:30:52,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:30:52,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-23 05:30:52,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:30:52,751 INFO L225 Difference]: With dead ends: 166 [2018-11-23 05:30:52,751 INFO L226 Difference]: Without dead ends: 128 [2018-11-23 05:30:52,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:30:52,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-23 05:30:52,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 110. [2018-11-23 05:30:52,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-23 05:30:52,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2018-11-23 05:30:52,760 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 33 [2018-11-23 05:30:52,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:30:52,760 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2018-11-23 05:30:52,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:30:52,760 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2018-11-23 05:30:52,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 05:30:52,761 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:30:52,761 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:30:52,761 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:30:52,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:30:52,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1004579722, now seen corresponding path program 1 times [2018-11-23 05:30:52,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:30:52,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:30:52,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:30:52,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:30:52,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:30:52,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:30:52,880 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:30:52,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:30:52,880 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e0bba0c-d1cd-402d-a96d-e8b314a0df98/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 05:30:52,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:30:52,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:30:52,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:30:52,917 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 6 treesize of output 5 [2018-11-23 05:30:52,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:52,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:52,922 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-23 05:30:52,948 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:52,951 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:52,952 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 05:30:52,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:52,990 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 91 treesize of output 51 [2018-11-23 05:30:53,013 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 05:30:53,014 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:53,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2018-11-23 05:30:53,034 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 05:30:53,034 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:53,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2018-11-23 05:30:53,056 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:53,057 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 14 treesize of output 47 [2018-11-23 05:30:53,058 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:53,068 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:53,075 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 05:30:53,082 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 05:30:53,099 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 126 treesize of output 74 [2018-11-23 05:30:53,127 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 05:30:53,127 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:53,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 72 [2018-11-23 05:30:53,151 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 05:30:53,151 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:53,169 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:53,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 70 [2018-11-23 05:30:53,176 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:53,177 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 18 treesize of output 35 [2018-11-23 05:30:53,178 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:53,188 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:53,194 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:53,201 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:53,212 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 05:30:53,212 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 4 variables, input treesize:197, output treesize:128 [2018-11-23 05:30:53,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 103 [2018-11-23 05:30:53,247 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:53,248 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:53,249 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:53,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 88 [2018-11-23 05:30:53,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:53,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:53,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 76 [2018-11-23 05:30:53,292 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:53,293 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:53,293 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:53,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 82 [2018-11-23 05:30:53,296 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:53,304 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:53,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:53,314 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:166, output treesize:96 [2018-11-23 05:30:53,329 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:53,331 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:53,333 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:53,333 INFO L478 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-11-23 05:30:53,333 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:53,380 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:53,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 3 new quantified variables, introduced 0 case distinctions, treesize of input 511 treesize of output 304 [2018-11-23 05:30:53,459 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:53,461 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 221 treesize of output 271 [2018-11-23 05:30:53,461 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:53,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 317 treesize of output 266 [2018-11-23 05:30:53,500 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 14 treesize of output 13 [2018-11-23 05:30:53,501 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:53,525 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:30:53,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 302 treesize of output 263 [2018-11-23 05:30:53,551 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 2 case distinctions, treesize of input 270 treesize of output 277 [2018-11-23 05:30:53,551 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-23 05:30:53,598 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:30:53,655 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:30:53,718 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:30:53,790 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 186 [2018-11-23 05:30:53,793 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:53,797 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 0 case distinctions, treesize of input 47 treesize of output 66 [2018-11-23 05:30:53,797 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:53,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 127 [2018-11-23 05:30:53,826 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 30 treesize of output 29 [2018-11-23 05:30:53,826 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:53,838 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:53,841 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:30:53,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 153 [2018-11-23 05:30:53,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 41 treesize of output 36 [2018-11-23 05:30:53,848 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:53,862 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:53,869 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:53,884 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:53,891 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 278 treesize of output 196 [2018-11-23 05:30:53,894 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:53,897 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 0 case distinctions, treesize of input 49 treesize of output 70 [2018-11-23 05:30:53,898 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:53,932 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:53,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 135 [2018-11-23 05:30:53,942 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 30 treesize of output 29 [2018-11-23 05:30:53,942 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:53,957 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:53,958 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:53,959 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:53,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 156 [2018-11-23 05:30:53,971 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:30:53,972 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 36 treesize of output 48 [2018-11-23 05:30:53,972 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:53,984 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:53,990 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:54,006 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:54,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 05:30:54,065 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 5 variables, input treesize:526, output treesize:361 [2018-11-23 05:30:54,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 283 treesize of output 190 [2018-11-23 05:30:54,140 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:54,150 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 83 treesize of output 85 [2018-11-23 05:30:54,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 05:30:54,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:30:54,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 211 [2018-11-23 05:30:54,324 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:54,325 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:54,325 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:30:54,327 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 0 case distinctions, treesize of input 45 treesize of output 37 [2018-11-23 05:30:54,327 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:54,343 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:54,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 220 treesize of output 225 [2018-11-23 05:30:54,353 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:54,360 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 2 case distinctions, treesize of input 45 treesize of output 47 [2018-11-23 05:30:54,361 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-23 05:30:54,382 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:30:54,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 326 treesize of output 247 [2018-11-23 05:30:54,477 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:54,478 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 100 treesize of output 86 [2018-11-23 05:30:54,479 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:54,508 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:54,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 243 treesize of output 258 [2018-11-23 05:30:54,575 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:54,576 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 100 treesize of output 86 [2018-11-23 05:30:54,577 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:54,589 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:54,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-11-23 05:30:54,636 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:610, output treesize:515 [2018-11-23 05:30:54,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 175 treesize of output 111 [2018-11-23 05:30:54,718 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:54,718 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:30:54,719 INFO L478 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 66 [2018-11-23 05:30:54,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:54,729 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 48 [2018-11-23 05:30:54,730 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 05:30:54,741 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 1 [2018-11-23 05:30:54,741 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:54,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:30:54,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 38 [2018-11-23 05:30:54,789 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 05:30:54,789 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:54,797 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-11-23 05:30:54,797 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:30:54,804 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 05:30:54,804 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:54,808 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:54,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 175 treesize of output 111 [2018-11-23 05:30:54,873 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 1 [2018-11-23 05:30:54,874 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:54,892 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2018-11-23 05:30:54,893 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:30:54,908 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:54,908 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:30:54,909 INFO L478 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 45 [2018-11-23 05:30:54,910 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:54,921 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:30:54,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 38 [2018-11-23 05:30:54,963 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 1 [2018-11-23 05:30:54,963 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:54,969 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 05:30:54,969 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:54,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 05:30:54,974 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:54,977 INFO L267 ElimStorePlain]: Start of recursive call 14: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:55,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 209 treesize of output 127 [2018-11-23 05:30:55,005 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:55,005 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:30:55,006 INFO L478 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 75 [2018-11-23 05:30:55,006 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:55,022 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 25 treesize of output 22 [2018-11-23 05:30:55,022 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-11-23 05:30:55,034 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 47 [2018-11-23 05:30:55,035 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:30:55,036 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 46 treesize of output 33 [2018-11-23 05:30:55,036 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:55,069 INFO L267 ElimStorePlain]: Start of recursive call 18: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 05:30:55,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 39 [2018-11-23 05:30:55,110 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 17 treesize of output 1 [2018-11-23 05:30:55,110 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:55,118 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 05:30:55,118 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:55,123 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 05:30:55,123 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:55,127 INFO L267 ElimStorePlain]: Start of recursive call 23: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:55,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 53 [2018-11-23 05:30:55,133 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 17 treesize of output 10 [2018-11-23 05:30:55,133 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:55,142 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 16 treesize of output 8 [2018-11-23 05:30:55,142 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:55,150 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2018-11-23 05:30:55,151 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:55,155 INFO L267 ElimStorePlain]: Start of recursive call 27: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:55,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:55,171 INFO L202 ElimStorePlain]: Needed 30 recursive calls to eliminate 13 variables, input treesize:560, output treesize:4 [2018-11-23 05:30:55,185 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:30:55,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:30:55,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2018-11-23 05:30:55,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 05:30:55,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 05:30:55,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-23 05:30:55,210 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 12 states. [2018-11-23 05:30:55,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:30:55,777 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2018-11-23 05:30:55,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 05:30:55,777 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-11-23 05:30:55,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:30:55,778 INFO L225 Difference]: With dead ends: 136 [2018-11-23 05:30:55,778 INFO L226 Difference]: Without dead ends: 134 [2018-11-23 05:30:55,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-11-23 05:30:55,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-23 05:30:55,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 117. [2018-11-23 05:30:55,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-23 05:30:55,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 128 transitions. [2018-11-23 05:30:55,787 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 128 transitions. Word has length 35 [2018-11-23 05:30:55,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:30:55,787 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 128 transitions. [2018-11-23 05:30:55,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 05:30:55,788 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 128 transitions. [2018-11-23 05:30:55,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 05:30:55,788 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:30:55,788 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:30:55,789 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:30:55,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:30:55,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1997813481, now seen corresponding path program 1 times [2018-11-23 05:30:55,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:30:55,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:30:55,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:30:55,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:30:55,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:30:55,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:30:55,947 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:30:55,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:30:55,948 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e0bba0c-d1cd-402d-a96d-e8b314a0df98/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 05:30:55,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:30:55,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:30:55,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:30:55,986 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 6 treesize of output 5 [2018-11-23 05:30:55,987 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:55,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:55,992 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-23 05:30:55,997 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:55,998 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:55,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 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 05:30:55,999 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:56,030 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 97 treesize of output 57 [2018-11-23 05:30:56,050 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 05:30:56,050 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:56,058 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-11-23 05:30:56,060 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 10 treesize of output 9 [2018-11-23 05:30:56,060 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:56,071 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 35 treesize of output 37 [2018-11-23 05:30:56,088 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 2 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 05:30:56,089 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-23 05:30:56,109 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:30:56,153 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:30:56,177 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:30:56,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 05:30:56,210 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:117, output treesize:112 [2018-11-23 05:30:56,281 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 63 treesize of output 54 [2018-11-23 05:30:56,285 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:56,286 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 05:30:56,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:56,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:56,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:56,314 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:45 [2018-11-23 05:30:56,339 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:56,343 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:56,351 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:56,352 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 26 treesize of output 46 [2018-11-23 05:30:56,352 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:56,389 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 205 treesize of output 118 [2018-11-23 05:30:56,418 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-11-23 05:30:56,418 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:56,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 84 [2018-11-23 05:30:56,435 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 14 treesize of output 13 [2018-11-23 05:30:56,435 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:56,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 81 [2018-11-23 05:30:56,456 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:56,460 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 2 case distinctions, treesize of input 42 treesize of output 57 [2018-11-23 05:30:56,461 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-23 05:30:56,479 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:30:56,501 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:30:56,522 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:30:56,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 05:30:56,547 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:213, output treesize:218 [2018-11-23 05:30:56,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 90 [2018-11-23 05:30:56,588 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:56,589 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 05:30:56,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:56,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:56,618 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 05:30:56,618 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:117, output treesize:90 [2018-11-23 05:30:56,634 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:56,635 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:56,636 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:56,637 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:56,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 61 [2018-11-23 05:30:56,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:56,665 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 304 treesize of output 144 [2018-11-23 05:30:56,705 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 22 treesize of output 15 [2018-11-23 05:30:56,705 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:56,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 110 [2018-11-23 05:30:56,728 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 18 treesize of output 17 [2018-11-23 05:30:56,729 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:56,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 107 [2018-11-23 05:30:56,760 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 2 case distinctions, treesize of input 46 treesize of output 61 [2018-11-23 05:30:56,760 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-23 05:30:56,780 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:30:56,807 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:30:56,835 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:30:56,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-11-23 05:30:56,865 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:316, output treesize:200 [2018-11-23 05:30:56,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 115 [2018-11-23 05:30:56,907 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:56,908 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 46 treesize of output 26 [2018-11-23 05:30:56,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:56,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:56,925 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 05:30:56,925 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:179, output treesize:124 [2018-11-23 05:30:56,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 69 [2018-11-23 05:30:56,975 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2018-11-23 05:30:56,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:56,989 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 05:30:56,989 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:57,001 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 05:30:57,001 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:57,008 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-23 05:30:57,009 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:57,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:57,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:57,016 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:131, output treesize:4 [2018-11-23 05:30:57,027 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:30:57,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:30:57,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2018-11-23 05:30:57,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 05:30:57,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 05:30:57,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2018-11-23 05:30:57,043 INFO L87 Difference]: Start difference. First operand 117 states and 128 transitions. Second operand 14 states. [2018-11-23 05:30:57,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:30:57,493 INFO L93 Difference]: Finished difference Result 208 states and 232 transitions. [2018-11-23 05:30:57,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 05:30:57,493 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2018-11-23 05:30:57,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:30:57,494 INFO L225 Difference]: With dead ends: 208 [2018-11-23 05:30:57,494 INFO L226 Difference]: Without dead ends: 206 [2018-11-23 05:30:57,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2018-11-23 05:30:57,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-11-23 05:30:57,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 115. [2018-11-23 05:30:57,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-23 05:30:57,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2018-11-23 05:30:57,506 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 126 transitions. Word has length 42 [2018-11-23 05:30:57,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:30:57,506 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 126 transitions. [2018-11-23 05:30:57,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 05:30:57,506 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 126 transitions. [2018-11-23 05:30:57,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 05:30:57,507 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:30:57,507 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:30:57,507 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:30:57,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:30:57,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1874896500, now seen corresponding path program 1 times [2018-11-23 05:30:57,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:30:57,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:30:57,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:30:57,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:30:57,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:30:57,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:30:57,784 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:30:57,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:30:57,785 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e0bba0c-d1cd-402d-a96d-e8b314a0df98/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 05:30:57,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:30:57,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:30:57,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:30:57,820 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 6 treesize of output 5 [2018-11-23 05:30:57,820 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:57,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:57,823 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-23 05:30:57,840 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:57,841 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:57,842 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 05:30:57,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:57,877 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 91 treesize of output 51 [2018-11-23 05:30:57,892 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 05:30:57,892 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:57,905 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 42 treesize of output 38 [2018-11-23 05:30:57,907 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 05:30:57,908 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:57,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2018-11-23 05:30:57,927 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:57,928 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 14 treesize of output 47 [2018-11-23 05:30:57,928 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:57,938 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:57,945 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 05:30:57,952 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 05:30:57,967 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 126 treesize of output 74 [2018-11-23 05:30:57,993 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 05:30:57,993 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:58,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 72 [2018-11-23 05:30:58,014 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 05:30:58,014 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:58,025 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:58,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 70 [2018-11-23 05:30:58,032 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:58,033 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 18 treesize of output 35 [2018-11-23 05:30:58,033 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:58,041 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:58,047 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:58,053 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:58,065 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 05:30:58,065 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 4 variables, input treesize:197, output treesize:128 [2018-11-23 05:30:58,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 103 [2018-11-23 05:30:58,098 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:58,098 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:58,099 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:58,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 88 [2018-11-23 05:30:58,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:58,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:58,143 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 14 [2018-11-23 05:30:58,145 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 14 treesize of output 13 [2018-11-23 05:30:58,145 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:58,147 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:58,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 76 [2018-11-23 05:30:58,177 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:58,178 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:58,179 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:58,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 82 [2018-11-23 05:30:58,181 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:58,191 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:58,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:58,203 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:179, output treesize:109 [2018-11-23 05:30:58,242 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:58,248 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:58,251 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:58,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 20 treesize of output 21 [2018-11-23 05:30:58,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:58,374 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 587 treesize of output 350 [2018-11-23 05:30:58,480 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2018-11-23 05:30:58,485 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:58,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 267 treesize of output 343 [2018-11-23 05:30:58,491 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:58,577 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 393 treesize of output 330 [2018-11-23 05:30:58,582 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 14 treesize of output 13 [2018-11-23 05:30:58,582 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:58,646 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:30:58,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 378 treesize of output 327 [2018-11-23 05:30:58,698 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 2 case distinctions, treesize of input 346 treesize of output 353 [2018-11-23 05:30:58,699 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-23 05:30:58,819 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:30:58,949 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:30:59,079 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:30:59,228 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 366 treesize of output 353 [2018-11-23 05:30:59,232 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:59,235 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 64 treesize of output 56 [2018-11-23 05:30:59,235 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:59,271 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:59,277 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 374 treesize of output 363 [2018-11-23 05:30:59,281 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:59,283 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 66 treesize of output 103 [2018-11-23 05:30:59,283 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:59,317 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:59,439 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 325 treesize of output 243 [2018-11-23 05:30:59,443 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:59,447 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 0 case distinctions, treesize of input 49 treesize of output 70 [2018-11-23 05:30:59,447 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:59,478 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:59,487 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 185 [2018-11-23 05:30:59,490 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 30 treesize of output 29 [2018-11-23 05:30:59,490 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:59,508 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:59,508 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:30:59,509 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:59,510 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:59,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 206 [2018-11-23 05:30:59,528 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:30:59,528 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 36 treesize of output 48 [2018-11-23 05:30:59,528 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:59,543 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:59,554 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:59,572 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:59,581 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 315 treesize of output 231 [2018-11-23 05:30:59,585 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:59,589 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 0 case distinctions, treesize of input 47 treesize of output 66 [2018-11-23 05:30:59,589 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:59,623 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 175 [2018-11-23 05:30:59,626 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 30 treesize of output 29 [2018-11-23 05:30:59,626 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:59,647 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:30:59,648 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:59,651 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:30:59,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 201 [2018-11-23 05:30:59,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 41 treesize of output 36 [2018-11-23 05:30:59,659 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:59,672 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:59,681 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:59,698 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:59,756 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 182 treesize of output 187 [2018-11-23 05:30:59,758 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 24 treesize of output 23 [2018-11-23 05:30:59,758 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:59,774 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:59,779 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 213 treesize of output 228 [2018-11-23 05:30:59,781 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 24 treesize of output 23 [2018-11-23 05:30:59,781 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:59,800 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:59,847 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:59,851 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 178 treesize of output 203 [2018-11-23 05:30:59,854 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 31 [2018-11-23 05:30:59,854 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:59,876 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:59,878 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:30:59,881 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 209 treesize of output 236 [2018-11-23 05:30:59,883 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 31 [2018-11-23 05:30:59,883 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-23 05:30:59,901 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:30:59,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 05:30:59,942 INFO L202 ElimStorePlain]: Needed 32 recursive calls to eliminate 8 variables, input treesize:632, output treesize:421 [2018-11-23 05:31:00,006 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:31:00,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 484 treesize of output 372 [2018-11-23 05:31:00,022 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:31:00,024 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 124 treesize of output 98 [2018-11-23 05:31:00,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:31:00,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:31:00,151 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:31:00,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 377 treesize of output 399 [2018-11-23 05:31:00,167 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:31:00,169 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 112 treesize of output 169 [2018-11-23 05:31:00,169 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:31:00,191 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:31:00,261 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:31:00,265 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 258 treesize of output 263 [2018-11-23 05:31:00,268 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 50 treesize of output 49 [2018-11-23 05:31:00,268 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:31:00,284 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:31:00,348 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:31:00,353 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 431 treesize of output 446 [2018-11-23 05:31:00,356 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 30 treesize of output 29 [2018-11-23 05:31:00,356 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 05:31:00,388 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:31:00,445 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:31:00,451 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:31:00,453 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:31:00,454 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:31:00,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 407 treesize of output 479 [2018-11-23 05:31:00,471 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:31:00,481 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 2 case distinctions, treesize of input 57 treesize of output 90 [2018-11-23 05:31:00,481 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-23 05:31:00,525 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:31:00,624 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:31:00,625 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:31:00,625 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:31:00,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 350 treesize of output 264 [2018-11-23 05:31:00,641 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:31:00,653 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 3 case distinctions, treesize of input 148 treesize of output 181 [2018-11-23 05:31:00,653 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-11-23 05:31:00,696 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:31:00,699 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:31:00,699 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:31:00,700 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:31:00,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 340 treesize of output 258 [2018-11-23 05:31:00,714 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:31:00,715 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:31:00,715 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:31:00,718 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 148 treesize of output 167 [2018-11-23 05:31:00,719 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 05:31:00,742 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:31:00,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 6 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-11-23 05:31:00,821 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 8 variables, input treesize:916, output treesize:729 [2018-11-23 05:31:00,942 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:31:00,943 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:31:00,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 274 treesize of output 216 [2018-11-23 05:31:00,962 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:31:00,974 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2018-11-23 05:31:00,974 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:31:01,001 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 77 treesize of output 62 [2018-11-23 05:31:01,002 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:31:01,020 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 1 [2018-11-23 05:31:01,020 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:31:01,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:31:01,091 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:31:01,092 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:31:01,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 248 treesize of output 181 [2018-11-23 05:31:01,097 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 110 [2018-11-23 05:31:01,097 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:31:01,116 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 1 [2018-11-23 05:31:01,116 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 05:31:01,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 96 treesize of output 71 [2018-11-23 05:31:01,131 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:31:01,143 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:31:01,196 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:31:01,197 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:31:01,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 89 [2018-11-23 05:31:01,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 45 treesize of output 27 [2018-11-23 05:31:01,203 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:31:01,215 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 38 treesize of output 37 [2018-11-23 05:31:01,215 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 05:31:01,230 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 1 case distinctions, treesize of input 42 treesize of output 28 [2018-11-23 05:31:01,230 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-11-23 05:31:01,248 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 05:31:01,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 63 [2018-11-23 05:31:01,310 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 1 [2018-11-23 05:31:01,310 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 05:31:01,320 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 35 treesize of output 24 [2018-11-23 05:31:01,320 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 05:31:01,340 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:31:01,352 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-11-23 05:31:01,353 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:31:01,360 INFO L267 ElimStorePlain]: Start of recursive call 14: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:31:01,410 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:31:01,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 248 treesize of output 194 [2018-11-23 05:31:01,418 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:31:01,419 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 50 [2018-11-23 05:31:01,419 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:31:01,440 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 45 treesize of output 34 [2018-11-23 05:31:01,440 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-23 05:31:01,468 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 05:31:01,468 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-23 05:31:01,480 INFO L267 ElimStorePlain]: Start of recursive call 18: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:31:01,521 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:31:01,523 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:31:01,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 84 [2018-11-23 05:31:01,528 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 05:31:01,528 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-23 05:31:01,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-11-23 05:31:01,560 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:31:01,573 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 29 treesize of output 18 [2018-11-23 05:31:01,573 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-23 05:31:01,582 INFO L267 ElimStorePlain]: Start of recursive call 22: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:31:01,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 6 dim-2 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2018-11-23 05:31:01,620 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 13 variables, input treesize:771, output treesize:108 [2018-11-23 05:31:49,750 WARN L180 SmtUtils]: Spent 48.10 s on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2018-11-23 05:31:49,778 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:31:49,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:31:49,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2018-11-23 05:31:49,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 05:31:49,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 05:31:49,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-11-23 05:31:49,794 INFO L87 Difference]: Start difference. First operand 115 states and 126 transitions. Second operand 16 states. [2018-11-23 05:31:50,281 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 83 [2018-11-23 05:32:28,752 WARN L180 SmtUtils]: Spent 38.19 s on a formula simplification. DAG size of input: 122 DAG size of output: 105 [2018-11-23 05:33:09,030 WARN L180 SmtUtils]: Spent 38.21 s on a formula simplification. DAG size of input: 123 DAG size of output: 106 [2018-11-23 05:33:09,222 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 77 [2018-11-23 05:33:09,395 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2018-11-23 05:33:09,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:33:09,403 INFO L93 Difference]: Finished difference Result 163 states and 183 transitions. [2018-11-23 05:33:09,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 05:33:09,403 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2018-11-23 05:33:09,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:33:09,404 INFO L225 Difference]: With dead ends: 163 [2018-11-23 05:33:09,404 INFO L226 Difference]: Without dead ends: 161 [2018-11-23 05:33:09,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 127.6s TimeCoverageRelationStatistics Valid=111, Invalid=590, Unknown=1, NotChecked=0, Total=702 [2018-11-23 05:33:09,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-11-23 05:33:09,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 118. [2018-11-23 05:33:09,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-23 05:33:09,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 129 transitions. [2018-11-23 05:33:09,414 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 129 transitions. Word has length 44 [2018-11-23 05:33:09,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:33:09,415 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 129 transitions. [2018-11-23 05:33:09,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 05:33:09,415 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 129 transitions. [2018-11-23 05:33:09,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 05:33:09,415 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:33:09,415 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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 05:33:09,416 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:33:09,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:33:09,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1415179328, now seen corresponding path program 1 times [2018-11-23 05:33:09,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:33:09,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:33:09,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:33:09,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:33:09,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:33:09,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:33:09,438 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-23 05:33:09,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:33:09,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:33:09,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:33:09,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:33:09,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:33:09,439 INFO L87 Difference]: Start difference. First operand 118 states and 129 transitions. Second operand 3 states. [2018-11-23 05:33:09,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:33:09,488 INFO L93 Difference]: Finished difference Result 150 states and 167 transitions. [2018-11-23 05:33:09,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:33:09,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-11-23 05:33:09,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:33:09,489 INFO L225 Difference]: With dead ends: 150 [2018-11-23 05:33:09,489 INFO L226 Difference]: Without dead ends: 124 [2018-11-23 05:33:09,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:33:09,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-23 05:33:09,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 107. [2018-11-23 05:33:09,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-23 05:33:09,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 116 transitions. [2018-11-23 05:33:09,504 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 116 transitions. Word has length 44 [2018-11-23 05:33:09,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:33:09,505 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 116 transitions. [2018-11-23 05:33:09,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:33:09,505 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 116 transitions. [2018-11-23 05:33:09,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 05:33:09,505 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:33:09,505 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:33:09,506 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:33:09,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:33:09,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1495461684, now seen corresponding path program 1 times [2018-11-23 05:33:09,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:33:09,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:33:09,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:33:09,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:33:09,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:33:09,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:33:09,770 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:33:09,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:33:09,770 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e0bba0c-d1cd-402d-a96d-e8b314a0df98/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 05:33:09,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:33:09,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:33:09,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:33:09,805 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 6 treesize of output 5 [2018-11-23 05:33:09,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:09,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:33:09,813 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-23 05:33:09,820 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:09,821 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:09,822 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 05:33:09,822 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:09,851 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 91 treesize of output 51 [2018-11-23 05:33:09,869 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 05:33:09,870 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:09,888 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 42 treesize of output 38 [2018-11-23 05:33:09,891 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 05:33:09,891 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:09,902 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:33:09,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 63 [2018-11-23 05:33:09,913 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:09,915 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 42 treesize of output 79 [2018-11-23 05:33:09,915 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:09,926 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:33:09,933 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 05:33:09,941 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 05:33:09,966 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 165 treesize of output 93 [2018-11-23 05:33:10,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 05:33:10,000 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:10,012 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 68 treesize of output 64 [2018-11-23 05:33:10,014 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 05:33:10,014 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:10,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 61 [2018-11-23 05:33:10,031 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:10,032 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 14 treesize of output 23 [2018-11-23 05:33:10,032 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:10,042 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:33:10,050 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:33:10,057 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:33:10,070 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 05:33:10,070 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 4 variables, input treesize:197, output treesize:96 [2018-11-23 05:33:10,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 79 [2018-11-23 05:33:10,102 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:10,102 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:10,103 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:10,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 70 [2018-11-23 05:33:10,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:10,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:33:10,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 81 [2018-11-23 05:33:10,146 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:10,147 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:10,147 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:10,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 43 [2018-11-23 05:33:10,150 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:10,162 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:33:10,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:33:10,175 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:137, output treesize:91 [2018-11-23 05:33:10,206 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:10,208 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:10,210 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:10,211 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 26 treesize of output 50 [2018-11-23 05:33:10,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:10,291 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 356 treesize of output 288 [2018-11-23 05:33:10,295 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:10,303 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 0 case distinctions, treesize of input 31 treesize of output 42 [2018-11-23 05:33:10,303 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:10,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 276 treesize of output 282 [2018-11-23 05:33:10,349 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 14 treesize of output 13 [2018-11-23 05:33:10,349 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:10,382 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:33:10,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 261 treesize of output 279 [2018-11-23 05:33:10,399 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:33:10,400 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 20 treesize of output 24 [2018-11-23 05:33:10,400 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:10,425 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:33:10,445 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 05:33:10,464 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 05:33:10,507 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:10,508 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 134 [2018-11-23 05:33:10,512 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:10,513 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 41 treesize of output 50 [2018-11-23 05:33:10,513 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:10,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 106 [2018-11-23 05:33:10,539 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 14 treesize of output 13 [2018-11-23 05:33:10,539 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:10,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 103 [2018-11-23 05:33:10,579 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 2 case distinctions, treesize of input 46 treesize of output 53 [2018-11-23 05:33:10,579 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-11-23 05:33:10,611 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:33:10,647 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:33:10,682 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:33:10,732 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 2 xjuncts. [2018-11-23 05:33:10,733 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:407, output treesize:475 [2018-11-23 05:33:10,874 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2018-11-23 05:33:10,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 282 treesize of output 226 [2018-11-23 05:33:10,968 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:10,979 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 45 treesize of output 59 [2018-11-23 05:33:10,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 05:33:11,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:33:11,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 239 treesize of output 208 [2018-11-23 05:33:11,162 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:11,171 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 2 case distinctions, treesize of input 41 treesize of output 55 [2018-11-23 05:33:11,171 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-23 05:33:11,203 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:33:11,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 233 treesize of output 202 [2018-11-23 05:33:11,217 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:11,218 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:11,219 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:33:11,221 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 0 case distinctions, treesize of input 41 treesize of output 92 [2018-11-23 05:33:11,221 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:11,246 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:33:11,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 243 treesize of output 226 [2018-11-23 05:33:11,373 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:11,375 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 36 treesize of output 42 [2018-11-23 05:33:11,375 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:11,402 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:33:11,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 212 treesize of output 190 [2018-11-23 05:33:11,506 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:11,507 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 28 [2018-11-23 05:33:11,507 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:11,531 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:33:11,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 05:33:11,612 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:526, output treesize:563 [2018-11-23 05:33:11,728 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:11,730 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:11,733 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:11,736 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:11,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 681 treesize of output 673 [2018-11-23 05:33:11,738 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:15,875 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:15,877 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:15,879 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:15,881 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:15,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 821 treesize of output 813 [2018-11-23 05:33:15,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:20,086 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:20,089 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:20,091 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:20,093 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:20,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 821 treesize of output 813 [2018-11-23 05:33:20,095 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:23,624 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 813 treesize of output 652 [2018-11-23 05:33:23,630 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 54 treesize of output 33 [2018-11-23 05:33:23,630 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:23,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 598 treesize of output 597 [2018-11-23 05:33:23,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-11-23 05:33:23,710 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:23,755 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:33:23,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 573 treesize of output 594 [2018-11-23 05:33:23,793 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 2 case distinctions, treesize of input 30 treesize of output 37 [2018-11-23 05:33:23,793 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-23 05:33:23,845 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:33:23,955 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:33:24,072 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:33:28,788 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 673 treesize of output 540 [2018-11-23 05:33:28,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 71 [2018-11-23 05:33:28,809 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-11-23 05:33:28,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 514 treesize of output 515 [2018-11-23 05:33:28,930 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 05:33:28,930 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:28,981 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:28,983 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:28,983 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:33:29,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 503 treesize of output 524 [2018-11-23 05:33:29,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 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 05:33:29,023 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-11-23 05:33:29,086 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:33:29,193 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:33:29,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 498 treesize of output 511 [2018-11-23 05:33:29,221 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 05:33:29,222 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:29,274 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:29,276 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:29,277 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:29,278 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:29,279 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:33:29,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 467 treesize of output 536 [2018-11-23 05:33:29,317 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 2 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 05:33:29,317 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-11-23 05:33:29,382 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:33:29,484 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:33:29,723 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-23 05:33:35,535 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:35,536 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 498 treesize of output 274 [2018-11-23 05:33:35,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 58 [2018-11-23 05:33:35,625 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:35,675 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 241 treesize of output 186 [2018-11-23 05:33:35,678 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 18 treesize of output 17 [2018-11-23 05:33:35,678 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:35,706 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:35,707 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:35,707 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:33:35,708 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:35,709 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:35,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 203 [2018-11-23 05:33:35,726 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:35,732 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 2 case distinctions, treesize of input 60 treesize of output 87 [2018-11-23 05:33:35,733 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 2 xjuncts. [2018-11-23 05:33:35,776 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:33:35,833 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:33:35,896 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:33:35,908 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 526 treesize of output 288 [2018-11-23 05:33:36,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 101 [2018-11-23 05:33:36,004 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 3 xjuncts. [2018-11-23 05:33:36,067 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:36,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 276 treesize of output 232 [2018-11-23 05:33:36,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2018-11-23 05:33:36,072 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:36,104 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:36,105 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:36,106 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:36,112 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:36,113 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:36,117 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:36,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 227 [2018-11-23 05:33:36,136 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 67 treesize of output 98 [2018-11-23 05:33:36,137 INFO L267 ElimStorePlain]: Start of recursive call 32: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 05:33:36,178 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:33:36,198 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:33:36,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 289 treesize of output 221 [2018-11-23 05:33:36,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-11-23 05:33:36,214 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:36,253 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:36,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 266 treesize of output 220 [2018-11-23 05:33:36,257 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 0 case distinctions, treesize of input 85 treesize of output 104 [2018-11-23 05:33:36,257 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:36,282 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:33:36,304 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:33:36,359 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:33:36,371 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:36,372 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 494 treesize of output 270 [2018-11-23 05:33:36,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 58 [2018-11-23 05:33:36,452 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:36,497 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 241 treesize of output 186 [2018-11-23 05:33:36,499 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 18 treesize of output 17 [2018-11-23 05:33:36,499 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:36,529 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:36,529 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:36,530 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:36,531 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:36,532 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:33:36,533 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:36,543 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:36,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 221 [2018-11-23 05:33:36,549 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 0 case distinctions, treesize of input 66 treesize of output 69 [2018-11-23 05:33:36,550 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:36,580 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:33:36,600 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:33:36,627 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:33:36,639 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 530 treesize of output 292 [2018-11-23 05:33:36,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 119 [2018-11-23 05:33:36,754 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 3 xjuncts. [2018-11-23 05:33:36,826 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:36,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 288 treesize of output 244 [2018-11-23 05:33:36,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2018-11-23 05:33:36,830 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:36,864 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:36,865 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:36,866 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:36,867 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:33:36,868 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:36,877 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:36,880 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:36,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 201 treesize of output 233 [2018-11-23 05:33:36,889 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:36,904 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 5 case distinctions, treesize of input 67 treesize of output 124 [2018-11-23 05:33:36,906 INFO L267 ElimStorePlain]: Start of recursive call 48: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 7 xjuncts. [2018-11-23 05:33:36,970 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:33:37,028 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:33:37,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 295 treesize of output 227 [2018-11-23 05:33:37,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-11-23 05:33:37,044 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:37,075 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:37,076 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:37,077 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:37,077 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:33:37,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 272 treesize of output 244 [2018-11-23 05:33:37,096 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:37,103 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 2 case distinctions, treesize of input 85 treesize of output 132 [2018-11-23 05:33:37,104 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 2 xjuncts. [2018-11-23 05:33:37,148 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:33:37,205 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:33:37,336 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-23 05:33:39,751 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 813 treesize of output 491 [2018-11-23 05:33:39,881 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2018-11-23 05:33:39,887 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 54 treesize of output 33 [2018-11-23 05:33:39,887 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:39,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 504 treesize of output 420 [2018-11-23 05:33:39,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-11-23 05:33:39,968 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:40,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 481 treesize of output 413 [2018-11-23 05:33:40,045 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:40,051 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 2 case distinctions, treesize of input 78 treesize of output 117 [2018-11-23 05:33:40,052 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 2 xjuncts. [2018-11-23 05:33:40,105 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:33:40,206 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:33:40,314 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:33:41,686 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 600 treesize of output 310 [2018-11-23 05:33:41,771 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 54 treesize of output 33 [2018-11-23 05:33:41,771 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:41,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 284 treesize of output 232 [2018-11-23 05:33:41,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-11-23 05:33:41,817 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:41,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 261 treesize of output 225 [2018-11-23 05:33:41,866 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:41,872 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 2 case distinctions, treesize of input 78 treesize of output 117 [2018-11-23 05:33:41,873 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 2 xjuncts. [2018-11-23 05:33:41,915 INFO L267 ElimStorePlain]: Start of recursive call 63: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:33:41,981 INFO L267 ElimStorePlain]: Start of recursive call 61: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:33:42,051 INFO L267 ElimStorePlain]: Start of recursive call 59: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:33:42,063 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 582 treesize of output 292 [2018-11-23 05:33:42,145 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 54 treesize of output 33 [2018-11-23 05:33:42,145 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:42,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 261 treesize of output 209 [2018-11-23 05:33:42,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-11-23 05:33:42,194 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:42,235 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:42,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 238 treesize of output 208 [2018-11-23 05:33:42,248 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 0 case distinctions, treesize of input 84 treesize of output 95 [2018-11-23 05:33:42,248 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:42,269 INFO L267 ElimStorePlain]: Start of recursive call 69: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:33:42,288 INFO L267 ElimStorePlain]: Start of recursive call 67: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:33:42,313 INFO L267 ElimStorePlain]: Start of recursive call 65: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:33:42,926 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 458 treesize of output 288 [2018-11-23 05:33:42,929 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 48 treesize of output 27 [2018-11-23 05:33:42,930 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:42,962 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:42,963 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:42,974 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 227 treesize of output 257 [2018-11-23 05:33:42,977 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 24 treesize of output 23 [2018-11-23 05:33:42,977 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:43,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 218 [2018-11-23 05:33:43,025 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:43,026 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 37 [2018-11-23 05:33:43,027 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:43,052 INFO L267 ElimStorePlain]: Start of recursive call 75: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:33:43,070 INFO L267 ElimStorePlain]: Start of recursive call 73: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:33:43,098 INFO L267 ElimStorePlain]: Start of recursive call 71: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:33:43,110 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 442 treesize of output 281 [2018-11-23 05:33:43,114 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 54 treesize of output 33 [2018-11-23 05:33:43,114 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:43,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 212 treesize of output 211 [2018-11-23 05:33:43,160 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 24 treesize of output 23 [2018-11-23 05:33:43,160 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:43,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 208 [2018-11-23 05:33:43,204 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 30 treesize of output 13 [2018-11-23 05:33:43,204 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:43,223 INFO L267 ElimStorePlain]: Start of recursive call 81: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:33:43,237 INFO L267 ElimStorePlain]: Start of recursive call 79: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:33:43,261 INFO L267 ElimStorePlain]: Start of recursive call 77: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:33:43,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-1 vars, 6 dim-2 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-11-23 05:33:43,611 INFO L202 ElimStorePlain]: Needed 82 recursive calls to eliminate 16 variables, input treesize:2324, output treesize:2581 [2018-11-23 05:33:44,216 WARN L180 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 143 [2018-11-23 05:33:44,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 684 treesize of output 565 [2018-11-23 05:33:44,266 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:44,270 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 174 treesize of output 138 [2018-11-23 05:33:44,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:44,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:33:45,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 664 treesize of output 436 [2018-11-23 05:33:45,740 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:45,742 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:45,744 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:45,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 131 treesize of output 249 [2018-11-23 05:33:45,755 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-23 05:33:45,810 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:33:47,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 684 treesize of output 573 [2018-11-23 05:33:47,193 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:47,195 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 174 treesize of output 138 [2018-11-23 05:33:47,195 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:47,234 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:33:48,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 515 treesize of output 363 [2018-11-23 05:33:48,720 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:48,721 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 174 treesize of output 138 [2018-11-23 05:33:48,722 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:48,747 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:33:49,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 516 treesize of output 421 [2018-11-23 05:33:49,921 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:49,923 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 104 treesize of output 82 [2018-11-23 05:33:49,923 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:49,956 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:33:50,935 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:50,936 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:50,937 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:50,937 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:33:50,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 455 treesize of output 349 [2018-11-23 05:33:50,961 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:50,962 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:50,965 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:50,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 148 [2018-11-23 05:33:50,975 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-11-23 05:33:51,040 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:33:52,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 511 treesize of output 408 [2018-11-23 05:33:52,015 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:52,016 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:33:52,020 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 0 case distinctions, treesize of input 133 treesize of output 248 [2018-11-23 05:33:52,021 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:52,050 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:33:52,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 555 treesize of output 452 [2018-11-23 05:33:52,072 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:52,077 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:52,088 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 2 case distinctions, treesize of input 133 treesize of output 201 [2018-11-23 05:33:52,088 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-11-23 05:33:52,129 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:33:52,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 515 treesize of output 363 [2018-11-23 05:33:52,849 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:52,851 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 174 treesize of output 138 [2018-11-23 05:33:52,851 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:52,872 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:33:53,475 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 733 treesize of output 618 [2018-11-23 05:33:53,479 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:53,479 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:53,491 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 2 case distinctions, treesize of input 103 treesize of output 111 [2018-11-23 05:33:53,491 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-11-23 05:33:53,545 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:33:54,248 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:54,249 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:54,250 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:33:54,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 392 treesize of output 397 [2018-11-23 05:33:54,269 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:54,272 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:54,282 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 2 case distinctions, treesize of input 100 treesize of output 135 [2018-11-23 05:33:54,282 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-11-23 05:33:54,336 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:33:54,340 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:54,340 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:54,341 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:33:54,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 378 treesize of output 383 [2018-11-23 05:33:54,360 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:54,360 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:33:54,364 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 0 case distinctions, treesize of input 100 treesize of output 137 [2018-11-23 05:33:54,364 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:54,400 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:33:54,958 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:54,959 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:54,961 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:54,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 554 treesize of output 352 [2018-11-23 05:33:54,976 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:54,977 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:54,977 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:33:54,978 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:54,981 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 159 treesize of output 193 [2018-11-23 05:33:54,981 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:55,010 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:33:55,013 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:55,014 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:55,015 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:55,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 600 treesize of output 386 [2018-11-23 05:33:55,031 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:55,032 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:55,034 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:55,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 159 treesize of output 241 [2018-11-23 05:33:55,043 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 2 xjuncts. [2018-11-23 05:33:55,098 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:33:55,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 417 treesize of output 277 [2018-11-23 05:33:55,502 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:55,515 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 104 treesize of output 82 [2018-11-23 05:33:55,516 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:55,544 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:33:55,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 12 dim-2 vars, End of recursive call: 6 dim-0 vars, and 9 xjuncts. [2018-11-23 05:33:55,849 INFO L202 ElimStorePlain]: Needed 31 recursive calls to eliminate 19 variables, input treesize:3737, output treesize:3347 [2018-11-23 05:33:56,246 WARN L180 SmtUtils]: Spent 335.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2018-11-23 05:33:56,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 333 treesize of output 246 [2018-11-23 05:33:56,348 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 9 treesize of output 1 [2018-11-23 05:33:56,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:56,371 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 196 treesize of output 167 [2018-11-23 05:33:56,371 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:56,389 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:56,391 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 30 [2018-11-23 05:33:56,391 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:33:56,410 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-11-23 05:33:56,410 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 05:33:56,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 05:33:56,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 461 treesize of output 271 [2018-11-23 05:33:56,783 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 179 [2018-11-23 05:33:56,784 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:33:56,809 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:56,810 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:56,811 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 39 treesize of output 37 [2018-11-23 05:33:56,811 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:56,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 144 treesize of output 102 [2018-11-23 05:33:56,835 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:56,855 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 113 treesize of output 53 [2018-11-23 05:33:56,855 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:33:56,871 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 05:33:57,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 361 treesize of output 258 [2018-11-23 05:33:57,210 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 203 treesize of output 168 [2018-11-23 05:33:57,211 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:57,231 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 105 [2018-11-23 05:33:57,231 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:33:57,246 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 1 [2018-11-23 05:33:57,247 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:57,260 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-11-23 05:33:57,261 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 05:33:57,272 INFO L267 ElimStorePlain]: Start of recursive call 12: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 05:33:57,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 85 [2018-11-23 05:33:57,581 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 05:33:57,581 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:57,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 32 treesize of output 23 [2018-11-23 05:33:57,594 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:57,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 15 [2018-11-23 05:33:57,603 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:57,610 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-23 05:33:57,610 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:57,613 INFO L267 ElimStorePlain]: Start of recursive call 17: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:33:57,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 461 treesize of output 298 [2018-11-23 05:33:57,926 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:57,927 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 27 treesize of output 14 [2018-11-23 05:33:57,927 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:57,950 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2018-11-23 05:33:57,951 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:33:57,971 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 217 treesize of output 180 [2018-11-23 05:33:57,971 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:57,990 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 119 [2018-11-23 05:33:57,990 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:33:58,004 INFO L267 ElimStorePlain]: Start of recursive call 22: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 05:33:58,278 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 411 treesize of output 300 [2018-11-23 05:33:58,281 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:58,282 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 15 treesize of output 8 [2018-11-23 05:33:58,282 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:58,308 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 245 treesize of output 210 [2018-11-23 05:33:58,309 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:58,331 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2018-11-23 05:33:58,331 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:33:58,351 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:58,352 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 36 [2018-11-23 05:33:58,352 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:33:58,371 INFO L267 ElimStorePlain]: Start of recursive call 27: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 05:33:58,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 361 treesize of output 227 [2018-11-23 05:33:58,623 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 108 treesize of output 52 [2018-11-23 05:33:58,623 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:33:58,643 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 1 [2018-11-23 05:33:58,643 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:58,660 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 65 treesize of output 55 [2018-11-23 05:33:58,660 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:33:58,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 84 treesize of output 48 [2018-11-23 05:33:58,676 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:58,689 INFO L267 ElimStorePlain]: Start of recursive call 32: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 05:33:58,929 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 6 new quantified variables, introduced 0 case distinctions, treesize of input 216 treesize of output 94 [2018-11-23 05:33:58,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 32 treesize of output 23 [2018-11-23 05:33:58,931 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:58,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 42 treesize of output 36 [2018-11-23 05:33:58,943 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:58,952 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-23 05:33:58,953 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:58,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2018-11-23 05:33:58,966 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:58,970 INFO L267 ElimStorePlain]: Start of recursive call 37: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:33:59,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 361 treesize of output 250 [2018-11-23 05:33:59,173 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:59,174 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 121 [2018-11-23 05:33:59,174 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:33:59,193 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 168 treesize of output 145 [2018-11-23 05:33:59,193 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:59,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, 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 1 [2018-11-23 05:33:59,208 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:59,222 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-11-23 05:33:59,223 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:33:59,235 INFO L267 ElimStorePlain]: Start of recursive call 42: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 05:33:59,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 79 [2018-11-23 05:33:59,427 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:59,428 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 30 [2018-11-23 05:33:59,429 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:33:59,445 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 19 treesize of output 10 [2018-11-23 05:33:59,446 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:59,458 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 10 treesize of output 6 [2018-11-23 05:33:59,458 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:59,466 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 05:33:59,467 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:59,473 INFO L267 ElimStorePlain]: Start of recursive call 47: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:33:59,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 84 [2018-11-23 05:33:59,648 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 25 treesize of output 19 [2018-11-23 05:33:59,648 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:59,658 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-11-23 05:33:59,658 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:59,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 9 [2018-11-23 05:33:59,664 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:59,669 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 05:33:59,669 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:59,671 INFO L267 ElimStorePlain]: Start of recursive call 52: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:33:59,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 91 [2018-11-23 05:33:59,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 50 treesize of output 46 [2018-11-23 05:33:59,831 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:59,845 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 31 treesize of output 19 [2018-11-23 05:33:59,845 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:59,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 39 treesize of output 21 [2018-11-23 05:33:59,853 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:59,860 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-23 05:33:59,860 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-11-23 05:33:59,864 INFO L267 ElimStorePlain]: Start of recursive call 57: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:33:59,993 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 371 treesize of output 276 [2018-11-23 05:33:59,996 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:33:59,997 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2018-11-23 05:33:59,997 INFO L267 ElimStorePlain]: Start of recursive call 63: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:34:00,020 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:00,022 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 71 [2018-11-23 05:34:00,022 INFO L267 ElimStorePlain]: Start of recursive call 64: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:34:00,042 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 199 treesize of output 172 [2018-11-23 05:34:00,042 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:00,059 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 05:34:00,059 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:00,074 INFO L267 ElimStorePlain]: Start of recursive call 62: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 05:34:00,187 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 6 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 89 [2018-11-23 05:34:00,189 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 18 treesize of output 6 [2018-11-23 05:34:00,189 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:00,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 32 treesize of output 23 [2018-11-23 05:34:00,201 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:00,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 15 [2018-11-23 05:34:00,210 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:00,216 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-23 05:34:00,216 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:00,220 INFO L267 ElimStorePlain]: Start of recursive call 67: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:34:00,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 54 [2018-11-23 05:34:00,316 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:00,317 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 18 [2018-11-23 05:34:00,317 INFO L267 ElimStorePlain]: Start of recursive call 73: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:34:00,329 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 1 [2018-11-23 05:34:00,329 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:00,337 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 05:34:00,338 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:00,350 INFO L267 ElimStorePlain]: Start of recursive call 72: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:34:00,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 361 treesize of output 227 [2018-11-23 05:34:00,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 145 treesize of output 103 [2018-11-23 05:34:00,438 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:00,456 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 120 [2018-11-23 05:34:00,456 INFO L267 ElimStorePlain]: Start of recursive call 78: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:34:00,472 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 21 treesize of output 1 [2018-11-23 05:34:00,472 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:00,486 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 84 treesize of output 36 [2018-11-23 05:34:00,486 INFO L267 ElimStorePlain]: Start of recursive call 80: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:34:00,498 INFO L267 ElimStorePlain]: Start of recursive call 76: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 05:34:00,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 54 [2018-11-23 05:34:00,572 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-11-23 05:34:00,572 INFO L267 ElimStorePlain]: Start of recursive call 82: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:34:00,583 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 05:34:00,583 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:00,593 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 05:34:00,594 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:00,602 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 05:34:00,602 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:00,609 INFO L267 ElimStorePlain]: Start of recursive call 81: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:34:00,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 84 [2018-11-23 05:34:00,675 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 05:34:00,676 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:00,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 41 treesize of output 23 [2018-11-23 05:34:00,689 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:00,696 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 15 [2018-11-23 05:34:00,697 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:00,702 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-23 05:34:00,702 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:00,704 INFO L267 ElimStorePlain]: Start of recursive call 86: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:34:00,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 24 dim-0 vars, 18 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:34:00,748 INFO L202 ElimStorePlain]: Needed 90 recursive calls to eliminate 42 variables, input treesize:3482, output treesize:4 [2018-11-23 05:34:00,798 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:34:00,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:34:00,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2018-11-23 05:34:00,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 05:34:00,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 05:34:00,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-11-23 05:34:00,822 INFO L87 Difference]: Start difference. First operand 107 states and 116 transitions. Second operand 17 states. [2018-11-23 05:34:01,661 WARN L180 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 150 [2018-11-23 05:34:02,448 WARN L180 SmtUtils]: Spent 685.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 181 [2018-11-23 05:34:03,484 WARN L180 SmtUtils]: Spent 675.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 184 [2018-11-23 05:34:03,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:34:03,632 INFO L93 Difference]: Finished difference Result 176 states and 195 transitions. [2018-11-23 05:34:03,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 05:34:03,632 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 45 [2018-11-23 05:34:03,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:34:03,633 INFO L225 Difference]: With dead ends: 176 [2018-11-23 05:34:03,633 INFO L226 Difference]: Without dead ends: 174 [2018-11-23 05:34:03,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2018-11-23 05:34:03,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-11-23 05:34:03,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 105. [2018-11-23 05:34:03,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-23 05:34:03,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2018-11-23 05:34:03,646 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 45 [2018-11-23 05:34:03,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:34:03,646 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2018-11-23 05:34:03,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 05:34:03,646 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2018-11-23 05:34:03,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 05:34:03,647 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:34:03,647 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:34:03,647 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:34:03,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:34:03,648 INFO L82 PathProgramCache]: Analyzing trace with hash 400881353, now seen corresponding path program 1 times [2018-11-23 05:34:03,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:34:03,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:34:03,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:34:03,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:34:03,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:34:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:34:03,885 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:34:03,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:34:03,886 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e0bba0c-d1cd-402d-a96d-e8b314a0df98/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 05:34:03,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:34:03,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:34:03,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:34:03,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 05:34:03,933 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:03,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:34:03,940 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-23 05:34:03,952 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:03,955 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:03,957 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 05:34:03,957 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:04,002 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 91 treesize of output 51 [2018-11-23 05:34:04,023 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 05:34:04,024 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:04,042 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 42 treesize of output 38 [2018-11-23 05:34:04,044 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 05:34:04,044 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:04,057 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:04,057 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:34:04,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2018-11-23 05:34:04,066 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:04,068 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 42 treesize of output 79 [2018-11-23 05:34:04,068 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:04,079 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:34:04,086 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 05:34:04,093 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 05:34:04,116 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 165 treesize of output 93 [2018-11-23 05:34:04,147 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 05:34:04,148 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:04,159 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 68 treesize of output 64 [2018-11-23 05:34:04,161 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 05:34:04,161 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:04,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 61 [2018-11-23 05:34:04,176 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:04,178 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 14 treesize of output 23 [2018-11-23 05:34:04,178 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:04,187 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:34:04,194 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:34:04,201 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:34:04,213 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 05:34:04,214 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 4 variables, input treesize:197, output treesize:96 [2018-11-23 05:34:04,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 85 [2018-11-23 05:34:04,244 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:04,245 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:04,246 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:04,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 43 [2018-11-23 05:34:04,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:04,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:34:04,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 87 [2018-11-23 05:34:04,284 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:04,285 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:04,286 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:04,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 82 [2018-11-23 05:34:04,288 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:04,299 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:34:04,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:34:04,310 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:134, output treesize:100 [2018-11-23 05:34:04,330 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:04,332 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:04,336 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:04,337 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 26 treesize of output 46 [2018-11-23 05:34:04,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:04,416 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 454 treesize of output 341 [2018-11-23 05:34:04,505 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:04,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 42 [2018-11-23 05:34:04,509 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:04,553 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 320 treesize of output 305 [2018-11-23 05:34:04,556 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 14 treesize of output 13 [2018-11-23 05:34:04,557 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:04,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 305 treesize of output 302 [2018-11-23 05:34:04,606 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:04,607 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 61 treesize of output 140 [2018-11-23 05:34:04,608 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:04,636 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:34:04,660 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 05:34:04,683 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 05:34:04,720 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 312 treesize of output 266 [2018-11-23 05:34:04,774 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:04,778 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 0 case distinctions, treesize of input 53 treesize of output 76 [2018-11-23 05:34:04,778 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:04,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 235 [2018-11-23 05:34:04,816 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 24 treesize of output 23 [2018-11-23 05:34:04,816 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:04,837 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:04,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 219 [2018-11-23 05:34:04,848 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:04,849 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:34:04,849 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 70 [2018-11-23 05:34:04,849 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:04,867 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:34:04,879 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:34:04,891 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:34:04,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:34:04,915 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:469, output treesize:254 [2018-11-23 05:34:04,945 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:04,952 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 250 treesize of output 212 [2018-11-23 05:34:04,956 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:04,957 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:04,958 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:04,961 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 153 treesize of output 197 [2018-11-23 05:34:04,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:04,992 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:34:05,031 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 165 treesize of output 196 [2018-11-23 05:34:05,034 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:05,035 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:05,036 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:05,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 124 [2018-11-23 05:34:05,038 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:05,056 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:34:05,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:34:05,079 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:292, output treesize:220 [2018-11-23 05:34:05,110 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:05,111 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:05,113 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:05,115 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:05,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 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 05:34:05,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:05,200 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:05,207 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:05,215 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 674 treesize of output 445 [2018-11-23 05:34:05,431 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2018-11-23 05:34:05,434 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:05,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 370 treesize of output 354 [2018-11-23 05:34:05,437 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:05,498 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:05,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 424 treesize of output 391 [2018-11-23 05:34:05,522 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 10 treesize of output 9 [2018-11-23 05:34:05,523 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:05,576 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:05,577 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:34:05,578 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:05,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 437 treesize of output 410 [2018-11-23 05:34:05,615 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 2 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 05:34:05,615 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-23 05:34:05,669 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:34:05,778 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:34:05,885 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:34:06,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 410 treesize of output 354 [2018-11-23 05:34:06,015 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:06,018 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 0 case distinctions, treesize of input 84 treesize of output 103 [2018-11-23 05:34:06,018 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:06,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 231 treesize of output 265 [2018-11-23 05:34:06,066 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 31 [2018-11-23 05:34:06,066 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:06,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 262 [2018-11-23 05:34:06,104 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 38 treesize of output 13 [2018-11-23 05:34:06,104 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:06,123 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:34:06,141 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:34:06,164 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:34:06,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 414 treesize of output 364 [2018-11-23 05:34:06,178 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:06,181 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 0 case distinctions, treesize of input 90 treesize of output 121 [2018-11-23 05:34:06,181 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:06,217 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:06,218 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:06,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 231 treesize of output 283 [2018-11-23 05:34:06,230 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 31 [2018-11-23 05:34:06,230 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:06,254 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:06,255 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:06,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 280 [2018-11-23 05:34:06,277 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 2 case distinctions, treesize of input 38 treesize of output 45 [2018-11-23 05:34:06,278 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-11-23 05:34:06,305 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:34:06,339 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:34:06,387 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:34:06,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 05:34:06,464 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 7 variables, input treesize:707, output treesize:795 [2018-11-23 05:34:06,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 1545 treesize of output 1148 [2018-11-23 05:34:06,560 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:06,562 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 244 treesize of output 194 [2018-11-23 05:34:06,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:06,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:34:06,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 377 treesize of output 316 [2018-11-23 05:34:06,724 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:06,734 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 3 case distinctions, treesize of input 123 treesize of output 165 [2018-11-23 05:34:06,734 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-23 05:34:06,804 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 05:34:06,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 425 treesize of output 446 [2018-11-23 05:34:06,973 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:06,982 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 45 treesize of output 47 [2018-11-23 05:34:06,982 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-23 05:34:07,030 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:34:07,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 411 treesize of output 435 [2018-11-23 05:34:07,045 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:07,045 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:07,046 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:34:07,049 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 0 case distinctions, treesize of input 45 treesize of output 29 [2018-11-23 05:34:07,049 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:07,090 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:34:07,274 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:07,275 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:07,276 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:07,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 904 treesize of output 556 [2018-11-23 05:34:07,290 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:07,292 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 244 treesize of output 194 [2018-11-23 05:34:07,292 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:07,324 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:34:07,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-2 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-11-23 05:34:07,491 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 9 variables, input treesize:1923, output treesize:2651 [2018-11-23 05:34:07,811 WARN L180 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 145 [2018-11-23 05:34:07,889 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:07,891 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:07,891 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:07,893 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:34:07,895 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:07,896 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:07,898 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:07,898 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:34:07,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 846 treesize of output 436 [2018-11-23 05:34:07,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 384 treesize of output 319 [2018-11-23 05:34:07,915 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:34:07,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 170 treesize of output 78 [2018-11-23 05:34:07,954 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:07,988 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 78 treesize of output 65 [2018-11-23 05:34:07,989 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:08,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 55 [2018-11-23 05:34:08,015 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 05:34:08,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 05:34:08,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 81 [2018-11-23 05:34:08,151 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 37 treesize of output 26 [2018-11-23 05:34:08,151 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:08,167 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:08,168 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 17 treesize of output 10 [2018-11-23 05:34:08,168 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:08,182 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 15 treesize of output 6 [2018-11-23 05:34:08,183 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:08,193 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 05:34:08,193 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:08,200 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:34:08,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, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 71 [2018-11-23 05:34:08,211 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 17 treesize of output 14 [2018-11-23 05:34:08,211 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-11-23 05:34:08,226 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 33 treesize of output 22 [2018-11-23 05:34:08,226 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:08,228 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 32 treesize of output 23 [2018-11-23 05:34:08,228 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:08,247 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 27 treesize of output 11 [2018-11-23 05:34:08,247 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:08,249 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-23 05:34:08,249 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:34:08,263 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:08,264 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 19 treesize of output 13 [2018-11-23 05:34:08,264 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:08,266 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 11 treesize of output 1 [2018-11-23 05:34:08,266 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:08,272 INFO L267 ElimStorePlain]: Start of recursive call 12: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:34:08,350 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:08,351 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:08,352 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:34:08,352 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:08,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 703 treesize of output 405 [2018-11-23 05:34:08,362 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 319 treesize of output 283 [2018-11-23 05:34:08,363 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:34:08,393 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:34:08,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 251 treesize of output 182 [2018-11-23 05:34:08,394 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:34:08,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 64 [2018-11-23 05:34:08,415 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:08,432 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 1 [2018-11-23 05:34:08,432 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:08,445 INFO L267 ElimStorePlain]: Start of recursive call 20: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 05:34:08,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 65 [2018-11-23 05:34:08,511 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 32 treesize of output 21 [2018-11-23 05:34:08,512 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:08,523 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:08,524 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 18 [2018-11-23 05:34:08,525 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:34:08,535 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 05:34:08,535 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:08,543 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 05:34:08,543 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:08,549 INFO L267 ElimStorePlain]: Start of recursive call 25: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:34:08,603 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:08,603 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:08,604 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:08,605 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:08,605 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:08,606 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:34:08,607 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:08,607 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:34:08,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 701 treesize of output 431 [2018-11-23 05:34:08,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 273 treesize of output 119 [2018-11-23 05:34:08,620 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:08,642 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 31 treesize of output 1 [2018-11-23 05:34:08,642 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:08,657 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 88 [2018-11-23 05:34:08,658 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:08,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 74 [2018-11-23 05:34:08,672 INFO L267 ElimStorePlain]: Start of recursive call 34: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 05:34:08,686 INFO L267 ElimStorePlain]: Start of recursive call 30: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 05:34:08,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 63 [2018-11-23 05:34:08,729 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 30 treesize of output 21 [2018-11-23 05:34:08,729 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:08,740 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 1 [2018-11-23 05:34:08,740 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:08,749 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 9 treesize of output 1 [2018-11-23 05:34:08,750 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:08,758 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 05:34:08,758 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:08,764 INFO L267 ElimStorePlain]: Start of recursive call 35: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:34:08,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:34:08,791 INFO L202 ElimStorePlain]: Needed 39 recursive calls to eliminate 14 variables, input treesize:2251, output treesize:4 [2018-11-23 05:34:08,830 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:34:08,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:34:08,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2018-11-23 05:34:08,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 05:34:08,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 05:34:08,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-11-23 05:34:08,846 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand 14 states. [2018-11-23 05:34:09,525 WARN L180 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 156 [2018-11-23 05:34:10,053 WARN L180 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 159 [2018-11-23 05:34:10,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:34:10,131 INFO L93 Difference]: Finished difference Result 160 states and 175 transitions. [2018-11-23 05:34:10,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 05:34:10,131 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 48 [2018-11-23 05:34:10,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:34:10,132 INFO L225 Difference]: With dead ends: 160 [2018-11-23 05:34:10,132 INFO L226 Difference]: Without dead ends: 158 [2018-11-23 05:34:10,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2018-11-23 05:34:10,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-23 05:34:10,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 129. [2018-11-23 05:34:10,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-23 05:34:10,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 139 transitions. [2018-11-23 05:34:10,155 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 139 transitions. Word has length 48 [2018-11-23 05:34:10,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:34:10,155 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 139 transitions. [2018-11-23 05:34:10,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 05:34:10,155 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 139 transitions. [2018-11-23 05:34:10,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 05:34:10,156 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:34:10,156 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:34:10,156 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:34:10,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:34:10,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1285453963, now seen corresponding path program 1 times [2018-11-23 05:34:10,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:34:10,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:34:10,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:34:10,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:34:10,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:34:10,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:34:10,188 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 05:34:10,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:34:10,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 05:34:10,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 05:34:10,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 05:34:10,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 05:34:10,189 INFO L87 Difference]: Start difference. First operand 129 states and 139 transitions. Second operand 4 states. [2018-11-23 05:34:10,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:34:10,257 INFO L93 Difference]: Finished difference Result 164 states and 182 transitions. [2018-11-23 05:34:10,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 05:34:10,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-11-23 05:34:10,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:34:10,258 INFO L225 Difference]: With dead ends: 164 [2018-11-23 05:34:10,258 INFO L226 Difference]: Without dead ends: 145 [2018-11-23 05:34:10,258 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 05:34:10,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-23 05:34:10,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2018-11-23 05:34:10,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-23 05:34:10,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 155 transitions. [2018-11-23 05:34:10,279 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 155 transitions. Word has length 49 [2018-11-23 05:34:10,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:34:10,279 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 155 transitions. [2018-11-23 05:34:10,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 05:34:10,279 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 155 transitions. [2018-11-23 05:34:10,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 05:34:10,280 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:34:10,280 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:34:10,280 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:34:10,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:34:10,280 INFO L82 PathProgramCache]: Analyzing trace with hash 297574799, now seen corresponding path program 1 times [2018-11-23 05:34:10,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:34:10,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:34:10,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:34:10,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:34:10,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:34:10,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:34:10,424 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 05:34:10,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:34:10,424 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e0bba0c-d1cd-402d-a96d-e8b314a0df98/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:34:10,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:34:10,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:34:10,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:34:10,448 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 6 treesize of output 5 [2018-11-23 05:34:10,448 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:10,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:34:10,456 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-23 05:34:10,463 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:10,465 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:10,465 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 05:34:10,466 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:10,487 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 91 treesize of output 51 [2018-11-23 05:34:10,505 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 05:34:10,506 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:10,526 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 42 treesize of output 38 [2018-11-23 05:34:10,528 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 05:34:10,528 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:10,541 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:10,542 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:34:10,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2018-11-23 05:34:10,552 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:10,553 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 42 treesize of output 79 [2018-11-23 05:34:10,553 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:10,565 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:34:10,573 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 05:34:10,581 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 05:34:10,595 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 165 treesize of output 93 [2018-11-23 05:34:10,626 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 05:34:10,626 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:10,637 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 68 treesize of output 64 [2018-11-23 05:34:10,639 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 05:34:10,639 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:10,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 61 [2018-11-23 05:34:10,654 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:10,655 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 14 treesize of output 23 [2018-11-23 05:34:10,656 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:10,664 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:34:10,671 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:34:10,677 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:34:10,687 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 05:34:10,687 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 4 variables, input treesize:191, output treesize:82 [2018-11-23 05:34:10,708 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 139 treesize of output 123 [2018-11-23 05:34:10,710 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:10,710 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:10,711 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:10,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 59 [2018-11-23 05:34:10,714 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:10,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:34:10,738 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 88 treesize of output 77 [2018-11-23 05:34:10,740 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:10,741 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:10,742 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:10,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 59 [2018-11-23 05:34:10,744 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:10,752 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:34:10,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:34:10,759 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:146, output treesize:68 [2018-11-23 05:34:10,799 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 91 treesize of output 70 [2018-11-23 05:34:10,801 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 42 treesize of output 34 [2018-11-23 05:34:10,802 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:34:10,821 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:10,824 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 24 treesize of output 23 [2018-11-23 05:34:10,824 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:10,832 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 05:34:10,841 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 44 treesize of output 34 [2018-11-23 05:34:10,843 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 25 treesize of output 14 [2018-11-23 05:34:10,843 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:10,850 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:34:10,851 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 16 treesize of output 8 [2018-11-23 05:34:10,851 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:34:10,855 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:34:10,858 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 05:34:10,858 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:98, output treesize:7 [2018-11-23 05:34:10,884 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 05:34:10,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:34:10,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2018-11-23 05:34:10,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 05:34:10,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 05:34:10,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=191, Unknown=2, NotChecked=0, Total=240 [2018-11-23 05:34:10,902 INFO L87 Difference]: Start difference. First operand 143 states and 155 transitions. Second operand 16 states. [2018-11-23 05:34:11,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:34:11,264 INFO L93 Difference]: Finished difference Result 167 states and 183 transitions. [2018-11-23 05:34:11,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 05:34:11,264 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2018-11-23 05:34:11,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:34:11,265 INFO L225 Difference]: With dead ends: 167 [2018-11-23 05:34:11,265 INFO L226 Difference]: Without dead ends: 110 [2018-11-23 05:34:11,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=324, Unknown=3, NotChecked=0, Total=420 [2018-11-23 05:34:11,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-23 05:34:11,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-11-23 05:34:11,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-23 05:34:11,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 115 transitions. [2018-11-23 05:34:11,279 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 115 transitions. Word has length 49 [2018-11-23 05:34:11,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:34:11,280 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 115 transitions. [2018-11-23 05:34:11,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 05:34:11,280 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 115 transitions. [2018-11-23 05:34:11,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 05:34:11,280 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:34:11,280 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:34:11,281 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:34:11,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:34:11,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1643497090, now seen corresponding path program 1 times [2018-11-23 05:34:11,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:34:11,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:34:11,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:34:11,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:34:11,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:34:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:34:11,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:34:11,346 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=21, |#NULL.offset|=13, |old(#NULL.base)|=21, |old(#NULL.offset)|=13] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=21, |old(#NULL.offset)|=13] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=21, |old(#NULL.offset)|=13] [?] RET #344#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret26 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4);call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4);call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4);~item~0.base, ~item~0.offset := ~head~0.base, ~head~0.offset;~status~0 := 0; VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=27, main_~item~0.offset=0, main_~status~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=27, main_~item~0.offset=0, main_~status~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~nondet1|=1] [?] assume !!(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~item~0.base, ~item~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4);call write~$Pointer$(~item~0.base, ~item~0.offset, #t~mem3.base, 4 + #t~mem3.offset, 4);havoc #t~mem3.base, #t~mem3.offset;call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4);~item~0.base, ~item~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset;call write~$Pointer$(0, 0, ~item~0.base, ~item~0.offset, 4); VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=20, main_~item~0.offset=0, main_~status~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=20, |main_#t~malloc2.offset|=0] [?] assume 0 == ~status~0;call write~int(1, ~item~0.base, 8 + ~item~0.offset, 4);~status~0 := 1; VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=20, main_~item~0.offset=0, main_~status~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=20, |main_#t~malloc2.offset|=0] [?] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=20, main_~item~0.offset=0, main_~status~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=20, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=20, main_~item~0.offset=0, main_~status~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=20, |main_#t~malloc2.offset|=0] [?] assume !!(~item~0.base != 0 || ~item~0.offset != 0); VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=20, main_~item~0.offset=0, main_~status~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=20, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=20, main_~item~0.offset=0, main_~status~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=20, |main_#t~malloc2.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=20, main_~item~0.offset=0, main_~status~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=20, |main_#t~malloc2.offset|=0, |main_#t~nondet1|=1] [?] assume !!(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~item~0.base, ~item~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4);call write~$Pointer$(~item~0.base, ~item~0.offset, #t~mem3.base, 4 + #t~mem3.offset, 4);havoc #t~mem3.base, #t~mem3.offset;call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4);~item~0.base, ~item~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset;call write~$Pointer$(0, 0, ~item~0.base, ~item~0.offset, 4); VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=16, main_~item~0.offset=0, main_~status~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0] [?] assume !(0 == ~status~0); VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=16, main_~item~0.offset=0, main_~status~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0] [?] assume 1 == ~status~0;call write~int(2, ~item~0.base, 8 + ~item~0.offset, 4);~status~0 := 2; VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=16, main_~item~0.offset=0, main_~status~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0] [?] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=16, main_~item~0.offset=0, main_~status~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=16, main_~item~0.offset=0, main_~status~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0] [?] assume !!(~item~0.base != 0 || ~item~0.offset != 0); VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=16, main_~item~0.offset=0, main_~status~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=16, main_~item~0.offset=0, main_~status~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=16, main_~item~0.offset=0, main_~status~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0, |main_#t~nondet1|=1] [?] assume !!(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~item~0.base, ~item~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4);call write~$Pointer$(~item~0.base, ~item~0.offset, #t~mem3.base, 4 + #t~mem3.offset, 4);havoc #t~mem3.base, #t~mem3.offset;call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4);~item~0.base, ~item~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset;call write~$Pointer$(0, 0, ~item~0.base, ~item~0.offset, 4); VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0] [?] assume !(0 == ~status~0); VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0] [?] assume !(1 == ~status~0); VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0] [?] assume ~status~0 >= 2;call write~int(3, ~item~0.base, 8 + ~item~0.offset, 4);~status~0 := 3; VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0] [?] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0] [?] assume !!(~item~0.base != 0 || ~item~0.offset != 0); VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0, |main_#t~nondet1|=0] [?] assume !(0 != #t~nondet1);havoc #t~nondet1; VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0] [?] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0] [?] assume !(1 == ~status~0); VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0] [?] assume !(2 == ~status~0); VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0] [?] assume 3 == ~status~0; VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0] [?] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0] [?] call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0, |main_#t~mem9.base|=20, |main_#t~mem9.offset|=0] [?] assume !!(#t~mem9.base != 0 || #t~mem9.offset != 0);havoc #t~mem9.base, #t~mem9.offset; VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0] [?] call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4);call #t~mem11.base, #t~mem11.offset := read~$Pointer$(#t~mem10.base, #t~mem10.offset, 4); VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0, |main_#t~mem10.base|=20, |main_#t~mem10.offset|=0, |main_#t~mem11.base|=16, |main_#t~mem11.offset|=0] [?] assume !!(#t~mem11.base != 0 || #t~mem11.offset != 0);havoc #t~mem11.base, #t~mem11.offset;havoc #t~mem10.base, #t~mem10.offset; VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0] [?] call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4);call #t~mem13.base, #t~mem13.offset := read~$Pointer$(#t~mem12.base, #t~mem12.offset, 4);call #t~mem14.base, #t~mem14.offset := read~$Pointer$(#t~mem13.base, #t~mem13.offset, 4); VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0, |main_#t~mem12.base|=20, |main_#t~mem12.offset|=0, |main_#t~mem13.base|=16, |main_#t~mem13.offset|=0, |main_#t~mem14.base|=36, |main_#t~mem14.offset|=0] [?] assume !!(#t~mem14.base != 0 || #t~mem14.offset != 0);havoc #t~mem14.base, #t~mem14.offset;havoc #t~mem12.base, #t~mem12.offset;havoc #t~mem13.base, #t~mem13.offset; VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0] [?] call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, #t~mem15.offset, 4);call #t~mem17.base, #t~mem17.offset := read~$Pointer$(#t~mem16.base, #t~mem16.offset, 4);call #t~mem18 := read~int(#t~mem17.base, 8 + #t~mem17.offset, 4); VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0, |main_#t~mem15.base|=20, |main_#t~mem15.offset|=0, |main_#t~mem16.base|=16, |main_#t~mem16.offset|=0, |main_#t~mem17.base|=36, |main_#t~mem17.offset|=0, |main_#t~mem18|=3] [?] assume !(3 != #t~mem18);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem18;havoc #t~mem16.base, #t~mem16.offset;havoc #t~mem17.base, #t~mem17.offset; VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0] [?] assume !false; VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=21, #NULL.offset=13, old(#NULL.base)=21, old(#NULL.offset)=13] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=21, old(#NULL.offset)=13] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=21, old(#NULL.offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret26 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L986] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12); [L986] ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; [L987] call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); [L988] call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4); [L989] call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); [L990] ~item~0.base, ~item~0.offset := ~head~0.base, ~head~0.offset; [L991] ~status~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=27, ~item~0.offset=0, ~status~0=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~nondet1=1, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=27, ~item~0.offset=0, ~status~0=0] [L993-L1018] assume !!(0 != #t~nondet1); [L993] havoc #t~nondet1; [L995] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12); [L995] call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~item~0.base, ~item~0.offset, 4); [L996] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4); [L996] call write~$Pointer$(~item~0.base, ~item~0.offset, #t~mem3.base, 4 + #t~mem3.offset, 4); [L996] havoc #t~mem3.base, #t~mem3.offset; [L997] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4); [L997] ~item~0.base, ~item~0.offset := #t~mem4.base, #t~mem4.offset; [L997] havoc #t~mem4.base, #t~mem4.offset; [L998] call write~$Pointer$(0, 0, ~item~0.base, ~item~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=20, ~item~0.offset=0, ~status~0=0] [L1000-L1014] assume 0 == ~status~0; [L1002] call write~int(1, ~item~0.base, 8 + ~item~0.offset, 4); [L1003] ~status~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=20, ~item~0.offset=0, ~status~0=1] [L1016] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=20, ~item~0.offset=0, ~status~0=1] [L1017] assume !!(~item~0.base != 0 || ~item~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=20, ~item~0.offset=0, ~status~0=1] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, #t~nondet1=1, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=20, ~item~0.offset=0, ~status~0=1] [L993-L1018] assume !!(0 != #t~nondet1); [L993] havoc #t~nondet1; [L995] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12); [L995] call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~item~0.base, ~item~0.offset, 4); [L996] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4); [L996] call write~$Pointer$(~item~0.base, ~item~0.offset, #t~mem3.base, 4 + #t~mem3.offset, 4); [L996] havoc #t~mem3.base, #t~mem3.offset; [L997] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4); [L997] ~item~0.base, ~item~0.offset := #t~mem4.base, #t~mem4.offset; [L997] havoc #t~mem4.base, #t~mem4.offset; [L998] call write~$Pointer$(0, 0, ~item~0.base, ~item~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=16, ~item~0.offset=0, ~status~0=1] [L1000-L1014] assume !(0 == ~status~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=16, ~item~0.offset=0, ~status~0=1] [L1005-L1014] assume 1 == ~status~0; [L1007] call write~int(2, ~item~0.base, 8 + ~item~0.offset, 4); [L1008] ~status~0 := 2; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=16, ~item~0.offset=0, ~status~0=2] [L1016] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=16, ~item~0.offset=0, ~status~0=2] [L1017] assume !!(~item~0.base != 0 || ~item~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=16, ~item~0.offset=0, ~status~0=2] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, #t~nondet1=1, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=16, ~item~0.offset=0, ~status~0=2] [L993-L1018] assume !!(0 != #t~nondet1); [L993] havoc #t~nondet1; [L995] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12); [L995] call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~item~0.base, ~item~0.offset, 4); [L996] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4); [L996] call write~$Pointer$(~item~0.base, ~item~0.offset, #t~mem3.base, 4 + #t~mem3.offset, 4); [L996] havoc #t~mem3.base, #t~mem3.offset; [L997] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4); [L997] ~item~0.base, ~item~0.offset := #t~mem4.base, #t~mem4.offset; [L997] havoc #t~mem4.base, #t~mem4.offset; [L998] call write~$Pointer$(0, 0, ~item~0.base, ~item~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=2] [L1000-L1014] assume !(0 == ~status~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=2] [L1005-L1014] assume !(1 == ~status~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=2] [L1010-L1014] assume ~status~0 >= 2; [L1012] call write~int(3, ~item~0.base, 8 + ~item~0.offset, 4); [L1013] ~status~0 := 3; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1016] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1017] assume !!(~item~0.base != 0 || ~item~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, #t~nondet1=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L993-L1018] assume !(0 != #t~nondet1); [L993] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1020] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1021-L1025] assume !(1 == ~status~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1026-L1031] assume !(2 == ~status~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1032-L1039] assume 3 == ~status~0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1034] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1035] call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, #t~mem9.base=20, #t~mem9.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1035] assume !!(#t~mem9.base != 0 || #t~mem9.offset != 0); [L1035] havoc #t~mem9.base, #t~mem9.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1036] call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); [L1036] call #t~mem11.base, #t~mem11.offset := read~$Pointer$(#t~mem10.base, #t~mem10.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, #t~mem10.base=20, #t~mem10.offset=0, #t~mem11.base=16, #t~mem11.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1036] assume !!(#t~mem11.base != 0 || #t~mem11.offset != 0); [L1036] havoc #t~mem11.base, #t~mem11.offset; [L1036] havoc #t~mem10.base, #t~mem10.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1037] call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); [L1037] call #t~mem13.base, #t~mem13.offset := read~$Pointer$(#t~mem12.base, #t~mem12.offset, 4); [L1037] call #t~mem14.base, #t~mem14.offset := read~$Pointer$(#t~mem13.base, #t~mem13.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, #t~mem12.base=20, #t~mem12.offset=0, #t~mem13.base=16, #t~mem13.offset=0, #t~mem14.base=36, #t~mem14.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1037] assume !!(#t~mem14.base != 0 || #t~mem14.offset != 0); [L1037] havoc #t~mem14.base, #t~mem14.offset; [L1037] havoc #t~mem12.base, #t~mem12.offset; [L1037] havoc #t~mem13.base, #t~mem13.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1038] call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); [L1038] call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, #t~mem15.offset, 4); [L1038] call #t~mem17.base, #t~mem17.offset := read~$Pointer$(#t~mem16.base, #t~mem16.offset, 4); [L1038] call #t~mem18 := read~int(#t~mem17.base, 8 + #t~mem17.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, #t~mem15.base=20, #t~mem15.offset=0, #t~mem16.base=16, #t~mem16.offset=0, #t~mem17.base=36, #t~mem17.offset=0, #t~mem18=3, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1038] assume !(3 != #t~mem18); [L1038] havoc #t~mem15.base, #t~mem15.offset; [L1038] havoc #t~mem18; [L1038] havoc #t~mem16.base, #t~mem16.offset; [L1038] havoc #t~mem17.base, #t~mem17.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1038] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=21, #NULL.offset=13, old(#NULL.base)=21, old(#NULL.offset)=13] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=21, old(#NULL.offset)=13] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=21, old(#NULL.offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret26 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L986] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12); [L986] ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; [L987] call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); [L988] call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4); [L989] call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); [L990] ~item~0.base, ~item~0.offset := ~head~0.base, ~head~0.offset; [L991] ~status~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=27, ~item~0.offset=0, ~status~0=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~nondet1=1, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=27, ~item~0.offset=0, ~status~0=0] [L993-L1018] assume !!(0 != #t~nondet1); [L993] havoc #t~nondet1; [L995] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12); [L995] call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~item~0.base, ~item~0.offset, 4); [L996] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4); [L996] call write~$Pointer$(~item~0.base, ~item~0.offset, #t~mem3.base, 4 + #t~mem3.offset, 4); [L996] havoc #t~mem3.base, #t~mem3.offset; [L997] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4); [L997] ~item~0.base, ~item~0.offset := #t~mem4.base, #t~mem4.offset; [L997] havoc #t~mem4.base, #t~mem4.offset; [L998] call write~$Pointer$(0, 0, ~item~0.base, ~item~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=20, ~item~0.offset=0, ~status~0=0] [L1000-L1014] assume 0 == ~status~0; [L1002] call write~int(1, ~item~0.base, 8 + ~item~0.offset, 4); [L1003] ~status~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=20, ~item~0.offset=0, ~status~0=1] [L1016] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=20, ~item~0.offset=0, ~status~0=1] [L1017] assume !!(~item~0.base != 0 || ~item~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=20, ~item~0.offset=0, ~status~0=1] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, #t~nondet1=1, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=20, ~item~0.offset=0, ~status~0=1] [L993-L1018] assume !!(0 != #t~nondet1); [L993] havoc #t~nondet1; [L995] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12); [L995] call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~item~0.base, ~item~0.offset, 4); [L996] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4); [L996] call write~$Pointer$(~item~0.base, ~item~0.offset, #t~mem3.base, 4 + #t~mem3.offset, 4); [L996] havoc #t~mem3.base, #t~mem3.offset; [L997] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4); [L997] ~item~0.base, ~item~0.offset := #t~mem4.base, #t~mem4.offset; [L997] havoc #t~mem4.base, #t~mem4.offset; [L998] call write~$Pointer$(0, 0, ~item~0.base, ~item~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=16, ~item~0.offset=0, ~status~0=1] [L1000-L1014] assume !(0 == ~status~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=16, ~item~0.offset=0, ~status~0=1] [L1005-L1014] assume 1 == ~status~0; [L1007] call write~int(2, ~item~0.base, 8 + ~item~0.offset, 4); [L1008] ~status~0 := 2; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=16, ~item~0.offset=0, ~status~0=2] [L1016] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=16, ~item~0.offset=0, ~status~0=2] [L1017] assume !!(~item~0.base != 0 || ~item~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=16, ~item~0.offset=0, ~status~0=2] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, #t~nondet1=1, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=16, ~item~0.offset=0, ~status~0=2] [L993-L1018] assume !!(0 != #t~nondet1); [L993] havoc #t~nondet1; [L995] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12); [L995] call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~item~0.base, ~item~0.offset, 4); [L996] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4); [L996] call write~$Pointer$(~item~0.base, ~item~0.offset, #t~mem3.base, 4 + #t~mem3.offset, 4); [L996] havoc #t~mem3.base, #t~mem3.offset; [L997] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4); [L997] ~item~0.base, ~item~0.offset := #t~mem4.base, #t~mem4.offset; [L997] havoc #t~mem4.base, #t~mem4.offset; [L998] call write~$Pointer$(0, 0, ~item~0.base, ~item~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=2] [L1000-L1014] assume !(0 == ~status~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=2] [L1005-L1014] assume !(1 == ~status~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=2] [L1010-L1014] assume ~status~0 >= 2; [L1012] call write~int(3, ~item~0.base, 8 + ~item~0.offset, 4); [L1013] ~status~0 := 3; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1016] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1017] assume !!(~item~0.base != 0 || ~item~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, #t~nondet1=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L993-L1018] assume !(0 != #t~nondet1); [L993] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1020] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1021-L1025] assume !(1 == ~status~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1026-L1031] assume !(2 == ~status~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1032-L1039] assume 3 == ~status~0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1034] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1035] call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, #t~mem9.base=20, #t~mem9.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1035] assume !!(#t~mem9.base != 0 || #t~mem9.offset != 0); [L1035] havoc #t~mem9.base, #t~mem9.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1036] call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); [L1036] call #t~mem11.base, #t~mem11.offset := read~$Pointer$(#t~mem10.base, #t~mem10.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, #t~mem10.base=20, #t~mem10.offset=0, #t~mem11.base=16, #t~mem11.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1036] assume !!(#t~mem11.base != 0 || #t~mem11.offset != 0); [L1036] havoc #t~mem11.base, #t~mem11.offset; [L1036] havoc #t~mem10.base, #t~mem10.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1037] call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); [L1037] call #t~mem13.base, #t~mem13.offset := read~$Pointer$(#t~mem12.base, #t~mem12.offset, 4); [L1037] call #t~mem14.base, #t~mem14.offset := read~$Pointer$(#t~mem13.base, #t~mem13.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, #t~mem12.base=20, #t~mem12.offset=0, #t~mem13.base=16, #t~mem13.offset=0, #t~mem14.base=36, #t~mem14.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1037] assume !!(#t~mem14.base != 0 || #t~mem14.offset != 0); [L1037] havoc #t~mem14.base, #t~mem14.offset; [L1037] havoc #t~mem12.base, #t~mem12.offset; [L1037] havoc #t~mem13.base, #t~mem13.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1038] call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); [L1038] call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, #t~mem15.offset, 4); [L1038] call #t~mem17.base, #t~mem17.offset := read~$Pointer$(#t~mem16.base, #t~mem16.offset, 4); [L1038] call #t~mem18 := read~int(#t~mem17.base, 8 + #t~mem17.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, #t~mem15.base=20, #t~mem15.offset=0, #t~mem16.base=16, #t~mem16.offset=0, #t~mem17.base=36, #t~mem17.offset=0, #t~mem18=3, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1038] assume !(3 != #t~mem18); [L1038] havoc #t~mem15.base, #t~mem15.offset; [L1038] havoc #t~mem18; [L1038] havoc #t~mem16.base, #t~mem16.offset; [L1038] havoc #t~mem17.base, #t~mem17.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1038] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=21, #NULL!offset=13, old(#NULL!base)=21, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=21, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret26 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L986] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L986] ~head~0 := #t~malloc0; [L987] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L988] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L989] FCALL call write~int(0, { base: ~head~0!base, offset: 8 + ~head~0!offset }, 4); [L990] ~item~0 := ~head~0; [L991] ~status~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=27, ~item~0!offset=0, ~status~0=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~nondet1=1, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=27, ~item~0!offset=0, ~status~0=0] [L993-L1018] COND FALSE !(!(0 != #t~nondet1)) [L993] havoc #t~nondet1; [L995] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L995] FCALL call write~$Pointer$(#t~malloc2, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L996] FCALL call #t~mem3 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L996] FCALL call write~$Pointer$(~item~0, { base: #t~mem3!base, offset: 4 + #t~mem3!offset }, 4); [L996] havoc #t~mem3; [L997] FCALL call #t~mem4 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L997] ~item~0 := #t~mem4; [L997] havoc #t~mem4; [L998] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~item~0!base, offset: ~item~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=20, ~item~0!offset=0, ~status~0=0] [L1000] COND TRUE 0 == ~status~0 [L1002] FCALL call write~int(1, { base: ~item~0!base, offset: 8 + ~item~0!offset }, 4); [L1003] ~status~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=20, ~item~0!offset=0, ~status~0=1] [L1016] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=20, ~item~0!offset=0, ~status~0=1] [L1017] COND FALSE !(!(~item~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=20, ~item~0!offset=0, ~status~0=1] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, #t~nondet1=1, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=20, ~item~0!offset=0, ~status~0=1] [L993-L1018] COND FALSE !(!(0 != #t~nondet1)) [L993] havoc #t~nondet1; [L995] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L995] FCALL call write~$Pointer$(#t~malloc2, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L996] FCALL call #t~mem3 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L996] FCALL call write~$Pointer$(~item~0, { base: #t~mem3!base, offset: 4 + #t~mem3!offset }, 4); [L996] havoc #t~mem3; [L997] FCALL call #t~mem4 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L997] ~item~0 := #t~mem4; [L997] havoc #t~mem4; [L998] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~item~0!base, offset: ~item~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=16, ~item~0!offset=0, ~status~0=1] [L1000] COND FALSE !(0 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=16, ~item~0!offset=0, ~status~0=1] [L1005] COND TRUE 1 == ~status~0 [L1007] FCALL call write~int(2, { base: ~item~0!base, offset: 8 + ~item~0!offset }, 4); [L1008] ~status~0 := 2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=16, ~item~0!offset=0, ~status~0=2] [L1016] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=16, ~item~0!offset=0, ~status~0=2] [L1017] COND FALSE !(!(~item~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=16, ~item~0!offset=0, ~status~0=2] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, #t~nondet1=1, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=16, ~item~0!offset=0, ~status~0=2] [L993-L1018] COND FALSE !(!(0 != #t~nondet1)) [L993] havoc #t~nondet1; [L995] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L995] FCALL call write~$Pointer$(#t~malloc2, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L996] FCALL call #t~mem3 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L996] FCALL call write~$Pointer$(~item~0, { base: #t~mem3!base, offset: 4 + #t~mem3!offset }, 4); [L996] havoc #t~mem3; [L997] FCALL call #t~mem4 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L997] ~item~0 := #t~mem4; [L997] havoc #t~mem4; [L998] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~item~0!base, offset: ~item~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=2] [L1000] COND FALSE !(0 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=2] [L1005] COND FALSE !(1 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=2] [L1010] COND TRUE ~status~0 >= 2 [L1012] FCALL call write~int(3, { base: ~item~0!base, offset: 8 + ~item~0!offset }, 4); [L1013] ~status~0 := 3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1016] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1017] COND FALSE !(!(~item~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, #t~nondet1=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L993-L1018] COND TRUE !(0 != #t~nondet1) [L993] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1020] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1021] COND FALSE !(1 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1026] COND FALSE !(2 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1032] COND TRUE 3 == ~status~0 VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1034] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1035] FCALL call #t~mem9 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, #t~mem9!base=20, #t~mem9!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1035] COND FALSE !(!(#t~mem9 != { base: 0, offset: 0 })) [L1035] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1036] FCALL call #t~mem10 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1036] FCALL call #t~mem11 := read~$Pointer$({ base: #t~mem10!base, offset: #t~mem10!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, #t~mem10!base=20, #t~mem10!offset=0, #t~mem11!base=16, #t~mem11!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1036] COND FALSE !(!(#t~mem11 != { base: 0, offset: 0 })) [L1036] havoc #t~mem11; [L1036] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1037] FCALL call #t~mem12 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1037] FCALL call #t~mem13 := read~$Pointer$({ base: #t~mem12!base, offset: #t~mem12!offset }, 4); [L1037] FCALL call #t~mem14 := read~$Pointer$({ base: #t~mem13!base, offset: #t~mem13!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, #t~mem12!base=20, #t~mem12!offset=0, #t~mem13!base=16, #t~mem13!offset=0, #t~mem14!base=36, #t~mem14!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1037] COND FALSE !(!(#t~mem14 != { base: 0, offset: 0 })) [L1037] havoc #t~mem14; [L1037] havoc #t~mem12; [L1037] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1038] FCALL call #t~mem15 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1038] FCALL call #t~mem16 := read~$Pointer$({ base: #t~mem15!base, offset: #t~mem15!offset }, 4); [L1038] FCALL call #t~mem17 := read~$Pointer$({ base: #t~mem16!base, offset: #t~mem16!offset }, 4); [L1038] FCALL call #t~mem18 := read~int({ base: #t~mem17!base, offset: 8 + #t~mem17!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, #t~mem15!base=20, #t~mem15!offset=0, #t~mem16!base=16, #t~mem16!offset=0, #t~mem17!base=36, #t~mem17!offset=0, #t~mem18=3, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1038] COND TRUE !(3 != #t~mem18) [L1038] havoc #t~mem15; [L1038] havoc #t~mem18; [L1038] havoc #t~mem16; [L1038] havoc #t~mem17; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1038] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=21, #NULL!offset=13, old(#NULL!base)=21, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=21, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret26 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L986] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L986] ~head~0 := #t~malloc0; [L987] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L988] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L989] FCALL call write~int(0, { base: ~head~0!base, offset: 8 + ~head~0!offset }, 4); [L990] ~item~0 := ~head~0; [L991] ~status~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=27, ~item~0!offset=0, ~status~0=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~nondet1=1, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=27, ~item~0!offset=0, ~status~0=0] [L993-L1018] COND FALSE !(!(0 != #t~nondet1)) [L993] havoc #t~nondet1; [L995] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L995] FCALL call write~$Pointer$(#t~malloc2, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L996] FCALL call #t~mem3 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L996] FCALL call write~$Pointer$(~item~0, { base: #t~mem3!base, offset: 4 + #t~mem3!offset }, 4); [L996] havoc #t~mem3; [L997] FCALL call #t~mem4 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L997] ~item~0 := #t~mem4; [L997] havoc #t~mem4; [L998] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~item~0!base, offset: ~item~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=20, ~item~0!offset=0, ~status~0=0] [L1000] COND TRUE 0 == ~status~0 [L1002] FCALL call write~int(1, { base: ~item~0!base, offset: 8 + ~item~0!offset }, 4); [L1003] ~status~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=20, ~item~0!offset=0, ~status~0=1] [L1016] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=20, ~item~0!offset=0, ~status~0=1] [L1017] COND FALSE !(!(~item~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=20, ~item~0!offset=0, ~status~0=1] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, #t~nondet1=1, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=20, ~item~0!offset=0, ~status~0=1] [L993-L1018] COND FALSE !(!(0 != #t~nondet1)) [L993] havoc #t~nondet1; [L995] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L995] FCALL call write~$Pointer$(#t~malloc2, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L996] FCALL call #t~mem3 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L996] FCALL call write~$Pointer$(~item~0, { base: #t~mem3!base, offset: 4 + #t~mem3!offset }, 4); [L996] havoc #t~mem3; [L997] FCALL call #t~mem4 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L997] ~item~0 := #t~mem4; [L997] havoc #t~mem4; [L998] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~item~0!base, offset: ~item~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=16, ~item~0!offset=0, ~status~0=1] [L1000] COND FALSE !(0 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=16, ~item~0!offset=0, ~status~0=1] [L1005] COND TRUE 1 == ~status~0 [L1007] FCALL call write~int(2, { base: ~item~0!base, offset: 8 + ~item~0!offset }, 4); [L1008] ~status~0 := 2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=16, ~item~0!offset=0, ~status~0=2] [L1016] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=16, ~item~0!offset=0, ~status~0=2] [L1017] COND FALSE !(!(~item~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=16, ~item~0!offset=0, ~status~0=2] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, #t~nondet1=1, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=16, ~item~0!offset=0, ~status~0=2] [L993-L1018] COND FALSE !(!(0 != #t~nondet1)) [L993] havoc #t~nondet1; [L995] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L995] FCALL call write~$Pointer$(#t~malloc2, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L996] FCALL call #t~mem3 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L996] FCALL call write~$Pointer$(~item~0, { base: #t~mem3!base, offset: 4 + #t~mem3!offset }, 4); [L996] havoc #t~mem3; [L997] FCALL call #t~mem4 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L997] ~item~0 := #t~mem4; [L997] havoc #t~mem4; [L998] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~item~0!base, offset: ~item~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=2] [L1000] COND FALSE !(0 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=2] [L1005] COND FALSE !(1 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=2] [L1010] COND TRUE ~status~0 >= 2 [L1012] FCALL call write~int(3, { base: ~item~0!base, offset: 8 + ~item~0!offset }, 4); [L1013] ~status~0 := 3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1016] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1017] COND FALSE !(!(~item~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, #t~nondet1=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L993-L1018] COND TRUE !(0 != #t~nondet1) [L993] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1020] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1021] COND FALSE !(1 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1026] COND FALSE !(2 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1032] COND TRUE 3 == ~status~0 VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1034] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1035] FCALL call #t~mem9 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, #t~mem9!base=20, #t~mem9!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1035] COND FALSE !(!(#t~mem9 != { base: 0, offset: 0 })) [L1035] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1036] FCALL call #t~mem10 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1036] FCALL call #t~mem11 := read~$Pointer$({ base: #t~mem10!base, offset: #t~mem10!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, #t~mem10!base=20, #t~mem10!offset=0, #t~mem11!base=16, #t~mem11!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1036] COND FALSE !(!(#t~mem11 != { base: 0, offset: 0 })) [L1036] havoc #t~mem11; [L1036] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1037] FCALL call #t~mem12 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1037] FCALL call #t~mem13 := read~$Pointer$({ base: #t~mem12!base, offset: #t~mem12!offset }, 4); [L1037] FCALL call #t~mem14 := read~$Pointer$({ base: #t~mem13!base, offset: #t~mem13!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, #t~mem12!base=20, #t~mem12!offset=0, #t~mem13!base=16, #t~mem13!offset=0, #t~mem14!base=36, #t~mem14!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1037] COND FALSE !(!(#t~mem14 != { base: 0, offset: 0 })) [L1037] havoc #t~mem14; [L1037] havoc #t~mem12; [L1037] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1038] FCALL call #t~mem15 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1038] FCALL call #t~mem16 := read~$Pointer$({ base: #t~mem15!base, offset: #t~mem15!offset }, 4); [L1038] FCALL call #t~mem17 := read~$Pointer$({ base: #t~mem16!base, offset: #t~mem16!offset }, 4); [L1038] FCALL call #t~mem18 := read~int({ base: #t~mem17!base, offset: 8 + #t~mem17!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, #t~mem15!base=20, #t~mem15!offset=0, #t~mem16!base=16, #t~mem16!offset=0, #t~mem17!base=36, #t~mem17!offset=0, #t~mem18=3, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1038] COND TRUE !(3 != #t~mem18) [L1038] havoc #t~mem15; [L1038] havoc #t~mem18; [L1038] havoc #t~mem16; [L1038] havoc #t~mem17; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1038] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=21, #NULL!offset=13, old(#NULL!base)=21, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=21, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret26 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L986] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L986] ~head~0 := #t~malloc0; [L987] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L988] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L989] FCALL call write~int(0, { base: ~head~0!base, offset: 8 + ~head~0!offset }, 4); [L990] ~item~0 := ~head~0; [L991] ~status~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=27, ~item~0!offset=0, ~status~0=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~nondet1=1, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=27, ~item~0!offset=0, ~status~0=0] [L993-L1018] COND FALSE !(!(0 != #t~nondet1)) [L993] havoc #t~nondet1; [L995] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L995] FCALL call write~$Pointer$(#t~malloc2, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L996] FCALL call #t~mem3 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L996] FCALL call write~$Pointer$(~item~0, { base: #t~mem3!base, offset: 4 + #t~mem3!offset }, 4); [L996] havoc #t~mem3; [L997] FCALL call #t~mem4 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L997] ~item~0 := #t~mem4; [L997] havoc #t~mem4; [L998] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~item~0!base, offset: ~item~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=20, ~item~0!offset=0, ~status~0=0] [L1000] COND TRUE 0 == ~status~0 [L1002] FCALL call write~int(1, { base: ~item~0!base, offset: 8 + ~item~0!offset }, 4); [L1003] ~status~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=20, ~item~0!offset=0, ~status~0=1] [L1016] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=20, ~item~0!offset=0, ~status~0=1] [L1017] COND FALSE !(!(~item~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=20, ~item~0!offset=0, ~status~0=1] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, #t~nondet1=1, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=20, ~item~0!offset=0, ~status~0=1] [L993-L1018] COND FALSE !(!(0 != #t~nondet1)) [L993] havoc #t~nondet1; [L995] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L995] FCALL call write~$Pointer$(#t~malloc2, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L996] FCALL call #t~mem3 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L996] FCALL call write~$Pointer$(~item~0, { base: #t~mem3!base, offset: 4 + #t~mem3!offset }, 4); [L996] havoc #t~mem3; [L997] FCALL call #t~mem4 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L997] ~item~0 := #t~mem4; [L997] havoc #t~mem4; [L998] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~item~0!base, offset: ~item~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=16, ~item~0!offset=0, ~status~0=1] [L1000] COND FALSE !(0 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=16, ~item~0!offset=0, ~status~0=1] [L1005] COND TRUE 1 == ~status~0 [L1007] FCALL call write~int(2, { base: ~item~0!base, offset: 8 + ~item~0!offset }, 4); [L1008] ~status~0 := 2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=16, ~item~0!offset=0, ~status~0=2] [L1016] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=16, ~item~0!offset=0, ~status~0=2] [L1017] COND FALSE !(!(~item~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=16, ~item~0!offset=0, ~status~0=2] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, #t~nondet1=1, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=16, ~item~0!offset=0, ~status~0=2] [L993-L1018] COND FALSE !(!(0 != #t~nondet1)) [L993] havoc #t~nondet1; [L995] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L995] FCALL call write~$Pointer$(#t~malloc2, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L996] FCALL call #t~mem3 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L996] FCALL call write~$Pointer$(~item~0, { base: #t~mem3!base, offset: 4 + #t~mem3!offset }, 4); [L996] havoc #t~mem3; [L997] FCALL call #t~mem4 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L997] ~item~0 := #t~mem4; [L997] havoc #t~mem4; [L998] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~item~0!base, offset: ~item~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=2] [L1000] COND FALSE !(0 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=2] [L1005] COND FALSE !(1 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=2] [L1010] COND TRUE ~status~0 >= 2 [L1012] FCALL call write~int(3, { base: ~item~0!base, offset: 8 + ~item~0!offset }, 4); [L1013] ~status~0 := 3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1016] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1017] COND FALSE !(!(~item~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, #t~nondet1=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L993-L1018] COND TRUE !(0 != #t~nondet1) [L993] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1020] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1021] COND FALSE !(1 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1026] COND FALSE !(2 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1032] COND TRUE 3 == ~status~0 VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1034] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1035] FCALL call #t~mem9 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, #t~mem9!base=20, #t~mem9!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1035] COND FALSE !(!(#t~mem9 != { base: 0, offset: 0 })) [L1035] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1036] FCALL call #t~mem10 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1036] FCALL call #t~mem11 := read~$Pointer$({ base: #t~mem10!base, offset: #t~mem10!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, #t~mem10!base=20, #t~mem10!offset=0, #t~mem11!base=16, #t~mem11!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1036] COND FALSE !(!(#t~mem11 != { base: 0, offset: 0 })) [L1036] havoc #t~mem11; [L1036] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1037] FCALL call #t~mem12 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1037] FCALL call #t~mem13 := read~$Pointer$({ base: #t~mem12!base, offset: #t~mem12!offset }, 4); [L1037] FCALL call #t~mem14 := read~$Pointer$({ base: #t~mem13!base, offset: #t~mem13!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, #t~mem12!base=20, #t~mem12!offset=0, #t~mem13!base=16, #t~mem13!offset=0, #t~mem14!base=36, #t~mem14!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1037] COND FALSE !(!(#t~mem14 != { base: 0, offset: 0 })) [L1037] havoc #t~mem14; [L1037] havoc #t~mem12; [L1037] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1038] FCALL call #t~mem15 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1038] FCALL call #t~mem16 := read~$Pointer$({ base: #t~mem15!base, offset: #t~mem15!offset }, 4); [L1038] FCALL call #t~mem17 := read~$Pointer$({ base: #t~mem16!base, offset: #t~mem16!offset }, 4); [L1038] FCALL call #t~mem18 := read~int({ base: #t~mem17!base, offset: 8 + #t~mem17!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, #t~mem15!base=20, #t~mem15!offset=0, #t~mem16!base=16, #t~mem16!offset=0, #t~mem17!base=36, #t~mem17!offset=0, #t~mem18=3, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1038] COND TRUE !(3 != #t~mem18) [L1038] havoc #t~mem15; [L1038] havoc #t~mem18; [L1038] havoc #t~mem16; [L1038] havoc #t~mem17; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1038] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=21, #NULL!offset=13, old(#NULL!base)=21, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=21, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret26 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L986] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L986] ~head~0 := #t~malloc0; [L987] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L988] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L989] FCALL call write~int(0, { base: ~head~0!base, offset: 8 + ~head~0!offset }, 4); [L990] ~item~0 := ~head~0; [L991] ~status~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=27, ~item~0!offset=0, ~status~0=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~nondet1=1, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=27, ~item~0!offset=0, ~status~0=0] [L993-L1018] COND FALSE !(!(0 != #t~nondet1)) [L993] havoc #t~nondet1; [L995] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L995] FCALL call write~$Pointer$(#t~malloc2, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L996] FCALL call #t~mem3 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L996] FCALL call write~$Pointer$(~item~0, { base: #t~mem3!base, offset: 4 + #t~mem3!offset }, 4); [L996] havoc #t~mem3; [L997] FCALL call #t~mem4 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L997] ~item~0 := #t~mem4; [L997] havoc #t~mem4; [L998] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~item~0!base, offset: ~item~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=20, ~item~0!offset=0, ~status~0=0] [L1000] COND TRUE 0 == ~status~0 [L1002] FCALL call write~int(1, { base: ~item~0!base, offset: 8 + ~item~0!offset }, 4); [L1003] ~status~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=20, ~item~0!offset=0, ~status~0=1] [L1016] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=20, ~item~0!offset=0, ~status~0=1] [L1017] COND FALSE !(!(~item~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=20, ~item~0!offset=0, ~status~0=1] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, #t~nondet1=1, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=20, ~item~0!offset=0, ~status~0=1] [L993-L1018] COND FALSE !(!(0 != #t~nondet1)) [L993] havoc #t~nondet1; [L995] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L995] FCALL call write~$Pointer$(#t~malloc2, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L996] FCALL call #t~mem3 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L996] FCALL call write~$Pointer$(~item~0, { base: #t~mem3!base, offset: 4 + #t~mem3!offset }, 4); [L996] havoc #t~mem3; [L997] FCALL call #t~mem4 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L997] ~item~0 := #t~mem4; [L997] havoc #t~mem4; [L998] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~item~0!base, offset: ~item~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=16, ~item~0!offset=0, ~status~0=1] [L1000] COND FALSE !(0 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=16, ~item~0!offset=0, ~status~0=1] [L1005] COND TRUE 1 == ~status~0 [L1007] FCALL call write~int(2, { base: ~item~0!base, offset: 8 + ~item~0!offset }, 4); [L1008] ~status~0 := 2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=16, ~item~0!offset=0, ~status~0=2] [L1016] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=16, ~item~0!offset=0, ~status~0=2] [L1017] COND FALSE !(!(~item~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=16, ~item~0!offset=0, ~status~0=2] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, #t~nondet1=1, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=16, ~item~0!offset=0, ~status~0=2] [L993-L1018] COND FALSE !(!(0 != #t~nondet1)) [L993] havoc #t~nondet1; [L995] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L995] FCALL call write~$Pointer$(#t~malloc2, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L996] FCALL call #t~mem3 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L996] FCALL call write~$Pointer$(~item~0, { base: #t~mem3!base, offset: 4 + #t~mem3!offset }, 4); [L996] havoc #t~mem3; [L997] FCALL call #t~mem4 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L997] ~item~0 := #t~mem4; [L997] havoc #t~mem4; [L998] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~item~0!base, offset: ~item~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=2] [L1000] COND FALSE !(0 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=2] [L1005] COND FALSE !(1 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=2] [L1010] COND TRUE ~status~0 >= 2 [L1012] FCALL call write~int(3, { base: ~item~0!base, offset: 8 + ~item~0!offset }, 4); [L1013] ~status~0 := 3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1016] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1017] COND FALSE !(!(~item~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, #t~nondet1=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L993-L1018] COND TRUE !(0 != #t~nondet1) [L993] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1020] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1021] COND FALSE !(1 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1026] COND FALSE !(2 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1032] COND TRUE 3 == ~status~0 VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1034] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1035] FCALL call #t~mem9 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, #t~mem9!base=20, #t~mem9!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1035] COND FALSE !(!(#t~mem9 != { base: 0, offset: 0 })) [L1035] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1036] FCALL call #t~mem10 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1036] FCALL call #t~mem11 := read~$Pointer$({ base: #t~mem10!base, offset: #t~mem10!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, #t~mem10!base=20, #t~mem10!offset=0, #t~mem11!base=16, #t~mem11!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1036] COND FALSE !(!(#t~mem11 != { base: 0, offset: 0 })) [L1036] havoc #t~mem11; [L1036] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1037] FCALL call #t~mem12 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1037] FCALL call #t~mem13 := read~$Pointer$({ base: #t~mem12!base, offset: #t~mem12!offset }, 4); [L1037] FCALL call #t~mem14 := read~$Pointer$({ base: #t~mem13!base, offset: #t~mem13!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, #t~mem12!base=20, #t~mem12!offset=0, #t~mem13!base=16, #t~mem13!offset=0, #t~mem14!base=36, #t~mem14!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1037] COND FALSE !(!(#t~mem14 != { base: 0, offset: 0 })) [L1037] havoc #t~mem14; [L1037] havoc #t~mem12; [L1037] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1038] FCALL call #t~mem15 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1038] FCALL call #t~mem16 := read~$Pointer$({ base: #t~mem15!base, offset: #t~mem15!offset }, 4); [L1038] FCALL call #t~mem17 := read~$Pointer$({ base: #t~mem16!base, offset: #t~mem16!offset }, 4); [L1038] FCALL call #t~mem18 := read~int({ base: #t~mem17!base, offset: 8 + #t~mem17!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, #t~mem15!base=20, #t~mem15!offset=0, #t~mem16!base=16, #t~mem16!offset=0, #t~mem17!base=36, #t~mem17!offset=0, #t~mem18=3, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1038] COND TRUE !(3 != #t~mem18) [L1038] havoc #t~mem15; [L1038] havoc #t~mem18; [L1038] havoc #t~mem16; [L1038] havoc #t~mem17; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1038] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L986] SLL* head = malloc(sizeof(SLL)); [L987] head->next = ((void*)0) [L988] head->prev = ((void*)0) [L989] head->data = 0 [L990] SLL* item = head; [L991] int status = 0; VAL [head={27:0}, item={27:0}, malloc(sizeof(SLL))={27:0}, status=0] [L993] COND TRUE __VERIFIER_nondet_int() [L995] item->next = malloc(sizeof(SLL)) [L996] EXPR item->next [L996] item->next->prev = item [L997] EXPR item->next [L997] item = item->next [L998] item->next = ((void*)0) VAL [head={27:0}, item={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={27:0}, status=0] [L1000] COND TRUE !status [L1002] item->data = 1 [L1003] status = 1 VAL [head={27:0}, item={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={27:0}, status=1] [L1016] COND FALSE !(!(head != ((void*)0))) VAL [head={27:0}, item={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={27:0}, status=1] [L1017] COND FALSE !(!(item != ((void*)0))) VAL [head={27:0}, item={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={27:0}, status=1] [L993] COND TRUE __VERIFIER_nondet_int() [L995] item->next = malloc(sizeof(SLL)) [L996] EXPR item->next [L996] item->next->prev = item [L997] EXPR item->next [L997] item = item->next [L998] item->next = ((void*)0) VAL [head={27:0}, item={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={27:0}, status=1] [L1000] COND FALSE !(!status) VAL [head={27:0}, item={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={27:0}, status=1] [L1005] COND TRUE status == 1 [L1007] item->data = 2 [L1008] status = 2 VAL [head={27:0}, item={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={27:0}, status=2] [L1016] COND FALSE !(!(head != ((void*)0))) VAL [head={27:0}, item={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={27:0}, status=2] [L1017] COND FALSE !(!(item != ((void*)0))) VAL [head={27:0}, item={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={27:0}, status=2] [L993] COND TRUE __VERIFIER_nondet_int() [L995] item->next = malloc(sizeof(SLL)) [L996] EXPR item->next [L996] item->next->prev = item [L997] EXPR item->next [L997] item = item->next [L998] item->next = ((void*)0) VAL [head={27:0}, item={36:0}, malloc(sizeof(SLL))={36:0}, malloc(sizeof(SLL))={27:0}, status=2] [L1000] COND FALSE !(!status) VAL [head={27:0}, item={36:0}, malloc(sizeof(SLL))={36:0}, malloc(sizeof(SLL))={27:0}, status=2] [L1005] COND FALSE !(status == 1) VAL [head={27:0}, item={36:0}, malloc(sizeof(SLL))={36:0}, malloc(sizeof(SLL))={27:0}, status=2] [L1010] COND TRUE status >= 2 [L1012] item->data = 3 [L1013] status = 3 VAL [head={27:0}, item={36:0}, malloc(sizeof(SLL))={36:0}, malloc(sizeof(SLL))={27:0}, status=3] [L1016] COND FALSE !(!(head != ((void*)0))) VAL [head={27:0}, item={36:0}, malloc(sizeof(SLL))={36:0}, malloc(sizeof(SLL))={27:0}, status=3] [L1017] COND FALSE !(!(item != ((void*)0))) VAL [head={27:0}, item={36:0}, malloc(sizeof(SLL))={36:0}, malloc(sizeof(SLL))={27:0}, status=3] [L993] COND FALSE !(__VERIFIER_nondet_int()) [L1020] COND FALSE !(!(head != ((void*)0))) VAL [head={27:0}, item={36:0}, malloc(sizeof(SLL))={36:0}, malloc(sizeof(SLL))={27:0}, status=3] [L1021] COND FALSE !(status == 1) VAL [head={27:0}, item={36:0}, malloc(sizeof(SLL))={36:0}, malloc(sizeof(SLL))={27:0}, status=3] [L1026] COND FALSE !(status == 2) VAL [head={27:0}, item={36:0}, malloc(sizeof(SLL))={36:0}, malloc(sizeof(SLL))={27:0}, status=3] [L1032] COND TRUE status == 3 VAL [head={27:0}, item={36:0}, malloc(sizeof(SLL))={36:0}, malloc(sizeof(SLL))={27:0}, status=3] [L1034] COND FALSE !(!(head != ((void*)0))) VAL [head={27:0}, item={36:0}, malloc(sizeof(SLL))={36:0}, malloc(sizeof(SLL))={27:0}, status=3] [L1035] EXPR head->next VAL [head={27:0}, head->next={20:0}, item={36:0}, malloc(sizeof(SLL))={36:0}, malloc(sizeof(SLL))={27:0}, status=3] [L1035] COND FALSE !(!(head->next != ((void*)0))) [L1036] EXPR head->next [L1036] EXPR head->next->next VAL [head={27:0}, head->next={20:0}, head->next->next={16:0}, item={36:0}, malloc(sizeof(SLL))={36:0}, malloc(sizeof(SLL))={27:0}, status=3] [L1036] COND FALSE !(!(head->next->next != ((void*)0))) [L1037] EXPR head->next [L1037] EXPR head->next->next [L1037] EXPR head->next->next->next VAL [head={27:0}, head->next={20:0}, head->next->next={16:0}, head->next->next->next={36:0}, item={36:0}, malloc(sizeof(SLL))={36:0}, malloc(sizeof(SLL))={27:0}, status=3] [L1037] COND FALSE !(!(head->next->next->next != ((void*)0))) [L1038] EXPR head->next [L1038] EXPR head->next->next [L1038] EXPR head->next->next->next [L1038] EXPR head->next->next->next->data VAL [head={27:0}, head->next={20:0}, head->next->next={16:0}, head->next->next->next={36:0}, head->next->next->next->data=3, item={36:0}, malloc(sizeof(SLL))={36:0}, malloc(sizeof(SLL))={27:0}, status=3] [L1038] COND TRUE !(head->next->next->next->data != 3) [L1038] __VERIFIER_error() VAL [head={27:0}, item={36:0}, malloc(sizeof(SLL))={36:0}, malloc(sizeof(SLL))={27:0}, status=3] ----- [2018-11-23 05:34:11,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 05:34:11 BoogieIcfgContainer [2018-11-23 05:34:11,735 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 05:34:11,736 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 05:34:11,736 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 05:34:11,736 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 05:34:11,736 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:30:48" (3/4) ... [2018-11-23 05:34:11,738 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|=21, |#NULL.offset|=13, |old(#NULL.base)|=21, |old(#NULL.offset)|=13] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=21, |old(#NULL.offset)|=13] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=21, |old(#NULL.offset)|=13] [?] RET #344#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret26 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4);call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4);call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4);~item~0.base, ~item~0.offset := ~head~0.base, ~head~0.offset;~status~0 := 0; VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=27, main_~item~0.offset=0, main_~status~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=27, main_~item~0.offset=0, main_~status~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~nondet1|=1] [?] assume !!(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~item~0.base, ~item~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4);call write~$Pointer$(~item~0.base, ~item~0.offset, #t~mem3.base, 4 + #t~mem3.offset, 4);havoc #t~mem3.base, #t~mem3.offset;call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4);~item~0.base, ~item~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset;call write~$Pointer$(0, 0, ~item~0.base, ~item~0.offset, 4); VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=20, main_~item~0.offset=0, main_~status~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=20, |main_#t~malloc2.offset|=0] [?] assume 0 == ~status~0;call write~int(1, ~item~0.base, 8 + ~item~0.offset, 4);~status~0 := 1; VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=20, main_~item~0.offset=0, main_~status~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=20, |main_#t~malloc2.offset|=0] [?] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=20, main_~item~0.offset=0, main_~status~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=20, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=20, main_~item~0.offset=0, main_~status~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=20, |main_#t~malloc2.offset|=0] [?] assume !!(~item~0.base != 0 || ~item~0.offset != 0); VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=20, main_~item~0.offset=0, main_~status~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=20, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=20, main_~item~0.offset=0, main_~status~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=20, |main_#t~malloc2.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=20, main_~item~0.offset=0, main_~status~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=20, |main_#t~malloc2.offset|=0, |main_#t~nondet1|=1] [?] assume !!(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~item~0.base, ~item~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4);call write~$Pointer$(~item~0.base, ~item~0.offset, #t~mem3.base, 4 + #t~mem3.offset, 4);havoc #t~mem3.base, #t~mem3.offset;call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4);~item~0.base, ~item~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset;call write~$Pointer$(0, 0, ~item~0.base, ~item~0.offset, 4); VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=16, main_~item~0.offset=0, main_~status~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0] [?] assume !(0 == ~status~0); VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=16, main_~item~0.offset=0, main_~status~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0] [?] assume 1 == ~status~0;call write~int(2, ~item~0.base, 8 + ~item~0.offset, 4);~status~0 := 2; VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=16, main_~item~0.offset=0, main_~status~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0] [?] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=16, main_~item~0.offset=0, main_~status~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=16, main_~item~0.offset=0, main_~status~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0] [?] assume !!(~item~0.base != 0 || ~item~0.offset != 0); VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=16, main_~item~0.offset=0, main_~status~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=16, main_~item~0.offset=0, main_~status~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=16, main_~item~0.offset=0, main_~status~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0, |main_#t~nondet1|=1] [?] assume !!(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~item~0.base, ~item~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4);call write~$Pointer$(~item~0.base, ~item~0.offset, #t~mem3.base, 4 + #t~mem3.offset, 4);havoc #t~mem3.base, #t~mem3.offset;call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4);~item~0.base, ~item~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset;call write~$Pointer$(0, 0, ~item~0.base, ~item~0.offset, 4); VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0] [?] assume !(0 == ~status~0); VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0] [?] assume !(1 == ~status~0); VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0] [?] assume ~status~0 >= 2;call write~int(3, ~item~0.base, 8 + ~item~0.offset, 4);~status~0 := 3; VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0] [?] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0] [?] assume !!(~item~0.base != 0 || ~item~0.offset != 0); VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0, |main_#t~nondet1|=0] [?] assume !(0 != #t~nondet1);havoc #t~nondet1; VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0] [?] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0] [?] assume !(1 == ~status~0); VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0] [?] assume !(2 == ~status~0); VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0] [?] assume 3 == ~status~0; VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0] [?] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0] [?] call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0, |main_#t~mem9.base|=20, |main_#t~mem9.offset|=0] [?] assume !!(#t~mem9.base != 0 || #t~mem9.offset != 0);havoc #t~mem9.base, #t~mem9.offset; VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0] [?] call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4);call #t~mem11.base, #t~mem11.offset := read~$Pointer$(#t~mem10.base, #t~mem10.offset, 4); VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0, |main_#t~mem10.base|=20, |main_#t~mem10.offset|=0, |main_#t~mem11.base|=16, |main_#t~mem11.offset|=0] [?] assume !!(#t~mem11.base != 0 || #t~mem11.offset != 0);havoc #t~mem11.base, #t~mem11.offset;havoc #t~mem10.base, #t~mem10.offset; VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0] [?] call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4);call #t~mem13.base, #t~mem13.offset := read~$Pointer$(#t~mem12.base, #t~mem12.offset, 4);call #t~mem14.base, #t~mem14.offset := read~$Pointer$(#t~mem13.base, #t~mem13.offset, 4); VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0, |main_#t~mem12.base|=20, |main_#t~mem12.offset|=0, |main_#t~mem13.base|=16, |main_#t~mem13.offset|=0, |main_#t~mem14.base|=36, |main_#t~mem14.offset|=0] [?] assume !!(#t~mem14.base != 0 || #t~mem14.offset != 0);havoc #t~mem14.base, #t~mem14.offset;havoc #t~mem12.base, #t~mem12.offset;havoc #t~mem13.base, #t~mem13.offset; VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0] [?] call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, #t~mem15.offset, 4);call #t~mem17.base, #t~mem17.offset := read~$Pointer$(#t~mem16.base, #t~mem16.offset, 4);call #t~mem18 := read~int(#t~mem17.base, 8 + #t~mem17.offset, 4); VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0, |main_#t~mem15.base|=20, |main_#t~mem15.offset|=0, |main_#t~mem16.base|=16, |main_#t~mem16.offset|=0, |main_#t~mem17.base|=36, |main_#t~mem17.offset|=0, |main_#t~mem18|=3] [?] assume !(3 != #t~mem18);havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem18;havoc #t~mem16.base, #t~mem16.offset;havoc #t~mem17.base, #t~mem17.offset; VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0] [?] assume !false; VAL [main_~head~0.base=27, main_~head~0.offset=0, main_~item~0.base=36, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=27, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=36, |main_#t~malloc2.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=21, #NULL.offset=13, old(#NULL.base)=21, old(#NULL.offset)=13] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=21, old(#NULL.offset)=13] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=21, old(#NULL.offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret26 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L986] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12); [L986] ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; [L987] call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); [L988] call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4); [L989] call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); [L990] ~item~0.base, ~item~0.offset := ~head~0.base, ~head~0.offset; [L991] ~status~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=27, ~item~0.offset=0, ~status~0=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~nondet1=1, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=27, ~item~0.offset=0, ~status~0=0] [L993-L1018] assume !!(0 != #t~nondet1); [L993] havoc #t~nondet1; [L995] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12); [L995] call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~item~0.base, ~item~0.offset, 4); [L996] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4); [L996] call write~$Pointer$(~item~0.base, ~item~0.offset, #t~mem3.base, 4 + #t~mem3.offset, 4); [L996] havoc #t~mem3.base, #t~mem3.offset; [L997] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4); [L997] ~item~0.base, ~item~0.offset := #t~mem4.base, #t~mem4.offset; [L997] havoc #t~mem4.base, #t~mem4.offset; [L998] call write~$Pointer$(0, 0, ~item~0.base, ~item~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=20, ~item~0.offset=0, ~status~0=0] [L1000-L1014] assume 0 == ~status~0; [L1002] call write~int(1, ~item~0.base, 8 + ~item~0.offset, 4); [L1003] ~status~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=20, ~item~0.offset=0, ~status~0=1] [L1016] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=20, ~item~0.offset=0, ~status~0=1] [L1017] assume !!(~item~0.base != 0 || ~item~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=20, ~item~0.offset=0, ~status~0=1] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, #t~nondet1=1, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=20, ~item~0.offset=0, ~status~0=1] [L993-L1018] assume !!(0 != #t~nondet1); [L993] havoc #t~nondet1; [L995] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12); [L995] call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~item~0.base, ~item~0.offset, 4); [L996] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4); [L996] call write~$Pointer$(~item~0.base, ~item~0.offset, #t~mem3.base, 4 + #t~mem3.offset, 4); [L996] havoc #t~mem3.base, #t~mem3.offset; [L997] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4); [L997] ~item~0.base, ~item~0.offset := #t~mem4.base, #t~mem4.offset; [L997] havoc #t~mem4.base, #t~mem4.offset; [L998] call write~$Pointer$(0, 0, ~item~0.base, ~item~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=16, ~item~0.offset=0, ~status~0=1] [L1000-L1014] assume !(0 == ~status~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=16, ~item~0.offset=0, ~status~0=1] [L1005-L1014] assume 1 == ~status~0; [L1007] call write~int(2, ~item~0.base, 8 + ~item~0.offset, 4); [L1008] ~status~0 := 2; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=16, ~item~0.offset=0, ~status~0=2] [L1016] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=16, ~item~0.offset=0, ~status~0=2] [L1017] assume !!(~item~0.base != 0 || ~item~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=16, ~item~0.offset=0, ~status~0=2] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, #t~nondet1=1, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=16, ~item~0.offset=0, ~status~0=2] [L993-L1018] assume !!(0 != #t~nondet1); [L993] havoc #t~nondet1; [L995] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12); [L995] call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~item~0.base, ~item~0.offset, 4); [L996] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4); [L996] call write~$Pointer$(~item~0.base, ~item~0.offset, #t~mem3.base, 4 + #t~mem3.offset, 4); [L996] havoc #t~mem3.base, #t~mem3.offset; [L997] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4); [L997] ~item~0.base, ~item~0.offset := #t~mem4.base, #t~mem4.offset; [L997] havoc #t~mem4.base, #t~mem4.offset; [L998] call write~$Pointer$(0, 0, ~item~0.base, ~item~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=2] [L1000-L1014] assume !(0 == ~status~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=2] [L1005-L1014] assume !(1 == ~status~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=2] [L1010-L1014] assume ~status~0 >= 2; [L1012] call write~int(3, ~item~0.base, 8 + ~item~0.offset, 4); [L1013] ~status~0 := 3; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1016] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1017] assume !!(~item~0.base != 0 || ~item~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, #t~nondet1=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L993-L1018] assume !(0 != #t~nondet1); [L993] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1020] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1021-L1025] assume !(1 == ~status~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1026-L1031] assume !(2 == ~status~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1032-L1039] assume 3 == ~status~0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1034] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1035] call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, #t~mem9.base=20, #t~mem9.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1035] assume !!(#t~mem9.base != 0 || #t~mem9.offset != 0); [L1035] havoc #t~mem9.base, #t~mem9.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1036] call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); [L1036] call #t~mem11.base, #t~mem11.offset := read~$Pointer$(#t~mem10.base, #t~mem10.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, #t~mem10.base=20, #t~mem10.offset=0, #t~mem11.base=16, #t~mem11.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1036] assume !!(#t~mem11.base != 0 || #t~mem11.offset != 0); [L1036] havoc #t~mem11.base, #t~mem11.offset; [L1036] havoc #t~mem10.base, #t~mem10.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1037] call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); [L1037] call #t~mem13.base, #t~mem13.offset := read~$Pointer$(#t~mem12.base, #t~mem12.offset, 4); [L1037] call #t~mem14.base, #t~mem14.offset := read~$Pointer$(#t~mem13.base, #t~mem13.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, #t~mem12.base=20, #t~mem12.offset=0, #t~mem13.base=16, #t~mem13.offset=0, #t~mem14.base=36, #t~mem14.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1037] assume !!(#t~mem14.base != 0 || #t~mem14.offset != 0); [L1037] havoc #t~mem14.base, #t~mem14.offset; [L1037] havoc #t~mem12.base, #t~mem12.offset; [L1037] havoc #t~mem13.base, #t~mem13.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1038] call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); [L1038] call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, #t~mem15.offset, 4); [L1038] call #t~mem17.base, #t~mem17.offset := read~$Pointer$(#t~mem16.base, #t~mem16.offset, 4); [L1038] call #t~mem18 := read~int(#t~mem17.base, 8 + #t~mem17.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, #t~mem15.base=20, #t~mem15.offset=0, #t~mem16.base=16, #t~mem16.offset=0, #t~mem17.base=36, #t~mem17.offset=0, #t~mem18=3, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1038] assume !(3 != #t~mem18); [L1038] havoc #t~mem15.base, #t~mem15.offset; [L1038] havoc #t~mem18; [L1038] havoc #t~mem16.base, #t~mem16.offset; [L1038] havoc #t~mem17.base, #t~mem17.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1038] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=21, #NULL.offset=13, old(#NULL.base)=21, old(#NULL.offset)=13] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=21, old(#NULL.offset)=13] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=21, old(#NULL.offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret26 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L986] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12); [L986] ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; [L987] call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); [L988] call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4); [L989] call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); [L990] ~item~0.base, ~item~0.offset := ~head~0.base, ~head~0.offset; [L991] ~status~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=27, ~item~0.offset=0, ~status~0=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~nondet1=1, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=27, ~item~0.offset=0, ~status~0=0] [L993-L1018] assume !!(0 != #t~nondet1); [L993] havoc #t~nondet1; [L995] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12); [L995] call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~item~0.base, ~item~0.offset, 4); [L996] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4); [L996] call write~$Pointer$(~item~0.base, ~item~0.offset, #t~mem3.base, 4 + #t~mem3.offset, 4); [L996] havoc #t~mem3.base, #t~mem3.offset; [L997] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4); [L997] ~item~0.base, ~item~0.offset := #t~mem4.base, #t~mem4.offset; [L997] havoc #t~mem4.base, #t~mem4.offset; [L998] call write~$Pointer$(0, 0, ~item~0.base, ~item~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=20, ~item~0.offset=0, ~status~0=0] [L1000-L1014] assume 0 == ~status~0; [L1002] call write~int(1, ~item~0.base, 8 + ~item~0.offset, 4); [L1003] ~status~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=20, ~item~0.offset=0, ~status~0=1] [L1016] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=20, ~item~0.offset=0, ~status~0=1] [L1017] assume !!(~item~0.base != 0 || ~item~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=20, ~item~0.offset=0, ~status~0=1] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, #t~nondet1=1, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=20, ~item~0.offset=0, ~status~0=1] [L993-L1018] assume !!(0 != #t~nondet1); [L993] havoc #t~nondet1; [L995] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12); [L995] call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~item~0.base, ~item~0.offset, 4); [L996] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4); [L996] call write~$Pointer$(~item~0.base, ~item~0.offset, #t~mem3.base, 4 + #t~mem3.offset, 4); [L996] havoc #t~mem3.base, #t~mem3.offset; [L997] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4); [L997] ~item~0.base, ~item~0.offset := #t~mem4.base, #t~mem4.offset; [L997] havoc #t~mem4.base, #t~mem4.offset; [L998] call write~$Pointer$(0, 0, ~item~0.base, ~item~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=16, ~item~0.offset=0, ~status~0=1] [L1000-L1014] assume !(0 == ~status~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=16, ~item~0.offset=0, ~status~0=1] [L1005-L1014] assume 1 == ~status~0; [L1007] call write~int(2, ~item~0.base, 8 + ~item~0.offset, 4); [L1008] ~status~0 := 2; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=16, ~item~0.offset=0, ~status~0=2] [L1016] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=16, ~item~0.offset=0, ~status~0=2] [L1017] assume !!(~item~0.base != 0 || ~item~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=16, ~item~0.offset=0, ~status~0=2] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, #t~nondet1=1, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=16, ~item~0.offset=0, ~status~0=2] [L993-L1018] assume !!(0 != #t~nondet1); [L993] havoc #t~nondet1; [L995] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12); [L995] call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~item~0.base, ~item~0.offset, 4); [L996] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4); [L996] call write~$Pointer$(~item~0.base, ~item~0.offset, #t~mem3.base, 4 + #t~mem3.offset, 4); [L996] havoc #t~mem3.base, #t~mem3.offset; [L997] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4); [L997] ~item~0.base, ~item~0.offset := #t~mem4.base, #t~mem4.offset; [L997] havoc #t~mem4.base, #t~mem4.offset; [L998] call write~$Pointer$(0, 0, ~item~0.base, ~item~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=2] [L1000-L1014] assume !(0 == ~status~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=2] [L1005-L1014] assume !(1 == ~status~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=2] [L1010-L1014] assume ~status~0 >= 2; [L1012] call write~int(3, ~item~0.base, 8 + ~item~0.offset, 4); [L1013] ~status~0 := 3; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1016] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1017] assume !!(~item~0.base != 0 || ~item~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, #t~nondet1=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L993-L1018] assume !(0 != #t~nondet1); [L993] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1020] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1021-L1025] assume !(1 == ~status~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1026-L1031] assume !(2 == ~status~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1032-L1039] assume 3 == ~status~0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1034] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1035] call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, #t~mem9.base=20, #t~mem9.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1035] assume !!(#t~mem9.base != 0 || #t~mem9.offset != 0); [L1035] havoc #t~mem9.base, #t~mem9.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1036] call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); [L1036] call #t~mem11.base, #t~mem11.offset := read~$Pointer$(#t~mem10.base, #t~mem10.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, #t~mem10.base=20, #t~mem10.offset=0, #t~mem11.base=16, #t~mem11.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1036] assume !!(#t~mem11.base != 0 || #t~mem11.offset != 0); [L1036] havoc #t~mem11.base, #t~mem11.offset; [L1036] havoc #t~mem10.base, #t~mem10.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1037] call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); [L1037] call #t~mem13.base, #t~mem13.offset := read~$Pointer$(#t~mem12.base, #t~mem12.offset, 4); [L1037] call #t~mem14.base, #t~mem14.offset := read~$Pointer$(#t~mem13.base, #t~mem13.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, #t~mem12.base=20, #t~mem12.offset=0, #t~mem13.base=16, #t~mem13.offset=0, #t~mem14.base=36, #t~mem14.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1037] assume !!(#t~mem14.base != 0 || #t~mem14.offset != 0); [L1037] havoc #t~mem14.base, #t~mem14.offset; [L1037] havoc #t~mem12.base, #t~mem12.offset; [L1037] havoc #t~mem13.base, #t~mem13.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1038] call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); [L1038] call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, #t~mem15.offset, 4); [L1038] call #t~mem17.base, #t~mem17.offset := read~$Pointer$(#t~mem16.base, #t~mem16.offset, 4); [L1038] call #t~mem18 := read~int(#t~mem17.base, 8 + #t~mem17.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, #t~mem15.base=20, #t~mem15.offset=0, #t~mem16.base=16, #t~mem16.offset=0, #t~mem17.base=36, #t~mem17.offset=0, #t~mem18=3, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1038] assume !(3 != #t~mem18); [L1038] havoc #t~mem15.base, #t~mem15.offset; [L1038] havoc #t~mem18; [L1038] havoc #t~mem16.base, #t~mem16.offset; [L1038] havoc #t~mem17.base, #t~mem17.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [L1038] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=27, #t~malloc0.offset=0, #t~malloc2.base=36, #t~malloc2.offset=0, ~head~0.base=27, ~head~0.offset=0, ~item~0.base=36, ~item~0.offset=0, ~status~0=3] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=21, #NULL!offset=13, old(#NULL!base)=21, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=21, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret26 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L986] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L986] ~head~0 := #t~malloc0; [L987] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L988] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L989] FCALL call write~int(0, { base: ~head~0!base, offset: 8 + ~head~0!offset }, 4); [L990] ~item~0 := ~head~0; [L991] ~status~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=27, ~item~0!offset=0, ~status~0=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~nondet1=1, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=27, ~item~0!offset=0, ~status~0=0] [L993-L1018] COND FALSE !(!(0 != #t~nondet1)) [L993] havoc #t~nondet1; [L995] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L995] FCALL call write~$Pointer$(#t~malloc2, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L996] FCALL call #t~mem3 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L996] FCALL call write~$Pointer$(~item~0, { base: #t~mem3!base, offset: 4 + #t~mem3!offset }, 4); [L996] havoc #t~mem3; [L997] FCALL call #t~mem4 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L997] ~item~0 := #t~mem4; [L997] havoc #t~mem4; [L998] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~item~0!base, offset: ~item~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=20, ~item~0!offset=0, ~status~0=0] [L1000] COND TRUE 0 == ~status~0 [L1002] FCALL call write~int(1, { base: ~item~0!base, offset: 8 + ~item~0!offset }, 4); [L1003] ~status~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=20, ~item~0!offset=0, ~status~0=1] [L1016] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=20, ~item~0!offset=0, ~status~0=1] [L1017] COND FALSE !(!(~item~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=20, ~item~0!offset=0, ~status~0=1] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, #t~nondet1=1, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=20, ~item~0!offset=0, ~status~0=1] [L993-L1018] COND FALSE !(!(0 != #t~nondet1)) [L993] havoc #t~nondet1; [L995] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L995] FCALL call write~$Pointer$(#t~malloc2, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L996] FCALL call #t~mem3 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L996] FCALL call write~$Pointer$(~item~0, { base: #t~mem3!base, offset: 4 + #t~mem3!offset }, 4); [L996] havoc #t~mem3; [L997] FCALL call #t~mem4 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L997] ~item~0 := #t~mem4; [L997] havoc #t~mem4; [L998] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~item~0!base, offset: ~item~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=16, ~item~0!offset=0, ~status~0=1] [L1000] COND FALSE !(0 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=16, ~item~0!offset=0, ~status~0=1] [L1005] COND TRUE 1 == ~status~0 [L1007] FCALL call write~int(2, { base: ~item~0!base, offset: 8 + ~item~0!offset }, 4); [L1008] ~status~0 := 2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=16, ~item~0!offset=0, ~status~0=2] [L1016] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=16, ~item~0!offset=0, ~status~0=2] [L1017] COND FALSE !(!(~item~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=16, ~item~0!offset=0, ~status~0=2] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, #t~nondet1=1, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=16, ~item~0!offset=0, ~status~0=2] [L993-L1018] COND FALSE !(!(0 != #t~nondet1)) [L993] havoc #t~nondet1; [L995] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L995] FCALL call write~$Pointer$(#t~malloc2, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L996] FCALL call #t~mem3 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L996] FCALL call write~$Pointer$(~item~0, { base: #t~mem3!base, offset: 4 + #t~mem3!offset }, 4); [L996] havoc #t~mem3; [L997] FCALL call #t~mem4 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L997] ~item~0 := #t~mem4; [L997] havoc #t~mem4; [L998] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~item~0!base, offset: ~item~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=2] [L1000] COND FALSE !(0 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=2] [L1005] COND FALSE !(1 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=2] [L1010] COND TRUE ~status~0 >= 2 [L1012] FCALL call write~int(3, { base: ~item~0!base, offset: 8 + ~item~0!offset }, 4); [L1013] ~status~0 := 3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1016] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1017] COND FALSE !(!(~item~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, #t~nondet1=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L993-L1018] COND TRUE !(0 != #t~nondet1) [L993] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1020] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1021] COND FALSE !(1 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1026] COND FALSE !(2 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1032] COND TRUE 3 == ~status~0 VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1034] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1035] FCALL call #t~mem9 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, #t~mem9!base=20, #t~mem9!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1035] COND FALSE !(!(#t~mem9 != { base: 0, offset: 0 })) [L1035] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1036] FCALL call #t~mem10 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1036] FCALL call #t~mem11 := read~$Pointer$({ base: #t~mem10!base, offset: #t~mem10!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, #t~mem10!base=20, #t~mem10!offset=0, #t~mem11!base=16, #t~mem11!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1036] COND FALSE !(!(#t~mem11 != { base: 0, offset: 0 })) [L1036] havoc #t~mem11; [L1036] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1037] FCALL call #t~mem12 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1037] FCALL call #t~mem13 := read~$Pointer$({ base: #t~mem12!base, offset: #t~mem12!offset }, 4); [L1037] FCALL call #t~mem14 := read~$Pointer$({ base: #t~mem13!base, offset: #t~mem13!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, #t~mem12!base=20, #t~mem12!offset=0, #t~mem13!base=16, #t~mem13!offset=0, #t~mem14!base=36, #t~mem14!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1037] COND FALSE !(!(#t~mem14 != { base: 0, offset: 0 })) [L1037] havoc #t~mem14; [L1037] havoc #t~mem12; [L1037] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1038] FCALL call #t~mem15 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1038] FCALL call #t~mem16 := read~$Pointer$({ base: #t~mem15!base, offset: #t~mem15!offset }, 4); [L1038] FCALL call #t~mem17 := read~$Pointer$({ base: #t~mem16!base, offset: #t~mem16!offset }, 4); [L1038] FCALL call #t~mem18 := read~int({ base: #t~mem17!base, offset: 8 + #t~mem17!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, #t~mem15!base=20, #t~mem15!offset=0, #t~mem16!base=16, #t~mem16!offset=0, #t~mem17!base=36, #t~mem17!offset=0, #t~mem18=3, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1038] COND TRUE !(3 != #t~mem18) [L1038] havoc #t~mem15; [L1038] havoc #t~mem18; [L1038] havoc #t~mem16; [L1038] havoc #t~mem17; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1038] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=21, #NULL!offset=13, old(#NULL!base)=21, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=21, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret26 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L986] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L986] ~head~0 := #t~malloc0; [L987] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L988] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L989] FCALL call write~int(0, { base: ~head~0!base, offset: 8 + ~head~0!offset }, 4); [L990] ~item~0 := ~head~0; [L991] ~status~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=27, ~item~0!offset=0, ~status~0=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~nondet1=1, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=27, ~item~0!offset=0, ~status~0=0] [L993-L1018] COND FALSE !(!(0 != #t~nondet1)) [L993] havoc #t~nondet1; [L995] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L995] FCALL call write~$Pointer$(#t~malloc2, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L996] FCALL call #t~mem3 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L996] FCALL call write~$Pointer$(~item~0, { base: #t~mem3!base, offset: 4 + #t~mem3!offset }, 4); [L996] havoc #t~mem3; [L997] FCALL call #t~mem4 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L997] ~item~0 := #t~mem4; [L997] havoc #t~mem4; [L998] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~item~0!base, offset: ~item~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=20, ~item~0!offset=0, ~status~0=0] [L1000] COND TRUE 0 == ~status~0 [L1002] FCALL call write~int(1, { base: ~item~0!base, offset: 8 + ~item~0!offset }, 4); [L1003] ~status~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=20, ~item~0!offset=0, ~status~0=1] [L1016] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=20, ~item~0!offset=0, ~status~0=1] [L1017] COND FALSE !(!(~item~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=20, ~item~0!offset=0, ~status~0=1] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, #t~nondet1=1, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=20, ~item~0!offset=0, ~status~0=1] [L993-L1018] COND FALSE !(!(0 != #t~nondet1)) [L993] havoc #t~nondet1; [L995] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L995] FCALL call write~$Pointer$(#t~malloc2, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L996] FCALL call #t~mem3 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L996] FCALL call write~$Pointer$(~item~0, { base: #t~mem3!base, offset: 4 + #t~mem3!offset }, 4); [L996] havoc #t~mem3; [L997] FCALL call #t~mem4 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L997] ~item~0 := #t~mem4; [L997] havoc #t~mem4; [L998] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~item~0!base, offset: ~item~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=16, ~item~0!offset=0, ~status~0=1] [L1000] COND FALSE !(0 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=16, ~item~0!offset=0, ~status~0=1] [L1005] COND TRUE 1 == ~status~0 [L1007] FCALL call write~int(2, { base: ~item~0!base, offset: 8 + ~item~0!offset }, 4); [L1008] ~status~0 := 2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=16, ~item~0!offset=0, ~status~0=2] [L1016] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=16, ~item~0!offset=0, ~status~0=2] [L1017] COND FALSE !(!(~item~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=16, ~item~0!offset=0, ~status~0=2] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, #t~nondet1=1, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=16, ~item~0!offset=0, ~status~0=2] [L993-L1018] COND FALSE !(!(0 != #t~nondet1)) [L993] havoc #t~nondet1; [L995] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L995] FCALL call write~$Pointer$(#t~malloc2, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L996] FCALL call #t~mem3 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L996] FCALL call write~$Pointer$(~item~0, { base: #t~mem3!base, offset: 4 + #t~mem3!offset }, 4); [L996] havoc #t~mem3; [L997] FCALL call #t~mem4 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L997] ~item~0 := #t~mem4; [L997] havoc #t~mem4; [L998] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~item~0!base, offset: ~item~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=2] [L1000] COND FALSE !(0 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=2] [L1005] COND FALSE !(1 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=2] [L1010] COND TRUE ~status~0 >= 2 [L1012] FCALL call write~int(3, { base: ~item~0!base, offset: 8 + ~item~0!offset }, 4); [L1013] ~status~0 := 3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1016] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1017] COND FALSE !(!(~item~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, #t~nondet1=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L993-L1018] COND TRUE !(0 != #t~nondet1) [L993] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1020] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1021] COND FALSE !(1 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1026] COND FALSE !(2 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1032] COND TRUE 3 == ~status~0 VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1034] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1035] FCALL call #t~mem9 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, #t~mem9!base=20, #t~mem9!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1035] COND FALSE !(!(#t~mem9 != { base: 0, offset: 0 })) [L1035] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1036] FCALL call #t~mem10 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1036] FCALL call #t~mem11 := read~$Pointer$({ base: #t~mem10!base, offset: #t~mem10!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, #t~mem10!base=20, #t~mem10!offset=0, #t~mem11!base=16, #t~mem11!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1036] COND FALSE !(!(#t~mem11 != { base: 0, offset: 0 })) [L1036] havoc #t~mem11; [L1036] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1037] FCALL call #t~mem12 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1037] FCALL call #t~mem13 := read~$Pointer$({ base: #t~mem12!base, offset: #t~mem12!offset }, 4); [L1037] FCALL call #t~mem14 := read~$Pointer$({ base: #t~mem13!base, offset: #t~mem13!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, #t~mem12!base=20, #t~mem12!offset=0, #t~mem13!base=16, #t~mem13!offset=0, #t~mem14!base=36, #t~mem14!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1037] COND FALSE !(!(#t~mem14 != { base: 0, offset: 0 })) [L1037] havoc #t~mem14; [L1037] havoc #t~mem12; [L1037] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1038] FCALL call #t~mem15 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1038] FCALL call #t~mem16 := read~$Pointer$({ base: #t~mem15!base, offset: #t~mem15!offset }, 4); [L1038] FCALL call #t~mem17 := read~$Pointer$({ base: #t~mem16!base, offset: #t~mem16!offset }, 4); [L1038] FCALL call #t~mem18 := read~int({ base: #t~mem17!base, offset: 8 + #t~mem17!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, #t~mem15!base=20, #t~mem15!offset=0, #t~mem16!base=16, #t~mem16!offset=0, #t~mem17!base=36, #t~mem17!offset=0, #t~mem18=3, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1038] COND TRUE !(3 != #t~mem18) [L1038] havoc #t~mem15; [L1038] havoc #t~mem18; [L1038] havoc #t~mem16; [L1038] havoc #t~mem17; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1038] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=21, #NULL!offset=13, old(#NULL!base)=21, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=21, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret26 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L986] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L986] ~head~0 := #t~malloc0; [L987] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L988] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L989] FCALL call write~int(0, { base: ~head~0!base, offset: 8 + ~head~0!offset }, 4); [L990] ~item~0 := ~head~0; [L991] ~status~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=27, ~item~0!offset=0, ~status~0=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~nondet1=1, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=27, ~item~0!offset=0, ~status~0=0] [L993-L1018] COND FALSE !(!(0 != #t~nondet1)) [L993] havoc #t~nondet1; [L995] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L995] FCALL call write~$Pointer$(#t~malloc2, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L996] FCALL call #t~mem3 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L996] FCALL call write~$Pointer$(~item~0, { base: #t~mem3!base, offset: 4 + #t~mem3!offset }, 4); [L996] havoc #t~mem3; [L997] FCALL call #t~mem4 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L997] ~item~0 := #t~mem4; [L997] havoc #t~mem4; [L998] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~item~0!base, offset: ~item~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=20, ~item~0!offset=0, ~status~0=0] [L1000] COND TRUE 0 == ~status~0 [L1002] FCALL call write~int(1, { base: ~item~0!base, offset: 8 + ~item~0!offset }, 4); [L1003] ~status~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=20, ~item~0!offset=0, ~status~0=1] [L1016] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=20, ~item~0!offset=0, ~status~0=1] [L1017] COND FALSE !(!(~item~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=20, ~item~0!offset=0, ~status~0=1] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, #t~nondet1=1, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=20, ~item~0!offset=0, ~status~0=1] [L993-L1018] COND FALSE !(!(0 != #t~nondet1)) [L993] havoc #t~nondet1; [L995] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L995] FCALL call write~$Pointer$(#t~malloc2, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L996] FCALL call #t~mem3 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L996] FCALL call write~$Pointer$(~item~0, { base: #t~mem3!base, offset: 4 + #t~mem3!offset }, 4); [L996] havoc #t~mem3; [L997] FCALL call #t~mem4 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L997] ~item~0 := #t~mem4; [L997] havoc #t~mem4; [L998] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~item~0!base, offset: ~item~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=16, ~item~0!offset=0, ~status~0=1] [L1000] COND FALSE !(0 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=16, ~item~0!offset=0, ~status~0=1] [L1005] COND TRUE 1 == ~status~0 [L1007] FCALL call write~int(2, { base: ~item~0!base, offset: 8 + ~item~0!offset }, 4); [L1008] ~status~0 := 2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=16, ~item~0!offset=0, ~status~0=2] [L1016] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=16, ~item~0!offset=0, ~status~0=2] [L1017] COND FALSE !(!(~item~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=16, ~item~0!offset=0, ~status~0=2] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, #t~nondet1=1, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=16, ~item~0!offset=0, ~status~0=2] [L993-L1018] COND FALSE !(!(0 != #t~nondet1)) [L993] havoc #t~nondet1; [L995] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L995] FCALL call write~$Pointer$(#t~malloc2, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L996] FCALL call #t~mem3 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L996] FCALL call write~$Pointer$(~item~0, { base: #t~mem3!base, offset: 4 + #t~mem3!offset }, 4); [L996] havoc #t~mem3; [L997] FCALL call #t~mem4 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L997] ~item~0 := #t~mem4; [L997] havoc #t~mem4; [L998] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~item~0!base, offset: ~item~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=2] [L1000] COND FALSE !(0 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=2] [L1005] COND FALSE !(1 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=2] [L1010] COND TRUE ~status~0 >= 2 [L1012] FCALL call write~int(3, { base: ~item~0!base, offset: 8 + ~item~0!offset }, 4); [L1013] ~status~0 := 3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1016] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1017] COND FALSE !(!(~item~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, #t~nondet1=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L993-L1018] COND TRUE !(0 != #t~nondet1) [L993] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1020] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1021] COND FALSE !(1 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1026] COND FALSE !(2 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1032] COND TRUE 3 == ~status~0 VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1034] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1035] FCALL call #t~mem9 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, #t~mem9!base=20, #t~mem9!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1035] COND FALSE !(!(#t~mem9 != { base: 0, offset: 0 })) [L1035] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1036] FCALL call #t~mem10 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1036] FCALL call #t~mem11 := read~$Pointer$({ base: #t~mem10!base, offset: #t~mem10!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, #t~mem10!base=20, #t~mem10!offset=0, #t~mem11!base=16, #t~mem11!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1036] COND FALSE !(!(#t~mem11 != { base: 0, offset: 0 })) [L1036] havoc #t~mem11; [L1036] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1037] FCALL call #t~mem12 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1037] FCALL call #t~mem13 := read~$Pointer$({ base: #t~mem12!base, offset: #t~mem12!offset }, 4); [L1037] FCALL call #t~mem14 := read~$Pointer$({ base: #t~mem13!base, offset: #t~mem13!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, #t~mem12!base=20, #t~mem12!offset=0, #t~mem13!base=16, #t~mem13!offset=0, #t~mem14!base=36, #t~mem14!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1037] COND FALSE !(!(#t~mem14 != { base: 0, offset: 0 })) [L1037] havoc #t~mem14; [L1037] havoc #t~mem12; [L1037] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1038] FCALL call #t~mem15 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1038] FCALL call #t~mem16 := read~$Pointer$({ base: #t~mem15!base, offset: #t~mem15!offset }, 4); [L1038] FCALL call #t~mem17 := read~$Pointer$({ base: #t~mem16!base, offset: #t~mem16!offset }, 4); [L1038] FCALL call #t~mem18 := read~int({ base: #t~mem17!base, offset: 8 + #t~mem17!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, #t~mem15!base=20, #t~mem15!offset=0, #t~mem16!base=16, #t~mem16!offset=0, #t~mem17!base=36, #t~mem17!offset=0, #t~mem18=3, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1038] COND TRUE !(3 != #t~mem18) [L1038] havoc #t~mem15; [L1038] havoc #t~mem18; [L1038] havoc #t~mem16; [L1038] havoc #t~mem17; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1038] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=21, #NULL!offset=13, old(#NULL!base)=21, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=21, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret26 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L986] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L986] ~head~0 := #t~malloc0; [L987] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L988] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L989] FCALL call write~int(0, { base: ~head~0!base, offset: 8 + ~head~0!offset }, 4); [L990] ~item~0 := ~head~0; [L991] ~status~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=27, ~item~0!offset=0, ~status~0=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~nondet1=1, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=27, ~item~0!offset=0, ~status~0=0] [L993-L1018] COND FALSE !(!(0 != #t~nondet1)) [L993] havoc #t~nondet1; [L995] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L995] FCALL call write~$Pointer$(#t~malloc2, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L996] FCALL call #t~mem3 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L996] FCALL call write~$Pointer$(~item~0, { base: #t~mem3!base, offset: 4 + #t~mem3!offset }, 4); [L996] havoc #t~mem3; [L997] FCALL call #t~mem4 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L997] ~item~0 := #t~mem4; [L997] havoc #t~mem4; [L998] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~item~0!base, offset: ~item~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=20, ~item~0!offset=0, ~status~0=0] [L1000] COND TRUE 0 == ~status~0 [L1002] FCALL call write~int(1, { base: ~item~0!base, offset: 8 + ~item~0!offset }, 4); [L1003] ~status~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=20, ~item~0!offset=0, ~status~0=1] [L1016] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=20, ~item~0!offset=0, ~status~0=1] [L1017] COND FALSE !(!(~item~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=20, ~item~0!offset=0, ~status~0=1] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, #t~nondet1=1, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=20, ~item~0!offset=0, ~status~0=1] [L993-L1018] COND FALSE !(!(0 != #t~nondet1)) [L993] havoc #t~nondet1; [L995] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L995] FCALL call write~$Pointer$(#t~malloc2, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L996] FCALL call #t~mem3 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L996] FCALL call write~$Pointer$(~item~0, { base: #t~mem3!base, offset: 4 + #t~mem3!offset }, 4); [L996] havoc #t~mem3; [L997] FCALL call #t~mem4 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L997] ~item~0 := #t~mem4; [L997] havoc #t~mem4; [L998] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~item~0!base, offset: ~item~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=16, ~item~0!offset=0, ~status~0=1] [L1000] COND FALSE !(0 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=16, ~item~0!offset=0, ~status~0=1] [L1005] COND TRUE 1 == ~status~0 [L1007] FCALL call write~int(2, { base: ~item~0!base, offset: 8 + ~item~0!offset }, 4); [L1008] ~status~0 := 2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=16, ~item~0!offset=0, ~status~0=2] [L1016] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=16, ~item~0!offset=0, ~status~0=2] [L1017] COND FALSE !(!(~item~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=16, ~item~0!offset=0, ~status~0=2] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, #t~nondet1=1, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=16, ~item~0!offset=0, ~status~0=2] [L993-L1018] COND FALSE !(!(0 != #t~nondet1)) [L993] havoc #t~nondet1; [L995] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L995] FCALL call write~$Pointer$(#t~malloc2, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L996] FCALL call #t~mem3 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L996] FCALL call write~$Pointer$(~item~0, { base: #t~mem3!base, offset: 4 + #t~mem3!offset }, 4); [L996] havoc #t~mem3; [L997] FCALL call #t~mem4 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L997] ~item~0 := #t~mem4; [L997] havoc #t~mem4; [L998] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~item~0!base, offset: ~item~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=2] [L1000] COND FALSE !(0 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=2] [L1005] COND FALSE !(1 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=2] [L1010] COND TRUE ~status~0 >= 2 [L1012] FCALL call write~int(3, { base: ~item~0!base, offset: 8 + ~item~0!offset }, 4); [L1013] ~status~0 := 3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1016] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1017] COND FALSE !(!(~item~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, #t~nondet1=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L993-L1018] COND TRUE !(0 != #t~nondet1) [L993] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1020] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1021] COND FALSE !(1 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1026] COND FALSE !(2 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1032] COND TRUE 3 == ~status~0 VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1034] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1035] FCALL call #t~mem9 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, #t~mem9!base=20, #t~mem9!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1035] COND FALSE !(!(#t~mem9 != { base: 0, offset: 0 })) [L1035] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1036] FCALL call #t~mem10 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1036] FCALL call #t~mem11 := read~$Pointer$({ base: #t~mem10!base, offset: #t~mem10!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, #t~mem10!base=20, #t~mem10!offset=0, #t~mem11!base=16, #t~mem11!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1036] COND FALSE !(!(#t~mem11 != { base: 0, offset: 0 })) [L1036] havoc #t~mem11; [L1036] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1037] FCALL call #t~mem12 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1037] FCALL call #t~mem13 := read~$Pointer$({ base: #t~mem12!base, offset: #t~mem12!offset }, 4); [L1037] FCALL call #t~mem14 := read~$Pointer$({ base: #t~mem13!base, offset: #t~mem13!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, #t~mem12!base=20, #t~mem12!offset=0, #t~mem13!base=16, #t~mem13!offset=0, #t~mem14!base=36, #t~mem14!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1037] COND FALSE !(!(#t~mem14 != { base: 0, offset: 0 })) [L1037] havoc #t~mem14; [L1037] havoc #t~mem12; [L1037] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1038] FCALL call #t~mem15 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1038] FCALL call #t~mem16 := read~$Pointer$({ base: #t~mem15!base, offset: #t~mem15!offset }, 4); [L1038] FCALL call #t~mem17 := read~$Pointer$({ base: #t~mem16!base, offset: #t~mem16!offset }, 4); [L1038] FCALL call #t~mem18 := read~int({ base: #t~mem17!base, offset: 8 + #t~mem17!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, #t~mem15!base=20, #t~mem15!offset=0, #t~mem16!base=16, #t~mem16!offset=0, #t~mem17!base=36, #t~mem17!offset=0, #t~mem18=3, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1038] COND TRUE !(3 != #t~mem18) [L1038] havoc #t~mem15; [L1038] havoc #t~mem18; [L1038] havoc #t~mem16; [L1038] havoc #t~mem17; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L1038] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=27, #t~malloc0!offset=0, #t~malloc2!base=36, #t~malloc2!offset=0, ~head~0!base=27, ~head~0!offset=0, ~item~0!base=36, ~item~0!offset=0, ~status~0=3] [L986] SLL* head = malloc(sizeof(SLL)); [L987] head->next = ((void*)0) [L988] head->prev = ((void*)0) [L989] head->data = 0 [L990] SLL* item = head; [L991] int status = 0; VAL [head={27:0}, item={27:0}, malloc(sizeof(SLL))={27:0}, status=0] [L993] COND TRUE __VERIFIER_nondet_int() [L995] item->next = malloc(sizeof(SLL)) [L996] EXPR item->next [L996] item->next->prev = item [L997] EXPR item->next [L997] item = item->next [L998] item->next = ((void*)0) VAL [head={27:0}, item={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={27:0}, status=0] [L1000] COND TRUE !status [L1002] item->data = 1 [L1003] status = 1 VAL [head={27:0}, item={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={27:0}, status=1] [L1016] COND FALSE !(!(head != ((void*)0))) VAL [head={27:0}, item={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={27:0}, status=1] [L1017] COND FALSE !(!(item != ((void*)0))) VAL [head={27:0}, item={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={27:0}, status=1] [L993] COND TRUE __VERIFIER_nondet_int() [L995] item->next = malloc(sizeof(SLL)) [L996] EXPR item->next [L996] item->next->prev = item [L997] EXPR item->next [L997] item = item->next [L998] item->next = ((void*)0) VAL [head={27:0}, item={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={27:0}, status=1] [L1000] COND FALSE !(!status) VAL [head={27:0}, item={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={27:0}, status=1] [L1005] COND TRUE status == 1 [L1007] item->data = 2 [L1008] status = 2 VAL [head={27:0}, item={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={27:0}, status=2] [L1016] COND FALSE !(!(head != ((void*)0))) VAL [head={27:0}, item={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={27:0}, status=2] [L1017] COND FALSE !(!(item != ((void*)0))) VAL [head={27:0}, item={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={27:0}, status=2] [L993] COND TRUE __VERIFIER_nondet_int() [L995] item->next = malloc(sizeof(SLL)) [L996] EXPR item->next [L996] item->next->prev = item [L997] EXPR item->next [L997] item = item->next [L998] item->next = ((void*)0) VAL [head={27:0}, item={36:0}, malloc(sizeof(SLL))={36:0}, malloc(sizeof(SLL))={27:0}, status=2] [L1000] COND FALSE !(!status) VAL [head={27:0}, item={36:0}, malloc(sizeof(SLL))={36:0}, malloc(sizeof(SLL))={27:0}, status=2] [L1005] COND FALSE !(status == 1) VAL [head={27:0}, item={36:0}, malloc(sizeof(SLL))={36:0}, malloc(sizeof(SLL))={27:0}, status=2] [L1010] COND TRUE status >= 2 [L1012] item->data = 3 [L1013] status = 3 VAL [head={27:0}, item={36:0}, malloc(sizeof(SLL))={36:0}, malloc(sizeof(SLL))={27:0}, status=3] [L1016] COND FALSE !(!(head != ((void*)0))) VAL [head={27:0}, item={36:0}, malloc(sizeof(SLL))={36:0}, malloc(sizeof(SLL))={27:0}, status=3] [L1017] COND FALSE !(!(item != ((void*)0))) VAL [head={27:0}, item={36:0}, malloc(sizeof(SLL))={36:0}, malloc(sizeof(SLL))={27:0}, status=3] [L993] COND FALSE !(__VERIFIER_nondet_int()) [L1020] COND FALSE !(!(head != ((void*)0))) VAL [head={27:0}, item={36:0}, malloc(sizeof(SLL))={36:0}, malloc(sizeof(SLL))={27:0}, status=3] [L1021] COND FALSE !(status == 1) VAL [head={27:0}, item={36:0}, malloc(sizeof(SLL))={36:0}, malloc(sizeof(SLL))={27:0}, status=3] [L1026] COND FALSE !(status == 2) VAL [head={27:0}, item={36:0}, malloc(sizeof(SLL))={36:0}, malloc(sizeof(SLL))={27:0}, status=3] [L1032] COND TRUE status == 3 VAL [head={27:0}, item={36:0}, malloc(sizeof(SLL))={36:0}, malloc(sizeof(SLL))={27:0}, status=3] [L1034] COND FALSE !(!(head != ((void*)0))) VAL [head={27:0}, item={36:0}, malloc(sizeof(SLL))={36:0}, malloc(sizeof(SLL))={27:0}, status=3] [L1035] EXPR head->next VAL [head={27:0}, head->next={20:0}, item={36:0}, malloc(sizeof(SLL))={36:0}, malloc(sizeof(SLL))={27:0}, status=3] [L1035] COND FALSE !(!(head->next != ((void*)0))) [L1036] EXPR head->next [L1036] EXPR head->next->next VAL [head={27:0}, head->next={20:0}, head->next->next={16:0}, item={36:0}, malloc(sizeof(SLL))={36:0}, malloc(sizeof(SLL))={27:0}, status=3] [L1036] COND FALSE !(!(head->next->next != ((void*)0))) [L1037] EXPR head->next [L1037] EXPR head->next->next [L1037] EXPR head->next->next->next VAL [head={27:0}, head->next={20:0}, head->next->next={16:0}, head->next->next->next={36:0}, item={36:0}, malloc(sizeof(SLL))={36:0}, malloc(sizeof(SLL))={27:0}, status=3] [L1037] COND FALSE !(!(head->next->next->next != ((void*)0))) [L1038] EXPR head->next [L1038] EXPR head->next->next [L1038] EXPR head->next->next->next [L1038] EXPR head->next->next->next->data VAL [head={27:0}, head->next={20:0}, head->next->next={16:0}, head->next->next->next={36:0}, head->next->next->next->data=3, item={36:0}, malloc(sizeof(SLL))={36:0}, malloc(sizeof(SLL))={27:0}, status=3] [L1038] COND TRUE !(head->next->next->next->data != 3) [L1038] __VERIFIER_error() VAL [head={27:0}, item={36:0}, malloc(sizeof(SLL))={36:0}, malloc(sizeof(SLL))={27:0}, status=3] ----- [2018-11-23 05:34:12,697 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_7e0bba0c-d1cd-402d-a96d-e8b314a0df98/bin-2019/uautomizer/witness.graphml [2018-11-23 05:34:12,697 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 05:34:12,698 INFO L168 Benchmark]: Toolchain (without parser) took 205249.73 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 283.6 MB). Free memory was 956.4 MB in the beginning and 917.0 MB in the end (delta: 39.5 MB). Peak memory consumption was 323.1 MB. Max. memory is 11.5 GB. [2018-11-23 05:34:12,698 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:34:12,699 INFO L168 Benchmark]: CACSL2BoogieTranslator took 345.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -173.4 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2018-11-23 05:34:12,699 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.66 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 05:34:12,699 INFO L168 Benchmark]: Boogie Preprocessor took 33.95 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 05:34:12,699 INFO L168 Benchmark]: RCFGBuilder took 388.04 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: 36.4 MB). Peak memory consumption was 36.4 MB. Max. memory is 11.5 GB. [2018-11-23 05:34:12,700 INFO L168 Benchmark]: TraceAbstraction took 203498.09 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 141.0 MB). Free memory was 1.1 GB in the beginning and 926.6 MB in the end (delta: 160.1 MB). Peak memory consumption was 301.1 MB. Max. memory is 11.5 GB. [2018-11-23 05:34:12,700 INFO L168 Benchmark]: Witness Printer took 961.43 ms. Allocated memory is still 1.3 GB. Free memory was 926.6 MB in the beginning and 917.0 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2018-11-23 05:34:12,702 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.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 345.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -173.4 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.66 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. * Boogie Preprocessor took 33.95 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. * RCFGBuilder took 388.04 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: 36.4 MB). Peak memory consumption was 36.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 203498.09 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 141.0 MB). Free memory was 1.1 GB in the beginning and 926.6 MB in the end (delta: 160.1 MB). Peak memory consumption was 301.1 MB. Max. memory is 11.5 GB. * Witness Printer took 961.43 ms. Allocated memory is still 1.3 GB. Free memory was 926.6 MB in the beginning and 917.0 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1038]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L986] SLL* head = malloc(sizeof(SLL)); [L987] head->next = ((void*)0) [L988] head->prev = ((void*)0) [L989] head->data = 0 [L990] SLL* item = head; [L991] int status = 0; VAL [head={27:0}, item={27:0}, malloc(sizeof(SLL))={27:0}, status=0] [L993] COND TRUE __VERIFIER_nondet_int() [L995] item->next = malloc(sizeof(SLL)) [L996] EXPR item->next [L996] item->next->prev = item [L997] EXPR item->next [L997] item = item->next [L998] item->next = ((void*)0) VAL [head={27:0}, item={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={27:0}, status=0] [L1000] COND TRUE !status [L1002] item->data = 1 [L1003] status = 1 VAL [head={27:0}, item={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={27:0}, status=1] [L1016] COND FALSE !(!(head != ((void*)0))) VAL [head={27:0}, item={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={27:0}, status=1] [L1017] COND FALSE !(!(item != ((void*)0))) VAL [head={27:0}, item={20:0}, malloc(sizeof(SLL))={20:0}, malloc(sizeof(SLL))={27:0}, status=1] [L993] COND TRUE __VERIFIER_nondet_int() [L995] item->next = malloc(sizeof(SLL)) [L996] EXPR item->next [L996] item->next->prev = item [L997] EXPR item->next [L997] item = item->next [L998] item->next = ((void*)0) VAL [head={27:0}, item={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={27:0}, status=1] [L1000] COND FALSE !(!status) VAL [head={27:0}, item={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={27:0}, status=1] [L1005] COND TRUE status == 1 [L1007] item->data = 2 [L1008] status = 2 VAL [head={27:0}, item={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={27:0}, status=2] [L1016] COND FALSE !(!(head != ((void*)0))) VAL [head={27:0}, item={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={27:0}, status=2] [L1017] COND FALSE !(!(item != ((void*)0))) VAL [head={27:0}, item={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={27:0}, status=2] [L993] COND TRUE __VERIFIER_nondet_int() [L995] item->next = malloc(sizeof(SLL)) [L996] EXPR item->next [L996] item->next->prev = item [L997] EXPR item->next [L997] item = item->next [L998] item->next = ((void*)0) VAL [head={27:0}, item={36:0}, malloc(sizeof(SLL))={36:0}, malloc(sizeof(SLL))={27:0}, status=2] [L1000] COND FALSE !(!status) VAL [head={27:0}, item={36:0}, malloc(sizeof(SLL))={36:0}, malloc(sizeof(SLL))={27:0}, status=2] [L1005] COND FALSE !(status == 1) VAL [head={27:0}, item={36:0}, malloc(sizeof(SLL))={36:0}, malloc(sizeof(SLL))={27:0}, status=2] [L1010] COND TRUE status >= 2 [L1012] item->data = 3 [L1013] status = 3 VAL [head={27:0}, item={36:0}, malloc(sizeof(SLL))={36:0}, malloc(sizeof(SLL))={27:0}, status=3] [L1016] COND FALSE !(!(head != ((void*)0))) VAL [head={27:0}, item={36:0}, malloc(sizeof(SLL))={36:0}, malloc(sizeof(SLL))={27:0}, status=3] [L1017] COND FALSE !(!(item != ((void*)0))) VAL [head={27:0}, item={36:0}, malloc(sizeof(SLL))={36:0}, malloc(sizeof(SLL))={27:0}, status=3] [L993] COND FALSE !(__VERIFIER_nondet_int()) [L1020] COND FALSE !(!(head != ((void*)0))) VAL [head={27:0}, item={36:0}, malloc(sizeof(SLL))={36:0}, malloc(sizeof(SLL))={27:0}, status=3] [L1021] COND FALSE !(status == 1) VAL [head={27:0}, item={36:0}, malloc(sizeof(SLL))={36:0}, malloc(sizeof(SLL))={27:0}, status=3] [L1026] COND FALSE !(status == 2) VAL [head={27:0}, item={36:0}, malloc(sizeof(SLL))={36:0}, malloc(sizeof(SLL))={27:0}, status=3] [L1032] COND TRUE status == 3 VAL [head={27:0}, item={36:0}, malloc(sizeof(SLL))={36:0}, malloc(sizeof(SLL))={27:0}, status=3] [L1034] COND FALSE !(!(head != ((void*)0))) VAL [head={27:0}, item={36:0}, malloc(sizeof(SLL))={36:0}, malloc(sizeof(SLL))={27:0}, status=3] [L1035] EXPR head->next VAL [head={27:0}, head->next={20:0}, item={36:0}, malloc(sizeof(SLL))={36:0}, malloc(sizeof(SLL))={27:0}, status=3] [L1035] COND FALSE !(!(head->next != ((void*)0))) [L1036] EXPR head->next [L1036] EXPR head->next->next VAL [head={27:0}, head->next={20:0}, head->next->next={16:0}, item={36:0}, malloc(sizeof(SLL))={36:0}, malloc(sizeof(SLL))={27:0}, status=3] [L1036] COND FALSE !(!(head->next->next != ((void*)0))) [L1037] EXPR head->next [L1037] EXPR head->next->next [L1037] EXPR head->next->next->next VAL [head={27:0}, head->next={20:0}, head->next->next={16:0}, head->next->next->next={36:0}, item={36:0}, malloc(sizeof(SLL))={36:0}, malloc(sizeof(SLL))={27:0}, status=3] [L1037] COND FALSE !(!(head->next->next->next != ((void*)0))) [L1038] EXPR head->next [L1038] EXPR head->next->next [L1038] EXPR head->next->next->next [L1038] EXPR head->next->next->next->data VAL [head={27:0}, head->next={20:0}, head->next->next={16:0}, head->next->next->next={36:0}, head->next->next->next->data=3, item={36:0}, malloc(sizeof(SLL))={36:0}, malloc(sizeof(SLL))={27:0}, status=3] [L1038] COND TRUE !(head->next->next->next->data != 3) [L1038] __VERIFIER_error() VAL [head={27:0}, item={36:0}, malloc(sizeof(SLL))={36:0}, malloc(sizeof(SLL))={27:0}, status=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 90 locations, 14 error locations. UNSAFE Result, 203.4s OverallTime, 21 OverallIterations, 4 TraceHistogramMax, 86.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1499 SDtfs, 2124 SDslu, 5044 SDs, 0 SdLazy, 3069 SolverSat, 271 SolverUnsat, 36 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 544 GetRequests, 335 SyntacticMatches, 17 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 685 ImplicationChecksByTransitivity, 135.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=143occurred in iteration=19, 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.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 488 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 115.0s InterpolantComputationTime, 1024 NumberOfCodeBlocks, 1024 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 944 ConstructedInterpolants, 156 QuantifiedInterpolants, 6783286 SizeOfPredicates, 123 NumberOfNonLiveVariables, 1341 ConjunctsInSsa, 325 ConjunctsInUnsatCore, 29 InterpolantComputations, 11 PerfectInterpolantSequences, 110/360 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...