./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2n_prepend_equal_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8e40739f-734a-4a51-b8a1-639edde371bc/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8e40739f-734a-4a51-b8a1-639edde371bc/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8e40739f-734a-4a51-b8a1-639edde371bc/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8e40739f-734a-4a51-b8a1-639edde371bc/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2n_prepend_equal_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_8e40739f-734a-4a51-b8a1-639edde371bc/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8e40739f-734a-4a51-b8a1-639edde371bc/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4aa4ae97046b46e050cb2478dec257c6a324dc09 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8e40739f-734a-4a51-b8a1-639edde371bc/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8e40739f-734a-4a51-b8a1-639edde371bc/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8e40739f-734a-4a51-b8a1-639edde371bc/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8e40739f-734a-4a51-b8a1-639edde371bc/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2n_prepend_equal_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_8e40739f-734a-4a51-b8a1-639edde371bc/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8e40739f-734a-4a51-b8a1-639edde371bc/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4aa4ae97046b46e050cb2478dec257c6a324dc09 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimArr_24 input size 13 context size 13 output size 13 --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 17:39:03,737 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 17:39:03,738 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 17:39:03,743 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 17:39:03,744 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 17:39:03,744 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 17:39:03,745 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 17:39:03,746 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 17:39:03,746 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 17:39:03,747 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 17:39:03,747 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 17:39:03,747 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 17:39:03,748 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 17:39:03,748 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 17:39:03,749 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 17:39:03,749 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 17:39:03,750 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 17:39:03,750 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 17:39:03,751 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 17:39:03,752 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 17:39:03,753 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 17:39:03,753 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 17:39:03,754 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 17:39:03,754 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 17:39:03,754 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 17:39:03,755 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 17:39:03,755 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 17:39:03,756 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 17:39:03,756 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 17:39:03,757 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 17:39:03,757 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 17:39:03,757 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 17:39:03,757 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 17:39:03,757 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 17:39:03,758 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 17:39:03,758 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 17:39:03,758 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8e40739f-734a-4a51-b8a1-639edde371bc/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 17:39:03,765 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 17:39:03,765 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 17:39:03,766 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 17:39:03,766 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 17:39:03,766 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 17:39:03,766 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 17:39:03,766 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 17:39:03,766 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 17:39:03,766 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 17:39:03,766 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 17:39:03,766 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 17:39:03,767 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 17:39:03,767 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 17:39:03,767 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 17:39:03,767 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 17:39:03,767 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 17:39:03,767 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 17:39:03,767 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 17:39:03,767 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 17:39:03,768 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 17:39:03,768 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 17:39:03,768 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 17:39:03,768 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 17:39:03,768 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 17:39:03,768 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 17:39:03,768 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 17:39:03,768 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 17:39:03,768 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 17:39:03,768 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 17:39:03,768 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 17:39:03,769 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 17:39:03,769 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 17:39:03,769 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 17:39:03,769 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 17:39:03,769 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 17:39:03,769 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 17:39:03,769 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_8e40739f-734a-4a51-b8a1-639edde371bc/bin-2019/utaipan 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 -> Taipan 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 -> 4aa4ae97046b46e050cb2478dec257c6a324dc09 [2018-12-09 17:39:03,786 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 17:39:03,793 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 17:39:03,796 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 17:39:03,797 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 17:39:03,797 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 17:39:03,798 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8e40739f-734a-4a51-b8a1-639edde371bc/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/dll2n_prepend_equal_true-unreach-call_true-valid-memsafety.i [2018-12-09 17:39:03,831 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8e40739f-734a-4a51-b8a1-639edde371bc/bin-2019/utaipan/data/fde23fe25/3a57d5fa4c254e02a57766911a97d4cd/FLAGea9d6ab0a [2018-12-09 17:39:04,133 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 17:39:04,133 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8e40739f-734a-4a51-b8a1-639edde371bc/sv-benchmarks/c/list-simple/dll2n_prepend_equal_true-unreach-call_true-valid-memsafety.i [2018-12-09 17:39:04,139 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8e40739f-734a-4a51-b8a1-639edde371bc/bin-2019/utaipan/data/fde23fe25/3a57d5fa4c254e02a57766911a97d4cd/FLAGea9d6ab0a [2018-12-09 17:39:04,147 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8e40739f-734a-4a51-b8a1-639edde371bc/bin-2019/utaipan/data/fde23fe25/3a57d5fa4c254e02a57766911a97d4cd [2018-12-09 17:39:04,149 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 17:39:04,150 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 17:39:04,150 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 17:39:04,150 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 17:39:04,152 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 17:39:04,153 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:39:04" (1/1) ... [2018-12-09 17:39:04,154 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c140d76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:39:04, skipping insertion in model container [2018-12-09 17:39:04,154 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:39:04" (1/1) ... [2018-12-09 17:39:04,159 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 17:39:04,176 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 17:39:04,324 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 17:39:04,365 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 17:39:04,396 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 17:39:04,427 INFO L195 MainTranslator]: Completed translation [2018-12-09 17:39:04,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:39:04 WrapperNode [2018-12-09 17:39:04,428 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 17:39:04,428 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 17:39:04,428 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 17:39:04,428 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 17:39:04,433 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:39:04" (1/1) ... [2018-12-09 17:39:04,441 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:39:04" (1/1) ... [2018-12-09 17:39:04,446 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 17:39:04,446 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 17:39:04,446 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 17:39:04,446 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 17:39:04,452 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:39:04" (1/1) ... [2018-12-09 17:39:04,452 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:39:04" (1/1) ... [2018-12-09 17:39:04,454 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:39:04" (1/1) ... [2018-12-09 17:39:04,454 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:39:04" (1/1) ... [2018-12-09 17:39:04,460 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:39:04" (1/1) ... [2018-12-09 17:39:04,463 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:39:04" (1/1) ... [2018-12-09 17:39:04,464 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:39:04" (1/1) ... [2018-12-09 17:39:04,466 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 17:39:04,466 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 17:39:04,466 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 17:39:04,466 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 17:39:04,466 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:39:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e40739f-734a-4a51-b8a1-639edde371bc/bin-2019/utaipan/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-12-09 17:39:04,497 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2018-12-09 17:39:04,498 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2018-12-09 17:39:04,498 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-09 17:39:04,498 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-09 17:39:04,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 17:39:04,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 17:39:04,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 17:39:04,498 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-09 17:39:04,498 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-09 17:39:04,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 17:39:04,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 17:39:04,498 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 17:39:04,498 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 17:39:04,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 17:39:04,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 17:39:04,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 17:39:04,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 17:39:04,499 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-12-09 17:39:04,499 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-12-09 17:39:04,499 INFO L130 BoogieDeclarations]: Found specification of procedure dll_prepend [2018-12-09 17:39:04,499 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_prepend [2018-12-09 17:39:04,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 17:39:04,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 17:39:04,708 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 17:39:04,709 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-12-09 17:39:04,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:39:04 BoogieIcfgContainer [2018-12-09 17:39:04,709 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 17:39:04,710 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 17:39:04,710 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 17:39:04,712 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 17:39:04,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 05:39:04" (1/3) ... [2018-12-09 17:39:04,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3af9b192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:39:04, skipping insertion in model container [2018-12-09 17:39:04,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:39:04" (2/3) ... [2018-12-09 17:39:04,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3af9b192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:39:04, skipping insertion in model container [2018-12-09 17:39:04,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:39:04" (3/3) ... [2018-12-09 17:39:04,714 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_prepend_equal_true-unreach-call_true-valid-memsafety.i [2018-12-09 17:39:04,720 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 17:39:04,725 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 17:39:04,733 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 17:39:04,753 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 17:39:04,753 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 17:39:04,753 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 17:39:04,754 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 17:39:04,754 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 17:39:04,754 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 17:39:04,754 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 17:39:04,754 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 17:39:04,764 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-12-09 17:39:04,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 17:39:04,768 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:39:04,769 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:39:04,771 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:39:04,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:39:04,775 INFO L82 PathProgramCache]: Analyzing trace with hash 2094879456, now seen corresponding path program 1 times [2018-12-09 17:39:04,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:39:04,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:39:04,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:39:04,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:39:04,808 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:39:04,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:39:04,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:39:04,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:39:04,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 17:39:04,892 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:39:04,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-09 17:39:04,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-09 17:39:04,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 17:39:04,904 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 2 states. [2018-12-09 17:39:04,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:39:04,917 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2018-12-09 17:39:04,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-09 17:39:04,918 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 30 [2018-12-09 17:39:04,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:39:04,923 INFO L225 Difference]: With dead ends: 86 [2018-12-09 17:39:04,923 INFO L226 Difference]: Without dead ends: 36 [2018-12-09 17:39:04,925 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-12-09 17:39:04,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-09 17:39:04,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-09 17:39:04,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-09 17:39:04,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-12-09 17:39:04,947 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 30 [2018-12-09 17:39:04,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:39:04,947 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-12-09 17:39:04,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-09 17:39:04,947 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-12-09 17:39:04,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 17:39:04,948 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:39:04,948 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:39:04,948 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:39:04,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:39:04,948 INFO L82 PathProgramCache]: Analyzing trace with hash 2094870807, now seen corresponding path program 1 times [2018-12-09 17:39:04,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:39:04,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:39:04,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:39:04,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:39:04,949 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:39:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:39:05,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:39:05,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:39:05,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 17:39:05,051 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:39:05,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 17:39:05,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 17:39:05,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-09 17:39:05,052 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 10 states. [2018-12-09 17:39:05,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:39:05,149 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-12-09 17:39:05,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 17:39:05,149 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-12-09 17:39:05,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:39:05,150 INFO L225 Difference]: With dead ends: 43 [2018-12-09 17:39:05,150 INFO L226 Difference]: Without dead ends: 40 [2018-12-09 17:39:05,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-12-09 17:39:05,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-09 17:39:05,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2018-12-09 17:39:05,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-09 17:39:05,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-12-09 17:39:05,154 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 30 [2018-12-09 17:39:05,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:39:05,155 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-12-09 17:39:05,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 17:39:05,155 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-12-09 17:39:05,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 17:39:05,155 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:39:05,155 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:39:05,156 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:39:05,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:39:05,156 INFO L82 PathProgramCache]: Analyzing trace with hash 2094872481, now seen corresponding path program 1 times [2018-12-09 17:39:05,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:39:05,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:39:05,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:39:05,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:39:05,157 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:39:05,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:39:05,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:39:05,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:39:05,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 17:39:05,190 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:39:05,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 17:39:05,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 17:39:05,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 17:39:05,191 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 5 states. [2018-12-09 17:39:05,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:39:05,209 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2018-12-09 17:39:05,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 17:39:05,209 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-12-09 17:39:05,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:39:05,209 INFO L225 Difference]: With dead ends: 66 [2018-12-09 17:39:05,209 INFO L226 Difference]: Without dead ends: 42 [2018-12-09 17:39:05,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 17:39:05,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-09 17:39:05,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2018-12-09 17:39:05,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-09 17:39:05,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-12-09 17:39:05,213 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 30 [2018-12-09 17:39:05,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:39:05,213 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-12-09 17:39:05,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 17:39:05,213 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-12-09 17:39:05,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 17:39:05,214 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:39:05,214 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:39:05,214 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:39:05,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:39:05,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1504377949, now seen corresponding path program 1 times [2018-12-09 17:39:05,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:39:05,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:39:05,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:39:05,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:39:05,215 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:39:05,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:39:05,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:39:05,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:39:05,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 17:39:05,237 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:39:05,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 17:39:05,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 17:39:05,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:39:05,237 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 3 states. [2018-12-09 17:39:05,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:39:05,252 INFO L93 Difference]: Finished difference Result 71 states and 80 transitions. [2018-12-09 17:39:05,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 17:39:05,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-12-09 17:39:05,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:39:05,253 INFO L225 Difference]: With dead ends: 71 [2018-12-09 17:39:05,253 INFO L226 Difference]: Without dead ends: 42 [2018-12-09 17:39:05,253 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-12-09 17:39:05,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-09 17:39:05,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-12-09 17:39:05,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-09 17:39:05,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-12-09 17:39:05,257 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 35 [2018-12-09 17:39:05,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:39:05,257 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-12-09 17:39:05,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 17:39:05,257 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-12-09 17:39:05,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 17:39:05,257 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:39:05,257 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:39:05,257 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:39:05,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:39:05,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1370364443, now seen corresponding path program 1 times [2018-12-09 17:39:05,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:39:05,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:39:05,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:39:05,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:39:05,259 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:39:05,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:39:05,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:39:05,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 17:39:05,292 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 17:39:05,293 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-12-09 17:39:05,294 INFO L205 CegarAbsIntRunner]: [0], [2], [4], [13], [16], [29], [46], [47], [53], [60], [62], [68], [70], [75], [77], [81], [82], [83], [85], [88], [92], [93], [97], [103], [105], [106], [107], [108], [109], [110], [115], [116], [117], [118], [119] [2018-12-09 17:39:05,316 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 17:39:05,316 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 17:39:05,418 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 17:39:05,418 INFO L272 AbstractInterpreter]: Visited 14 different actions 19 times. Merged at 4 different actions 4 times. Never widened. Performed 187 root evaluator evaluations with a maximum evaluation depth of 3. Performed 187 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 30 variables. [2018-12-09 17:39:05,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:39:05,424 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 17:39:05,469 INFO L227 lantSequenceWeakener]: Weakened 12 states. On average, predicates are now at 76.98% of their original sizes. [2018-12-09 17:39:05,469 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 17:39:05,513 INFO L418 sIntCurrentIteration]: We unified 34 AI predicates to 34 [2018-12-09 17:39:05,513 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 17:39:05,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 17:39:05,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2018-12-09 17:39:05,514 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:39:05,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 17:39:05,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 17:39:05,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-09 17:39:05,515 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 9 states. [2018-12-09 17:39:05,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:39:05,746 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2018-12-09 17:39:05,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 17:39:05,746 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-12-09 17:39:05,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:39:05,747 INFO L225 Difference]: With dead ends: 71 [2018-12-09 17:39:05,747 INFO L226 Difference]: Without dead ends: 47 [2018-12-09 17:39:05,748 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-12-09 17:39:05,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-09 17:39:05,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-12-09 17:39:05,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-09 17:39:05,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2018-12-09 17:39:05,753 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 35 [2018-12-09 17:39:05,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:39:05,753 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2018-12-09 17:39:05,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 17:39:05,754 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-12-09 17:39:05,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 17:39:05,754 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:39:05,755 INFO L402 BasicCegarLoop]: trace histogram [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, 1] [2018-12-09 17:39:05,755 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:39:05,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:39:05,755 INFO L82 PathProgramCache]: Analyzing trace with hash 2118555171, now seen corresponding path program 1 times [2018-12-09 17:39:05,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:39:05,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:39:05,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:39:05,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:39:05,757 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:39:05,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:39:06,618 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:39:06,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 17:39:06,619 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 17:39:06,619 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-12-09 17:39:06,619 INFO L205 CegarAbsIntRunner]: [0], [2], [4], [13], [16], [29], [46], [47], [53], [60], [62], [68], [70], [73], [75], [77], [81], [82], [83], [85], [88], [92], [93], [97], [103], [105], [106], [107], [108], [109], [110], [115], [116], [117], [118], [119] [2018-12-09 17:39:06,621 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 17:39:06,621 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 17:39:06,682 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 17:39:06,682 INFO L272 AbstractInterpreter]: Visited 36 different actions 61 times. Merged at 9 different actions 19 times. Never widened. Performed 622 root evaluator evaluations with a maximum evaluation depth of 3. Performed 622 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 3 different actions. Largest state had 30 variables. [2018-12-09 17:39:06,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:39:06,685 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 17:39:06,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 17:39:06,685 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e40739f-734a-4a51-b8a1-639edde371bc/bin-2019/utaipan/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-12-09 17:39:06,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:39:06,691 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 17:39:06,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:39:06,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 17:39:06,753 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-12-09 17:39:06,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 17:39:06,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:39:06,764 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-12-09 17:39:22,304 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:39:22,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:39:22,305 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-12-09 17:39:22,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-12-09 17:39:22,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:39:22,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:39:22,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:39:22,322 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:26 [2018-12-09 17:39:23,579 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 11 treesize of output 8 [2018-12-09 17:39:23,580 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-12-09 17:39:23,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:39:23,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:39:23,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:39:23,587 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2018-12-09 17:39:27,153 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 27 treesize of output 22 [2018-12-09 17:39:27,155 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:39:27,157 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-12-09 17:39:27,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:39:27,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:39:27,173 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:39:27,175 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:39:27,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:39:27,185 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:79, output treesize:62 [2018-12-09 17:39:30,668 WARN L180 SmtUtils]: Spent 706.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-12-09 17:39:30,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 158 treesize of output 211 [2018-12-09 17:39:30,691 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 159 treesize of output 53 [2018-12-09 17:39:30,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:39:30,724 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 156 treesize of output 103 [2018-12-09 17:39:30,724 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 17:39:30,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 17:39:30,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2018-12-09 17:39:30,747 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-12-09 17:39:30,748 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 17:39:30,749 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:39:30,757 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 2 xjuncts. [2018-12-09 17:39:30,757 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:172, output treesize:82 [2018-12-09 17:39:33,122 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 50 treesize of output 47 [2018-12-09 17:39:33,124 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-12-09 17:39:33,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:39:33,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:39:33,134 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 85 treesize of output 82 [2018-12-09 17:39:33,136 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-12-09 17:39:33,137 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 17:39:33,152 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:39:33,192 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 46 treesize of output 43 [2018-12-09 17:39:33,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, 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-12-09 17:39:33,194 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 17:39:33,200 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:39:33,204 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 81 treesize of output 78 [2018-12-09 17:39:33,206 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-12-09 17:39:33,206 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 17:39:33,214 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:39:33,240 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 77 treesize of output 74 [2018-12-09 17:39:33,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-12-09 17:39:33,242 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 17:39:33,249 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:39:33,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 66 [2018-12-09 17:39:33,281 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 51 treesize of output 39 [2018-12-09 17:39:33,281 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 17:39:33,304 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 44 treesize of output 38 [2018-12-09 17:39:33,305 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-12-09 17:39:33,317 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 17:39:33,338 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-12-09 17:39:33,338 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:136, output treesize:135 [2018-12-09 17:39:35,544 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:39:35,545 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:39:35,545 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:39:35,547 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:39:35,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2018-12-09 17:39:35,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 17:39:35,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-12-09 17:39:35,558 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 8 [2018-12-09 17:39:35,558 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 17:39:35,559 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:39:35,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:39:35,566 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:166, output treesize:33 [2018-12-09 17:39:35,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-12-09 17:39:35,603 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 21 treesize of output 12 [2018-12-09 17:39:35,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:39:35,605 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:39:35,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-09 17:39:35,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 17:39:35,612 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 17:39:35,613 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:39:35,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:39:35,617 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:14 [2018-12-09 17:39:35,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-09 17:39:35,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 17:39:35,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:39:35,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:39:35,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:39:35,652 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-12-09 17:39:35,673 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:39:35,674 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 17:39:35,980 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2018-12-09 17:39:36,195 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 19 treesize of output 16 [2018-12-09 17:39:36,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2018-12-09 17:39:36,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2018-12-09 17:39:36,201 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 17:39:36,203 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:39:36,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:39:36,218 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:39:36,220 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:39:36,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2018-12-09 17:39:36,235 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 56 treesize of output 52 [2018-12-09 17:39:36,235 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:39:36,238 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:39:36,251 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:39:36,253 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:39:36,263 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:39:36,265 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:39:36,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 106 [2018-12-09 17:39:36,375 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:39:36,375 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 17:39:36,376 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 68 treesize of output 70 [2018-12-09 17:39:36,376 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-09 17:39:36,378 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:39:36,378 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 17:39:36,379 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 68 treesize of output 70 [2018-12-09 17:39:36,379 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 17:39:36,386 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 69 treesize of output 95 [2018-12-09 17:39:36,387 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-12-09 17:39:36,389 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:39:36,389 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 17:39:36,390 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 68 treesize of output 70 [2018-12-09 17:39:36,390 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 17:39:36,443 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 70 treesize of output 69 [2018-12-09 17:39:36,443 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-09 17:39:36,501 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 69 treesize of output 47 [2018-12-09 17:39:36,502 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 8 treesize of output 1 [2018-12-09 17:39:36,503 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-09 17:39:36,508 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 6 treesize of output 1 [2018-12-09 17:39:36,509 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-09 17:39:36,513 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:39:36,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 53 [2018-12-09 17:39:36,563 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 39 treesize of output 33 [2018-12-09 17:39:36,564 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-09 17:39:36,579 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 26 treesize of output 22 [2018-12-09 17:39:36,579 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 2 xjuncts. [2018-12-09 17:39:36,594 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 17:39:36,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 [2018-12-09 17:39:36,631 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 8 treesize of output 1 [2018-12-09 17:39:36,632 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-09 17:39:36,635 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:39:36,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 43 [2018-12-09 17:39:36,638 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 8 treesize of output 1 [2018-12-09 17:39:36,638 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-09 17:39:36,645 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:39:36,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 43 [2018-12-09 17:39:36,647 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 8 treesize of output 1 [2018-12-09 17:39:36,648 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-12-09 17:39:36,652 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:39:36,670 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 17:39:36,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-12-09 17:39:36,689 INFO L202 ElimStorePlain]: Needed 30 recursive calls to eliminate 7 variables, input treesize:147, output treesize:76 [2018-12-09 17:39:38,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-12-09 17:39:38,205 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 13 treesize of output 11 [2018-12-09 17:39:38,205 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:39:38,207 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:39:38,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-12-09 17:39:38,225 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 9 treesize of output 7 [2018-12-09 17:39:38,225 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:39:38,227 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:39:38,245 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:39:38,249 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:39:38,250 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:39:38,254 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:39:38,255 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:39:38,260 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:39:38,261 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:39:38,267 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:39:38,491 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 17:39:38,492 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: alternation not yet supported at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:347) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:264) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-12-09 17:39:38,496 INFO L168 Benchmark]: Toolchain (without parser) took 34346.42 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 277.3 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -154.0 MB). Peak memory consumption was 123.3 MB. Max. memory is 11.5 GB. [2018-12-09 17:39:38,497 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 17:39:38,497 INFO L168 Benchmark]: CACSL2BoogieTranslator took 277.70 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -151.4 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2018-12-09 17:39:38,497 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.88 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 17:39:38,498 INFO L168 Benchmark]: Boogie Preprocessor took 19.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. [2018-12-09 17:39:38,498 INFO L168 Benchmark]: RCFGBuilder took 243.26 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2018-12-09 17:39:38,498 INFO L168 Benchmark]: TraceAbstraction took 33785.45 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 158.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -36.1 MB). Peak memory consumption was 122.8 MB. Max. memory is 11.5 GB. [2018-12-09 17:39:38,500 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 277.70 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -151.4 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.88 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 243.26 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 33785.45 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 158.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -36.1 MB). Peak memory consumption was 122.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: alternation not yet supported: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:347) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-09 17:39:39,700 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 17:39:39,701 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 17:39:39,707 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 17:39:39,707 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 17:39:39,708 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 17:39:39,708 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 17:39:39,709 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 17:39:39,710 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 17:39:39,710 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 17:39:39,711 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 17:39:39,711 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 17:39:39,711 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 17:39:39,712 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 17:39:39,712 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 17:39:39,713 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 17:39:39,713 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 17:39:39,714 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 17:39:39,715 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 17:39:39,715 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 17:39:39,716 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 17:39:39,716 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 17:39:39,718 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 17:39:39,718 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 17:39:39,718 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 17:39:39,718 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 17:39:39,719 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 17:39:39,719 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 17:39:39,719 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 17:39:39,720 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 17:39:39,720 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 17:39:39,720 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 17:39:39,721 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 17:39:39,721 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 17:39:39,721 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 17:39:39,721 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 17:39:39,722 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8e40739f-734a-4a51-b8a1-639edde371bc/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-09 17:39:39,729 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 17:39:39,729 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 17:39:39,729 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 17:39:39,729 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 17:39:39,730 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 17:39:39,730 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 17:39:39,730 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 17:39:39,730 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 17:39:39,730 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 17:39:39,730 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 17:39:39,730 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 17:39:39,730 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 17:39:39,730 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 17:39:39,731 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 17:39:39,731 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 17:39:39,731 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 17:39:39,731 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 17:39:39,731 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-09 17:39:39,731 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-09 17:39:39,731 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 17:39:39,731 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 17:39:39,731 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 17:39:39,731 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 17:39:39,731 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 17:39:39,731 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 17:39:39,732 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 17:39:39,732 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 17:39:39,732 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 17:39:39,732 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 17:39:39,732 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 17:39:39,732 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 17:39:39,732 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-09 17:39:39,732 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 17:39:39,732 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-09 17:39:39,732 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-09 17:39:39,732 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_8e40739f-734a-4a51-b8a1-639edde371bc/bin-2019/utaipan 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 -> Taipan 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 -> 4aa4ae97046b46e050cb2478dec257c6a324dc09 [2018-12-09 17:39:39,750 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 17:39:39,757 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 17:39:39,759 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 17:39:39,760 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 17:39:39,761 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 17:39:39,761 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8e40739f-734a-4a51-b8a1-639edde371bc/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/dll2n_prepend_equal_true-unreach-call_true-valid-memsafety.i [2018-12-09 17:39:39,796 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8e40739f-734a-4a51-b8a1-639edde371bc/bin-2019/utaipan/data/2a73114d1/108c855b303b4d908bf231c02ac43412/FLAGd9330d9b2 [2018-12-09 17:39:40,169 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 17:39:40,169 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8e40739f-734a-4a51-b8a1-639edde371bc/sv-benchmarks/c/list-simple/dll2n_prepend_equal_true-unreach-call_true-valid-memsafety.i [2018-12-09 17:39:40,177 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8e40739f-734a-4a51-b8a1-639edde371bc/bin-2019/utaipan/data/2a73114d1/108c855b303b4d908bf231c02ac43412/FLAGd9330d9b2 [2018-12-09 17:39:40,186 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8e40739f-734a-4a51-b8a1-639edde371bc/bin-2019/utaipan/data/2a73114d1/108c855b303b4d908bf231c02ac43412 [2018-12-09 17:39:40,188 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 17:39:40,189 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 17:39:40,190 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 17:39:40,190 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 17:39:40,193 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 17:39:40,193 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:39:40" (1/1) ... [2018-12-09 17:39:40,195 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49da4dbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:39:40, skipping insertion in model container [2018-12-09 17:39:40,195 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:39:40" (1/1) ... [2018-12-09 17:39:40,199 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 17:39:40,225 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 17:39:40,383 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 17:39:40,392 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 17:39:40,431 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 17:39:40,502 INFO L195 MainTranslator]: Completed translation [2018-12-09 17:39:40,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:39:40 WrapperNode [2018-12-09 17:39:40,503 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 17:39:40,503 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 17:39:40,503 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 17:39:40,503 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 17:39:40,508 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:39:40" (1/1) ... [2018-12-09 17:39:40,517 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:39:40" (1/1) ... [2018-12-09 17:39:40,522 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 17:39:40,522 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 17:39:40,522 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 17:39:40,522 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 17:39:40,527 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:39:40" (1/1) ... [2018-12-09 17:39:40,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:39:40" (1/1) ... [2018-12-09 17:39:40,530 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:39:40" (1/1) ... [2018-12-09 17:39:40,530 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:39:40" (1/1) ... [2018-12-09 17:39:40,537 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:39:40" (1/1) ... [2018-12-09 17:39:40,540 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:39:40" (1/1) ... [2018-12-09 17:39:40,541 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:39:40" (1/1) ... [2018-12-09 17:39:40,543 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 17:39:40,544 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 17:39:40,544 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 17:39:40,544 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 17:39:40,544 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:39:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e40739f-734a-4a51-b8a1-639edde371bc/bin-2019/utaipan/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-12-09 17:39:40,576 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2018-12-09 17:39:40,576 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2018-12-09 17:39:40,576 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-09 17:39:40,576 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-09 17:39:40,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 17:39:40,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-09 17:39:40,576 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-09 17:39:40,576 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-09 17:39:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 17:39:40,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 17:39:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 17:39:40,577 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 17:39:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 17:39:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 17:39:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 17:39:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-09 17:39:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 17:39:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-12-09 17:39:40,577 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-12-09 17:39:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure dll_prepend [2018-12-09 17:39:40,577 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_prepend [2018-12-09 17:39:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 17:39:40,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 17:39:40,989 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 17:39:40,989 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-12-09 17:39:40,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:39:40 BoogieIcfgContainer [2018-12-09 17:39:40,990 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 17:39:40,990 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 17:39:40,990 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 17:39:40,992 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 17:39:40,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 05:39:40" (1/3) ... [2018-12-09 17:39:40,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31700996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:39:40, skipping insertion in model container [2018-12-09 17:39:40,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:39:40" (2/3) ... [2018-12-09 17:39:40,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31700996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:39:40, skipping insertion in model container [2018-12-09 17:39:40,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:39:40" (3/3) ... [2018-12-09 17:39:40,993 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_prepend_equal_true-unreach-call_true-valid-memsafety.i [2018-12-09 17:39:40,999 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 17:39:41,003 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 17:39:41,012 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 17:39:41,028 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 17:39:41,028 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 17:39:41,028 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 17:39:41,028 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 17:39:41,028 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 17:39:41,028 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 17:39:41,028 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 17:39:41,028 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 17:39:41,029 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 17:39:41,037 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-12-09 17:39:41,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 17:39:41,041 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:39:41,041 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:39:41,042 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:39:41,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:39:41,045 INFO L82 PathProgramCache]: Analyzing trace with hash 2094879456, now seen corresponding path program 1 times [2018-12-09 17:39:41,048 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 17:39:41,048 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e40739f-734a-4a51-b8a1-639edde371bc/bin-2019/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 17:39:41,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:39:41,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:39:41,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 17:39:41,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:39:41,141 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 17:39:41,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:39:41,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 17:39:41,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-09 17:39:41,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-09 17:39:41,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 17:39:41,156 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 2 states. [2018-12-09 17:39:41,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:39:41,170 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2018-12-09 17:39:41,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-09 17:39:41,171 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 30 [2018-12-09 17:39:41,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:39:41,176 INFO L225 Difference]: With dead ends: 86 [2018-12-09 17:39:41,176 INFO L226 Difference]: Without dead ends: 36 [2018-12-09 17:39:41,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 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-12-09 17:39:41,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-09 17:39:41,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-09 17:39:41,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-09 17:39:41,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-12-09 17:39:41,201 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 30 [2018-12-09 17:39:41,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:39:41,201 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-12-09 17:39:41,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-09 17:39:41,201 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-12-09 17:39:41,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 17:39:41,202 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:39:41,202 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:39:41,202 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:39:41,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:39:41,202 INFO L82 PathProgramCache]: Analyzing trace with hash 2094870807, now seen corresponding path program 1 times [2018-12-09 17:39:41,203 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 17:39:41,203 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e40739f-734a-4a51-b8a1-639edde371bc/bin-2019/utaipan/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 17:39:41,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:39:41,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:39:41,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 17:39:41,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:39:41,297 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 17:39:41,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:39:41,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 17:39:41,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 17:39:41,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 17:39:41,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 17:39:41,300 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 5 states. [2018-12-09 17:39:41,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:39:41,334 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2018-12-09 17:39:41,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 17:39:41,334 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-12-09 17:39:41,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:39:41,335 INFO L225 Difference]: With dead ends: 64 [2018-12-09 17:39:41,335 INFO L226 Difference]: Without dead ends: 41 [2018-12-09 17:39:41,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 17:39:41,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-09 17:39:41,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-12-09 17:39:41,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-09 17:39:41,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-12-09 17:39:41,340 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 30 [2018-12-09 17:39:41,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:39:41,340 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-12-09 17:39:41,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 17:39:41,340 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-12-09 17:39:41,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 17:39:41,341 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:39:41,341 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:39:41,341 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:39:41,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:39:41,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1504376275, now seen corresponding path program 1 times [2018-12-09 17:39:41,341 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 17:39:41,342 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e40739f-734a-4a51-b8a1-639edde371bc/bin-2019/utaipan/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 17:39:41,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:39:41,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:39:41,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 17:39:41,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:39:41,409 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 17:39:41,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:39:41,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 17:39:41,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 17:39:41,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 17:39:41,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:39:41,411 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 3 states. [2018-12-09 17:39:41,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:39:41,605 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2018-12-09 17:39:41,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 17:39:41,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-12-09 17:39:41,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:39:41,606 INFO L225 Difference]: With dead ends: 69 [2018-12-09 17:39:41,606 INFO L226 Difference]: Without dead ends: 41 [2018-12-09 17:39:41,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 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-12-09 17:39:41,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-09 17:39:41,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-12-09 17:39:41,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-09 17:39:41,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-12-09 17:39:41,610 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 35 [2018-12-09 17:39:41,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:39:41,610 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-12-09 17:39:41,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 17:39:41,611 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-12-09 17:39:41,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 17:39:41,611 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:39:41,611 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:39:41,611 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:39:41,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:39:41,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1370362769, now seen corresponding path program 1 times [2018-12-09 17:39:41,612 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 17:39:41,612 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e40739f-734a-4a51-b8a1-639edde371bc/bin-2019/utaipan/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 17:39:41,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:39:41,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:39:41,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 17:39:41,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:39:41,715 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 17:39:41,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:39:41,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 17:39:41,840 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e40739f-734a-4a51-b8a1-639edde371bc/bin-2019/utaipan/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-12-09 17:39:41,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:39:41,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:39:41,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 17:39:42,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 17:39:42,005 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-12-09 17:39:42,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:39:42,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:39:42,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:39:42,013 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-12-09 17:39:42,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-12-09 17:39:42,061 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 12 treesize of output 4 [2018-12-09 17:39:42,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:39:42,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:39:42,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:39:42,065 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2018-12-09 17:39:42,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 17:39:42,085 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 17:39:42,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 17:39:42,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6, 6] total 17 [2018-12-09 17:39:42,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 17:39:42,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 17:39:42,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-12-09 17:39:42,100 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 17 states. [2018-12-09 17:39:42,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:39:42,979 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-12-09 17:39:42,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 17:39:42,980 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 35 [2018-12-09 17:39:42,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:39:42,981 INFO L225 Difference]: With dead ends: 73 [2018-12-09 17:39:42,981 INFO L226 Difference]: Without dead ends: 50 [2018-12-09 17:39:42,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2018-12-09 17:39:42,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-09 17:39:42,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2018-12-09 17:39:42,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 17:39:42,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-12-09 17:39:42,987 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 35 [2018-12-09 17:39:42,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:39:42,987 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-12-09 17:39:42,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 17:39:42,988 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-12-09 17:39:42,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 17:39:42,988 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:39:42,989 INFO L402 BasicCegarLoop]: trace histogram [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, 1] [2018-12-09 17:39:42,989 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:39:42,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:39:42,989 INFO L82 PathProgramCache]: Analyzing trace with hash 2118555171, now seen corresponding path program 1 times [2018-12-09 17:39:42,990 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 17:39:42,990 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e40739f-734a-4a51-b8a1-639edde371bc/bin-2019/utaipan/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 17:39:43,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:39:43,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:39:43,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 17:39:43,209 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-12-09 17:39:43,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 17:39:43,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:39:43,217 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-12-09 17:39:43,710 WARN L854 $PredicateComparison]: unable to prove that (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1))) (= (select |c_old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1)))) is different from true [2018-12-09 17:39:44,577 WARN L180 SmtUtils]: Spent 853.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-09 17:39:46,596 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 17 [2018-12-09 17:39:46,701 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:39:46,702 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:39:46,703 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-12-09 17:39:46,709 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 25 treesize of output 20 [2018-12-09 17:39:46,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:39:46,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:39:46,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 17:39:46,728 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:31 [2018-12-09 17:39:46,882 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 11 treesize of output 8 [2018-12-09 17:39:46,887 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-12-09 17:39:46,887 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:39:46,892 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:39:46,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:39:46,920 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2018-12-09 17:39:47,131 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:39:47,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:39:47,285 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 27 treesize of output 22 [2018-12-09 17:39:47,300 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:39:47,307 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-12-09 17:39:47,307 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 17:39:47,326 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:39:47,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:39:47,376 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:83, output treesize:70 [2018-12-09 17:39:49,524 WARN L180 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 38 [2018-12-09 17:39:49,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 290 treesize of output 280 [2018-12-09 17:39:49,549 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 280 treesize of output 270 [2018-12-09 17:39:49,550 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:39:49,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:39:49,987 INFO L303 Elim1Store]: Index analysis took 127 ms [2018-12-09 17:39:50,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 137 [2018-12-09 17:39:50,063 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 126 treesize of output 12 [2018-12-09 17:39:50,063 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 17:39:50,388 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 123 treesize of output 66 [2018-12-09 17:39:50,388 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-09 17:39:50,491 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 17:39:50,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-09 17:39:50,689 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:311, output treesize:346 [2018-12-09 17:39:59,282 WARN L180 SmtUtils]: Spent 6.31 s on a formula simplification that was a NOOP. DAG size: 63 [2018-12-09 17:39:59,330 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 245 treesize of output 242 [2018-12-09 17:39:59,342 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-12-09 17:39:59,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:39:59,495 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:39:59,550 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 288 treesize of output 285 [2018-12-09 17:39:59,580 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-12-09 17:39:59,580 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 17:39:59,848 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:40:01,898 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 241 treesize of output 238 [2018-12-09 17:40:01,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-12-09 17:40:01,908 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 17:40:01,992 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:40:03,119 INFO L303 Elim1Store]: Index analysis took 195 ms [2018-12-09 17:40:03,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 284 treesize of output 308 [2018-12-09 17:40:03,537 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 286 treesize of output 280 [2018-12-09 17:40:03,538 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-12-09 17:40:06,525 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 285 treesize of output 273 [2018-12-09 17:40:06,526 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 17:40:07,153 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 17:40:08,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-09 17:40:08,294 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 7 variables, input treesize:534, output treesize:1033 [2018-12-09 17:40:24,183 WARN L180 SmtUtils]: Spent 14.50 s on a formula simplification that was a NOOP. DAG size: 86 [2018-12-09 17:40:49,181 WARN L180 SmtUtils]: Spent 24.99 s on a formula simplification. DAG size of input: 312 DAG size of output: 66 [2018-12-09 17:40:49,249 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:40:49,294 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:40:49,352 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:40:49,353 INFO L303 Elim1Store]: Index analysis took 170 ms [2018-12-09 17:40:49,353 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-12-09 17:40:49,353 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 17:40:50,541 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 17:40:50,541 INFO L303 Elim1Store]: Index analysis took 112 ms [2018-12-09 17:40:50,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 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 196 treesize of output 151 [2018-12-09 17:40:50,771 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2018-12-09 17:40:50,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 79 [2018-12-09 17:40:50,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 75 [2018-12-09 17:40:50,811 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 75 treesize of output 92 [2018-12-09 17:40:50,812 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 17:40:50,865 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:40:50,923 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:40:51,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 69 [2018-12-09 17:40:51,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 70 [2018-12-09 17:40:51,048 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 17:40:51,102 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 59 treesize of output 64 [2018-12-09 17:40:51,102 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 17:40:51,138 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:40:51,199 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 17:40:51,212 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 75 treesize of output 69 [2018-12-09 17:40:51,218 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:40:51,218 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 17:40:51,219 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:40:51,221 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:40:51,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 95 [2018-12-09 17:40:51,230 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 17:40:51,262 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 47 treesize of output 52 [2018-12-09 17:40:51,266 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-12-09 17:40:51,266 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 17:40:51,281 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:40:51,291 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:40:51,304 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:40:51,490 INFO L303 Elim1Store]: Index analysis took 185 ms [2018-12-09 17:40:51,494 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 1 case distinctions, treesize of input 113 treesize of output 88 [2018-12-09 17:40:51,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-12-09 17:40:51,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2018-12-09 17:40:51,540 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2018-12-09 17:40:51,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 49 [2018-12-09 17:40:51,577 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-09 17:40:51,600 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:40:51,632 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:40:51,652 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:40:51,773 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 3 case distinctions, treesize of input 88 treesize of output 99 [2018-12-09 17:40:51,779 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 94 treesize of output 93 [2018-12-09 17:40:51,780 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-09 17:40:52,181 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:40:52,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 129 [2018-12-09 17:40:52,182 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-09 17:40:52,576 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 17:40:52,592 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 3 case distinctions, treesize of input 76 treesize of output 90 [2018-12-09 17:40:52,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:40:52,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 83 treesize of output 150 [2018-12-09 17:40:52,600 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-09 17:40:52,675 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 17:40:52,813 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 17:40:52,832 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 3 case distinctions, treesize of input 73 treesize of output 89 [2018-12-09 17:40:52,837 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 82 treesize of output 94 [2018-12-09 17:40:52,837 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-09 17:40:52,874 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:40:52,924 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:40:52,945 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:40:53,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:40:53,003 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 14 variables, input treesize:1123, output treesize:82 [2018-12-09 17:40:53,266 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 45 treesize of output 31 [2018-12-09 17:40:53,269 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 18 treesize of output 5 [2018-12-09 17:40:53,270 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:40:53,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 17:40:53,277 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 17:40:53,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:40:53,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-12-09 17:40:53,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2018-12-09 17:40:53,292 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 17:40:53,296 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:40:53,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:40:53,302 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:76, output treesize:16 [2018-12-09 17:40:53,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-09 17:40:53,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 17:40:53,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:40:53,713 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:40:53,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:40:53,715 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:9 [2018-12-09 17:40:53,855 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-12-09 17:40:53,855 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 17:40:54,593 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-12-09 17:40:54,717 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-12-09 17:41:01,370 WARN L180 SmtUtils]: Spent 6.65 s on a formula simplification that was a NOOP. DAG size: 113 [2018-12-09 17:41:03,375 WARN L180 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 78 [2018-12-09 17:41:07,202 WARN L180 SmtUtils]: Spent 3.83 s on a formula simplification that was a NOOP. DAG size: 92 [2018-12-09 17:41:09,800 WARN L180 SmtUtils]: Spent 2.60 s on a formula simplification that was a NOOP. DAG size: 88 [2018-12-09 17:41:09,982 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-12-09 17:41:09,984 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:41:10,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:41:10,176 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:41:10,206 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:41:10,324 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:41:10,343 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:41:10,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 101 [2018-12-09 17:41:10,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2018-12-09 17:41:10,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2018-12-09 17:41:10,526 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 17:41:10,578 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:41:10,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 105 treesize of output 89 [2018-12-09 17:41:10,910 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 4 case distinctions, treesize of input 70 treesize of output 131 [2018-12-09 17:41:10,911 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 4 xjuncts. [2018-12-09 17:41:11,957 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 73 treesize of output 72 [2018-12-09 17:41:11,958 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 17:41:12,959 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:41:13,000 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 17:41:13,067 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 4 case distinctions, treesize of input 68 treesize of output 97 [2018-12-09 17:41:13,074 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 17:41:13,077 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:41:13,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 156 [2018-12-09 17:41:13,151 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 4 xjuncts. [2018-12-09 17:41:13,469 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 17:41:13,479 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:41:13,496 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 17:41:13,523 INFO L478 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 4 case distinctions, treesize of input 64 treesize of output 128 [2018-12-09 17:41:13,524 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 3 xjuncts. [2018-12-09 17:41:14,226 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-12-09 17:41:15,043 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:41:15,078 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 17:41:15,132 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 4 case distinctions, treesize of input 65 treesize of output 96 [2018-12-09 17:41:15,138 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 17:41:15,140 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:41:15,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 78 [2018-12-09 17:41:15,152 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-09 17:41:15,304 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 17:41:15,313 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:41:15,327 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 17:41:15,354 INFO L478 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 4 case distinctions, treesize of input 64 treesize of output 128 [2018-12-09 17:41:15,355 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 3 xjuncts. [2018-12-09 17:41:15,569 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 17:41:18,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 109 [2018-12-09 17:41:18,207 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 97 treesize of output 84 [2018-12-09 17:41:18,207 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-09 17:41:18,307 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 17:41:18,308 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 17:41:18,333 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 86 treesize of output 128 [2018-12-09 17:41:18,334 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-12-09 17:41:18,413 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 17:41:18,423 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:41:18,424 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 17:41:18,424 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 93 treesize of output 99 [2018-12-09 17:41:18,430 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 17:41:18,432 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:41:18,443 INFO L478 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 83 [2018-12-09 17:41:18,444 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-09 17:41:18,466 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:41:18,759 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-12-09 17:41:18,916 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-09 17:41:19,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 69 [2018-12-09 17:41:19,039 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 13 treesize of output 4 [2018-12-09 17:41:19,039 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-09 17:41:19,053 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:41:19,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 71 [2018-12-09 17:41:19,061 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 47 treesize of output 37 [2018-12-09 17:41:19,061 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-09 17:41:19,075 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:41:19,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 71 [2018-12-09 17:41:19,081 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 43 treesize of output 33 [2018-12-09 17:41:19,081 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-12-09 17:41:19,094 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:41:19,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2018-12-09 17:41:19,101 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 30 treesize of output 28 [2018-12-09 17:41:19,101 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:41:19,119 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:41:19,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 54 [2018-12-09 17:41:19,263 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 49 treesize of output 23 [2018-12-09 17:41:19,264 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-12-09 17:41:19,315 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 23 treesize of output 15 [2018-12-09 17:41:19,315 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-09 17:41:19,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 68 [2018-12-09 17:41:19,378 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 4 xjuncts. [2018-12-09 17:41:19,433 INFO L267 ElimStorePlain]: Start of recursive call 33: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-09 17:41:19,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 64 [2018-12-09 17:41:19,439 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 12 treesize of output 3 [2018-12-09 17:41:19,439 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-12-09 17:41:19,453 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:41:19,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 64 [2018-12-09 17:41:19,459 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 17:41:19,462 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 32 treesize of output 27 [2018-12-09 17:41:19,462 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-12-09 17:41:19,471 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:41:19,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 62 [2018-12-09 17:41:19,479 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 17:41:19,482 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:41:19,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 51 [2018-12-09 17:41:19,487 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-12-09 17:41:19,497 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:41:19,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-12-09 17:41:19,556 INFO L202 ElimStorePlain]: Needed 42 recursive calls to eliminate 7 variables, input treesize:135, output treesize:86 [2018-12-09 17:41:19,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 17:41:19,830 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e40739f-734a-4a51-b8a1-639edde371bc/bin-2019/utaipan/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-12-09 17:41:19,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:41:19,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:41:19,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 17:41:19,884 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-12-09 17:41:19,884 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 17:41:19,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:41:19,886 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 17:41:37,450 WARN L180 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 15 [2018-12-09 17:42:03,207 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:42:03,208 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:42:03,209 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:42:03,209 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 40 [2018-12-09 17:42:03,212 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 28 treesize of output 34 [2018-12-09 17:42:03,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:42:03,220 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:42:03,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:42:03,230 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:29 [2018-12-09 17:42:08,710 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 11 treesize of output 8 [2018-12-09 17:42:08,713 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-12-09 17:42:08,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:42:08,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:42:08,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:42:08,744 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2018-12-09 17:42:15,086 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 27 treesize of output 22 [2018-12-09 17:42:15,102 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:42:15,115 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-12-09 17:42:15,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:42:15,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:42:15,256 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:42:15,268 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:42:15,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:42:15,338 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:79, output treesize:62 [2018-12-09 17:42:26,238 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 37 [2018-12-09 17:42:26,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 158 treesize of output 211 [2018-12-09 17:42:26,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 159 treesize of output 53 [2018-12-09 17:42:26,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:42:26,494 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 156 treesize of output 103 [2018-12-09 17:42:26,495 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 17:42:26,538 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 17:42:26,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2018-12-09 17:42:26,598 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-12-09 17:42:26,598 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 17:42:26,605 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:42:26,649 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 2 xjuncts. [2018-12-09 17:42:26,649 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:172, output treesize:82 [2018-12-09 17:42:33,055 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 85 treesize of output 82 [2018-12-09 17:42:33,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-12-09 17:42:33,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:42:33,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:42:33,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 62 [2018-12-09 17:42:33,444 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 51 treesize of output 39 [2018-12-09 17:42:33,444 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 17:42:33,587 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 48 treesize of output 42 [2018-12-09 17:42:33,587 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-09 17:42:33,655 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 17:42:33,825 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 35 treesize of output 32 [2018-12-09 17:42:33,828 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-12-09 17:42:33,828 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 17:42:33,840 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:42:33,847 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 34 treesize of output 31 [2018-12-09 17:42:33,850 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-12-09 17:42:33,850 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 17:42:33,864 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:42:33,886 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 70 treesize of output 67 [2018-12-09 17:42:33,893 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-12-09 17:42:33,893 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-09 17:42:33,939 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:42:34,063 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 66 treesize of output 63 [2018-12-09 17:42:34,067 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-12-09 17:42:34,067 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-09 17:42:34,091 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:42:34,095 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 30 treesize of output 27 [2018-12-09 17:42:34,097 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-12-09 17:42:34,097 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-09 17:42:34,106 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:42:34,110 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 31 treesize of output 28 [2018-12-09 17:42:34,112 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-12-09 17:42:34,112 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-09 17:42:34,121 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:42:34,195 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-12-09 17:42:34,195 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 6 variables, input treesize:136, output treesize:135 [2018-12-09 17:42:36,711 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:42:36,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:42:36,713 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:42:36,714 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 17:42:36,714 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 30 treesize of output 49 [2018-12-09 17:42:36,714 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 17:42:36,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-12-09 17:42:36,750 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 23 treesize of output 17 [2018-12-09 17:42:36,750 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 17:42:36,752 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:42:36,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:42:36,765 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:188, output treesize:27 [2018-12-09 17:42:40,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-09 17:42:40,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 17:42:40,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:42:40,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:42:40,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-12-09 17:42:40,049 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 21 treesize of output 12 [2018-12-09 17:42:40,050 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 17:42:40,055 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:42:40,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:42:40,061 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:41, output treesize:11 [2018-12-09 17:42:40,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-09 17:42:40,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 17:42:40,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:42:40,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:42:40,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:42:40,273 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-09 17:42:40,278 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-12-09 17:42:40,278 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 17:42:40,558 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-12-09 17:42:40,664 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-12-09 17:42:45,175 WARN L180 SmtUtils]: Spent 4.51 s on a formula simplification that was a NOOP. DAG size: 109 [2018-12-09 17:42:46,288 WARN L180 SmtUtils]: Spent 1.11 s on a formula simplification that was a NOOP. DAG size: 77 [2018-12-09 17:42:47,588 WARN L180 SmtUtils]: Spent 1.30 s on a formula simplification that was a NOOP. DAG size: 91 [2018-12-09 17:42:48,900 WARN L180 SmtUtils]: Spent 1.31 s on a formula simplification that was a NOOP. DAG size: 87 [2018-12-09 17:42:49,070 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-12-09 17:42:49,071 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:42:49,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:42:49,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 78 [2018-12-09 17:42:49,225 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 78 treesize of output 74 [2018-12-09 17:42:49,225 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:42:49,239 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:42:49,361 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 19 treesize of output 16 [2018-12-09 17:42:49,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2018-12-09 17:42:49,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2018-12-09 17:42:49,386 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 17:42:49,397 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:42:49,404 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:42:49,474 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:42:49,484 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:42:49,555 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:42:49,568 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:42:49,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 106 [2018-12-09 17:42:50,114 WARN L180 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2018-12-09 17:42:50,121 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 70 treesize of output 69 [2018-12-09 17:42:50,121 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-09 17:42:50,418 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:42:50,418 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 17:42:50,419 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 68 treesize of output 70 [2018-12-09 17:42:50,419 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 17:42:50,444 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 69 treesize of output 95 [2018-12-09 17:42:50,444 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-12-09 17:42:50,457 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:42:50,458 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 17:42:50,458 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 68 treesize of output 70 [2018-12-09 17:42:50,459 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 17:42:50,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 53 [2018-12-09 17:42:50,823 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 26 treesize of output 22 [2018-12-09 17:42:50,823 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-12-09 17:42:50,871 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 39 treesize of output 33 [2018-12-09 17:42:50,871 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-09 17:42:50,947 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 17:42:51,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 [2018-12-09 17:42:51,188 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 8 treesize of output 1 [2018-12-09 17:42:51,188 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-09 17:42:51,194 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:42:51,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 45 [2018-12-09 17:42:51,207 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:42:51,207 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 14 treesize of output 10 [2018-12-09 17:42:51,207 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-09 17:42:51,229 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:42:51,232 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 45 [2018-12-09 17:42:51,236 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:42:51,237 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 14 treesize of output 10 [2018-12-09 17:42:51,237 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-09 17:42:51,251 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:42:51,402 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 17:42:51,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 6 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-12-09 17:42:51,497 INFO L202 ElimStorePlain]: Needed 26 recursive calls to eliminate 8 variables, input treesize:147, output treesize:76 [2018-12-09 17:42:51,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 17:42:51,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 38 [2018-12-09 17:42:51,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-09 17:42:51,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-09 17:42:51,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1501, Unknown=38, NotChecked=78, Total=1722 [2018-12-09 17:42:51,896 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 38 states. [2018-12-09 17:43:07,422 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 27 DAG size of output: 19 [2018-12-09 17:43:17,510 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 29 DAG size of output: 21 [2018-12-09 17:43:20,313 WARN L180 SmtUtils]: Spent 2.58 s on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2018-12-09 17:43:35,929 WARN L180 SmtUtils]: Spent 5.90 s on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2018-12-09 17:44:04,352 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2018-12-09 17:44:30,986 WARN L180 SmtUtils]: Spent 8.33 s on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2018-12-09 17:45:03,974 WARN L180 SmtUtils]: Spent 10.38 s on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2018-12-09 17:46:15,357 WARN L180 SmtUtils]: Spent 50.74 s on a formula simplification. DAG size of input: 137 DAG size of output: 133 [2018-12-09 17:46:34,397 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2018-12-09 17:47:03,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:47:03,083 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2018-12-09 17:47:03,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-09 17:47:03,085 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 40 [2018-12-09 17:47:03,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:47:03,087 INFO L225 Difference]: With dead ends: 75 [2018-12-09 17:47:03,087 INFO L226 Difference]: Without dead ends: 73 [2018-12-09 17:47:03,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 259.1s TimeCoverageRelationStatistics Valid=228, Invalid=3249, Unknown=67, NotChecked=116, Total=3660 [2018-12-09 17:47:03,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-09 17:47:03,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 56. [2018-12-09 17:47:03,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-09 17:47:03,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2018-12-09 17:47:03,096 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 40 [2018-12-09 17:47:03,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:47:03,096 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2018-12-09 17:47:03,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-09 17:47:03,096 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2018-12-09 17:47:03,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 17:47:03,097 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:47:03,097 INFO L402 BasicCegarLoop]: trace histogram [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, 1] [2018-12-09 17:47:03,097 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:47:03,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:47:03,097 INFO L82 PathProgramCache]: Analyzing trace with hash 390225691, now seen corresponding path program 2 times [2018-12-09 17:47:03,098 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 17:47:03,098 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e40739f-734a-4a51-b8a1-639edde371bc/bin-2019/utaipan/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 17:47:03,112 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-09 17:47:03,266 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 17:47:03,266 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 17:47:03,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 17:47:03,309 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:47:03,309 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 17:47:03,446 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:47:03,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 17:47:03,449 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e40739f-734a-4a51-b8a1-639edde371bc/bin-2019/utaipan/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-12-09 17:47:03,455 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 17:47:04,621 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 17:47:04,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 17:47:04,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 17:47:04,712 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:47:04,712 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 17:47:05,201 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:47:05,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 17:47:05,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9, 9] total 20 [2018-12-09 17:47:05,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-09 17:47:05,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-09 17:47:05,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2018-12-09 17:47:05,219 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 20 states. [2018-12-09 17:47:06,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:47:06,070 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2018-12-09 17:47:06,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 17:47:06,071 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 45 [2018-12-09 17:47:06,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:47:06,071 INFO L225 Difference]: With dead ends: 85 [2018-12-09 17:47:06,071 INFO L226 Difference]: Without dead ends: 44 [2018-12-09 17:47:06,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 159 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2018-12-09 17:47:06,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-09 17:47:06,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-09 17:47:06,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 17:47:06,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2018-12-09 17:47:06,075 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 45 [2018-12-09 17:47:06,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:47:06,076 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2018-12-09 17:47:06,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-09 17:47:06,076 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2018-12-09 17:47:06,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 17:47:06,076 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:47:06,076 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2018-12-09 17:47:06,076 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:47:06,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:47:06,076 INFO L82 PathProgramCache]: Analyzing trace with hash 117064084, now seen corresponding path program 1 times [2018-12-09 17:47:06,077 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 17:47:06,077 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e40739f-734a-4a51-b8a1-639edde371bc/bin-2019/utaipan/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 17:47:06,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 17:47:06,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:47:06,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 17:47:06,328 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-12-09 17:47:06,328 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 17:47:06,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:47:06,332 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 17:47:08,350 WARN L854 $PredicateComparison]: unable to prove that (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1))) (= (select |c_old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1)))) is different from true [2018-12-09 17:47:10,371 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 17 [2018-12-09 17:47:13,807 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 17 [2018-12-09 17:47:15,836 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 17 [2018-12-09 17:47:15,840 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:47:15,842 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:47:15,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-12-09 17:47:15,847 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 25 treesize of output 20 [2018-12-09 17:47:15,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:47:15,854 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:47:15,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:47:15,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:27 [2018-12-09 17:47:19,187 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:47:19,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:47:19,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:47:19,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:63 [2018-12-09 17:47:21,441 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 33 [2018-12-09 17:47:21,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 205 treesize of output 203 [2018-12-09 17:47:21,461 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 203 treesize of output 201 [2018-12-09 17:47:21,462 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:47:21,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:47:21,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 17:47:21,616 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:220, output treesize:216 [2018-12-09 17:47:28,578 WARN L180 SmtUtils]: Spent 2.11 s on a formula simplification that was a NOOP. DAG size: 40 [2018-12-09 17:47:28,660 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 11 treesize of output 8 [2018-12-09 17:47:28,685 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-12-09 17:47:28,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:47:28,733 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:47:28,891 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-12-09 17:47:28,891 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:344, output treesize:340 [2018-12-09 17:47:31,280 WARN L180 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 40 [2018-12-09 17:47:32,342 WARN L180 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 120 DAG size of output: 55 [2018-12-09 17:47:32,377 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:47:32,404 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:47:32,433 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:47:32,446 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:47:32,446 INFO L303 Elim1Store]: Index analysis took 103 ms [2018-12-09 17:47:32,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-12-09 17:47:32,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 17:47:32,651 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:47:32,821 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:47:32,827 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:47:32,828 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 17:47:32,828 INFO L303 Elim1Store]: Index analysis took 210 ms [2018-12-09 17:47:32,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 150 [2018-12-09 17:47:33,234 WARN L180 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2018-12-09 17:47:33,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 69 [2018-12-09 17:47:33,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 62 [2018-12-09 17:47:33,298 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 59 treesize of output 62 [2018-12-09 17:47:33,299 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 17:47:33,371 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:47:33,453 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:47:33,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 101 [2018-12-09 17:47:33,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 90 [2018-12-09 17:47:33,710 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 17:47:33,956 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 80 [2018-12-09 17:47:34,162 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 17:47:34,163 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimArr_24 input size 13 context size 13 output size 13 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-12-09 17:47:34,166 INFO L168 Benchmark]: Toolchain (without parser) took 473978.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 186.6 MB). Free memory was 938.0 MB in the beginning and 1.0 GB in the end (delta: -108.5 MB). Peak memory consumption was 78.1 MB. Max. memory is 11.5 GB. [2018-12-09 17:47:34,167 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 17:47:34,167 INFO L168 Benchmark]: CACSL2BoogieTranslator took 313.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -187.0 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. [2018-12-09 17:47:34,167 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.64 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-09 17:47:34,168 INFO L168 Benchmark]: Boogie Preprocessor took 21.46 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-12-09 17:47:34,168 INFO L168 Benchmark]: RCFGBuilder took 446.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 34.1 MB). Peak memory consumption was 34.1 MB. Max. memory is 11.5 GB. [2018-12-09 17:47:34,168 INFO L168 Benchmark]: TraceAbstraction took 473175.55 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 47.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 37.5 MB). Peak memory consumption was 85.2 MB. Max. memory is 11.5 GB. [2018-12-09 17:47:34,170 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 313.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -187.0 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.64 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.46 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 446.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 34.1 MB). Peak memory consumption was 34.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 473175.55 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 47.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 37.5 MB). Peak memory consumption was 85.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimArr_24 input size 13 context size 13 output size 13 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimArr_24 input size 13 context size 13 output size 13: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...