./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/s5lif.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/s5lif.c -s /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 549066cbb7a87d3d7638f4434cfbd1023f1c6d7e ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/s5lif.c -s /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 549066cbb7a87d3d7638f4434cfbd1023f1c6d7e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: var is still there: |#memory_int| input size 379 context size 379 output size 379 --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 23:27:43,639 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 23:27:43,641 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 23:27:43,659 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 23:27:43,660 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 23:27:43,662 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 23:27:43,664 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 23:27:43,675 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 23:27:43,680 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 23:27:43,684 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 23:27:43,685 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 23:27:43,686 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 23:27:43,687 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 23:27:43,688 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 23:27:43,689 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 23:27:43,690 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 23:27:43,691 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 23:27:43,692 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 23:27:43,694 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 23:27:43,698 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 23:27:43,703 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 23:27:43,705 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 23:27:43,709 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 23:27:43,710 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 23:27:43,715 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 23:27:43,715 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 23:27:43,716 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 23:27:43,718 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 23:27:43,719 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 23:27:43,720 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 23:27:43,721 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 23:27:43,722 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 23:27:43,722 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 23:27:43,724 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 23:27:43,725 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 23:27:43,726 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 23:27:43,726 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 23:27:43,726 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 23:27:43,727 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 23:27:43,728 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 23:27:43,729 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 23:27:43,730 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 23:27:43,761 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 23:27:43,761 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 23:27:43,762 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 23:27:43,763 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 23:27:43,763 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 23:27:43,763 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 23:27:43,763 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 23:27:43,764 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 23:27:43,764 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 23:27:43,764 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 23:27:43,764 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 23:27:43,765 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 23:27:43,765 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 23:27:43,765 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 23:27:43,765 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 23:27:43,765 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 23:27:43,766 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 23:27:43,766 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 23:27:43,766 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 23:27:43,766 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 23:27:43,767 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 23:27:43,767 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 23:27:43,767 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 23:27:43,767 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 23:27:43,768 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 23:27:43,768 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 23:27:43,768 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 23:27:43,768 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 23:27:43,769 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 549066cbb7a87d3d7638f4434cfbd1023f1c6d7e [2019-11-19 23:27:43,984 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 23:27:44,004 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 23:27:44,009 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 23:27:44,011 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 23:27:44,011 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 23:27:44,013 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/../../sv-benchmarks/c/array-fpi/s5lif.c [2019-11-19 23:27:44,084 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/data/cfa8cabc3/e3b87f2486504f5cb61aa02cbe7eb3fa/FLAG47a86eb2f [2019-11-19 23:27:44,542 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 23:27:44,544 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/sv-benchmarks/c/array-fpi/s5lif.c [2019-11-19 23:27:44,553 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/data/cfa8cabc3/e3b87f2486504f5cb61aa02cbe7eb3fa/FLAG47a86eb2f [2019-11-19 23:27:44,938 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/data/cfa8cabc3/e3b87f2486504f5cb61aa02cbe7eb3fa [2019-11-19 23:27:44,940 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 23:27:44,941 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 23:27:44,942 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 23:27:44,947 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 23:27:44,950 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 23:27:44,951 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:27:44" (1/1) ... [2019-11-19 23:27:44,953 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ce27084 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:27:44, skipping insertion in model container [2019-11-19 23:27:44,953 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:27:44" (1/1) ... [2019-11-19 23:27:44,961 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 23:27:44,981 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 23:27:45,180 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:27:45,263 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 23:27:45,292 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:27:45,310 INFO L192 MainTranslator]: Completed translation [2019-11-19 23:27:45,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:27:45 WrapperNode [2019-11-19 23:27:45,311 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 23:27:45,312 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 23:27:45,312 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 23:27:45,313 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 23:27:45,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:27:45" (1/1) ... [2019-11-19 23:27:45,331 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:27:45" (1/1) ... [2019-11-19 23:27:45,357 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 23:27:45,357 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 23:27:45,358 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 23:27:45,358 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 23:27:45,369 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:27:45" (1/1) ... [2019-11-19 23:27:45,369 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:27:45" (1/1) ... [2019-11-19 23:27:45,372 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:27:45" (1/1) ... [2019-11-19 23:27:45,372 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:27:45" (1/1) ... [2019-11-19 23:27:45,379 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:27:45" (1/1) ... [2019-11-19 23:27:45,385 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:27:45" (1/1) ... [2019-11-19 23:27:45,386 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:27:45" (1/1) ... [2019-11-19 23:27:45,389 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 23:27:45,389 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 23:27:45,390 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 23:27:45,390 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 23:27:45,392 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:27:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 23:27:45,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 23:27:45,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-19 23:27:45,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-19 23:27:45,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 23:27:45,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 23:27:45,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-19 23:27:45,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 23:27:45,838 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 23:27:45,839 INFO L285 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-19 23:27:45,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:27:45 BoogieIcfgContainer [2019-11-19 23:27:45,840 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 23:27:45,841 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 23:27:45,842 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 23:27:45,845 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 23:27:45,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 11:27:44" (1/3) ... [2019-11-19 23:27:45,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fdababe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:27:45, skipping insertion in model container [2019-11-19 23:27:45,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:27:45" (2/3) ... [2019-11-19 23:27:45,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fdababe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:27:45, skipping insertion in model container [2019-11-19 23:27:45,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:27:45" (3/3) ... [2019-11-19 23:27:45,849 INFO L109 eAbstractionObserver]: Analyzing ICFG s5lif.c [2019-11-19 23:27:45,861 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 23:27:45,869 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 23:27:45,882 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 23:27:45,908 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 23:27:45,909 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 23:27:45,909 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 23:27:45,909 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 23:27:45,909 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 23:27:45,910 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 23:27:45,910 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 23:27:45,910 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 23:27:45,927 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-11-19 23:27:45,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-19 23:27:45,934 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:27:45,935 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:27:45,935 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:27:45,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:27:45,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1306593900, now seen corresponding path program 1 times [2019-11-19 23:27:45,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:27:45,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014942054] [2019-11-19 23:27:45,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:27:46,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:27:46,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:27:46,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014942054] [2019-11-19 23:27:46,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:27:46,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:27:46,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716993682] [2019-11-19 23:27:46,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-19 23:27:46,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:27:46,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-19 23:27:46,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 23:27:46,163 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2019-11-19 23:27:46,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:27:46,181 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2019-11-19 23:27:46,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-19 23:27:46,182 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-11-19 23:27:46,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:27:46,191 INFO L225 Difference]: With dead ends: 35 [2019-11-19 23:27:46,191 INFO L226 Difference]: Without dead ends: 16 [2019-11-19 23:27:46,194 INFO L630 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 [2019-11-19 23:27:46,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-11-19 23:27:46,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-19 23:27:46,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-19 23:27:46,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2019-11-19 23:27:46,232 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 11 [2019-11-19 23:27:46,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:27:46,232 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-11-19 23:27:46,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-19 23:27:46,233 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2019-11-19 23:27:46,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-19 23:27:46,233 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:27:46,234 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:27:46,234 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:27:46,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:27:46,234 INFO L82 PathProgramCache]: Analyzing trace with hash -875432925, now seen corresponding path program 1 times [2019-11-19 23:27:46,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:27:46,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386143478] [2019-11-19 23:27:46,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:27:46,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:27:46,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:27:46,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386143478] [2019-11-19 23:27:46,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:27:46,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:27:46,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577308565] [2019-11-19 23:27:46,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:27:46,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:27:46,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:27:46,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:27:46,321 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand 3 states. [2019-11-19 23:27:46,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:27:46,394 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2019-11-19 23:27:46,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:27:46,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-19 23:27:46,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:27:46,396 INFO L225 Difference]: With dead ends: 29 [2019-11-19 23:27:46,396 INFO L226 Difference]: Without dead ends: 18 [2019-11-19 23:27:46,397 INFO L630 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 [2019-11-19 23:27:46,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-11-19 23:27:46,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-11-19 23:27:46,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-19 23:27:46,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-11-19 23:27:46,402 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 11 [2019-11-19 23:27:46,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:27:46,402 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-19 23:27:46,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:27:46,402 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2019-11-19 23:27:46,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-19 23:27:46,403 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:27:46,403 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:27:46,403 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:27:46,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:27:46,404 INFO L82 PathProgramCache]: Analyzing trace with hash -100050171, now seen corresponding path program 1 times [2019-11-19 23:27:46,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:27:46,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625608160] [2019-11-19 23:27:46,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:27:46,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:27:46,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 23:27:46,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625608160] [2019-11-19 23:27:46,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:27:46,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:27:46,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729992817] [2019-11-19 23:27:46,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:27:46,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:27:46,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:27:46,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:27:46,483 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 4 states. [2019-11-19 23:27:46,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:27:46,570 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2019-11-19 23:27:46,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:27:46,571 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-19 23:27:46,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:27:46,572 INFO L225 Difference]: With dead ends: 30 [2019-11-19 23:27:46,572 INFO L226 Difference]: Without dead ends: 23 [2019-11-19 23:27:46,573 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:27:46,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-19 23:27:46,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2019-11-19 23:27:46,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-19 23:27:46,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2019-11-19 23:27:46,579 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 13 [2019-11-19 23:27:46,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:27:46,580 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-11-19 23:27:46,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:27:46,580 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2019-11-19 23:27:46,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-19 23:27:46,581 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:27:46,581 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:27:46,582 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:27:46,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:27:46,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1777901324, now seen corresponding path program 1 times [2019-11-19 23:27:46,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:27:46,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545483188] [2019-11-19 23:27:46,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:27:46,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:27:47,127 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2019-11-19 23:27:47,298 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 37 [2019-11-19 23:27:47,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:27:47,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545483188] [2019-11-19 23:27:47,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731012391] [2019-11-19 23:27:47,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:27:47,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:27:47,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-19 23:27:47,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:27:47,893 INFO L377 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 10 treesize of output 8 [2019-11-19 23:27:47,894 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:27:47,912 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:27:47,924 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-19 23:27:47,925 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:27:47,938 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:27:47,939 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:27:47,939 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2019-11-19 23:27:47,993 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-19 23:27:47,994 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:27:48,011 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:27:48,012 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:27:48,012 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-11-19 23:27:48,450 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:27:48,450 INFO L377 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 79 [2019-11-19 23:27:48,452 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:27:48,493 INFO L567 ElimStorePlain]: treesize reduction 61, result has 33.0 percent of original size [2019-11-19 23:27:48,494 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:27:48,495 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:25 [2019-11-19 23:27:48,624 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-11-19 23:27:48,625 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:27:48,644 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:27:48,645 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 23:27:48,646 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:29 [2019-11-19 23:27:48,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:27:48,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:27:48,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:27:48,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2019-11-19 23:27:48,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946386587] [2019-11-19 23:27:48,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-19 23:27:48,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:27:48,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-19 23:27:48,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2019-11-19 23:27:48,811 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 24 states. [2019-11-19 23:27:49,584 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 40 [2019-11-19 23:27:50,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:27:50,431 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2019-11-19 23:27:50,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-19 23:27:50,436 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 18 [2019-11-19 23:27:50,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:27:50,439 INFO L225 Difference]: With dead ends: 50 [2019-11-19 23:27:50,439 INFO L226 Difference]: Without dead ends: 37 [2019-11-19 23:27:50,440 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=235, Invalid=1247, Unknown=0, NotChecked=0, Total=1482 [2019-11-19 23:27:50,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-19 23:27:50,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 29. [2019-11-19 23:27:50,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-19 23:27:50,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2019-11-19 23:27:50,449 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 18 [2019-11-19 23:27:50,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:27:50,449 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2019-11-19 23:27:50,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-19 23:27:50,450 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2019-11-19 23:27:50,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-19 23:27:50,451 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:27:50,451 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:27:50,660 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:27:50,660 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:27:50,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:27:50,661 INFO L82 PathProgramCache]: Analyzing trace with hash -780577906, now seen corresponding path program 2 times [2019-11-19 23:27:50,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:27:50,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076505922] [2019-11-19 23:27:50,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:27:50,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:27:50,781 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 23:27:50,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076505922] [2019-11-19 23:27:50,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244123501] [2019-11-19 23:27:50,782 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:27:50,832 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 23:27:50,832 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:27:50,833 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 23:27:50,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:27:50,876 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 23:27:50,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:27:50,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-11-19 23:27:50,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858891080] [2019-11-19 23:27:50,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 23:27:50,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:27:50,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 23:27:50,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-19 23:27:50,878 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 10 states. [2019-11-19 23:27:51,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:27:51,043 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2019-11-19 23:27:51,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 23:27:51,044 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-19 23:27:51,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:27:51,045 INFO L225 Difference]: With dead ends: 62 [2019-11-19 23:27:51,045 INFO L226 Difference]: Without dead ends: 42 [2019-11-19 23:27:51,046 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-19 23:27:51,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-19 23:27:51,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 28. [2019-11-19 23:27:51,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-19 23:27:51,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-11-19 23:27:51,053 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 20 [2019-11-19 23:27:51,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:27:51,054 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-11-19 23:27:51,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 23:27:51,054 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2019-11-19 23:27:51,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-19 23:27:51,055 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:27:51,055 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:27:51,259 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:27:51,267 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:27:51,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:27:51,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1936976406, now seen corresponding path program 3 times [2019-11-19 23:27:51,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:27:51,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798627536] [2019-11-19 23:27:51,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:27:51,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:27:51,399 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 23:27:51,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798627536] [2019-11-19 23:27:51,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262015175] [2019-11-19 23:27:51,400 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:27:51,439 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-19 23:27:51,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:27:51,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 23:27:51,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:27:51,494 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 23:27:51,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:27:51,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-11-19 23:27:51,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46083502] [2019-11-19 23:27:51,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 23:27:51,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:27:51,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 23:27:51,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-19 23:27:51,496 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 10 states. [2019-11-19 23:27:51,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:27:51,661 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2019-11-19 23:27:51,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 23:27:51,662 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-19 23:27:51,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:27:51,662 INFO L225 Difference]: With dead ends: 37 [2019-11-19 23:27:51,663 INFO L226 Difference]: Without dead ends: 29 [2019-11-19 23:27:51,663 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-11-19 23:27:51,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-19 23:27:51,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2019-11-19 23:27:51,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-19 23:27:51,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-11-19 23:27:51,669 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 20 [2019-11-19 23:27:51,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:27:51,669 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-11-19 23:27:51,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 23:27:51,669 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-11-19 23:27:51,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-19 23:27:51,670 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:27:51,670 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:27:51,871 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:27:51,871 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:27:51,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:27:51,872 INFO L82 PathProgramCache]: Analyzing trace with hash 387064011, now seen corresponding path program 4 times [2019-11-19 23:27:51,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:27:51,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077182978] [2019-11-19 23:27:51,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:27:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:27:52,951 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-11-19 23:27:53,102 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2019-11-19 23:27:53,764 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:27:53,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077182978] [2019-11-19 23:27:53,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305069935] [2019-11-19 23:27:53,766 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:27:53,819 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-19 23:27:53,819 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:27:53,821 WARN L253 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 45 conjunts are in the unsatisfiable core [2019-11-19 23:27:53,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:27:53,832 INFO L377 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 10 treesize of output 8 [2019-11-19 23:27:53,832 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:27:53,849 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:27:53,855 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-19 23:27:53,855 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:27:53,872 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:27:53,872 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:27:53,873 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2019-11-19 23:27:53,942 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-19 23:27:53,942 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:27:53,963 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:27:53,963 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:27:53,964 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-11-19 23:27:54,117 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:27:54,118 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 72 [2019-11-19 23:27:54,119 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:27:54,181 INFO L567 ElimStorePlain]: treesize reduction 36, result has 57.1 percent of original size [2019-11-19 23:27:54,182 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:27:54,182 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:52, output treesize:48 [2019-11-19 23:27:54,597 INFO L343 Elim1Store]: treesize reduction 16, result has 89.1 percent of original size [2019-11-19 23:27:54,598 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 66 treesize of output 163 [2019-11-19 23:27:54,599 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:27:54,664 INFO L567 ElimStorePlain]: treesize reduction 116, result has 43.1 percent of original size [2019-11-19 23:27:54,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:27:54,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:27:54,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:27:54,669 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 23:27:54,670 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:89, output treesize:88 [2019-11-19 23:27:54,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:27:54,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:27:54,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:27:54,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:27:54,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:27:54,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:27:55,070 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:27:55,071 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 23:27:55,072 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 37 [2019-11-19 23:27:55,073 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:27:55,088 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:27:55,089 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:27:55,089 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:74, output treesize:44 [2019-11-19 23:27:55,236 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 23:27:55,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:27:55,239 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2019-11-19 23:27:55,240 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:27:55,260 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:27:55,261 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:27:55,262 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:59 [2019-11-19 23:27:55,429 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 23:27:55,430 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 35 [2019-11-19 23:27:55,431 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:27:55,443 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:27:55,444 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 23:27:55,445 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:39 [2019-11-19 23:27:55,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:27:55,563 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:27:55,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:27:55,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 39 [2019-11-19 23:27:55,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032719674] [2019-11-19 23:27:55,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-11-19 23:27:55,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:27:55,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-11-19 23:27:55,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1303, Unknown=0, NotChecked=0, Total=1482 [2019-11-19 23:27:55,567 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 39 states. [2019-11-19 23:27:57,298 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 46 [2019-11-19 23:27:58,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:27:58,484 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2019-11-19 23:27:58,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-19 23:27:58,485 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 25 [2019-11-19 23:27:58,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:27:58,486 INFO L225 Difference]: With dead ends: 72 [2019-11-19 23:27:58,486 INFO L226 Difference]: Without dead ends: 55 [2019-11-19 23:27:58,489 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1212 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=558, Invalid=3474, Unknown=0, NotChecked=0, Total=4032 [2019-11-19 23:27:58,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-19 23:27:58,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2019-11-19 23:27:58,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-19 23:27:58,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2019-11-19 23:27:58,497 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 25 [2019-11-19 23:27:58,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:27:58,497 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2019-11-19 23:27:58,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-11-19 23:27:58,497 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2019-11-19 23:27:58,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-19 23:27:58,498 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:27:58,498 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:27:58,699 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:27:58,699 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:27:58,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:27:58,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1640406643, now seen corresponding path program 5 times [2019-11-19 23:27:58,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:27:58,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529428626] [2019-11-19 23:27:58,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:27:58,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:27:58,819 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-19 23:27:58,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529428626] [2019-11-19 23:27:58,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881877135] [2019-11-19 23:27:58,819 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:27:58,888 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-11-19 23:27:58,888 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:27:58,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 23:27:58,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:27:58,960 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-19 23:27:58,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:27:58,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-11-19 23:27:58,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848856806] [2019-11-19 23:27:58,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-19 23:27:58,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:27:58,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-19 23:27:58,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-11-19 23:27:58,961 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand 13 states. [2019-11-19 23:27:59,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:27:59,150 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2019-11-19 23:27:59,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 23:27:59,150 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2019-11-19 23:27:59,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:27:59,152 INFO L225 Difference]: With dead ends: 81 [2019-11-19 23:27:59,152 INFO L226 Difference]: Without dead ends: 51 [2019-11-19 23:27:59,153 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-11-19 23:27:59,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-19 23:27:59,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 37. [2019-11-19 23:27:59,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-19 23:27:59,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2019-11-19 23:27:59,165 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 27 [2019-11-19 23:27:59,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:27:59,165 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2019-11-19 23:27:59,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-19 23:27:59,165 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2019-11-19 23:27:59,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-19 23:27:59,166 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:27:59,166 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:27:59,368 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:27:59,368 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:27:59,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:27:59,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1494406189, now seen corresponding path program 6 times [2019-11-19 23:27:59,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:27:59,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442003637] [2019-11-19 23:27:59,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:27:59,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:27:59,464 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-19 23:27:59,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442003637] [2019-11-19 23:27:59,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271119946] [2019-11-19 23:27:59,464 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:27:59,508 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-11-19 23:27:59,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:27:59,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 23:27:59,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:27:59,588 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-19 23:27:59,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:27:59,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-11-19 23:27:59,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190976586] [2019-11-19 23:27:59,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-19 23:27:59,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:27:59,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-19 23:27:59,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-11-19 23:27:59,590 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand 13 states. [2019-11-19 23:27:59,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:27:59,872 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2019-11-19 23:27:59,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 23:27:59,873 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2019-11-19 23:27:59,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:27:59,873 INFO L225 Difference]: With dead ends: 46 [2019-11-19 23:27:59,873 INFO L226 Difference]: Without dead ends: 36 [2019-11-19 23:27:59,874 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2019-11-19 23:27:59,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-19 23:27:59,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2019-11-19 23:27:59,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-19 23:27:59,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2019-11-19 23:27:59,880 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 27 [2019-11-19 23:27:59,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:27:59,880 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-11-19 23:27:59,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-19 23:27:59,881 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2019-11-19 23:27:59,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-19 23:27:59,882 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:27:59,882 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:28:00,082 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:28:00,083 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:28:00,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:28:00,083 INFO L82 PathProgramCache]: Analyzing trace with hash 669104364, now seen corresponding path program 7 times [2019-11-19 23:28:00,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:28:00,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055222798] [2019-11-19 23:28:00,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:28:00,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:28:01,044 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-11-19 23:28:01,348 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 51 [2019-11-19 23:28:01,517 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2019-11-19 23:28:02,431 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:28:02,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055222798] [2019-11-19 23:28:02,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895192307] [2019-11-19 23:28:02,432 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:28:02,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:28:02,483 WARN L253 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 56 conjunts are in the unsatisfiable core [2019-11-19 23:28:02,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:28:02,495 INFO L377 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 10 treesize of output 8 [2019-11-19 23:28:02,496 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:28:02,504 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:28:02,509 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-19 23:28:02,510 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:28:02,519 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:28:02,520 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:28:02,520 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2019-11-19 23:28:02,567 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-19 23:28:02,567 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:28:02,576 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:28:02,577 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:28:02,577 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-11-19 23:28:02,672 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:28:02,673 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 56 [2019-11-19 23:28:02,673 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:28:02,706 INFO L567 ElimStorePlain]: treesize reduction 24, result has 60.0 percent of original size [2019-11-19 23:28:02,707 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:28:02,707 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2019-11-19 23:28:02,852 INFO L343 Elim1Store]: treesize reduction 10, result has 87.7 percent of original size [2019-11-19 23:28:02,852 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 98 [2019-11-19 23:28:02,853 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:28:02,898 INFO L567 ElimStorePlain]: treesize reduction 54, result has 47.1 percent of original size [2019-11-19 23:28:02,898 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:28:02,898 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:48 [2019-11-19 23:28:03,306 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-11-19 23:28:03,307 INFO L343 Elim1Store]: treesize reduction 32, result has 83.0 percent of original size [2019-11-19 23:28:03,307 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 69 treesize of output 191 [2019-11-19 23:28:03,308 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:28:03,381 INFO L567 ElimStorePlain]: treesize reduction 91, result has 35.5 percent of original size [2019-11-19 23:28:03,381 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:28:03,381 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:82, output treesize:50 [2019-11-19 23:28:03,659 INFO L343 Elim1Store]: treesize reduction 100, result has 55.2 percent of original size [2019-11-19 23:28:03,660 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 74 treesize of output 158 [2019-11-19 23:28:03,661 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:28:03,701 INFO L567 ElimStorePlain]: treesize reduction 69, result has 43.4 percent of original size [2019-11-19 23:28:03,702 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:28:03,702 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:87, output treesize:53 [2019-11-19 23:28:03,927 INFO L343 Elim1Store]: treesize reduction 82, result has 17.2 percent of original size [2019-11-19 23:28:03,927 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 54 treesize of output 47 [2019-11-19 23:28:03,928 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:28:03,941 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:28:03,941 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:28:03,942 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:64, output treesize:43 [2019-11-19 23:28:04,108 INFO L343 Elim1Store]: treesize reduction 32, result has 56.2 percent of original size [2019-11-19 23:28:04,108 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 98 [2019-11-19 23:28:04,110 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:28:04,161 INFO L567 ElimStorePlain]: treesize reduction 66, result has 46.8 percent of original size [2019-11-19 23:28:04,161 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:28:04,162 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:71, output treesize:58 [2019-11-19 23:28:04,351 INFO L343 Elim1Store]: treesize reduction 32, result has 56.2 percent of original size [2019-11-19 23:28:04,351 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 98 [2019-11-19 23:28:04,352 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:28:04,390 INFO L567 ElimStorePlain]: treesize reduction 83, result has 42.0 percent of original size [2019-11-19 23:28:04,390 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:28:04,391 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:60 [2019-11-19 23:28:04,562 INFO L343 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2019-11-19 23:28:04,563 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 49 [2019-11-19 23:28:04,563 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:28:04,577 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:28:04,578 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 23:28:04,578 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:78, output treesize:60 [2019-11-19 23:28:04,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:04,737 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:28:04,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:28:04,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 52 [2019-11-19 23:28:04,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742891976] [2019-11-19 23:28:04,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-11-19 23:28:04,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:28:04,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-11-19 23:28:04,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=2389, Unknown=0, NotChecked=0, Total=2652 [2019-11-19 23:28:04,741 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 52 states. [2019-11-19 23:28:07,216 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 47 [2019-11-19 23:28:08,770 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-11-19 23:28:09,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:28:09,264 INFO L93 Difference]: Finished difference Result 90 states and 108 transitions. [2019-11-19 23:28:09,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-11-19 23:28:09,265 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 32 [2019-11-19 23:28:09,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:28:09,266 INFO L225 Difference]: With dead ends: 90 [2019-11-19 23:28:09,266 INFO L226 Difference]: Without dead ends: 68 [2019-11-19 23:28:09,269 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2242 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=802, Invalid=6680, Unknown=0, NotChecked=0, Total=7482 [2019-11-19 23:28:09,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-19 23:28:09,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 50. [2019-11-19 23:28:09,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-19 23:28:09,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2019-11-19 23:28:09,281 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 32 [2019-11-19 23:28:09,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:28:09,281 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2019-11-19 23:28:09,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-11-19 23:28:09,281 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2019-11-19 23:28:09,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-19 23:28:09,283 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:28:09,283 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:28:09,486 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:28:09,487 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:28:09,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:28:09,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1182567058, now seen corresponding path program 8 times [2019-11-19 23:28:09,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:28:09,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256178382] [2019-11-19 23:28:09,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:28:09,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:28:09,620 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-19 23:28:09,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256178382] [2019-11-19 23:28:09,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726735300] [2019-11-19 23:28:09,621 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:28:09,669 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 23:28:09,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:28:09,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 23:28:09,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:28:09,739 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-19 23:28:09,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:28:09,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2019-11-19 23:28:09,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557001545] [2019-11-19 23:28:09,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-19 23:28:09,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:28:09,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-19 23:28:09,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-11-19 23:28:09,741 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand 16 states. [2019-11-19 23:28:09,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:28:09,938 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2019-11-19 23:28:09,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-19 23:28:09,939 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2019-11-19 23:28:09,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:28:09,940 INFO L225 Difference]: With dead ends: 97 [2019-11-19 23:28:09,940 INFO L226 Difference]: Without dead ends: 60 [2019-11-19 23:28:09,940 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2019-11-19 23:28:09,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-19 23:28:09,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 46. [2019-11-19 23:28:09,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-19 23:28:09,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2019-11-19 23:28:09,949 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 34 [2019-11-19 23:28:09,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:28:09,949 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2019-11-19 23:28:09,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-19 23:28:09,950 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2019-11-19 23:28:09,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-19 23:28:09,951 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:28:09,951 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:28:10,154 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:28:10,155 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:28:10,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:28:10,155 INFO L82 PathProgramCache]: Analyzing trace with hash -596323510, now seen corresponding path program 9 times [2019-11-19 23:28:10,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:28:10,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275911275] [2019-11-19 23:28:10,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:28:10,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:28:10,254 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-19 23:28:10,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275911275] [2019-11-19 23:28:10,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916238342] [2019-11-19 23:28:10,254 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:28:10,336 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-19 23:28:10,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:28:10,338 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 23:28:10,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:28:10,408 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-19 23:28:10,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:28:10,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2019-11-19 23:28:10,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191587036] [2019-11-19 23:28:10,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-19 23:28:10,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:28:10,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-19 23:28:10,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2019-11-19 23:28:10,410 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 16 states. [2019-11-19 23:28:10,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:28:10,664 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2019-11-19 23:28:10,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-19 23:28:10,665 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2019-11-19 23:28:10,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:28:10,665 INFO L225 Difference]: With dead ends: 55 [2019-11-19 23:28:10,666 INFO L226 Difference]: Without dead ends: 43 [2019-11-19 23:28:10,666 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2019-11-19 23:28:10,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-19 23:28:10,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2019-11-19 23:28:10,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-19 23:28:10,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2019-11-19 23:28:10,673 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 34 [2019-11-19 23:28:10,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:28:10,673 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2019-11-19 23:28:10,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-19 23:28:10,673 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2019-11-19 23:28:10,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-19 23:28:10,675 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:28:10,675 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:28:10,875 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:28:10,876 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:28:10,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:28:10,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1984465037, now seen corresponding path program 10 times [2019-11-19 23:28:10,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:28:10,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551488166] [2019-11-19 23:28:10,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:28:10,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:28:11,887 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 36 [2019-11-19 23:28:12,230 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 46 [2019-11-19 23:28:12,384 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 49 [2019-11-19 23:28:12,790 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 52 [2019-11-19 23:28:13,025 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 54 [2019-11-19 23:28:13,194 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 43 [2019-11-19 23:28:13,485 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-11-19 23:28:13,784 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 58 [2019-11-19 23:28:15,160 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:28:15,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551488166] [2019-11-19 23:28:15,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581916619] [2019-11-19 23:28:15,160 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:28:15,233 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-19 23:28:15,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:28:15,235 WARN L253 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 69 conjunts are in the unsatisfiable core [2019-11-19 23:28:15,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:28:15,248 INFO L377 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 10 treesize of output 8 [2019-11-19 23:28:15,248 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:28:15,261 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:28:15,266 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-19 23:28:15,266 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:28:15,275 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:28:15,275 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:28:15,275 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2019-11-19 23:28:15,326 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-19 23:28:15,327 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:28:15,340 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:28:15,341 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:28:15,341 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-11-19 23:28:15,456 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:28:15,456 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 72 [2019-11-19 23:28:15,457 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:28:15,493 INFO L567 ElimStorePlain]: treesize reduction 36, result has 57.1 percent of original size [2019-11-19 23:28:15,494 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:28:15,494 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:52, output treesize:48 [2019-11-19 23:28:15,685 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:28:15,685 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 138 [2019-11-19 23:28:15,686 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:28:15,744 INFO L567 ElimStorePlain]: treesize reduction 72, result has 47.1 percent of original size [2019-11-19 23:28:15,744 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 23:28:15,744 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:68, output treesize:64 [2019-11-19 23:28:15,955 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:28:15,956 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 220 [2019-11-19 23:28:15,957 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:28:16,036 INFO L567 ElimStorePlain]: treesize reduction 108, result has 42.6 percent of original size [2019-11-19 23:28:16,037 INFO L496 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. [2019-11-19 23:28:16,037 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:84, output treesize:80 [2019-11-19 23:28:16,826 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 64 [2019-11-19 23:28:16,827 INFO L343 Elim1Store]: treesize reduction 96, result has 73.1 percent of original size [2019-11-19 23:28:16,827 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 88 treesize of output 299 [2019-11-19 23:28:16,828 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:28:16,976 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2019-11-19 23:28:16,977 INFO L567 ElimStorePlain]: treesize reduction 232, result has 38.3 percent of original size [2019-11-19 23:28:16,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:16,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:16,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:16,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:16,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:16,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:16,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:16,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:16,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:16,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:16,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:16,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:16,988 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-19 23:28:16,988 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:121, output treesize:144 [2019-11-19 23:28:16,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:16,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:16,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:16,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:16,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:16,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:16,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:16,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:16,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:16,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:16,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:16,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:17,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:17,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:17,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:17,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:17,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:17,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:17,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:17,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:17,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:17,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:17,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:17,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:17,734 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 52 [2019-11-19 23:28:17,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:17,893 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:28:17,924 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:28:18,098 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2019-11-19 23:28:18,099 INFO L343 Elim1Store]: treesize reduction 48, result has 83.7 percent of original size [2019-11-19 23:28:18,099 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 117 treesize of output 325 [2019-11-19 23:28:18,101 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:28:18,111 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:28:18,112 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 55 [2019-11-19 23:28:18,113 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:28:18,273 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 57 [2019-11-19 23:28:18,273 INFO L567 ElimStorePlain]: treesize reduction 117, result has 57.5 percent of original size [2019-11-19 23:28:18,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:18,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:18,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:18,277 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-19 23:28:18,277 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:187, output treesize:147 [2019-11-19 23:28:18,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:18,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:18,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:18,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:18,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:18,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:18,785 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-11-19 23:28:19,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:19,029 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:28:19,030 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:28:19,032 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:28:19,050 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:28:19,055 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 70 [2019-11-19 23:28:19,056 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:28:19,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:28:19,074 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:28:19,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:28:19,268 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-11-19 23:28:19,268 INFO L343 Elim1Store]: treesize reduction 16, result has 92.6 percent of original size [2019-11-19 23:28:19,269 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 113 treesize of output 284 [2019-11-19 23:28:19,271 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:28:19,532 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 51 [2019-11-19 23:28:19,533 INFO L567 ElimStorePlain]: treesize reduction 167, result has 48.0 percent of original size [2019-11-19 23:28:19,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:19,534 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-19 23:28:19,534 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:195, output treesize:143 [2019-11-19 23:28:19,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:19,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:20,099 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:28:20,101 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:28:20,102 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 23:28:20,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:28:20,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:28:20,107 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:28:20,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:28:20,109 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 61 [2019-11-19 23:28:20,110 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:28:20,130 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:28:20,131 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:28:20,131 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:92, output treesize:62 [2019-11-19 23:28:20,348 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:28:20,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:28:20,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:28:20,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:28:20,353 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:28:20,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:28:20,355 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:28:20,355 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 23:28:20,356 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:28:20,358 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 65 [2019-11-19 23:28:20,358 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:28:20,381 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:28:20,381 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:28:20,381 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:90, output treesize:69 [2019-11-19 23:28:20,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:28:20,571 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:28:20,573 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:28:20,574 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:28:20,574 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 23:28:20,575 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:28:20,576 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:28:20,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:28:20,579 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 68 [2019-11-19 23:28:20,579 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:28:20,604 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:28:20,604 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:28:20,605 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:95, output treesize:82 [2019-11-19 23:28:20,821 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:28:20,822 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:28:20,823 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:28:20,824 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:28:20,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:28:20,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:28:20,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:28:20,828 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:28:20,828 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 23:28:20,829 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 65 [2019-11-19 23:28:20,830 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:28:20,861 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:28:20,861 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:28:20,862 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:98, output treesize:67 [2019-11-19 23:28:21,078 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 23:28:21,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:28:21,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:28:21,082 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2019-11-19 23:28:21,082 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:28:21,099 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:28:21,100 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 23:28:21,100 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:74, output treesize:53 [2019-11-19 23:28:21,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:21,278 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:28:21,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:28:21,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 65 [2019-11-19 23:28:21,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637671886] [2019-11-19 23:28:21,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-11-19 23:28:21,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:28:21,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-11-19 23:28:21,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=3719, Unknown=0, NotChecked=0, Total=4160 [2019-11-19 23:28:21,281 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 65 states. [2019-11-19 23:28:23,800 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 58 [2019-11-19 23:28:24,093 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 60 [2019-11-19 23:28:24,515 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 64 [2019-11-19 23:28:24,836 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2019-11-19 23:28:25,326 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2019-11-19 23:28:25,904 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 62 [2019-11-19 23:28:26,509 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 54 [2019-11-19 23:28:27,708 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-11-19 23:28:28,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:28:28,317 INFO L93 Difference]: Finished difference Result 109 states and 130 transitions. [2019-11-19 23:28:28,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-11-19 23:28:28,318 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 39 [2019-11-19 23:28:28,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:28:28,319 INFO L225 Difference]: With dead ends: 109 [2019-11-19 23:28:28,319 INFO L226 Difference]: Without dead ends: 82 [2019-11-19 23:28:28,321 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3480 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=1073, Invalid=8827, Unknown=0, NotChecked=0, Total=9900 [2019-11-19 23:28:28,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-19 23:28:28,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 60. [2019-11-19 23:28:28,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-19 23:28:28,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2019-11-19 23:28:28,330 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 39 [2019-11-19 23:28:28,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:28:28,330 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2019-11-19 23:28:28,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-11-19 23:28:28,330 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2019-11-19 23:28:28,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-19 23:28:28,331 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:28:28,331 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:28:28,534 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:28:28,535 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:28:28,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:28:28,535 INFO L82 PathProgramCache]: Analyzing trace with hash -52187595, now seen corresponding path program 11 times [2019-11-19 23:28:28,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:28:28,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443451062] [2019-11-19 23:28:28,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:28:28,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:28:28,648 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-19 23:28:28,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443451062] [2019-11-19 23:28:28,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013577918] [2019-11-19 23:28:28,649 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:28:28,871 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-19 23:28:28,871 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:28:28,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 23:28:28,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:28:28,986 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 25 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-19 23:28:28,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:28:28,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2019-11-19 23:28:28,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673212934] [2019-11-19 23:28:28,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-19 23:28:28,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:28:28,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-19 23:28:28,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-11-19 23:28:28,987 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand 19 states. [2019-11-19 23:28:29,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:28:29,214 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2019-11-19 23:28:29,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-19 23:28:29,214 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 41 [2019-11-19 23:28:29,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:28:29,215 INFO L225 Difference]: With dead ends: 113 [2019-11-19 23:28:29,215 INFO L226 Difference]: Without dead ends: 69 [2019-11-19 23:28:29,216 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2019-11-19 23:28:29,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-19 23:28:29,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 55. [2019-11-19 23:28:29,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-19 23:28:29,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2019-11-19 23:28:29,225 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 41 [2019-11-19 23:28:29,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:28:29,225 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2019-11-19 23:28:29,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-19 23:28:29,225 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2019-11-19 23:28:29,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-19 23:28:29,226 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:28:29,226 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:28:29,426 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:28:29,427 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:28:29,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:28:29,427 INFO L82 PathProgramCache]: Analyzing trace with hash 486643541, now seen corresponding path program 12 times [2019-11-19 23:28:29,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:28:29,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791878751] [2019-11-19 23:28:29,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:28:29,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:28:29,527 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-19 23:28:29,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791878751] [2019-11-19 23:28:29,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340835479] [2019-11-19 23:28:29,527 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:28:29,624 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-11-19 23:28:29,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:28:29,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 23:28:29,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:28:29,695 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-19 23:28:29,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:28:29,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2019-11-19 23:28:29,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635187840] [2019-11-19 23:28:29,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-19 23:28:29,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:28:29,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-19 23:28:29,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-11-19 23:28:29,696 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 19 states. [2019-11-19 23:28:29,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:28:29,955 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2019-11-19 23:28:29,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-19 23:28:29,955 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 41 [2019-11-19 23:28:29,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:28:29,956 INFO L225 Difference]: With dead ends: 64 [2019-11-19 23:28:29,956 INFO L226 Difference]: Without dead ends: 50 [2019-11-19 23:28:29,956 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=198, Invalid=614, Unknown=0, NotChecked=0, Total=812 [2019-11-19 23:28:29,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-19 23:28:29,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2019-11-19 23:28:29,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-19 23:28:29,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2019-11-19 23:28:29,962 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 41 [2019-11-19 23:28:29,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:28:29,963 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2019-11-19 23:28:29,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-19 23:28:29,963 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2019-11-19 23:28:29,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-19 23:28:29,964 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:28:29,964 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:28:30,167 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:28:30,167 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:28:30,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:28:30,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1593279692, now seen corresponding path program 13 times [2019-11-19 23:28:30,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:28:30,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799018501] [2019-11-19 23:28:30,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:28:30,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:28:31,235 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 52 [2019-11-19 23:28:31,442 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 56 [2019-11-19 23:28:31,574 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 49 [2019-11-19 23:28:31,715 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 58 [2019-11-19 23:28:31,908 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 62 [2019-11-19 23:28:32,200 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-11-19 23:28:32,362 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2019-11-19 23:28:33,672 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:28:33,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799018501] [2019-11-19 23:28:33,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086842804] [2019-11-19 23:28:33,673 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:28:33,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:28:33,714 WARN L253 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 82 conjunts are in the unsatisfiable core [2019-11-19 23:28:33,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:28:33,723 INFO L377 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 10 treesize of output 8 [2019-11-19 23:28:33,723 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:28:33,730 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:28:33,732 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-19 23:28:33,733 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:28:33,738 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:28:33,738 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:28:33,738 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2019-11-19 23:28:33,778 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-19 23:28:33,778 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:28:33,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:28:33,786 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:28:33,786 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-11-19 23:28:33,870 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:28:33,870 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 56 [2019-11-19 23:28:33,871 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:28:33,902 INFO L567 ElimStorePlain]: treesize reduction 24, result has 60.0 percent of original size [2019-11-19 23:28:33,902 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:28:33,902 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2019-11-19 23:28:34,022 INFO L343 Elim1Store]: treesize reduction 52, result has 45.8 percent of original size [2019-11-19 23:28:34,022 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 71 [2019-11-19 23:28:34,023 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:28:34,048 INFO L567 ElimStorePlain]: treesize reduction 24, result has 66.7 percent of original size [2019-11-19 23:28:34,048 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:28:34,048 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:48 [2019-11-19 23:28:34,185 INFO L343 Elim1Store]: treesize reduction 122, result has 31.5 percent of original size [2019-11-19 23:28:34,186 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 86 [2019-11-19 23:28:34,186 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:28:34,215 INFO L567 ElimStorePlain]: treesize reduction 24, result has 71.4 percent of original size [2019-11-19 23:28:34,215 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:28:34,215 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:64, output treesize:60 [2019-11-19 23:28:34,374 INFO L343 Elim1Store]: treesize reduction 210, result has 24.5 percent of original size [2019-11-19 23:28:34,375 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 101 [2019-11-19 23:28:34,375 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:28:34,411 INFO L567 ElimStorePlain]: treesize reduction 24, result has 75.8 percent of original size [2019-11-19 23:28:34,412 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:28:34,412 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:79, output treesize:75 [2019-11-19 23:28:34,952 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 69 [2019-11-19 23:28:34,953 INFO L343 Elim1Store]: treesize reduction 112, result has 70.4 percent of original size [2019-11-19 23:28:34,953 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 20 case distinctions, treesize of input 87 treesize of output 307 [2019-11-19 23:28:34,955 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:28:35,006 INFO L567 ElimStorePlain]: treesize reduction 151, result has 31.1 percent of original size [2019-11-19 23:28:35,006 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:28:35,007 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:100, output treesize:68 [2019-11-19 23:28:35,383 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 69 [2019-11-19 23:28:35,384 INFO L343 Elim1Store]: treesize reduction 112, result has 70.4 percent of original size [2019-11-19 23:28:35,384 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 20 case distinctions, treesize of input 87 treesize of output 307 [2019-11-19 23:28:35,385 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:28:35,445 INFO L567 ElimStorePlain]: treesize reduction 311, result has 17.5 percent of original size [2019-11-19 23:28:35,445 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:28:35,445 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:100, output treesize:66 [2019-11-19 23:28:35,850 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 63 [2019-11-19 23:28:35,850 INFO L343 Elim1Store]: treesize reduction 182, result has 55.1 percent of original size [2019-11-19 23:28:35,851 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 20 case distinctions, treesize of input 90 treesize of output 264 [2019-11-19 23:28:35,852 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:28:35,907 INFO L567 ElimStorePlain]: treesize reduction 249, result has 21.7 percent of original size [2019-11-19 23:28:35,907 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:28:35,907 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:103, output treesize:69 [2019-11-19 23:28:36,339 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 56 [2019-11-19 23:28:36,340 INFO L343 Elim1Store]: treesize reduction 252, result has 41.7 percent of original size [2019-11-19 23:28:36,340 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 20 case distinctions, treesize of input 93 treesize of output 221 [2019-11-19 23:28:36,341 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:28:36,409 INFO L567 ElimStorePlain]: treesize reduction 187, result has 27.8 percent of original size [2019-11-19 23:28:36,410 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:28:36,410 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:106, output treesize:72 [2019-11-19 23:28:36,818 INFO L343 Elim1Store]: treesize reduction 218, result has 13.8 percent of original size [2019-11-19 23:28:36,818 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 72 treesize of output 71 [2019-11-19 23:28:36,819 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:28:36,837 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:28:36,837 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:28:36,838 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:82, output treesize:61 [2019-11-19 23:28:37,064 INFO L343 Elim1Store]: treesize reduction 112, result has 38.1 percent of original size [2019-11-19 23:28:37,064 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 76 treesize of output 150 [2019-11-19 23:28:37,065 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:28:37,103 INFO L567 ElimStorePlain]: treesize reduction 128, result has 37.3 percent of original size [2019-11-19 23:28:37,103 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:28:37,103 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:89, output treesize:76 [2019-11-19 23:28:37,343 INFO L343 Elim1Store]: treesize reduction 89, result has 56.8 percent of original size [2019-11-19 23:28:37,343 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 90 treesize of output 203 [2019-11-19 23:28:37,344 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:28:37,384 INFO L567 ElimStorePlain]: treesize reduction 107, result has 42.5 percent of original size [2019-11-19 23:28:37,385 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:28:37,385 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:103, output treesize:79 [2019-11-19 23:28:37,627 INFO L343 Elim1Store]: treesize reduction 112, result has 38.1 percent of original size [2019-11-19 23:28:37,627 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 84 treesize of output 152 [2019-11-19 23:28:37,628 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:28:37,684 INFO L567 ElimStorePlain]: treesize reduction 120, result has 38.1 percent of original size [2019-11-19 23:28:37,685 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:28:37,685 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:97, output treesize:74 [2019-11-19 23:28:37,991 INFO L343 Elim1Store]: treesize reduction 129, result has 52.4 percent of original size [2019-11-19 23:28:37,991 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 87 treesize of output 237 [2019-11-19 23:28:37,992 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:28:38,045 INFO L567 ElimStorePlain]: treesize reduction 297, result has 22.7 percent of original size [2019-11-19 23:28:38,045 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:28:38,046 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:100, output treesize:87 [2019-11-19 23:28:38,288 INFO L343 Elim1Store]: treesize reduction 112, result has 0.9 percent of original size [2019-11-19 23:28:38,288 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 89 treesize of output 74 [2019-11-19 23:28:38,289 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:28:38,313 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:28:38,314 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 23:28:38,314 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:99, output treesize:69 [2019-11-19 23:28:38,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:28:38,608 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:28:38,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:28:38,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 78 [2019-11-19 23:28:38,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276901197] [2019-11-19 23:28:38,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-11-19 23:28:38,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:28:38,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-11-19 23:28:38,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=485, Invalid=5521, Unknown=0, NotChecked=0, Total=6006 [2019-11-19 23:28:38,611 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand 78 states. [2019-11-19 23:28:41,000 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 56 [2019-11-19 23:28:42,508 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 67 [2019-11-19 23:28:43,038 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-11-19 23:28:44,758 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 67 [2019-11-19 23:28:45,238 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2019-11-19 23:28:45,439 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 63 [2019-11-19 23:28:47,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:28:47,151 INFO L93 Difference]: Finished difference Result 141 states and 173 transitions. [2019-11-19 23:28:47,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-11-19 23:28:47,152 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 46 [2019-11-19 23:28:47,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:28:47,152 INFO L225 Difference]: With dead ends: 141 [2019-11-19 23:28:47,152 INFO L226 Difference]: Without dead ends: 109 [2019-11-19 23:28:47,157 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6852 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=1935, Invalid=18087, Unknown=0, NotChecked=0, Total=20022 [2019-11-19 23:28:47,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-19 23:28:47,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 79. [2019-11-19 23:28:47,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-19 23:28:47,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 92 transitions. [2019-11-19 23:28:47,174 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 92 transitions. Word has length 46 [2019-11-19 23:28:47,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:28:47,175 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 92 transitions. [2019-11-19 23:28:47,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-11-19 23:28:47,175 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 92 transitions. [2019-11-19 23:28:47,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-19 23:28:47,176 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:28:47,176 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:28:47,387 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:28:47,388 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:28:47,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:28:47,388 INFO L82 PathProgramCache]: Analyzing trace with hash -2108307122, now seen corresponding path program 14 times [2019-11-19 23:28:47,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:28:47,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195277264] [2019-11-19 23:28:47,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:28:47,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:28:47,518 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 27 proven. 34 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-19 23:28:47,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195277264] [2019-11-19 23:28:47,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132700138] [2019-11-19 23:28:47,518 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:28:47,578 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 23:28:47,578 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:28:47,579 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-19 23:28:47,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:28:47,675 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 36 proven. 25 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-19 23:28:47,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:28:47,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2019-11-19 23:28:47,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726984981] [2019-11-19 23:28:47,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-19 23:28:47,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:28:47,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-19 23:28:47,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2019-11-19 23:28:47,677 INFO L87 Difference]: Start difference. First operand 79 states and 92 transitions. Second operand 22 states. [2019-11-19 23:28:47,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:28:47,907 INFO L93 Difference]: Finished difference Result 138 states and 156 transitions. [2019-11-19 23:28:47,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-19 23:28:47,908 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 48 [2019-11-19 23:28:47,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:28:47,908 INFO L225 Difference]: With dead ends: 138 [2019-11-19 23:28:47,908 INFO L226 Difference]: Without dead ends: 78 [2019-11-19 23:28:47,909 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-11-19 23:28:47,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-19 23:28:47,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 64. [2019-11-19 23:28:47,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-19 23:28:47,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2019-11-19 23:28:47,917 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 48 [2019-11-19 23:28:47,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:28:47,917 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2019-11-19 23:28:47,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-19 23:28:47,917 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2019-11-19 23:28:47,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-19 23:28:47,917 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:28:47,918 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:28:48,118 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:28:48,118 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:28:48,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:28:48,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1571168938, now seen corresponding path program 15 times [2019-11-19 23:28:48,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:28:48,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204777437] [2019-11-19 23:28:48,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:28:48,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:28:48,289 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 16 proven. 55 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-19 23:28:48,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204777437] [2019-11-19 23:28:48,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963321274] [2019-11-19 23:28:48,290 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:28:48,443 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-11-19 23:28:48,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:28:48,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-19 23:28:48,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:28:48,522 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 25 proven. 46 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-19 23:28:48,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:28:48,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2019-11-19 23:28:48,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073135473] [2019-11-19 23:28:48,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-19 23:28:48,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:28:48,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-19 23:28:48,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-11-19 23:28:48,523 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand 22 states. [2019-11-19 23:28:48,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:28:48,852 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2019-11-19 23:28:48,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-19 23:28:48,852 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 48 [2019-11-19 23:28:48,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:28:48,853 INFO L225 Difference]: With dead ends: 73 [2019-11-19 23:28:48,853 INFO L226 Difference]: Without dead ends: 57 [2019-11-19 23:28:48,853 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=265, Invalid=857, Unknown=0, NotChecked=0, Total=1122 [2019-11-19 23:28:48,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-19 23:28:48,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2019-11-19 23:28:48,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-19 23:28:48,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2019-11-19 23:28:48,858 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 48 [2019-11-19 23:28:48,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:28:48,858 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2019-11-19 23:28:48,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-19 23:28:48,858 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2019-11-19 23:28:48,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-19 23:28:48,859 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:28:48,859 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:28:49,059 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:28:49,059 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:28:49,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:28:49,060 INFO L82 PathProgramCache]: Analyzing trace with hash 99891227, now seen corresponding path program 16 times [2019-11-19 23:28:49,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:28:49,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199282099] [2019-11-19 23:28:49,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:28:49,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:28:50,093 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 48 [2019-11-19 23:28:50,348 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 50 [2019-11-19 23:28:50,519 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 53 [2019-11-19 23:28:50,818 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 52 [2019-11-19 23:28:51,004 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 55 [2019-11-19 23:28:51,361 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 56 [2019-11-19 23:28:51,594 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 59 [2019-11-19 23:28:51,773 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 47 [2019-11-19 23:28:51,944 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 60 [2019-11-19 23:28:52,143 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 63 [2019-11-19 23:28:53,943 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:28:53,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199282099] [2019-11-19 23:28:53,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534762970] [2019-11-19 23:28:53,944 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:28:54,023 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-19 23:28:54,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:28:54,025 WARN L253 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 93 conjunts are in the unsatisfiable core [2019-11-19 23:28:54,027 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:28:54,035 INFO L377 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 10 treesize of output 8 [2019-11-19 23:28:54,035 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:28:54,043 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:28:54,046 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-19 23:28:54,046 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:28:54,053 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:28:54,054 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:28:54,054 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2019-11-19 23:28:54,097 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-19 23:28:54,097 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:28:54,105 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:28:54,106 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:28:54,106 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-11-19 23:28:54,216 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:28:54,217 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 72 [2019-11-19 23:28:54,217 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:28:54,276 INFO L567 ElimStorePlain]: treesize reduction 36, result has 57.1 percent of original size [2019-11-19 23:28:54,277 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:28:54,277 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:52, output treesize:48 [2019-11-19 23:28:54,452 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:28:54,452 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 138 [2019-11-19 23:28:54,453 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:28:54,498 INFO L567 ElimStorePlain]: treesize reduction 72, result has 47.1 percent of original size [2019-11-19 23:28:54,499 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 23:28:54,499 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:68, output treesize:64 [2019-11-19 23:28:54,688 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:28:54,688 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 220 [2019-11-19 23:28:54,689 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:28:54,752 INFO L567 ElimStorePlain]: treesize reduction 108, result has 42.6 percent of original size [2019-11-19 23:28:54,752 INFO L496 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. [2019-11-19 23:28:54,753 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:84, output treesize:80 [2019-11-19 23:28:54,996 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:28:54,997 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 67 treesize of output 318 [2019-11-19 23:28:54,997 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:28:55,096 INFO L567 ElimStorePlain]: treesize reduction 144, result has 40.0 percent of original size [2019-11-19 23:28:55,096 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-19 23:28:55,096 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:100, output treesize:96 [2019-11-19 23:28:55,438 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2019-11-19 23:28:55,438 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:28:55,439 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 78 treesize of output 432 [2019-11-19 23:28:55,440 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:28:55,542 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2019-11-19 23:28:55,542 INFO L567 ElimStorePlain]: treesize reduction 180, result has 38.4 percent of original size [2019-11-19 23:28:55,543 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-19 23:28:55,543 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:116, output treesize:112 [2019-11-19 23:29:00,124 WARN L191 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 90 [2019-11-19 23:29:00,124 INFO L343 Elim1Store]: treesize reduction 240, result has 62.0 percent of original size [2019-11-19 23:29:00,125 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 27 case distinctions, treesize of input 110 treesize of output 435 [2019-11-19 23:29:00,126 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:29:00,286 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 79 [2019-11-19 23:29:00,286 INFO L567 ElimStorePlain]: treesize reduction 348, result has 36.5 percent of original size [2019-11-19 23:29:00,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,315 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-11-19 23:29:00,316 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:153, output treesize:200 [2019-11-19 23:29:00,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:00,593 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-19 23:29:08,994 WARN L191 SmtUtils]: Spent 7.87 s on a formula simplification. DAG size of input: 182 DAG size of output: 63 [2019-11-19 23:29:09,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:09,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:09,864 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:09,869 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 50 [2019-11-19 23:29:09,869 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:29:09,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:10,249 WARN L191 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 98 [2019-11-19 23:29:10,250 INFO L343 Elim1Store]: treesize reduction 160, result has 70.7 percent of original size [2019-11-19 23:29:10,250 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 2 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 25 case distinctions, treesize of input 144 treesize of output 475 [2019-11-19 23:29:10,252 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:29:10,463 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 73 [2019-11-19 23:29:10,464 INFO L567 ElimStorePlain]: treesize reduction 385, result has 34.6 percent of original size [2019-11-19 23:29:10,469 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 32 dim-0 vars, and 2 xjuncts. [2019-11-19 23:29:10,469 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:209, output treesize:713 [2019-11-19 23:29:10,864 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 325 DAG size of output: 46 [2019-11-19 23:29:11,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:11,137 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:11,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:11,143 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:11,163 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:11,267 INFO L343 Elim1Store]: treesize reduction 16, result has 92.0 percent of original size [2019-11-19 23:29:11,268 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 105 treesize of output 260 [2019-11-19 23:29:11,269 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:29:11,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:11,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:11,278 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:11,279 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 62 [2019-11-19 23:29:11,280 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:29:11,407 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-11-19 23:29:11,408 INFO L567 ElimStorePlain]: treesize reduction 92, result has 62.4 percent of original size [2019-11-19 23:29:11,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:11,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:11,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:11,410 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-19 23:29:11,410 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:179, output treesize:153 [2019-11-19 23:29:11,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:11,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:11,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:11,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:11,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:11,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:11,783 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-11-19 23:29:11,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:11,952 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:11,956 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:11,957 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:11,959 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:11,960 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:11,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:11,987 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:11,989 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 77 [2019-11-19 23:29:11,990 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:29:11,994 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:11,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:11,997 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:11,999 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:12,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:12,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:12,145 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-11-19 23:29:12,145 INFO L343 Elim1Store]: treesize reduction 16, result has 93.1 percent of original size [2019-11-19 23:29:12,146 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 7 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 117 treesize of output 309 [2019-11-19 23:29:12,147 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:29:12,293 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 56 [2019-11-19 23:29:12,294 INFO L567 ElimStorePlain]: treesize reduction 188, result has 48.5 percent of original size [2019-11-19 23:29:12,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:12,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:12,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:12,295 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-19 23:29:12,295 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:203, output treesize:177 [2019-11-19 23:29:12,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:12,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:12,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:12,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:12,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:12,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:12,718 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-11-19 23:29:12,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:12,897 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:12,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:12,899 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:12,900 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:12,901 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:12,903 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:12,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:12,905 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:12,906 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:12,907 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:12,929 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:12,938 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 92 [2019-11-19 23:29:12,938 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:29:12,943 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:12,944 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:12,945 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:12,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:12,949 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:12,949 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:12,951 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:12,953 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:12,954 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:12,957 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:13,103 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2019-11-19 23:29:13,103 INFO L343 Elim1Store]: treesize reduction 16, result has 94.0 percent of original size [2019-11-19 23:29:13,104 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 11 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 13 case distinctions, treesize of input 129 treesize of output 358 [2019-11-19 23:29:13,105 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:29:13,262 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 57 [2019-11-19 23:29:13,263 INFO L567 ElimStorePlain]: treesize reduction 154, result has 55.4 percent of original size [2019-11-19 23:29:13,264 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-19 23:29:13,264 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:227, output treesize:205 [2019-11-19 23:29:13,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:13,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:13,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:13,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:13,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:13,713 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:13,714 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:13,715 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:13,715 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:13,716 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:13,717 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:13,718 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:13,719 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:13,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:13,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:13,721 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 83 [2019-11-19 23:29:13,722 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:29:13,743 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:29:13,743 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:29:13,743 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:94, output treesize:73 [2019-11-19 23:29:13,932 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:13,933 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:13,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:13,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:13,935 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:13,936 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:13,937 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 23:29:13,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:13,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:13,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:13,940 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:13,956 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:13,960 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:13,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:13,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:13,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:13,963 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:13,964 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 16 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 87 [2019-11-19 23:29:13,964 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:29:13,988 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:29:13,988 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:29:13,988 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:101, output treesize:80 [2019-11-19 23:29:14,212 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 23:29:14,213 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:14,215 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:14,216 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:14,218 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:14,219 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:14,220 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:14,222 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:14,223 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:14,225 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:14,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:14,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:14,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:14,230 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:14,231 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:14,233 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:14,234 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 16 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 90 [2019-11-19 23:29:14,235 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:29:14,276 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:29:14,276 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:29:14,277 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:106, output treesize:83 [2019-11-19 23:29:14,642 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:14,643 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:14,644 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:14,645 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:14,646 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:14,647 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:14,652 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:14,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:14,654 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:14,655 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:14,656 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 23:29:14,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:14,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:14,659 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:14,659 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:14,660 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:14,661 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:14,663 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 16 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 93 [2019-11-19 23:29:14,663 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:29:14,704 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:29:14,704 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:29:14,704 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:109, output treesize:96 [2019-11-19 23:29:15,056 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:15,057 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:15,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:15,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:15,061 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:15,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:15,063 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:15,064 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 23:29:15,065 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:15,066 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:15,068 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:15,069 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:15,070 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:15,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:15,072 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:15,074 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:15,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:15,076 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 16 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 87 [2019-11-19 23:29:15,077 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:29:15,102 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:29:15,102 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:29:15,103 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:109, output treesize:88 [2019-11-19 23:29:15,339 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:15,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:15,341 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:15,342 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:15,343 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:15,343 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:15,344 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:15,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:15,346 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:15,346 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:15,347 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:15,348 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 23:29:15,348 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:15,349 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:15,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:15,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:15,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:15,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:29:15,353 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 16 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 90 [2019-11-19 23:29:15,354 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:29:15,378 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:29:15,378 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:29:15,378 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:115, output treesize:91 [2019-11-19 23:29:15,625 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 75 [2019-11-19 23:29:15,625 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:29:15,642 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:29:15,642 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:29:15,643 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:87, output treesize:60 [2019-11-19 23:29:15,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:29:15,864 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:29:15,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:29:15,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 47] total 91 [2019-11-19 23:29:15,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752316530] [2019-11-19 23:29:15,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-11-19 23:29:15,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:29:15,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-11-19 23:29:15,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=874, Invalid=7316, Unknown=0, NotChecked=0, Total=8190 [2019-11-19 23:29:15,866 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand 91 states. [2019-11-19 23:29:22,144 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2019-11-19 23:29:29,464 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2019-11-19 23:29:38,461 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 73 [2019-11-19 23:29:43,415 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 75 [2019-11-19 23:30:01,859 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 76 [2019-11-19 23:30:02,236 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 78 [2019-11-19 23:30:02,949 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 61 [2019-11-19 23:30:04,273 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2019-11-19 23:30:05,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:30:05,447 INFO L93 Difference]: Finished difference Result 159 states and 189 transitions. [2019-11-19 23:30:05,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-11-19 23:30:05,447 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 53 [2019-11-19 23:30:05,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:30:05,448 INFO L225 Difference]: With dead ends: 159 [2019-11-19 23:30:05,448 INFO L226 Difference]: Without dead ends: 122 [2019-11-19 23:30:05,450 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7305 ImplicationChecksByTransitivity, 49.7s TimeCoverageRelationStatistics Valid=1928, Invalid=17252, Unknown=2, NotChecked=0, Total=19182 [2019-11-19 23:30:05,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-19 23:30:05,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 80. [2019-11-19 23:30:05,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-19 23:30:05,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 94 transitions. [2019-11-19 23:30:05,460 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 94 transitions. Word has length 53 [2019-11-19 23:30:05,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:30:05,460 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 94 transitions. [2019-11-19 23:30:05,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-11-19 23:30:05,460 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 94 transitions. [2019-11-19 23:30:05,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-19 23:30:05,461 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:30:05,461 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:30:05,661 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:30:05,661 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:30:05,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:30:05,662 INFO L82 PathProgramCache]: Analyzing trace with hash -717757223, now seen corresponding path program 1 times [2019-11-19 23:30:05,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:30:05,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111987592] [2019-11-19 23:30:05,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:30:05,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:30:06,226 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 20 proven. 67 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-19 23:30:06,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111987592] [2019-11-19 23:30:06,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424356021] [2019-11-19 23:30:06,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:30:06,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:30:06,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-19 23:30:06,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:30:06,374 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-19 23:30:06,374 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:30:06,375 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:30:06,375 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:30:06,376 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-19 23:30:06,422 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:30:06,422 INFO L377 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 2 case distinctions, treesize of input 35 treesize of output 72 [2019-11-19 23:30:06,422 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:30:06,434 INFO L567 ElimStorePlain]: treesize reduction 62, result has 17.3 percent of original size [2019-11-19 23:30:06,434 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:30:06,434 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:13 [2019-11-19 23:30:06,471 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:30:06,471 INFO L377 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 2 case distinctions, treesize of input 35 treesize of output 72 [2019-11-19 23:30:06,471 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:30:06,482 INFO L567 ElimStorePlain]: treesize reduction 62, result has 17.3 percent of original size [2019-11-19 23:30:06,482 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:30:06,482 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:13 [2019-11-19 23:30:06,517 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:30:06,518 INFO L377 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 2 case distinctions, treesize of input 35 treesize of output 72 [2019-11-19 23:30:06,518 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:30:06,529 INFO L567 ElimStorePlain]: treesize reduction 62, result has 17.3 percent of original size [2019-11-19 23:30:06,529 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:30:06,529 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:13 [2019-11-19 23:30:06,568 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:30:06,568 INFO L377 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 2 case distinctions, treesize of input 35 treesize of output 72 [2019-11-19 23:30:06,569 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:30:06,580 INFO L567 ElimStorePlain]: treesize reduction 62, result has 17.3 percent of original size [2019-11-19 23:30:06,580 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:30:06,581 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:13 [2019-11-19 23:30:06,619 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:30:06,619 INFO L377 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 2 case distinctions, treesize of input 35 treesize of output 72 [2019-11-19 23:30:06,620 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:30:06,632 INFO L567 ElimStorePlain]: treesize reduction 62, result has 17.3 percent of original size [2019-11-19 23:30:06,633 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:30:06,633 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:13 [2019-11-19 23:30:06,665 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-11-19 23:30:06,665 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:30:06,666 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:30:06,666 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:30:06,666 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-11-19 23:30:06,689 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 11 proven. 76 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-19 23:30:06,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:30:06,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 32 [2019-11-19 23:30:06,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511665717] [2019-11-19 23:30:06,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-19 23:30:06,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:30:06,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-19 23:30:06,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=834, Unknown=0, NotChecked=0, Total=992 [2019-11-19 23:30:06,691 INFO L87 Difference]: Start difference. First operand 80 states and 94 transitions. Second operand 32 states. [2019-11-19 23:30:07,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:30:07,505 INFO L93 Difference]: Finished difference Result 117 states and 134 transitions. [2019-11-19 23:30:07,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-19 23:30:07,505 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 53 [2019-11-19 23:30:07,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:30:07,506 INFO L225 Difference]: With dead ends: 117 [2019-11-19 23:30:07,506 INFO L226 Difference]: Without dead ends: 96 [2019-11-19 23:30:07,506 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=396, Invalid=2360, Unknown=0, NotChecked=0, Total=2756 [2019-11-19 23:30:07,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-19 23:30:07,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 83. [2019-11-19 23:30:07,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-19 23:30:07,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 96 transitions. [2019-11-19 23:30:07,516 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 96 transitions. Word has length 53 [2019-11-19 23:30:07,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:30:07,517 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 96 transitions. [2019-11-19 23:30:07,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-19 23:30:07,517 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 96 transitions. [2019-11-19 23:30:07,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-19 23:30:07,517 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:30:07,517 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:30:07,718 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:30:07,718 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:30:07,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:30:07,719 INFO L82 PathProgramCache]: Analyzing trace with hash 161930841, now seen corresponding path program 2 times [2019-11-19 23:30:07,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:30:07,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27628471] [2019-11-19 23:30:07,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:30:07,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:30:08,163 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 15 proven. 72 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-19 23:30:08,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27628471] [2019-11-19 23:30:08,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611395344] [2019-11-19 23:30:08,164 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:30:08,205 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 23:30:08,205 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:30:08,206 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 37 conjunts are in the unsatisfiable core [2019-11-19 23:30:08,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:30:08,272 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2019-11-19 23:30:08,272 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:30:08,277 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:30:08,277 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:30:08,277 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-11-19 23:30:08,324 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:08,324 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-11-19 23:30:08,324 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:30:08,333 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:30:08,333 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:30:08,333 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-11-19 23:30:08,388 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:08,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:08,390 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:08,391 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:30:08,391 INFO L377 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 1 case distinctions, treesize of input 32 treesize of output 34 [2019-11-19 23:30:08,391 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:30:08,398 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:30:08,398 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:30:08,399 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-11-19 23:30:08,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:08,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:08,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:08,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:08,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:08,489 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:08,490 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:30:08,491 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 50 [2019-11-19 23:30:08,491 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:30:08,501 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:30:08,502 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:30:08,502 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:34 [2019-11-19 23:30:08,547 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:08,552 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:08,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:08,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:08,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:08,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:08,558 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:30:08,559 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 50 [2019-11-19 23:30:08,559 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:30:08,570 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:30:08,570 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:30:08,571 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:34 [2019-11-19 23:30:08,630 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:08,631 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:08,632 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:08,633 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:08,634 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:08,635 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:08,636 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:30:08,636 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 50 [2019-11-19 23:30:08,636 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:30:08,647 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:30:08,648 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:30:08,648 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:34 [2019-11-19 23:30:08,707 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 23:30:08,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:08,710 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:30:08,710 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 16 [2019-11-19 23:30:08,710 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:30:08,719 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:30:08,719 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:30:08,719 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:7 [2019-11-19 23:30:08,767 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 29 proven. 51 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-11-19 23:30:08,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:30:08,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 33 [2019-11-19 23:30:08,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152343603] [2019-11-19 23:30:08,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-19 23:30:08,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:30:08,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-19 23:30:08,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=897, Unknown=0, NotChecked=0, Total=1056 [2019-11-19 23:30:08,768 INFO L87 Difference]: Start difference. First operand 83 states and 96 transitions. Second operand 33 states. [2019-11-19 23:30:09,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:30:09,562 INFO L93 Difference]: Finished difference Result 116 states and 132 transitions. [2019-11-19 23:30:09,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-19 23:30:09,562 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 53 [2019-11-19 23:30:09,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:30:09,563 INFO L225 Difference]: With dead ends: 116 [2019-11-19 23:30:09,563 INFO L226 Difference]: Without dead ends: 89 [2019-11-19 23:30:09,563 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=404, Invalid=2352, Unknown=0, NotChecked=0, Total=2756 [2019-11-19 23:30:09,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-19 23:30:09,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2019-11-19 23:30:09,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-19 23:30:09,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2019-11-19 23:30:09,571 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 94 transitions. Word has length 53 [2019-11-19 23:30:09,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:30:09,571 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 94 transitions. [2019-11-19 23:30:09,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-19 23:30:09,571 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2019-11-19 23:30:09,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-19 23:30:09,572 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:30:09,572 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:30:09,772 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:30:09,773 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:30:09,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:30:09,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1486094621, now seen corresponding path program 3 times [2019-11-19 23:30:09,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:30:09,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711881390] [2019-11-19 23:30:09,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:30:09,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:30:10,352 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 4 proven. 83 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-19 23:30:10,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711881390] [2019-11-19 23:30:10,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675147843] [2019-11-19 23:30:10,353 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:30:10,473 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-11-19 23:30:10,473 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:30:10,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 47 conjunts are in the unsatisfiable core [2019-11-19 23:30:10,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:30:10,486 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2019-11-19 23:30:10,486 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:30:10,492 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:30:10,492 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:30:10,493 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2019-11-19 23:30:10,534 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:30:10,534 INFO L377 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 1 case distinctions, treesize of input 27 treesize of output 62 [2019-11-19 23:30:10,535 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:30:10,554 INFO L567 ElimStorePlain]: treesize reduction 36, result has 50.0 percent of original size [2019-11-19 23:30:10,555 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:30:10,555 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:36 [2019-11-19 23:30:10,629 INFO L343 Elim1Store]: treesize reduction 56, result has 51.7 percent of original size [2019-11-19 23:30:10,629 INFO L377 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 39 treesize of output 77 [2019-11-19 23:30:10,630 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:30:10,653 INFO L567 ElimStorePlain]: treesize reduction 36, result has 57.1 percent of original size [2019-11-19 23:30:10,653 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:30:10,653 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:52, output treesize:48 [2019-11-19 23:30:10,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:10,732 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:10,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:10,753 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:30:10,753 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 126 [2019-11-19 23:30:10,753 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:30:10,786 INFO L567 ElimStorePlain]: treesize reduction 62, result has 50.4 percent of original size [2019-11-19 23:30:10,786 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:30:10,786 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:67, output treesize:63 [2019-11-19 23:30:11,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:11,142 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:11,143 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:11,144 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:11,206 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:30:11,207 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 72 treesize of output 292 [2019-11-19 23:30:11,207 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:30:11,305 INFO L567 ElimStorePlain]: treesize reduction 100, result has 65.4 percent of original size [2019-11-19 23:30:11,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:11,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:11,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:11,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:11,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:11,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:11,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:11,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:11,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:11,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:11,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:11,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:11,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:11,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:11,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:11,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:11,328 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 23:30:11,328 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:96, output treesize:189 [2019-11-19 23:30:11,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:11,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:11,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:11,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:11,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:11,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:11,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:11,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:11,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:11,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:11,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:11,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:11,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:11,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:11,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:11,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:11,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:11,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:11,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:11,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:11,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:11,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:11,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:11,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:11,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:11,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:11,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:11,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:11,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:11,402 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-19 23:30:11,663 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 84 [2019-11-19 23:30:11,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 23:30:11,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:11,755 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:11,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:11,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:11,769 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 63 [2019-11-19 23:30:11,770 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:30:11,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:11,786 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:11,787 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:11,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:11,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:11,793 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:11,809 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:11,816 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 85 [2019-11-19 23:30:11,817 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:30:11,824 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:11,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:11,830 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:11,831 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:11,833 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:11,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:11,836 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:11,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:11,880 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:30:11,881 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 124 treesize of output 216 [2019-11-19 23:30:11,881 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 23:30:11,887 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:11,888 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:11,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:11,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:11,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:11,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:11,892 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:11,893 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:11,894 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:11,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:11,895 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 97 [2019-11-19 23:30:11,896 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-19 23:30:12,094 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 105 [2019-11-19 23:30:12,094 INFO L567 ElimStorePlain]: treesize reduction 84, result has 80.0 percent of original size [2019-11-19 23:30:12,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:12,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:12,096 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2019-11-19 23:30:12,096 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:395, output treesize:335 [2019-11-19 23:30:12,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:12,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:12,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:12,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:12,574 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 117 [2019-11-19 23:30:12,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-19 23:30:12,584 INFO L392 ElimStorePlain]: Different costs {6=[v_prenex_36], 12=[v_prenex_40], 20=[v_prenex_42, v_prenex_38, |#memory_int|]} [2019-11-19 23:30:12,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:12,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:12,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:12,600 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:30:12,600 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 24 [2019-11-19 23:30:12,600 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:30:12,781 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2019-11-19 23:30:12,782 INFO L567 ElimStorePlain]: treesize reduction 8, result has 97.6 percent of original size [2019-11-19 23:30:12,788 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:12,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:12,790 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 23:30:12,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:12,792 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:30:12,793 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 37 [2019-11-19 23:30:12,793 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:30:12,879 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:30:12,885 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:12,887 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 23:30:12,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:12,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:12,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:12,916 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:30:12,917 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 99 treesize of output 120 [2019-11-19 23:30:12,917 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 23:30:13,064 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 96 [2019-11-19 23:30:13,065 INFO L567 ElimStorePlain]: treesize reduction 52, result has 82.1 percent of original size [2019-11-19 23:30:13,070 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:13,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:13,072 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:13,073 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 23:30:13,074 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:13,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:13,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:13,077 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:30:13,078 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 73 treesize of output 40 [2019-11-19 23:30:13,078 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-19 23:30:13,137 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:30:13,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:13,142 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:13,143 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:13,144 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:13,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:13,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:13,146 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:13,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:13,148 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:30:13,148 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 23:30:13,150 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:30:13,150 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 71 treesize of output 38 [2019-11-19 23:30:13,150 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-19 23:30:13,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:30:13,203 INFO L496 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 5 dim-2 vars, End of recursive call: and 5 xjuncts. [2019-11-19 23:30:13,204 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 15 variables, input treesize:366, output treesize:117 [2019-11-19 23:30:13,273 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 39 proven. 33 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-19 23:30:13,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:30:13,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 33 [2019-11-19 23:30:13,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384373862] [2019-11-19 23:30:13,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-19 23:30:13,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:30:13,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-19 23:30:13,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=917, Unknown=0, NotChecked=0, Total=1056 [2019-11-19 23:30:13,275 INFO L87 Difference]: Start difference. First operand 83 states and 94 transitions. Second operand 33 states. [2019-11-19 23:30:15,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:30:15,087 INFO L93 Difference]: Finished difference Result 114 states and 128 transitions. [2019-11-19 23:30:15,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-19 23:30:15,088 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 53 [2019-11-19 23:30:15,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:30:15,089 INFO L225 Difference]: With dead ends: 114 [2019-11-19 23:30:15,089 INFO L226 Difference]: Without dead ends: 84 [2019-11-19 23:30:15,089 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 37 SyntacticMatches, 8 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=345, Invalid=2105, Unknown=0, NotChecked=0, Total=2450 [2019-11-19 23:30:15,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-19 23:30:15,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2019-11-19 23:30:15,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-19 23:30:15,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2019-11-19 23:30:15,102 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 53 [2019-11-19 23:30:15,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:30:15,102 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2019-11-19 23:30:15,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-19 23:30:15,102 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2019-11-19 23:30:15,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-19 23:30:15,103 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:30:15,103 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:30:15,303 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:30:15,303 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:30:15,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:30:15,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1559422173, now seen corresponding path program 17 times [2019-11-19 23:30:15,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:30:15,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436966948] [2019-11-19 23:30:15,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:30:15,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:30:15,490 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 38 proven. 47 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-19 23:30:15,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436966948] [2019-11-19 23:30:15,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866583272] [2019-11-19 23:30:15,491 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:30:16,025 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-11-19 23:30:16,025 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:30:16,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-19 23:30:16,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:30:16,160 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 49 proven. 51 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-19 23:30:16,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:30:16,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2019-11-19 23:30:16,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411086951] [2019-11-19 23:30:16,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-19 23:30:16,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:30:16,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-19 23:30:16,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=451, Unknown=0, NotChecked=0, Total=600 [2019-11-19 23:30:16,161 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand 25 states. [2019-11-19 23:30:16,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:30:16,435 INFO L93 Difference]: Finished difference Result 145 states and 158 transitions. [2019-11-19 23:30:16,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-19 23:30:16,435 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 55 [2019-11-19 23:30:16,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:30:16,436 INFO L225 Difference]: With dead ends: 145 [2019-11-19 23:30:16,436 INFO L226 Difference]: Without dead ends: 87 [2019-11-19 23:30:16,437 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=247, Invalid=745, Unknown=0, NotChecked=0, Total=992 [2019-11-19 23:30:16,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-19 23:30:16,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 73. [2019-11-19 23:30:16,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-19 23:30:16,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2019-11-19 23:30:16,446 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 55 [2019-11-19 23:30:16,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:30:16,446 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2019-11-19 23:30:16,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-19 23:30:16,446 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2019-11-19 23:30:16,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-19 23:30:16,447 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:30:16,447 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:30:16,649 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:30:16,649 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:30:16,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:30:16,650 INFO L82 PathProgramCache]: Analyzing trace with hash -179313539, now seen corresponding path program 18 times [2019-11-19 23:30:16,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:30:16,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247349427] [2019-11-19 23:30:16,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:30:16,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:30:16,812 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 25 proven. 75 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-19 23:30:16,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247349427] [2019-11-19 23:30:16,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115292717] [2019-11-19 23:30:16,812 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:30:17,099 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-11-19 23:30:17,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:30:17,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-19 23:30:17,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:30:17,233 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 36 proven. 49 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-19 23:30:17,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:30:17,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2019-11-19 23:30:17,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079647403] [2019-11-19 23:30:17,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-19 23:30:17,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:30:17,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-19 23:30:17,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2019-11-19 23:30:17,235 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand 25 states. [2019-11-19 23:30:17,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:30:17,809 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2019-11-19 23:30:17,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-19 23:30:17,810 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 55 [2019-11-19 23:30:17,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:30:17,811 INFO L225 Difference]: With dead ends: 82 [2019-11-19 23:30:17,811 INFO L226 Difference]: Without dead ends: 64 [2019-11-19 23:30:17,811 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=342, Invalid=1140, Unknown=0, NotChecked=0, Total=1482 [2019-11-19 23:30:17,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-19 23:30:17,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2019-11-19 23:30:17,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-19 23:30:17,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2019-11-19 23:30:17,821 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 55 [2019-11-19 23:30:17,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:30:17,821 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2019-11-19 23:30:17,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-19 23:30:17,821 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2019-11-19 23:30:17,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-19 23:30:17,822 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:30:17,822 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:30:18,027 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:30:18,027 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:30:18,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:30:18,028 INFO L82 PathProgramCache]: Analyzing trace with hash 703185580, now seen corresponding path program 19 times [2019-11-19 23:30:18,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:30:18,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281177080] [2019-11-19 23:30:18,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:30:18,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:30:19,703 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 55 [2019-11-19 23:30:19,981 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 56 [2019-11-19 23:30:20,169 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 60 [2019-11-19 23:30:20,502 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 60 [2019-11-19 23:30:20,716 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 64 [2019-11-19 23:30:20,881 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 51 [2019-11-19 23:30:21,095 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 63 [2019-11-19 23:30:21,333 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 67 [2019-11-19 23:30:21,527 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 53 [2019-11-19 23:30:21,729 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-11-19 23:30:21,958 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2019-11-19 23:30:22,137 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-11-19 23:30:23,310 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 42 [2019-11-19 23:30:24,333 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:30:24,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281177080] [2019-11-19 23:30:24,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726705777] [2019-11-19 23:30:24,333 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:30:24,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:30:24,380 WARN L253 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 108 conjunts are in the unsatisfiable core [2019-11-19 23:30:24,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:30:24,388 INFO L377 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 10 treesize of output 8 [2019-11-19 23:30:24,388 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:30:24,404 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:30:24,408 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-19 23:30:24,408 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:30:24,416 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:30:24,416 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:30:24,417 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2019-11-19 23:30:24,466 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-19 23:30:24,466 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:30:24,474 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:30:24,474 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:30:24,474 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-11-19 23:30:24,613 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:30:24,613 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 56 [2019-11-19 23:30:24,613 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:30:24,643 INFO L567 ElimStorePlain]: treesize reduction 24, result has 60.0 percent of original size [2019-11-19 23:30:24,643 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:30:24,643 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2019-11-19 23:30:24,825 INFO L343 Elim1Store]: treesize reduction 52, result has 45.8 percent of original size [2019-11-19 23:30:24,826 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 71 [2019-11-19 23:30:24,826 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:30:24,851 INFO L567 ElimStorePlain]: treesize reduction 24, result has 66.7 percent of original size [2019-11-19 23:30:24,851 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:30:24,852 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:48 [2019-11-19 23:30:25,042 INFO L343 Elim1Store]: treesize reduction 32, result has 77.5 percent of original size [2019-11-19 23:30:25,042 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 140 [2019-11-19 23:30:25,043 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:30:25,082 INFO L567 ElimStorePlain]: treesize reduction 84, result has 39.1 percent of original size [2019-11-19 23:30:25,082 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:30:25,082 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:58, output treesize:54 [2019-11-19 23:30:25,330 INFO L343 Elim1Store]: treesize reduction 66, result has 69.3 percent of original size [2019-11-19 23:30:25,330 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 57 treesize of output 182 [2019-11-19 23:30:25,330 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:30:25,382 INFO L567 ElimStorePlain]: treesize reduction 114, result has 35.6 percent of original size [2019-11-19 23:30:25,382 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:30:25,382 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:63 [2019-11-19 23:30:25,678 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 57 [2019-11-19 23:30:25,679 INFO L343 Elim1Store]: treesize reduction 112, result has 62.7 percent of original size [2019-11-19 23:30:25,679 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 66 treesize of output 224 [2019-11-19 23:30:25,680 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:30:25,740 INFO L567 ElimStorePlain]: treesize reduction 144, result has 33.3 percent of original size [2019-11-19 23:30:25,741 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:30:25,741 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:76, output treesize:72 [2019-11-19 23:30:26,067 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 67 [2019-11-19 23:30:26,067 INFO L343 Elim1Store]: treesize reduction 170, result has 57.2 percent of original size [2019-11-19 23:30:26,067 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 75 treesize of output 266 [2019-11-19 23:30:26,068 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:30:26,148 INFO L567 ElimStorePlain]: treesize reduction 174, result has 32.6 percent of original size [2019-11-19 23:30:26,148 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:30:26,148 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:88, output treesize:84 [2019-11-19 23:30:26,921 WARN L191 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 93 [2019-11-19 23:30:26,921 INFO L343 Elim1Store]: treesize reduction 240, result has 61.0 percent of original size [2019-11-19 23:30:26,921 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 35 case distinctions, treesize of input 105 treesize of output 423 [2019-11-19 23:30:26,923 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:30:27,011 INFO L567 ElimStorePlain]: treesize reduction 431, result has 17.0 percent of original size [2019-11-19 23:30:27,012 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:30:27,012 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:118, output treesize:88 [2019-11-19 23:30:27,556 WARN L191 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 88 [2019-11-19 23:30:27,556 INFO L343 Elim1Store]: treesize reduction 328, result has 51.1 percent of original size [2019-11-19 23:30:27,556 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 35 case distinctions, treesize of input 110 treesize of output 390 [2019-11-19 23:30:27,558 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:30:27,642 INFO L567 ElimStorePlain]: treesize reduction 381, result has 18.9 percent of original size [2019-11-19 23:30:27,643 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:30:27,643 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:123, output treesize:89 [2019-11-19 23:30:28,229 WARN L191 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 93 [2019-11-19 23:30:28,229 INFO L343 Elim1Store]: treesize reduction 240, result has 61.0 percent of original size [2019-11-19 23:30:28,229 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 35 case distinctions, treesize of input 105 treesize of output 423 [2019-11-19 23:30:28,231 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:30:28,328 INFO L567 ElimStorePlain]: treesize reduction 433, result has 16.6 percent of original size [2019-11-19 23:30:28,328 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:30:28,329 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:118, output treesize:86 [2019-11-19 23:30:28,949 WARN L191 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 93 [2019-11-19 23:30:28,950 INFO L343 Elim1Store]: treesize reduction 240, result has 61.0 percent of original size [2019-11-19 23:30:28,950 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 35 case distinctions, treesize of input 105 treesize of output 423 [2019-11-19 23:30:28,951 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:30:29,081 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 50 [2019-11-19 23:30:29,082 INFO L567 ElimStorePlain]: treesize reduction 433, result has 16.6 percent of original size [2019-11-19 23:30:29,082 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:30:29,082 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:118, output treesize:86 [2019-11-19 23:30:29,760 WARN L191 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 86 [2019-11-19 23:30:29,760 INFO L343 Elim1Store]: treesize reduction 316, result has 51.3 percent of original size [2019-11-19 23:30:29,761 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 35 case distinctions, treesize of input 108 treesize of output 380 [2019-11-19 23:30:29,762 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:30:29,848 INFO L567 ElimStorePlain]: treesize reduction 371, result has 19.3 percent of original size [2019-11-19 23:30:29,849 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:30:29,849 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:121, output treesize:89 [2019-11-19 23:30:30,521 WARN L191 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 93 [2019-11-19 23:30:30,521 INFO L343 Elim1Store]: treesize reduction 240, result has 61.0 percent of original size [2019-11-19 23:30:30,521 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 35 case distinctions, treesize of input 105 treesize of output 423 [2019-11-19 23:30:30,523 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:30:30,617 INFO L567 ElimStorePlain]: treesize reduction 433, result has 16.6 percent of original size [2019-11-19 23:30:30,617 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:30:30,618 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:118, output treesize:86 [2019-11-19 23:30:31,055 INFO L343 Elim1Store]: treesize reduction 402, result has 11.6 percent of original size [2019-11-19 23:30:31,055 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 27 case distinctions, treesize of input 90 treesize of output 95 [2019-11-19 23:30:31,056 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:30:31,075 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:30:31,075 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:30:31,075 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:100, output treesize:79 [2019-11-19 23:30:31,395 INFO L343 Elim1Store]: treesize reduction 240, result has 28.8 percent of original size [2019-11-19 23:30:31,395 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 94 treesize of output 202 [2019-11-19 23:30:31,396 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:30:31,448 INFO L567 ElimStorePlain]: treesize reduction 166, result has 36.2 percent of original size [2019-11-19 23:30:31,448 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:30:31,448 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:107, output treesize:94 [2019-11-19 23:30:31,810 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 75 [2019-11-19 23:30:31,810 INFO L343 Elim1Store]: treesize reduction 197, result has 47.0 percent of original size [2019-11-19 23:30:31,810 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 108 treesize of output 285 [2019-11-19 23:30:31,812 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:30:31,882 INFO L567 ElimStorePlain]: treesize reduction 360, result has 21.7 percent of original size [2019-11-19 23:30:31,882 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:30:31,883 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:121, output treesize:100 [2019-11-19 23:30:32,217 INFO L343 Elim1Store]: treesize reduction 240, result has 28.8 percent of original size [2019-11-19 23:30:32,217 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 100 treesize of output 204 [2019-11-19 23:30:32,218 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:30:32,277 INFO L567 ElimStorePlain]: treesize reduction 176, result has 34.3 percent of original size [2019-11-19 23:30:32,277 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:30:32,277 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:113, output treesize:92 [2019-11-19 23:30:32,687 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 84 [2019-11-19 23:30:32,687 INFO L343 Elim1Store]: treesize reduction 257, result has 43.8 percent of original size [2019-11-19 23:30:32,688 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 1 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 36 case distinctions, treesize of input 105 treesize of output 319 [2019-11-19 23:30:32,689 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:30:32,761 INFO L567 ElimStorePlain]: treesize reduction 342, result has 23.0 percent of original size [2019-11-19 23:30:32,761 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:30:32,761 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:118, output treesize:102 [2019-11-19 23:30:33,282 WARN L191 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 115 [2019-11-19 23:30:33,282 INFO L343 Elim1Store]: treesize reduction 292, result has 50.9 percent of original size [2019-11-19 23:30:33,283 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 1 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 45 case distinctions, treesize of input 115 treesize of output 435 [2019-11-19 23:30:33,285 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:30:33,382 INFO L567 ElimStorePlain]: treesize reduction 568, result has 16.5 percent of original size [2019-11-19 23:30:33,383 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:30:33,383 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:128, output treesize:112 [2019-11-19 23:30:33,751 INFO L343 Elim1Store]: treesize reduction 240, result has 28.8 percent of original size [2019-11-19 23:30:33,752 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 116 treesize of output 206 [2019-11-19 23:30:33,753 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:30:33,811 INFO L567 ElimStorePlain]: treesize reduction 198, result has 37.9 percent of original size [2019-11-19 23:30:33,811 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:30:33,812 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:129, output treesize:121 [2019-11-19 23:30:34,123 INFO L343 Elim1Store]: treesize reduction 240, result has 0.4 percent of original size [2019-11-19 23:30:34,123 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 127 treesize of output 102 [2019-11-19 23:30:34,124 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:30:34,144 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:30:34,144 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 23:30:34,144 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:137, output treesize:100 [2019-11-19 23:30:34,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:30:34,476 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:30:34,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:30:34,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 54] total 104 [2019-11-19 23:30:34,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044419326] [2019-11-19 23:30:34,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-11-19 23:30:34,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:30:34,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-11-19 23:30:34,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1187, Invalid=9525, Unknown=0, NotChecked=0, Total=10712 [2019-11-19 23:30:34,478 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand 104 states. [2019-11-19 23:30:38,881 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 68 [2019-11-19 23:30:39,432 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 69 [2019-11-19 23:30:39,693 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 71 [2019-11-19 23:30:40,549 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 66 [2019-11-19 23:30:41,286 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 65 [2019-11-19 23:30:42,265 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 73 [2019-11-19 23:30:42,527 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 75 [2019-11-19 23:30:44,229 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 79 [2019-11-19 23:30:49,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:30:49,665 INFO L93 Difference]: Finished difference Result 166 states and 187 transitions. [2019-11-19 23:30:49,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-11-19 23:30:49,665 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 60 [2019-11-19 23:30:49,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:30:49,666 INFO L225 Difference]: With dead ends: 166 [2019-11-19 23:30:49,666 INFO L226 Difference]: Without dead ends: 124 [2019-11-19 23:30:49,667 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 9 SyntacticMatches, 6 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10228 ImplicationChecksByTransitivity, 20.9s TimeCoverageRelationStatistics Valid=3044, Invalid=27406, Unknown=0, NotChecked=0, Total=30450 [2019-11-19 23:30:49,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-11-19 23:30:49,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 90. [2019-11-19 23:30:49,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-19 23:30:49,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2019-11-19 23:30:49,681 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 60 [2019-11-19 23:30:49,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:30:49,681 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2019-11-19 23:30:49,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-11-19 23:30:49,682 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2019-11-19 23:30:49,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-19 23:30:49,682 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:30:49,682 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:30:49,885 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:30:49,885 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:30:49,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:30:49,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1504710446, now seen corresponding path program 20 times [2019-11-19 23:30:49,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:30:49,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741099700] [2019-11-19 23:30:49,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:30:49,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:30:50,113 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 51 proven. 62 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-11-19 23:30:50,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741099700] [2019-11-19 23:30:50,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351850916] [2019-11-19 23:30:50,114 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:30:50,198 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 23:30:50,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:30:50,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-19 23:30:50,201 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:30:50,418 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 64 proven. 49 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-11-19 23:30:50,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:30:50,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 28 [2019-11-19 23:30:50,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635774010] [2019-11-19 23:30:50,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-19 23:30:50,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:30:50,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-19 23:30:50,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=571, Unknown=0, NotChecked=0, Total=756 [2019-11-19 23:30:50,420 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 28 states. [2019-11-19 23:30:50,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:30:50,756 INFO L93 Difference]: Finished difference Result 161 states and 175 transitions. [2019-11-19 23:30:50,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-19 23:30:50,756 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 62 [2019-11-19 23:30:50,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:30:50,757 INFO L225 Difference]: With dead ends: 161 [2019-11-19 23:30:50,757 INFO L226 Difference]: Without dead ends: 96 [2019-11-19 23:30:50,757 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=309, Invalid=951, Unknown=0, NotChecked=0, Total=1260 [2019-11-19 23:30:50,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-19 23:30:50,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 82. [2019-11-19 23:30:50,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-19 23:30:50,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2019-11-19 23:30:50,771 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 62 [2019-11-19 23:30:50,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:30:50,772 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2019-11-19 23:30:50,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-19 23:30:50,772 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2019-11-19 23:30:50,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-19 23:30:50,772 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:30:50,772 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:30:50,972 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:30:50,973 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:30:50,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:30:50,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1552401418, now seen corresponding path program 21 times [2019-11-19 23:30:50,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:30:50,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234510439] [2019-11-19 23:30:50,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:30:50,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:30:51,185 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 36 proven. 98 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-19 23:30:51,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234510439] [2019-11-19 23:30:51,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031601664] [2019-11-19 23:30:51,186 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:30:51,425 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-11-19 23:30:51,425 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:30:51,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-19 23:30:51,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:30:51,554 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 49 proven. 64 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-11-19 23:30:51,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:30:51,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 28 [2019-11-19 23:30:51,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358554346] [2019-11-19 23:30:51,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-19 23:30:51,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:30:51,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-19 23:30:51,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-11-19 23:30:51,556 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand 28 states. [2019-11-19 23:30:52,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:30:52,048 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2019-11-19 23:30:52,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-19 23:30:52,049 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 62 [2019-11-19 23:30:52,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:30:52,049 INFO L225 Difference]: With dead ends: 91 [2019-11-19 23:30:52,050 INFO L226 Difference]: Without dead ends: 71 [2019-11-19 23:30:52,050 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=429, Invalid=1463, Unknown=0, NotChecked=0, Total=1892 [2019-11-19 23:30:52,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-19 23:30:52,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2019-11-19 23:30:52,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-19 23:30:52,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2019-11-19 23:30:52,061 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 62 [2019-11-19 23:30:52,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:30:52,062 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2019-11-19 23:30:52,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-19 23:30:52,062 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2019-11-19 23:30:52,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-19 23:30:52,062 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:30:52,062 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:30:52,266 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:30:52,267 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:30:52,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:30:52,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1720016189, now seen corresponding path program 22 times [2019-11-19 23:30:52,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:30:52,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737677664] [2019-11-19 23:30:52,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:30:52,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:30:53,626 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 33 [2019-11-19 23:30:53,816 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2019-11-19 23:30:54,018 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 50 [2019-11-19 23:30:54,295 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 57 [2019-11-19 23:30:54,493 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 60 [2019-11-19 23:30:54,832 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 57 [2019-11-19 23:30:55,052 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 60 [2019-11-19 23:30:55,218 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 49 [2019-11-19 23:30:55,454 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 59 [2019-11-19 23:30:55,716 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 62 [2019-11-19 23:30:55,923 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 51 [2019-11-19 23:30:56,209 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 62 [2019-11-19 23:30:56,504 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 65 [2019-11-19 23:30:56,734 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 54 [2019-11-19 23:30:57,033 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 65 [2019-11-19 23:30:57,353 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 68 [2019-11-19 23:30:57,611 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 54 [2019-11-19 23:30:57,861 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 65 [2019-11-19 23:30:58,124 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 68 [2019-11-19 23:30:58,322 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 58 [2019-11-19 23:30:58,509 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 55 [2019-11-19 23:31:01,254 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:31:01,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737677664] [2019-11-19 23:31:01,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287262243] [2019-11-19 23:31:01,254 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:31:01,329 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-19 23:31:01,329 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:31:01,332 WARN L253 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 117 conjunts are in the unsatisfiable core [2019-11-19 23:31:01,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:31:01,348 INFO L377 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 10 treesize of output 8 [2019-11-19 23:31:01,348 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:31:01,356 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:31:01,358 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-19 23:31:01,358 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:31:01,366 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:31:01,366 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:31:01,366 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2019-11-19 23:31:01,430 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-19 23:31:01,430 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:31:01,440 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:31:01,440 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:31:01,440 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-11-19 23:31:01,593 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:31:01,593 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 72 [2019-11-19 23:31:01,593 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:31:01,623 INFO L567 ElimStorePlain]: treesize reduction 36, result has 57.1 percent of original size [2019-11-19 23:31:01,624 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:31:01,624 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:52, output treesize:48 [2019-11-19 23:31:01,831 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:31:01,831 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 138 [2019-11-19 23:31:01,832 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:31:01,886 INFO L567 ElimStorePlain]: treesize reduction 72, result has 47.1 percent of original size [2019-11-19 23:31:01,887 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 23:31:01,887 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:68, output treesize:64 [2019-11-19 23:31:02,137 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:31:02,138 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 220 [2019-11-19 23:31:02,138 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:31:02,203 INFO L567 ElimStorePlain]: treesize reduction 108, result has 42.6 percent of original size [2019-11-19 23:31:02,203 INFO L496 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. [2019-11-19 23:31:02,203 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:84, output treesize:80 [2019-11-19 23:31:02,535 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:31:02,535 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 67 treesize of output 318 [2019-11-19 23:31:02,536 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:31:02,619 INFO L567 ElimStorePlain]: treesize reduction 144, result has 40.0 percent of original size [2019-11-19 23:31:02,620 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-19 23:31:02,620 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:100, output treesize:96 [2019-11-19 23:31:03,073 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2019-11-19 23:31:03,073 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:31:03,073 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 78 treesize of output 432 [2019-11-19 23:31:03,074 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:31:03,183 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2019-11-19 23:31:03,183 INFO L567 ElimStorePlain]: treesize reduction 180, result has 38.4 percent of original size [2019-11-19 23:31:03,184 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-19 23:31:03,184 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:116, output treesize:112 [2019-11-19 23:31:04,149 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2019-11-19 23:31:04,149 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:31:04,150 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 89 treesize of output 562 [2019-11-19 23:31:04,151 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:31:04,284 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 67 [2019-11-19 23:31:04,284 INFO L567 ElimStorePlain]: treesize reduction 216, result has 37.2 percent of original size [2019-11-19 23:31:04,285 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-11-19 23:31:04,285 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:132, output treesize:128 [2019-11-19 23:31:14,212 WARN L191 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 171 [2019-11-19 23:31:14,212 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:31:14,212 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 100 treesize of output 708 [2019-11-19 23:31:14,214 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:31:14,380 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 74 [2019-11-19 23:31:14,380 INFO L567 ElimStorePlain]: treesize reduction 252, result has 36.4 percent of original size [2019-11-19 23:31:14,381 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-11-19 23:31:14,381 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:148, output treesize:144 [2019-11-19 23:31:42,874 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-11-19 23:33:00,329 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-11-19 23:33:00,330 FATAL L310 FreeRefinementEngine]: Exception during interpolant generation: SMTLIBException [2019-11-19 23:33:00,530 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:33:00,531 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:153) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:140) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:899) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:576) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java: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) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 42 more [2019-11-19 23:33:00,535 INFO L168 Benchmark]: Toolchain (without parser) took 315593.91 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 343.4 MB). Free memory was 951.4 MB in the beginning and 994.7 MB in the end (delta: -43.3 MB). Peak memory consumption was 300.1 MB. Max. memory is 11.5 GB. [2019-11-19 23:33:00,535 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 23:33:00,535 INFO L168 Benchmark]: CACSL2BoogieTranslator took 369.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 951.4 MB in the beginning and 1.2 GB in the end (delta: -202.0 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-11-19 23:33:00,536 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 23:33:00,536 INFO L168 Benchmark]: Boogie Preprocessor took 31.72 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 23:33:00,536 INFO L168 Benchmark]: RCFGBuilder took 450.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 22.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. [2019-11-19 23:33:00,536 INFO L168 Benchmark]: TraceAbstraction took 314692.63 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 181.9 MB). Free memory was 1.1 GB in the beginning and 994.7 MB in the end (delta: 136.5 MB). Peak memory consumption was 318.4 MB. Max. memory is 11.5 GB. [2019-11-19 23:33:00,537 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 369.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 951.4 MB in the beginning and 1.2 GB in the end (delta: -202.0 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.72 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 450.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 22.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 314692.63 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 181.9 MB). Free memory was 1.1 GB in the beginning and 994.7 MB in the end (delta: 136.5 MB). Peak memory consumption was 318.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-19 23:33:02,278 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 23:33:02,280 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 23:33:02,291 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 23:33:02,292 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 23:33:02,293 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 23:33:02,294 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 23:33:02,296 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 23:33:02,298 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 23:33:02,299 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 23:33:02,300 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 23:33:02,302 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 23:33:02,302 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 23:33:02,303 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 23:33:02,304 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 23:33:02,305 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 23:33:02,306 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 23:33:02,307 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 23:33:02,309 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 23:33:02,311 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 23:33:02,312 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 23:33:02,313 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 23:33:02,315 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 23:33:02,315 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 23:33:02,325 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 23:33:02,325 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 23:33:02,327 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 23:33:02,328 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 23:33:02,329 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 23:33:02,331 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 23:33:02,333 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 23:33:02,334 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 23:33:02,335 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 23:33:02,336 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 23:33:02,337 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 23:33:02,340 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 23:33:02,341 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 23:33:02,341 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 23:33:02,342 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 23:33:02,343 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 23:33:02,346 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 23:33:02,348 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-19 23:33:02,373 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 23:33:02,374 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 23:33:02,379 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 23:33:02,379 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 23:33:02,380 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 23:33:02,380 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 23:33:02,380 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 23:33:02,381 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 23:33:02,381 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 23:33:02,381 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 23:33:02,382 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 23:33:02,383 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 23:33:02,383 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-19 23:33:02,383 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-19 23:33:02,384 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 23:33:02,384 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 23:33:02,384 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 23:33:02,385 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 23:33:02,385 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 23:33:02,386 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 23:33:02,387 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 23:33:02,389 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 23:33:02,390 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 23:33:02,390 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 23:33:02,390 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 23:33:02,390 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 23:33:02,391 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-19 23:33:02,391 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-19 23:33:02,391 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 23:33:02,391 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-19 23:33:02,391 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 549066cbb7a87d3d7638f4434cfbd1023f1c6d7e [2019-11-19 23:33:02,665 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 23:33:02,679 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 23:33:02,686 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 23:33:02,687 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 23:33:02,687 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 23:33:02,687 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/../../sv-benchmarks/c/array-fpi/s5lif.c [2019-11-19 23:33:02,760 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/data/d96e99c75/209d2886ab8d4d2fa3672dcf71718e4a/FLAG85d43b8b6 [2019-11-19 23:33:03,191 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 23:33:03,192 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/sv-benchmarks/c/array-fpi/s5lif.c [2019-11-19 23:33:03,198 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/data/d96e99c75/209d2886ab8d4d2fa3672dcf71718e4a/FLAG85d43b8b6 [2019-11-19 23:33:03,589 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/data/d96e99c75/209d2886ab8d4d2fa3672dcf71718e4a [2019-11-19 23:33:03,591 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 23:33:03,593 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 23:33:03,594 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 23:33:03,594 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 23:33:03,597 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 23:33:03,598 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:33:03" (1/1) ... [2019-11-19 23:33:03,601 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33addb18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:33:03, skipping insertion in model container [2019-11-19 23:33:03,601 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:33:03" (1/1) ... [2019-11-19 23:33:03,607 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 23:33:03,624 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 23:33:03,786 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:33:03,799 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 23:33:03,839 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:33:03,915 INFO L192 MainTranslator]: Completed translation [2019-11-19 23:33:03,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:33:03 WrapperNode [2019-11-19 23:33:03,916 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 23:33:03,916 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 23:33:03,917 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 23:33:03,917 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 23:33:03,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:33:03" (1/1) ... [2019-11-19 23:33:03,936 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:33:03" (1/1) ... [2019-11-19 23:33:03,959 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 23:33:03,960 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 23:33:03,960 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 23:33:03,960 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 23:33:03,970 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:33:03" (1/1) ... [2019-11-19 23:33:03,971 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:33:03" (1/1) ... [2019-11-19 23:33:03,975 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:33:03" (1/1) ... [2019-11-19 23:33:03,975 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:33:03" (1/1) ... [2019-11-19 23:33:03,985 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:33:03" (1/1) ... [2019-11-19 23:33:03,989 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:33:03" (1/1) ... [2019-11-19 23:33:03,991 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:33:03" (1/1) ... [2019-11-19 23:33:03,994 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 23:33:03,995 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 23:33:03,995 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 23:33:03,995 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 23:33:03,996 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:33:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 23:33:04,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 23:33:04,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2019-11-19 23:33:04,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-19 23:33:04,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-19 23:33:04,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 23:33:04,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 23:33:04,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2019-11-19 23:33:04,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 23:33:04,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-19 23:33:04,337 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 23:33:04,338 INFO L285 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-19 23:33:04,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:33:04 BoogieIcfgContainer [2019-11-19 23:33:04,339 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 23:33:04,340 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 23:33:04,340 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 23:33:04,342 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 23:33:04,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 11:33:03" (1/3) ... [2019-11-19 23:33:04,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58b3977f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:33:04, skipping insertion in model container [2019-11-19 23:33:04,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:33:03" (2/3) ... [2019-11-19 23:33:04,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58b3977f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:33:04, skipping insertion in model container [2019-11-19 23:33:04,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:33:04" (3/3) ... [2019-11-19 23:33:04,345 INFO L109 eAbstractionObserver]: Analyzing ICFG s5lif.c [2019-11-19 23:33:04,354 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 23:33:04,360 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 23:33:04,371 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 23:33:04,396 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 23:33:04,397 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 23:33:04,397 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 23:33:04,397 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 23:33:04,397 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 23:33:04,397 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 23:33:04,397 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 23:33:04,398 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 23:33:04,418 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-11-19 23:33:04,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-19 23:33:04,424 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:33:04,426 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:33:04,426 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:33:04,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:33:04,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1306593900, now seen corresponding path program 1 times [2019-11-19 23:33:04,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:33:04,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1711432459] [2019-11-19 23:33:04,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/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 [2019-11-19 23:33:04,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:33:04,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-19 23:33:04,543 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:33:04,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:33:04,554 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:33:04,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:33:04,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1711432459] [2019-11-19 23:33:04,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:33:04,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-19 23:33:04,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168681453] [2019-11-19 23:33:04,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-19 23:33:04,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:33:04,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-19 23:33:04,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 23:33:04,584 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2019-11-19 23:33:04,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:33:04,602 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2019-11-19 23:33:04,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-19 23:33:04,604 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-11-19 23:33:04,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:33:04,614 INFO L225 Difference]: With dead ends: 35 [2019-11-19 23:33:04,614 INFO L226 Difference]: Without dead ends: 16 [2019-11-19 23:33:04,617 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 23:33:04,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-11-19 23:33:04,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-19 23:33:04,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-19 23:33:04,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2019-11-19 23:33:04,645 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 11 [2019-11-19 23:33:04,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:33:04,645 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-11-19 23:33:04,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-19 23:33:04,645 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2019-11-19 23:33:04,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-19 23:33:04,646 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:33:04,646 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:33:04,846 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:33:04,847 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:33:04,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:33:04,847 INFO L82 PathProgramCache]: Analyzing trace with hash -875432925, now seen corresponding path program 1 times [2019-11-19 23:33:04,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:33:04,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [477579388] [2019-11-19 23:33:04,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/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 [2019-11-19 23:33:04,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:33:04,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 23:33:04,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:33:04,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:33:04,972 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:33:04,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:33:04,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [477579388] [2019-11-19 23:33:04,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:33:04,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-19 23:33:04,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962081941] [2019-11-19 23:33:04,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:33:04,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:33:04,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:33:04,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:33:04,993 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand 4 states. [2019-11-19 23:33:05,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:33:05,083 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2019-11-19 23:33:05,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:33:05,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-19 23:33:05,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:33:05,087 INFO L225 Difference]: With dead ends: 29 [2019-11-19 23:33:05,087 INFO L226 Difference]: Without dead ends: 18 [2019-11-19 23:33:05,088 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:33:05,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-11-19 23:33:05,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-11-19 23:33:05,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-19 23:33:05,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-11-19 23:33:05,093 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 11 [2019-11-19 23:33:05,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:33:05,094 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-19 23:33:05,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:33:05,094 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2019-11-19 23:33:05,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-19 23:33:05,095 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:33:05,095 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:33:05,297 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:33:05,297 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:33:05,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:33:05,298 INFO L82 PathProgramCache]: Analyzing trace with hash -100050171, now seen corresponding path program 1 times [2019-11-19 23:33:05,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:33:05,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [716717010] [2019-11-19 23:33:05,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/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 [2019-11-19 23:33:05,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:33:05,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 23:33:05,396 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:33:05,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:33:05,472 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:33:05,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:33:05,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [716717010] [2019-11-19 23:33:05,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:33:05,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-19 23:33:05,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343343846] [2019-11-19 23:33:05,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 23:33:05,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:33:05,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 23:33:05,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-11-19 23:33:05,594 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 10 states. [2019-11-19 23:33:05,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:33:05,969 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2019-11-19 23:33:05,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 23:33:05,970 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2019-11-19 23:33:05,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:33:05,971 INFO L225 Difference]: With dead ends: 53 [2019-11-19 23:33:05,971 INFO L226 Difference]: Without dead ends: 43 [2019-11-19 23:33:05,972 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-11-19 23:33:05,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-19 23:33:05,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 33. [2019-11-19 23:33:05,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-19 23:33:05,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2019-11-19 23:33:05,983 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 13 [2019-11-19 23:33:05,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:33:05,983 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2019-11-19 23:33:05,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 23:33:05,984 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2019-11-19 23:33:05,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-19 23:33:05,985 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:33:05,985 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:33:06,192 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:33:06,192 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:33:06,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:33:06,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1777901324, now seen corresponding path program 1 times [2019-11-19 23:33:06,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:33:06,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [62986783] [2019-11-19 23:33:06,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/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 [2019-11-19 23:33:06,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:33:06,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-19 23:33:06,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:33:06,401 INFO L377 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 10 treesize of output 8 [2019-11-19 23:33:06,402 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:33:06,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:33:06,450 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:33:06,452 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 23:33:06,455 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2019-11-19 23:33:06,456 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:33:06,480 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:33:06,481 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:33:06,481 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:34 [2019-11-19 23:33:06,528 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:33:06,530 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-11-19 23:33:06,531 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:33:06,572 INFO L567 ElimStorePlain]: treesize reduction 4, result has 89.5 percent of original size [2019-11-19 23:33:06,573 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:33:06,573 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:34 [2019-11-19 23:33:06,715 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:33:06,764 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:33:06,765 INFO L377 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 65 [2019-11-19 23:33:06,767 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:33:06,837 INFO L567 ElimStorePlain]: treesize reduction 26, result has 56.7 percent of original size [2019-11-19 23:33:06,837 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:33:06,838 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:51, output treesize:34 [2019-11-19 23:33:06,946 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:33:06,946 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:33:07,736 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 23:33:07,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [62986783] [2019-11-19 23:33:07,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 23:33:07,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2019-11-19 23:33:07,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103214767] [2019-11-19 23:33:07,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 23:33:07,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:33:07,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 23:33:07,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-11-19 23:33:07,739 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand 6 states. [2019-11-19 23:33:08,454 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-11-19 23:33:10,026 WARN L191 SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-11-19 23:33:10,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:33:10,903 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2019-11-19 23:33:10,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 23:33:10,904 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-11-19 23:33:10,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:33:10,905 INFO L225 Difference]: With dead ends: 53 [2019-11-19 23:33:10,906 INFO L226 Difference]: Without dead ends: 39 [2019-11-19 23:33:10,906 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-11-19 23:33:10,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-19 23:33:10,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-11-19 23:33:10,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-19 23:33:10,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2019-11-19 23:33:10,915 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 18 [2019-11-19 23:33:10,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:33:10,915 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2019-11-19 23:33:10,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 23:33:10,916 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2019-11-19 23:33:10,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-19 23:33:10,916 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:33:10,917 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:33:11,119 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:33:11,119 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:33:11,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:33:11,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1384874314, now seen corresponding path program 1 times [2019-11-19 23:33:11,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:33:11,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1435986419] [2019-11-19 23:33:11,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:33:11,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:33:11,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 23:33:11,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:33:11,223 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-19 23:33:11,223 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:33:11,229 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:33:11,229 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:33:11,229 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-19 23:33:11,257 INFO L377 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 17 treesize of output 9 [2019-11-19 23:33:11,258 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:33:11,265 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:33:11,265 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:33:11,265 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2019-11-19 23:33:11,274 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 23:33:11,274 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:33:11,325 INFO L377 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 14 [2019-11-19 23:33:11,332 INFO L377 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 24 treesize of output 22 [2019-11-19 23:33:11,333 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:33:11,336 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:33:11,336 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:33:11,340 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:33:11,340 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:33:11,340 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:7 [2019-11-19 23:33:11,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 23:33:11,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1435986419] [2019-11-19 23:33:11,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:33:11,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-11-19 23:33:11,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348014190] [2019-11-19 23:33:11,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 23:33:11,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:33:11,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 23:33:11,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-19 23:33:11,365 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 9 states. [2019-11-19 23:33:11,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:33:11,527 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2019-11-19 23:33:11,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 23:33:11,528 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-11-19 23:33:11,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:33:11,529 INFO L225 Difference]: With dead ends: 49 [2019-11-19 23:33:11,529 INFO L226 Difference]: Without dead ends: 27 [2019-11-19 23:33:11,530 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-11-19 23:33:11,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-19 23:33:11,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-11-19 23:33:11,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-19 23:33:11,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-11-19 23:33:11,535 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 18 [2019-11-19 23:33:11,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:33:11,535 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-11-19 23:33:11,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 23:33:11,536 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-11-19 23:33:11,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-19 23:33:11,536 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:33:11,537 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:33:11,737 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:33:11,737 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:33:11,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:33:11,738 INFO L82 PathProgramCache]: Analyzing trace with hash -2122286649, now seen corresponding path program 1 times [2019-11-19 23:33:11,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:33:11,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1364066292] [2019-11-19 23:33:11,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/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 [2019-11-19 23:33:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:33:11,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-19 23:33:11,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:33:11,938 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-19 23:33:11,938 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:33:12,145 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-19 23:33:12,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1364066292] [2019-11-19 23:33:12,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:33:12,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-11-19 23:33:12,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275263471] [2019-11-19 23:33:12,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-19 23:33:12,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:33:12,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-19 23:33:12,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-11-19 23:33:12,147 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 16 states. [2019-11-19 23:33:12,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:33:12,644 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2019-11-19 23:33:12,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-19 23:33:12,648 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2019-11-19 23:33:12,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:33:12,649 INFO L225 Difference]: With dead ends: 78 [2019-11-19 23:33:12,649 INFO L226 Difference]: Without dead ends: 62 [2019-11-19 23:33:12,650 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=261, Unknown=0, NotChecked=0, Total=380 [2019-11-19 23:33:12,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-19 23:33:12,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 48. [2019-11-19 23:33:12,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-19 23:33:12,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2019-11-19 23:33:12,657 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 23 [2019-11-19 23:33:12,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:33:12,658 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2019-11-19 23:33:12,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-19 23:33:12,659 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2019-11-19 23:33:12,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-19 23:33:12,660 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:33:12,660 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:33:12,862 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:33:12,864 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:33:12,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:33:12,864 INFO L82 PathProgramCache]: Analyzing trace with hash 645229449, now seen corresponding path program 2 times [2019-11-19 23:33:12,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:33:12,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [148809454] [2019-11-19 23:33:12,865 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:33:12,993 ERROR L271 FreeRefinementEngine]: Caught known exception: Array theory solver does not yet support write-chains connecting two different constant arrays [2019-11-19 23:33:12,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2047535185] [2019-11-19 23:33:12,994 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:33:13,122 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 23:33:13,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:33:13,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 23:33:13,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:33:13,228 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-19 23:33:13,228 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:33:13,236 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:33:13,237 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:33:13,237 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-19 23:33:13,274 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:33:13,276 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:33:13,276 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 28 [2019-11-19 23:33:13,277 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:33:13,286 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:33:13,286 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:33:13,287 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:18 [2019-11-19 23:33:13,320 INFO L377 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 17 treesize of output 9 [2019-11-19 23:33:13,321 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:33:13,323 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:33:13,324 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:33:13,324 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:3 [2019-11-19 23:33:13,343 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-19 23:33:13,343 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:33:13,492 INFO L377 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 14 [2019-11-19 23:33:13,498 INFO L377 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 28 treesize of output 24 [2019-11-19 23:33:13,498 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:33:13,501 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:33:13,501 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:33:13,503 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:33:13,503 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:33:13,503 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:9 [2019-11-19 23:33:13,545 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-19 23:33:13,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [148809454] [2019-11-19 23:33:13,545 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-19 23:33:13,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047535185] [2019-11-19 23:33:13,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:33:13,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-11-19 23:33:13,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200696548] [2019-11-19 23:33:13,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-19 23:33:13,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:33:13,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-19 23:33:13,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-11-19 23:33:13,546 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 13 states. [2019-11-19 23:33:13,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:33:13,845 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2019-11-19 23:33:13,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-19 23:33:13,846 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-11-19 23:33:13,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:33:13,847 INFO L225 Difference]: With dead ends: 63 [2019-11-19 23:33:13,847 INFO L226 Difference]: Without dead ends: 34 [2019-11-19 23:33:13,847 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-11-19 23:33:13,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-19 23:33:13,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-11-19 23:33:13,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-19 23:33:13,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-11-19 23:33:13,853 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 25 [2019-11-19 23:33:13,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:33:13,853 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-11-19 23:33:13,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-19 23:33:13,853 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-11-19 23:33:13,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-19 23:33:13,854 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:33:13,854 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:33:14,058 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:33:14,058 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:33:14,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:33:14,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1363538264, now seen corresponding path program 3 times [2019-11-19 23:33:14,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:33:14,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1760324055] [2019-11-19 23:33:14,059 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_422d6feb-a855-484f-bc4b-924f030ca827/bin/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:33:14,246 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-19 23:33:14,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:33:14,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-19 23:33:14,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:33:14,268 INFO L377 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 10 treesize of output 8 [2019-11-19 23:33:14,269 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:33:14,291 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:33:14,292 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:33:14,292 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-11-19 23:33:14,370 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 [2019-11-19 23:33:14,371 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:33:14,402 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:33:14,402 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:33:14,402 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:60, output treesize:33 [2019-11-19 23:33:14,695 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:33:14,716 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:33:14,716 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 89 [2019-11-19 23:33:14,718 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:33:14,851 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-11-19 23:33:14,851 INFO L567 ElimStorePlain]: treesize reduction 67, result has 52.5 percent of original size [2019-11-19 23:33:14,852 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:33:14,852 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:115, output treesize:74 [2019-11-19 23:33:15,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:33:15,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:33:15,075 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:33:15,076 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 125 [2019-11-19 23:33:15,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:15,090 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:33:15,094 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:33:15,100 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:33:15,109 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:33:15,110 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:33:15,119 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:33:15,120 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 46 [2019-11-19 23:33:15,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:33:15,128 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:33:15,136 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:33:15,136 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:33:15,194 INFO L567 ElimStorePlain]: treesize reduction 4, result has 89.2 percent of original size [2019-11-19 23:33:15,194 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:33:15,195 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:123, output treesize:29 [2019-11-19 23:33:15,398 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-19 23:33:15,398 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:33:24,388 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-19 23:33:27,000 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-11-19 23:33:27,226 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2019-11-19 23:33:27,227 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:33:27,427 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:33:27,428 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |#memory_int| input size 379 context size 379 output size 379 at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:351) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:361) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java: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) [2019-11-19 23:33:27,431 INFO L168 Benchmark]: Toolchain (without parser) took 23838.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 213.9 MB). Free memory was 955.1 MB in the beginning and 938.2 MB in the end (delta: 16.8 MB). Peak memory consumption was 230.8 MB. Max. memory is 11.5 GB. [2019-11-19 23:33:27,431 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 23:33:27,432 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 955.1 MB in the beginning and 1.2 GB in the end (delta: -202.5 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-19 23:33:27,432 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-19 23:33:27,432 INFO L168 Benchmark]: Boogie Preprocessor took 34.58 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 23:33:27,433 INFO L168 Benchmark]: RCFGBuilder took 344.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2019-11-19 23:33:27,433 INFO L168 Benchmark]: TraceAbstraction took 23090.70 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.0 MB). Free memory was 1.1 GB in the beginning and 938.2 MB in the end (delta: 194.0 MB). Peak memory consumption was 247.0 MB. Max. memory is 11.5 GB. [2019-11-19 23:33:27,434 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 322.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 955.1 MB in the beginning and 1.2 GB in the end (delta: -202.5 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.58 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 344.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 23090.70 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.0 MB). Free memory was 1.1 GB in the beginning and 938.2 MB in the end (delta: 194.0 MB). Peak memory consumption was 247.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |#memory_int| input size 379 context size 379 output size 379 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |#memory_int| input size 379 context size 379 output size 379: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:351) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...