./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/s4if.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/s4if.c -s /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/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 f0c6762a510921214435f03fd1512220ceb2c5e3 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_904d1f1c-914f-4c78-b706-7dfccaa09081/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/s4if.c -s /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/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 f0c6762a510921214435f03fd1512220ceb2c5e3 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 20:02:41,737 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:02:41,739 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:02:41,754 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:02:41,754 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:02:41,755 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:02:41,757 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:02:41,763 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:02:41,768 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:02:41,771 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:02:41,772 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:02:41,773 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:02:41,773 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:02:41,774 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:02:41,775 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:02:41,776 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:02:41,776 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:02:41,777 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:02:41,779 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:02:41,780 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:02:41,785 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:02:41,787 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:02:41,790 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:02:41,791 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:02:41,796 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:02:41,796 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:02:41,797 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:02:41,799 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:02:41,799 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:02:41,801 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:02:41,801 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:02:41,803 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:02:41,803 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:02:41,804 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:02:41,807 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:02:41,807 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:02:41,808 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:02:41,808 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:02:41,808 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:02:41,809 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:02:41,810 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:02:41,811 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 20:02:41,828 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:02:41,828 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:02:41,830 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:02:41,830 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:02:41,831 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:02:41,831 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:02:41,831 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:02:41,831 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:02:41,831 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:02:41,832 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:02:41,833 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:02:41,833 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:02:41,833 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:02:41,833 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:02:41,834 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:02:41,834 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:02:41,834 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:02:41,834 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:02:41,835 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:02:41,835 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:02:41,835 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:02:41,835 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:02:41,835 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:02:41,836 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:02:41,836 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:02:41,836 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:02:41,837 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 20:02:41,837 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:02:41,837 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_904d1f1c-914f-4c78-b706-7dfccaa09081/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 -> f0c6762a510921214435f03fd1512220ceb2c5e3 [2019-11-15 20:02:41,901 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:02:41,911 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:02:41,915 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:02:41,917 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:02:41,917 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:02:41,918 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/bin/uautomizer/../../sv-benchmarks/c/array-fpi/s4if.c [2019-11-15 20:02:41,984 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/bin/uautomizer/data/44a7b1e0e/d26189148f5246d2bc0471821d7626c2/FLAGb768e599a [2019-11-15 20:02:42,374 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:02:42,374 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/sv-benchmarks/c/array-fpi/s4if.c [2019-11-15 20:02:42,381 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/bin/uautomizer/data/44a7b1e0e/d26189148f5246d2bc0471821d7626c2/FLAGb768e599a [2019-11-15 20:02:42,762 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/bin/uautomizer/data/44a7b1e0e/d26189148f5246d2bc0471821d7626c2 [2019-11-15 20:02:42,765 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:02:42,766 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:02:42,767 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:02:42,767 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:02:42,773 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:02:42,774 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:02:42" (1/1) ... [2019-11-15 20:02:42,776 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@320fc0b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:02:42, skipping insertion in model container [2019-11-15 20:02:42,777 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:02:42" (1/1) ... [2019-11-15 20:02:42,784 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:02:42,806 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:02:43,029 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:02:43,109 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:02:43,136 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:02:43,155 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:02:43,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:02:43 WrapperNode [2019-11-15 20:02:43,156 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:02:43,156 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:02:43,157 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:02:43,157 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:02:43,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:02:43" (1/1) ... [2019-11-15 20:02:43,176 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:02:43" (1/1) ... [2019-11-15 20:02:43,198 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:02:43,198 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:02:43,198 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:02:43,199 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:02:43,209 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:02:43" (1/1) ... [2019-11-15 20:02:43,209 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:02:43" (1/1) ... [2019-11-15 20:02:43,211 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:02:43" (1/1) ... [2019-11-15 20:02:43,211 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:02:43" (1/1) ... [2019-11-15 20:02:43,218 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:02:43" (1/1) ... [2019-11-15 20:02:43,222 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:02:43" (1/1) ... [2019-11-15 20:02:43,224 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:02:43" (1/1) ... [2019-11-15 20:02:43,226 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:02:43,226 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:02:43,227 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:02:43,227 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:02:43,228 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:02:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/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-15 20:02:43,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 20:02:43,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 20:02:43,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 20:02:43,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:02:43,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:02:43,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 20:02:43,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 20:02:43,561 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:02:43,562 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 20:02:43,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:02:43 BoogieIcfgContainer [2019-11-15 20:02:43,563 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:02:43,564 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:02:43,564 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:02:43,567 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:02:43,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:02:42" (1/3) ... [2019-11-15 20:02:43,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61ff4f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:02:43, skipping insertion in model container [2019-11-15 20:02:43,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:02:43" (2/3) ... [2019-11-15 20:02:43,569 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61ff4f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:02:43, skipping insertion in model container [2019-11-15 20:02:43,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:02:43" (3/3) ... [2019-11-15 20:02:43,571 INFO L109 eAbstractionObserver]: Analyzing ICFG s4if.c [2019-11-15 20:02:43,579 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:02:43,586 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 20:02:43,612 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 20:02:43,665 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:02:43,666 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:02:43,666 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:02:43,666 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:02:43,666 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:02:43,666 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:02:43,666 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:02:43,666 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:02:43,679 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-11-15 20:02:43,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-15 20:02:43,701 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:02:43,702 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:02:43,704 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:02:43,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:02:43,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1476218026, now seen corresponding path program 1 times [2019-11-15 20:02:43,717 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:02:43,717 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140085047] [2019-11-15 20:02:43,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:02:43,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:02:43,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:02:43,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:02:43,884 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-15 20:02:43,885 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140085047] [2019-11-15 20:02:43,885 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:02:43,886 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:02:43,886 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825319642] [2019-11-15 20:02:43,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-15 20:02:43,891 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:02:43,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 20:02:43,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 20:02:43,906 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2019-11-15 20:02:43,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:02:43,920 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2019-11-15 20:02:43,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 20:02:43,922 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-11-15 20:02:43,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:02:43,930 INFO L225 Difference]: With dead ends: 29 [2019-11-15 20:02:43,930 INFO L226 Difference]: Without dead ends: 13 [2019-11-15 20:02:43,932 INFO L600 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-15 20:02:43,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-11-15 20:02:43,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-11-15 20:02:43,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-15 20:02:43,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-11-15 20:02:43,959 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 9 [2019-11-15 20:02:43,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:02:43,960 INFO L462 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-11-15 20:02:43,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-15 20:02:43,960 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2019-11-15 20:02:43,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-15 20:02:43,961 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:02:43,961 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:02:43,961 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:02:43,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:02:43,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1304115419, now seen corresponding path program 1 times [2019-11-15 20:02:43,962 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:02:43,962 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734034712] [2019-11-15 20:02:43,962 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:02:43,962 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:02:43,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:02:43,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:02:44,034 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-15 20:02:44,035 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734034712] [2019-11-15 20:02:44,035 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:02:44,035 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:02:44,035 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028761823] [2019-11-15 20:02:44,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:02:44,036 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:02:44,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:02:44,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:02:44,037 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 3 states. [2019-11-15 20:02:44,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:02:44,082 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2019-11-15 20:02:44,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:02:44,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-15 20:02:44,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:02:44,083 INFO L225 Difference]: With dead ends: 23 [2019-11-15 20:02:44,084 INFO L226 Difference]: Without dead ends: 15 [2019-11-15 20:02:44,084 INFO L600 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-15 20:02:44,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-11-15 20:02:44,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-11-15 20:02:44,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-15 20:02:44,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-11-15 20:02:44,088 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 9 [2019-11-15 20:02:44,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:02:44,088 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-11-15 20:02:44,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:02:44,088 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-11-15 20:02:44,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-15 20:02:44,089 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:02:44,089 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:02:44,089 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:02:44,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:02:44,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1358761923, now seen corresponding path program 1 times [2019-11-15 20:02:44,090 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:02:44,090 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811438050] [2019-11-15 20:02:44,090 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:02:44,091 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:02:44,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:02:44,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:02:44,155 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-15 20:02:44,155 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811438050] [2019-11-15 20:02:44,156 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:02:44,156 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:02:44,156 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754715872] [2019-11-15 20:02:44,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:02:44,157 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:02:44,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:02:44,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:02:44,157 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 4 states. [2019-11-15 20:02:44,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:02:44,207 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-11-15 20:02:44,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:02:44,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-15 20:02:44,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:02:44,209 INFO L225 Difference]: With dead ends: 22 [2019-11-15 20:02:44,209 INFO L226 Difference]: Without dead ends: 18 [2019-11-15 20:02:44,210 INFO L600 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-15 20:02:44,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-11-15 20:02:44,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2019-11-15 20:02:44,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-15 20:02:44,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-11-15 20:02:44,214 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2019-11-15 20:02:44,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:02:44,215 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-11-15 20:02:44,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:02:44,215 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2019-11-15 20:02:44,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-15 20:02:44,216 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:02:44,216 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:02:44,216 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:02:44,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:02:44,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1565637502, now seen corresponding path program 1 times [2019-11-15 20:02:44,217 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:02:44,217 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200036913] [2019-11-15 20:02:44,218 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:02:44,218 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:02:44,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:02:44,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:02:44,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:02:44,633 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200036913] [2019-11-15 20:02:44,633 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130364454] [2019-11-15 20:02:44,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/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-15 20:02:44,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:02:44,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-15 20:02:44,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:02:44,757 INFO L375 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-15 20:02:44,758 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:02:44,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:02:44,771 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:02:44,771 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2019-11-15 20:02:44,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:02:44,819 INFO L375 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-15 20:02:44,819 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:02:44,835 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:02:44,835 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:02:44,835 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2019-11-15 20:02:45,095 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:02:45,104 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:02:45,105 INFO L375 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 1 case distinctions, treesize of input 55 treesize of output 57 [2019-11-15 20:02:45,106 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:02:45,149 INFO L567 ElimStorePlain]: treesize reduction 32, result has 62.8 percent of original size [2019-11-15 20:02:45,150 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-15 20:02:45,150 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:71, output treesize:54 [2019-11-15 20:02:45,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:02:45,263 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:02:45,264 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:02:45,264 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2019-11-15 20:02:45,264 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305694512] [2019-11-15 20:02:45,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-15 20:02:45,265 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:02:45,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 20:02:45,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-11-15 20:02:45,266 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 18 states. [2019-11-15 20:02:46,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:02:46,032 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2019-11-15 20:02:46,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 20:02:46,033 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 14 [2019-11-15 20:02:46,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:02:46,035 INFO L225 Difference]: With dead ends: 33 [2019-11-15 20:02:46,035 INFO L226 Difference]: Without dead ends: 24 [2019-11-15 20:02:46,037 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2019-11-15 20:02:46,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-15 20:02:46,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2019-11-15 20:02:46,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-15 20:02:46,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-11-15 20:02:46,042 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 14 [2019-11-15 20:02:46,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:02:46,043 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-11-15 20:02:46,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-15 20:02:46,043 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-11-15 20:02:46,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-15 20:02:46,044 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:02:46,045 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:02:46,248 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:02:46,248 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:02:46,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:02:46,249 INFO L82 PathProgramCache]: Analyzing trace with hash -472130976, now seen corresponding path program 2 times [2019-11-15 20:02:46,249 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:02:46,249 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319368363] [2019-11-15 20:02:46,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:02:46,250 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:02:46,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:02:46,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:02:46,360 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:02:46,360 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319368363] [2019-11-15 20:02:46,361 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106535006] [2019-11-15 20:02:46,361 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/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-15 20:02:46,408 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 20:02:46,408 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:02:46,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 20:02:46,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:02:46,455 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:02:46,455 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:02:46,455 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-11-15 20:02:46,456 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818616692] [2019-11-15 20:02:46,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 20:02:46,456 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:02:46,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 20:02:46,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:02:46,457 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 10 states. [2019-11-15 20:02:46,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:02:46,613 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2019-11-15 20:02:46,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 20:02:46,614 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-11-15 20:02:46,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:02:46,614 INFO L225 Difference]: With dead ends: 31 [2019-11-15 20:02:46,615 INFO L226 Difference]: Without dead ends: 27 [2019-11-15 20:02:46,615 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 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-15 20:02:46,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-15 20:02:46,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2019-11-15 20:02:46,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-15 20:02:46,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-11-15 20:02:46,620 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2019-11-15 20:02:46,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:02:46,621 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-11-15 20:02:46,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 20:02:46,621 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2019-11-15 20:02:46,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-15 20:02:46,625 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:02:46,625 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:02:46,825 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:02:46,826 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:02:46,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:02:46,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1317941731, now seen corresponding path program 3 times [2019-11-15 20:02:46,826 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:02:46,827 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419910921] [2019-11-15 20:02:46,827 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:02:46,827 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:02:46,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:02:46,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:02:46,885 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:02:46,885 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419910921] [2019-11-15 20:02:46,885 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963145028] [2019-11-15 20:02:46,885 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/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-15 20:02:46,930 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-15 20:02:46,930 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:02:46,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 20:02:46,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:02:46,966 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:02:46,966 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:02:46,967 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-11-15 20:02:46,967 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646935768] [2019-11-15 20:02:46,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 20:02:46,968 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:02:46,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 20:02:46,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:02:46,968 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 10 states. [2019-11-15 20:02:47,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:02:47,062 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2019-11-15 20:02:47,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 20:02:47,064 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-15 20:02:47,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:02:47,065 INFO L225 Difference]: With dead ends: 35 [2019-11-15 20:02:47,065 INFO L226 Difference]: Without dead ends: 23 [2019-11-15 20:02:47,066 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:02:47,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-15 20:02:47,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2019-11-15 20:02:47,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-15 20:02:47,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-11-15 20:02:47,070 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 17 [2019-11-15 20:02:47,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:02:47,070 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-11-15 20:02:47,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 20:02:47,071 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2019-11-15 20:02:47,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 20:02:47,071 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:02:47,071 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:02:47,273 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:02:47,274 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:02:47,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:02:47,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1991965825, now seen corresponding path program 4 times [2019-11-15 20:02:47,274 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:02:47,275 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72637040] [2019-11-15 20:02:47,275 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:02:47,275 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:02:47,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:02:47,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:02:47,945 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:02:47,945 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72637040] [2019-11-15 20:02:47,945 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709661864] [2019-11-15 20:02:47,946 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/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-15 20:02:47,999 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 20:02:47,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:02:48,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-15 20:02:48,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:02:48,013 INFO L375 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-15 20:02:48,013 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:02:48,023 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:02:48,023 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:02:48,023 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-15 20:02:48,057 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:02:48,059 INFO L375 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-15 20:02:48,059 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:02:48,073 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:02:48,074 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:02:48,074 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2019-11-15 20:02:48,172 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:02:48,191 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:02:48,191 INFO L375 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-15 20:02:48,192 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:02:48,237 INFO L567 ElimStorePlain]: treesize reduction 36, result has 56.1 percent of original size [2019-11-15 20:02:48,238 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-15 20:02:48,238 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:46 [2019-11-15 20:02:48,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:02:48,568 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:02:48,568 INFO L375 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 66 treesize of output 103 [2019-11-15 20:02:48,570 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:02:48,628 INFO L567 ElimStorePlain]: treesize reduction 80, result has 46.7 percent of original size [2019-11-15 20:02:48,629 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-15 20:02:48,630 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:87, output treesize:70 [2019-11-15 20:02:48,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:02:48,866 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:02:48,867 INFO L375 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 85 treesize of output 165 [2019-11-15 20:02:48,868 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:02:48,939 INFO L567 ElimStorePlain]: treesize reduction 150, result has 31.5 percent of original size [2019-11-15 20:02:48,941 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-15 20:02:48,941 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:114, output treesize:66 [2019-11-15 20:02:48,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:02:49,034 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:02:49,034 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:02:49,034 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 26 [2019-11-15 20:02:49,035 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559523765] [2019-11-15 20:02:49,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-15 20:02:49,035 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:02:49,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-15 20:02:49,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=576, Unknown=0, NotChecked=0, Total=650 [2019-11-15 20:02:49,036 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 26 states. [2019-11-15 20:02:49,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:02:49,897 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2019-11-15 20:02:49,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 20:02:49,897 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 19 [2019-11-15 20:02:49,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:02:49,898 INFO L225 Difference]: With dead ends: 43 [2019-11-15 20:02:49,898 INFO L226 Difference]: Without dead ends: 32 [2019-11-15 20:02:49,900 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=179, Invalid=1153, Unknown=0, NotChecked=0, Total=1332 [2019-11-15 20:02:49,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-15 20:02:49,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2019-11-15 20:02:49,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-15 20:02:49,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-11-15 20:02:49,906 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 19 [2019-11-15 20:02:49,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:02:49,906 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-11-15 20:02:49,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-15 20:02:49,907 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-11-15 20:02:49,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 20:02:49,908 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:02:49,908 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:02:50,118 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:02:50,119 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:02:50,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:02:50,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1189058463, now seen corresponding path program 5 times [2019-11-15 20:02:50,120 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:02:50,120 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066354298] [2019-11-15 20:02:50,120 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:02:50,120 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:02:50,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:02:50,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:02:50,207 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:02:50,207 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066354298] [2019-11-15 20:02:50,207 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505890751] [2019-11-15 20:02:50,207 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/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-15 20:02:50,252 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-11-15 20:02:50,252 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:02:50,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 20:02:50,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:02:50,302 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:02:50,302 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:02:50,302 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-11-15 20:02:50,302 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214491328] [2019-11-15 20:02:50,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-15 20:02:50,303 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:02:50,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 20:02:50,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-11-15 20:02:50,303 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 13 states. [2019-11-15 20:02:50,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:02:50,571 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2019-11-15 20:02:50,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 20:02:50,571 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2019-11-15 20:02:50,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:02:50,572 INFO L225 Difference]: With dead ends: 39 [2019-11-15 20:02:50,573 INFO L226 Difference]: Without dead ends: 35 [2019-11-15 20:02:50,573 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2019-11-15 20:02:50,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-15 20:02:50,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2019-11-15 20:02:50,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-15 20:02:50,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-11-15 20:02:50,581 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 21 [2019-11-15 20:02:50,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:02:50,585 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-11-15 20:02:50,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-15 20:02:50,585 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2019-11-15 20:02:50,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 20:02:50,586 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:02:50,587 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:02:50,790 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:02:50,790 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:02:50,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:02:50,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1846717952, now seen corresponding path program 6 times [2019-11-15 20:02:50,790 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:02:50,790 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692106921] [2019-11-15 20:02:50,791 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:02:50,791 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:02:50,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:02:50,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:02:50,928 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:02:50,929 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692106921] [2019-11-15 20:02:50,929 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445527351] [2019-11-15 20:02:50,929 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/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-15 20:02:50,983 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-11-15 20:02:50,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:02:50,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 20:02:50,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:02:51,088 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:02:51,088 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:02:51,088 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-11-15 20:02:51,089 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322939083] [2019-11-15 20:02:51,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-15 20:02:51,089 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:02:51,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 20:02:51,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-11-15 20:02:51,090 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 13 states. [2019-11-15 20:02:51,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:02:51,230 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2019-11-15 20:02:51,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 20:02:51,231 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2019-11-15 20:02:51,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:02:51,231 INFO L225 Difference]: With dead ends: 43 [2019-11-15 20:02:51,232 INFO L226 Difference]: Without dead ends: 28 [2019-11-15 20:02:51,232 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 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-15 20:02:51,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-15 20:02:51,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2019-11-15 20:02:51,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-15 20:02:51,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-11-15 20:02:51,257 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 22 [2019-11-15 20:02:51,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:02:51,258 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-11-15 20:02:51,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-15 20:02:51,258 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-11-15 20:02:51,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 20:02:51,259 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:02:51,259 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:02:51,459 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:02:51,460 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:02:51,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:02:51,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1106368034, now seen corresponding path program 7 times [2019-11-15 20:02:51,460 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:02:51,460 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990799997] [2019-11-15 20:02:51,460 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:02:51,460 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:02:51,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:02:51,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:02:51,998 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:02:51,998 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990799997] [2019-11-15 20:02:51,998 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529039774] [2019-11-15 20:02:51,998 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/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-15 20:02:52,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:02:52,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 41 conjunts are in the unsatisfiable core [2019-11-15 20:02:52,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:02:52,047 INFO L375 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-15 20:02:52,047 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:02:52,053 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:02:52,054 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:02:52,054 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-15 20:02:52,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:02:52,086 INFO L375 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-15 20:02:52,086 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:02:52,094 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:02:52,094 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:02:52,095 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2019-11-15 20:02:52,157 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:02:52,166 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:02:52,167 INFO L375 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-15 20:02:52,167 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:02:52,190 INFO L567 ElimStorePlain]: treesize reduction 24, result has 60.7 percent of original size [2019-11-15 20:02:52,190 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:02:52,191 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2019-11-15 20:02:52,273 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:02:52,306 INFO L341 Elim1Store]: treesize reduction 10, result has 87.7 percent of original size [2019-11-15 20:02:52,306 INFO L375 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-15 20:02:52,307 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:02:52,345 INFO L567 ElimStorePlain]: treesize reduction 54, result has 47.6 percent of original size [2019-11-15 20:02:52,346 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:02:52,346 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:49 [2019-11-15 20:02:52,527 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:02:52,551 INFO L341 Elim1Store]: treesize reduction 32, result has 56.2 percent of original size [2019-11-15 20:02:52,551 INFO L375 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 69 treesize of output 101 [2019-11-15 20:02:52,554 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:02:52,584 INFO L567 ElimStorePlain]: treesize reduction 80, result has 44.1 percent of original size [2019-11-15 20:02:52,584 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-15 20:02:52,584 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:80, output treesize:63 [2019-11-15 20:02:52,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:02:52,755 INFO L341 Elim1Store]: treesize reduction 32, result has 75.2 percent of original size [2019-11-15 20:02:52,756 INFO L375 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 88 treesize of output 171 [2019-11-15 20:02:52,757 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:02:52,799 INFO L567 ElimStorePlain]: treesize reduction 134, result has 36.2 percent of original size [2019-11-15 20:02:52,800 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-15 20:02:52,801 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:99, output treesize:76 [2019-11-15 20:02:52,950 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:02:53,022 INFO L341 Elim1Store]: treesize reduction 32, result has 75.2 percent of original size [2019-11-15 20:02:53,023 INFO L375 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 90 treesize of output 173 [2019-11-15 20:02:53,024 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:02:53,058 INFO L567 ElimStorePlain]: treesize reduction 40, result has 62.3 percent of original size [2019-11-15 20:02:53,059 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-15 20:02:53,059 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:66 [2019-11-15 20:02:53,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:02:53,180 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:02:53,180 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:02:53,180 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 35 [2019-11-15 20:02:53,180 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065549366] [2019-11-15 20:02:53,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-11-15 20:02:53,181 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:02:53,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-11-15 20:02:53,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1082, Unknown=0, NotChecked=0, Total=1190 [2019-11-15 20:02:53,191 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 35 states. [2019-11-15 20:02:54,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:02:54,499 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2019-11-15 20:02:54,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-15 20:02:54,500 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 24 [2019-11-15 20:02:54,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:02:54,501 INFO L225 Difference]: With dead ends: 60 [2019-11-15 20:02:54,501 INFO L226 Difference]: Without dead ends: 44 [2019-11-15 20:02:54,502 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=248, Invalid=2302, Unknown=0, NotChecked=0, Total=2550 [2019-11-15 20:02:54,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-15 20:02:54,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 33. [2019-11-15 20:02:54,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-15 20:02:54,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2019-11-15 20:02:54,508 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 24 [2019-11-15 20:02:54,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:02:54,508 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2019-11-15 20:02:54,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-11-15 20:02:54,509 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2019-11-15 20:02:54,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 20:02:54,510 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:02:54,510 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:02:54,719 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:02:54,720 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:02:54,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:02:54,720 INFO L82 PathProgramCache]: Analyzing trace with hash -426309664, now seen corresponding path program 1 times [2019-11-15 20:02:54,720 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:02:54,720 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299996722] [2019-11-15 20:02:54,720 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:02:54,720 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:02:54,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:02:54,729 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 20:02:54,729 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1463963120] [2019-11-15 20:02:54,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/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-15 20:02:54,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:02:54,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-15 20:02:54,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:02:54,802 INFO L375 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-15 20:02:54,802 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:02:54,808 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:02:54,808 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:02:54,808 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-11-15 20:02:54,838 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:02:54,838 INFO L375 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 25 treesize of output 54 [2019-11-15 20:02:54,839 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:02:54,855 INFO L567 ElimStorePlain]: treesize reduction 30, result has 49.2 percent of original size [2019-11-15 20:02:54,855 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-15 20:02:54,856 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:29 [2019-11-15 20:02:54,913 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:02:54,929 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:02:54,929 INFO L375 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 46 treesize of output 91 [2019-11-15 20:02:54,930 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:02:54,956 INFO L567 ElimStorePlain]: treesize reduction 46, result has 41.0 percent of original size [2019-11-15 20:02:54,957 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-15 20:02:54,957 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:57, output treesize:27 [2019-11-15 20:02:55,021 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:02:55,021 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 24 [2019-11-15 20:02:55,022 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:02:55,036 INFO L567 ElimStorePlain]: treesize reduction 14, result has 33.3 percent of original size [2019-11-15 20:02:55,036 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:02:55,036 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:3 [2019-11-15 20:02:55,058 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 20:02:55,058 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299996722] [2019-11-15 20:02:55,058 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 20:02:55,058 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463963120] [2019-11-15 20:02:55,059 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:02:55,059 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-11-15 20:02:55,059 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301502896] [2019-11-15 20:02:55,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 20:02:55,060 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:02:55,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 20:02:55,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-15 20:02:55,060 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 11 states. [2019-11-15 20:02:55,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:02:55,310 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2019-11-15 20:02:55,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 20:02:55,310 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-11-15 20:02:55,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:02:55,311 INFO L225 Difference]: With dead ends: 46 [2019-11-15 20:02:55,311 INFO L226 Difference]: Without dead ends: 37 [2019-11-15 20:02:55,311 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-11-15 20:02:55,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-15 20:02:55,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-11-15 20:02:55,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-15 20:02:55,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2019-11-15 20:02:55,318 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 24 [2019-11-15 20:02:55,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:02:55,318 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-11-15 20:02:55,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 20:02:55,318 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2019-11-15 20:02:55,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 20:02:55,319 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:02:55,319 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:02:55,519 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:02:55,520 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:02:55,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:02:55,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1700299324, now seen corresponding path program 8 times [2019-11-15 20:02:55,520 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:02:55,520 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841431913] [2019-11-15 20:02:55,520 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:02:55,520 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:02:55,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:02:55,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:02:55,613 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:02:55,614 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841431913] [2019-11-15 20:02:55,614 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063862062] [2019-11-15 20:02:55,614 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/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-15 20:02:55,677 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 20:02:55,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:02:55,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 20:02:55,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:02:55,755 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:02:55,755 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:02:55,756 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2019-11-15 20:02:55,756 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795916524] [2019-11-15 20:02:55,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 20:02:55,756 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:02:55,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 20:02:55,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2019-11-15 20:02:55,757 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 16 states. [2019-11-15 20:02:55,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:02:55,974 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2019-11-15 20:02:55,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 20:02:55,974 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-11-15 20:02:55,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:02:55,975 INFO L225 Difference]: With dead ends: 47 [2019-11-15 20:02:55,975 INFO L226 Difference]: Without dead ends: 43 [2019-11-15 20:02:55,976 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2019-11-15 20:02:55,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-15 20:02:55,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 33. [2019-11-15 20:02:55,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-15 20:02:55,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2019-11-15 20:02:55,982 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 26 [2019-11-15 20:02:55,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:02:55,983 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-11-15 20:02:55,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 20:02:55,983 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2019-11-15 20:02:55,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 20:02:55,983 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:02:55,984 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:02:56,184 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:02:56,184 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:02:56,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:02:56,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1307941697, now seen corresponding path program 9 times [2019-11-15 20:02:56,185 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:02:56,185 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652304115] [2019-11-15 20:02:56,185 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:02:56,185 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:02:56,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:02:56,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:02:56,284 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:02:56,285 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652304115] [2019-11-15 20:02:56,285 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897357932] [2019-11-15 20:02:56,285 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/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-15 20:02:56,350 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-15 20:02:56,350 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:02:56,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 20:02:56,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:02:56,438 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:02:56,438 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:02:56,438 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2019-11-15 20:02:56,438 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407160093] [2019-11-15 20:02:56,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 20:02:56,439 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:02:56,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 20:02:56,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-11-15 20:02:56,439 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 16 states. [2019-11-15 20:02:56,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:02:56,590 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2019-11-15 20:02:56,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 20:02:56,590 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-11-15 20:02:56,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:02:56,591 INFO L225 Difference]: With dead ends: 51 [2019-11-15 20:02:56,591 INFO L226 Difference]: Without dead ends: 33 [2019-11-15 20:02:56,592 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2019-11-15 20:02:56,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-15 20:02:56,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2019-11-15 20:02:56,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-15 20:02:56,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-11-15 20:02:56,604 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 27 [2019-11-15 20:02:56,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:02:56,606 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-11-15 20:02:56,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 20:02:56,606 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-11-15 20:02:56,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 20:02:56,611 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:02:56,611 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:02:56,815 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:02:56,815 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:02:56,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:02:56,816 INFO L82 PathProgramCache]: Analyzing trace with hash 311885347, now seen corresponding path program 10 times [2019-11-15 20:02:56,816 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:02:56,816 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707563519] [2019-11-15 20:02:56,818 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:02:56,818 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:02:56,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:02:56,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:02:57,704 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:02:57,707 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707563519] [2019-11-15 20:02:57,707 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103460099] [2019-11-15 20:02:57,708 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/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-15 20:02:57,779 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 20:02:57,780 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:02:57,781 WARN L254 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 49 conjunts are in the unsatisfiable core [2019-11-15 20:02:57,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:02:57,798 INFO L375 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-15 20:02:57,798 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:02:57,818 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:02:57,818 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:02:57,818 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-15 20:02:57,857 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:02:57,858 INFO L375 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-15 20:02:57,858 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:02:57,868 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:02:57,868 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:02:57,868 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2019-11-15 20:02:57,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:02:58,002 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:02:58,002 INFO L375 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-15 20:02:58,003 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:02:58,034 INFO L567 ElimStorePlain]: treesize reduction 36, result has 56.1 percent of original size [2019-11-15 20:02:58,035 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-15 20:02:58,035 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:46 [2019-11-15 20:02:58,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:02:58,163 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:02:58,163 INFO L375 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-15 20:02:58,164 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:02:58,211 INFO L567 ElimStorePlain]: treesize reduction 72, result has 46.3 percent of original size [2019-11-15 20:02:58,212 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-15 20:02:58,212 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:66, output treesize:62 [2019-11-15 20:02:58,348 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:02:58,424 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:02:58,425 INFO L375 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-15 20:02:58,426 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:02:58,515 INFO L567 ElimStorePlain]: treesize reduction 108, result has 41.9 percent of original size [2019-11-15 20:02:58,516 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-15 20:02:58,516 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:82, output treesize:78 [2019-11-15 20:02:58,976 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:02:59,019 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:02:59,020 INFO L375 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 88 treesize of output 243 [2019-11-15 20:02:59,021 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:02:59,088 INFO L567 ElimStorePlain]: treesize reduction 176, result has 36.7 percent of original size [2019-11-15 20:02:59,090 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-15 20:02:59,090 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:119, output treesize:102 [2019-11-15 20:02:59,327 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:02:59,399 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:02:59,399 INFO L375 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 107 treesize of output 337 [2019-11-15 20:02:59,402 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:02:59,493 INFO L567 ElimStorePlain]: treesize reduction 312, result has 27.8 percent of original size [2019-11-15 20:02:59,494 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-15 20:02:59,494 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:143, output treesize:120 [2019-11-15 20:02:59,832 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:02:59,948 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-11-15 20:02:59,949 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:02:59,949 INFO L375 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 120 treesize of output 449 [2019-11-15 20:02:59,951 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:03:00,079 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 68 [2019-11-15 20:03:00,079 INFO L567 ElimStorePlain]: treesize reduction 272, result has 33.3 percent of original size [2019-11-15 20:03:00,080 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-15 20:03:00,080 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:161, output treesize:136 [2019-11-15 20:03:00,527 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:03:00,703 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 147 [2019-11-15 20:03:00,703 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:03:00,704 INFO L375 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 131 treesize of output 575 [2019-11-15 20:03:00,708 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:03:00,823 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 59 [2019-11-15 20:03:00,823 INFO L567 ElimStorePlain]: treesize reduction 500, result has 16.8 percent of original size [2019-11-15 20:03:00,950 INFO L496 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-11-15 20:03:00,951 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 11 variables, input treesize:180, output treesize:83 [2019-11-15 20:03:01,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:03:01,112 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:03:01,112 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:03:01,112 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 47 [2019-11-15 20:03:01,112 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929602622] [2019-11-15 20:03:01,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-11-15 20:03:01,113 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:03:01,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-11-15 20:03:01,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2011, Unknown=0, NotChecked=0, Total=2162 [2019-11-15 20:03:01,114 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 47 states. [2019-11-15 20:03:03,051 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2019-11-15 20:03:04,051 WARN L191 SmtUtils]: Spent 903.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2019-11-15 20:03:04,550 WARN L191 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-11-15 20:03:06,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:03:06,340 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2019-11-15 20:03:06,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-15 20:03:06,340 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 29 [2019-11-15 20:03:06,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:03:06,341 INFO L225 Difference]: With dead ends: 65 [2019-11-15 20:03:06,341 INFO L226 Difference]: Without dead ends: 48 [2019-11-15 20:03:06,343 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=374, Invalid=4318, Unknown=0, NotChecked=0, Total=4692 [2019-11-15 20:03:06,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-15 20:03:06,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2019-11-15 20:03:06,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-15 20:03:06,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2019-11-15 20:03:06,352 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 29 [2019-11-15 20:03:06,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:03:06,352 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2019-11-15 20:03:06,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-11-15 20:03:06,353 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2019-11-15 20:03:06,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 20:03:06,353 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:03:06,354 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:03:06,557 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:03:06,557 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:03:06,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:03:06,557 INFO L82 PathProgramCache]: Analyzing trace with hash 879440005, now seen corresponding path program 11 times [2019-11-15 20:03:06,557 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:03:06,557 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297672699] [2019-11-15 20:03:06,557 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:03:06,558 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:03:06,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:03:06,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:03:06,687 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:03:06,688 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297672699] [2019-11-15 20:03:06,688 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140179870] [2019-11-15 20:03:06,688 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/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-15 20:03:06,790 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-15 20:03:06,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:03:06,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 20:03:06,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:03:06,885 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:03:06,885 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:03:06,885 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2019-11-15 20:03:06,886 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963967093] [2019-11-15 20:03:06,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-15 20:03:06,886 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:03:06,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-15 20:03:06,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-11-15 20:03:06,887 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 19 states. [2019-11-15 20:03:07,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:03:07,295 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2019-11-15 20:03:07,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 20:03:07,295 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2019-11-15 20:03:07,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:03:07,296 INFO L225 Difference]: With dead ends: 55 [2019-11-15 20:03:07,296 INFO L226 Difference]: Without dead ends: 51 [2019-11-15 20:03:07,297 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=198, Invalid=614, Unknown=0, NotChecked=0, Total=812 [2019-11-15 20:03:07,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-15 20:03:07,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2019-11-15 20:03:07,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-15 20:03:07,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2019-11-15 20:03:07,314 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 31 [2019-11-15 20:03:07,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:03:07,314 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2019-11-15 20:03:07,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-15 20:03:07,314 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2019-11-15 20:03:07,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 20:03:07,320 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:03:07,320 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:03:07,524 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:03:07,524 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:03:07,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:03:07,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1393842980, now seen corresponding path program 12 times [2019-11-15 20:03:07,524 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:03:07,524 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768612682] [2019-11-15 20:03:07,525 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:03:07,525 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:03:07,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:03:07,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:03:07,610 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:03:07,610 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768612682] [2019-11-15 20:03:07,611 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110419532] [2019-11-15 20:03:07,611 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/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-15 20:03:07,670 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-11-15 20:03:07,670 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:03:07,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 20:03:07,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:03:07,761 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:03:07,761 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:03:07,761 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2019-11-15 20:03:07,761 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986735420] [2019-11-15 20:03:07,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-15 20:03:07,762 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:03:07,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-15 20:03:07,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-11-15 20:03:07,762 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 19 states. [2019-11-15 20:03:07,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:03:07,938 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2019-11-15 20:03:07,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 20:03:07,938 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2019-11-15 20:03:07,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:03:07,939 INFO L225 Difference]: With dead ends: 59 [2019-11-15 20:03:07,939 INFO L226 Difference]: Without dead ends: 38 [2019-11-15 20:03:07,939 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2019-11-15 20:03:07,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-15 20:03:07,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2019-11-15 20:03:07,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-15 20:03:07,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2019-11-15 20:03:07,945 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 32 [2019-11-15 20:03:07,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:03:07,945 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2019-11-15 20:03:07,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-15 20:03:07,946 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2019-11-15 20:03:07,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-15 20:03:07,946 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:03:07,946 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:03:08,147 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:03:08,147 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:03:08,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:03:08,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1635696442, now seen corresponding path program 13 times [2019-11-15 20:03:08,147 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:03:08,147 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083625709] [2019-11-15 20:03:08,147 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:03:08,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:03:08,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:03:08,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:03:09,177 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:03:09,177 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083625709] [2019-11-15 20:03:09,177 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053222923] [2019-11-15 20:03:09,177 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/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-15 20:03:09,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:03:09,231 WARN L254 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 57 conjunts are in the unsatisfiable core [2019-11-15 20:03:09,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:03:09,237 INFO L375 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-15 20:03:09,237 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:03:09,243 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:03:09,243 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:03:09,243 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-15 20:03:09,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:03:09,280 INFO L375 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-15 20:03:09,281 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:03:09,295 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:03:09,296 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:03:09,296 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2019-11-15 20:03:09,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:03:09,489 INFO L341 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2019-11-15 20:03:09,489 INFO L375 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 35 treesize of output 37 [2019-11-15 20:03:09,490 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:03:09,499 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:03:09,500 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:03:09,500 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:42 [2019-11-15 20:03:09,585 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:03:09,640 INFO L341 Elim1Store]: treesize reduction 10, result has 87.7 percent of original size [2019-11-15 20:03:09,641 INFO L375 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-15 20:03:09,641 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:03:09,673 INFO L567 ElimStorePlain]: treesize reduction 54, result has 46.0 percent of original size [2019-11-15 20:03:09,673 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:03:09,673 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2019-11-15 20:03:09,776 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:03:09,830 INFO L341 Elim1Store]: treesize reduction 32, result has 77.5 percent of original size [2019-11-15 20:03:09,830 INFO L375 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-15 20:03:09,831 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:03:09,872 INFO L567 ElimStorePlain]: treesize reduction 84, result has 39.6 percent of original size [2019-11-15 20:03:09,873 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:03:09,873 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:55 [2019-11-15 20:03:09,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:03:10,087 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 41 [2019-11-15 20:03:10,087 INFO L341 Elim1Store]: treesize reduction 114, result has 51.7 percent of original size [2019-11-15 20:03:10,088 INFO L375 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 60 treesize of output 155 [2019-11-15 20:03:10,088 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:03:10,139 INFO L567 ElimStorePlain]: treesize reduction 84, result has 45.5 percent of original size [2019-11-15 20:03:10,139 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:03:10,140 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:74, output treesize:70 [2019-11-15 20:03:10,491 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:03:10,570 INFO L341 Elim1Store]: treesize reduction 112, result has 38.1 percent of original size [2019-11-15 20:03:10,571 INFO L375 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 87 treesize of output 153 [2019-11-15 20:03:10,572 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:03:10,634 INFO L567 ElimStorePlain]: treesize reduction 36, result has 67.0 percent of original size [2019-11-15 20:03:10,635 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-15 20:03:10,635 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:98, output treesize:73 [2019-11-15 20:03:11,182 WARN L191 SmtUtils]: Spent 477.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-11-15 20:03:11,834 WARN L191 SmtUtils]: Spent 575.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-15 20:03:11,846 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:03:12,016 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 67 [2019-11-15 20:03:12,017 INFO L341 Elim1Store]: treesize reduction 112, result has 57.7 percent of original size [2019-11-15 20:03:12,017 INFO L375 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 98 treesize of output 251 [2019-11-15 20:03:12,019 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:03:12,108 INFO L567 ElimStorePlain]: treesize reduction 152, result has 35.6 percent of original size [2019-11-15 20:03:12,108 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-15 20:03:12,108 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:109, output treesize:84 [2019-11-15 20:03:13,220 WARN L191 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-11-15 20:03:13,885 WARN L191 SmtUtils]: Spent 608.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-15 20:03:13,901 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:03:14,039 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 67 [2019-11-15 20:03:14,039 INFO L341 Elim1Store]: treesize reduction 112, result has 57.7 percent of original size [2019-11-15 20:03:14,040 INFO L375 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 98 treesize of output 251 [2019-11-15 20:03:14,041 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:03:14,136 INFO L567 ElimStorePlain]: treesize reduction 192, result has 30.4 percent of original size [2019-11-15 20:03:14,137 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-15 20:03:14,137 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:109, output treesize:84 [2019-11-15 20:03:15,205 WARN L191 SmtUtils]: Spent 966.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-11-15 20:03:17,037 WARN L191 SmtUtils]: Spent 1.75 s on a formula simplification that was a NOOP. DAG size: 47 [2019-11-15 20:03:17,042 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:03:17,154 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 67 [2019-11-15 20:03:17,154 INFO L341 Elim1Store]: treesize reduction 112, result has 57.7 percent of original size [2019-11-15 20:03:17,154 INFO L375 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 98 treesize of output 251 [2019-11-15 20:03:17,156 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:03:17,220 INFO L567 ElimStorePlain]: treesize reduction 256, result has 26.9 percent of original size [2019-11-15 20:03:17,221 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-15 20:03:17,221 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:109, output treesize:94 [2019-11-15 20:03:17,438 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:03:17,644 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 67 [2019-11-15 20:03:17,644 INFO L341 Elim1Store]: treesize reduction 112, result has 57.7 percent of original size [2019-11-15 20:03:17,644 INFO L375 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 108 treesize of output 253 [2019-11-15 20:03:17,646 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:03:17,717 INFO L567 ElimStorePlain]: treesize reduction 314, result has 25.8 percent of original size [2019-11-15 20:03:17,718 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-15 20:03:17,718 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:119, output treesize:109 [2019-11-15 20:03:17,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:03:17,875 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:03:17,875 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:03:17,875 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 25] total 51 [2019-11-15 20:03:17,875 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770382337] [2019-11-15 20:03:17,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-11-15 20:03:17,876 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:03:17,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-11-15 20:03:17,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2392, Unknown=0, NotChecked=0, Total=2550 [2019-11-15 20:03:17,877 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand 51 states. [2019-11-15 20:03:20,157 WARN L191 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-11-15 20:03:21,618 WARN L191 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-11-15 20:03:22,749 WARN L191 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-11-15 20:03:24,475 WARN L191 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-11-15 20:03:26,014 WARN L191 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2019-11-15 20:03:26,345 WARN L191 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 50 [2019-11-15 20:03:27,805 WARN L191 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2019-11-15 20:03:28,818 WARN L191 SmtUtils]: Spent 944.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2019-11-15 20:03:29,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:03:29,445 INFO L93 Difference]: Finished difference Result 84 states and 100 transitions. [2019-11-15 20:03:29,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-15 20:03:29,445 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 34 [2019-11-15 20:03:29,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:03:29,446 INFO L225 Difference]: With dead ends: 84 [2019-11-15 20:03:29,446 INFO L226 Difference]: Without dead ends: 62 [2019-11-15 20:03:29,447 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1445 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=363, Invalid=5187, Unknown=0, NotChecked=0, Total=5550 [2019-11-15 20:03:29,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-15 20:03:29,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 49. [2019-11-15 20:03:29,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-15 20:03:29,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2019-11-15 20:03:29,457 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 34 [2019-11-15 20:03:29,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:03:29,457 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2019-11-15 20:03:29,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-11-15 20:03:29,458 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2019-11-15 20:03:29,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-15 20:03:29,458 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:03:29,458 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:03:29,661 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:03:29,661 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:03:29,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:03:29,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1979212484, now seen corresponding path program 2 times [2019-11-15 20:03:29,661 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:03:29,662 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911018387] [2019-11-15 20:03:29,662 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:03:29,662 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:03:29,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:03:29,668 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 20:03:29,668 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2096708468] [2019-11-15 20:03:29,668 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/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-15 20:03:29,734 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 20:03:29,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:03:29,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-15 20:03:29,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:03:29,771 INFO L375 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-15 20:03:29,771 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:03:29,777 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:03:29,778 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:03:29,778 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2019-11-15 20:03:29,815 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:03:29,815 INFO L375 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-15 20:03:29,816 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:03:29,830 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:03:29,831 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-15 20:03:29,831 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2019-11-15 20:03:29,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:03:29,892 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:03:29,893 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:03:29,894 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:03:29,894 INFO L375 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 46 treesize of output 47 [2019-11-15 20:03:29,895 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:03:29,904 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:03:29,905 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-15 20:03:29,905 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:35 [2019-11-15 20:03:29,945 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:03:29,946 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:03:29,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:03:29,948 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:03:29,948 INFO L375 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 46 treesize of output 47 [2019-11-15 20:03:29,949 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:03:29,962 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:03:29,963 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-15 20:03:29,963 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:35 [2019-11-15 20:03:29,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:03:30,001 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:03:30,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:03:30,004 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:03:30,005 INFO L375 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 46 treesize of output 47 [2019-11-15 20:03:30,006 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:03:30,017 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:03:30,018 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-15 20:03:30,018 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:30 [2019-11-15 20:03:30,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:03:30,072 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:03:30,072 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2019-11-15 20:03:30,072 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:03:30,075 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:03:30,076 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-15 20:03:30,076 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:3 [2019-11-15 20:03:30,093 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 18 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 20:03:30,093 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911018387] [2019-11-15 20:03:30,093 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 20:03:30,093 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096708468] [2019-11-15 20:03:30,094 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:03:30,094 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-11-15 20:03:30,094 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873759064] [2019-11-15 20:03:30,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-15 20:03:30,094 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:03:30,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 20:03:30,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-11-15 20:03:30,095 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 15 states. [2019-11-15 20:03:31,381 WARN L191 SmtUtils]: Spent 790.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 27 [2019-11-15 20:03:31,724 WARN L191 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-11-15 20:03:31,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:03:31,778 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2019-11-15 20:03:31,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 20:03:31,779 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2019-11-15 20:03:31,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:03:31,779 INFO L225 Difference]: With dead ends: 62 [2019-11-15 20:03:31,779 INFO L226 Difference]: Without dead ends: 53 [2019-11-15 20:03:31,780 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2019-11-15 20:03:31,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-15 20:03:31,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-11-15 20:03:31,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-15 20:03:31,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2019-11-15 20:03:31,790 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 34 [2019-11-15 20:03:31,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:03:31,790 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2019-11-15 20:03:31,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-15 20:03:31,790 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2019-11-15 20:03:31,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-15 20:03:31,791 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:03:31,791 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:03:31,993 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:03:31,994 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:03:31,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:03:31,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1893861880, now seen corresponding path program 3 times [2019-11-15 20:03:31,994 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:03:31,994 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241321516] [2019-11-15 20:03:31,994 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:03:31,994 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:03:31,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:03:32,001 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 20:03:32,001 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [106231234] [2019-11-15 20:03:32,001 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/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-15 20:03:32,111 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-11-15 20:03:32,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:03:32,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-15 20:03:32,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:03:32,163 INFO L375 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-15 20:03:32,164 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:03:32,169 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:03:32,169 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:03:32,169 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-11-15 20:03:32,191 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:03:32,191 INFO L375 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 25 treesize of output 54 [2019-11-15 20:03:32,192 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:03:32,210 INFO L567 ElimStorePlain]: treesize reduction 30, result has 49.2 percent of original size [2019-11-15 20:03:32,210 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:03:32,210 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-11-15 20:03:32,268 INFO L341 Elim1Store]: treesize reduction 54, result has 49.1 percent of original size [2019-11-15 20:03:32,268 INFO L375 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 37 treesize of output 69 [2019-11-15 20:03:32,268 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:03:32,290 INFO L567 ElimStorePlain]: treesize reduction 30, result has 57.7 percent of original size [2019-11-15 20:03:32,290 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:03:32,290 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2019-11-15 20:03:48,476 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:03:48,477 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:03:48,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:03:48,498 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:03:48,498 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 124 [2019-11-15 20:03:48,499 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:03:48,531 INFO L567 ElimStorePlain]: treesize reduction 90, result has 35.3 percent of original size [2019-11-15 20:03:48,532 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-15 20:03:48,532 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:74, output treesize:49 [2019-11-15 20:03:50,578 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:03:50,581 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:03:50,584 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:03:50,601 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:03:50,602 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 124 [2019-11-15 20:03:50,602 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:03:50,633 INFO L567 ElimStorePlain]: treesize reduction 112, result has 30.4 percent of original size [2019-11-15 20:03:50,634 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-15 20:03:50,634 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:74, output treesize:44 [2019-11-15 20:03:50,699 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:03:50,701 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:03:50,717 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:03:50,717 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 37 treesize of output 64 [2019-11-15 20:03:50,718 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:03:50,722 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:03:50,723 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-15 20:03:50,723 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:7 [2019-11-15 20:03:50,742 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 26 proven. 27 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-15 20:03:50,742 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241321516] [2019-11-15 20:03:50,742 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 20:03:50,743 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106231234] [2019-11-15 20:03:50,743 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:03:50,743 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-11-15 20:03:50,743 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714235215] [2019-11-15 20:03:50,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 20:03:50,743 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:03:50,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 20:03:50,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=187, Unknown=9, NotChecked=0, Total=240 [2019-11-15 20:03:50,744 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 16 states. [2019-11-15 20:03:57,054 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 35 [2019-11-15 20:04:03,117 WARN L191 SmtUtils]: Spent 4.03 s on a formula simplification that was a NOOP. DAG size: 39 [2019-11-15 20:04:09,985 WARN L191 SmtUtils]: Spent 4.02 s on a formula simplification that was a NOOP. DAG size: 36 [2019-11-15 20:04:18,065 WARN L191 SmtUtils]: Spent 4.02 s on a formula simplification that was a NOOP. DAG size: 36 [2019-11-15 20:04:28,668 WARN L191 SmtUtils]: Spent 8.04 s on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-11-15 20:04:37,115 WARN L191 SmtUtils]: Spent 8.04 s on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2019-11-15 20:04:53,625 WARN L191 SmtUtils]: Spent 4.02 s on a formula simplification that was a NOOP. DAG size: 35 [2019-11-15 20:05:03,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:05:03,675 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2019-11-15 20:05:03,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 20:05:03,679 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2019-11-15 20:05:03,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:05:03,680 INFO L225 Difference]: With dead ends: 65 [2019-11-15 20:05:03,680 INFO L226 Difference]: Without dead ends: 53 [2019-11-15 20:05:03,680 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 73.5s TimeCoverageRelationStatistics Valid=117, Invalid=462, Unknown=21, NotChecked=0, Total=600 [2019-11-15 20:05:03,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-15 20:05:03,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-11-15 20:05:03,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-15 20:05:03,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2019-11-15 20:05:03,691 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 34 [2019-11-15 20:05:03,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:05:03,691 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2019-11-15 20:05:03,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 20:05:03,692 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2019-11-15 20:05:03,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 20:05:03,692 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:05:03,692 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:05:03,893 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:05:03,893 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:05:03,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:05:03,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1035254296, now seen corresponding path program 14 times [2019-11-15 20:05:03,893 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:05:03,893 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132017213] [2019-11-15 20:05:03,894 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:03,894 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:03,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:05:03,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:04,043 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 16 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:05:04,043 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132017213] [2019-11-15 20:05:04,043 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733777348] [2019-11-15 20:05:04,043 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/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-15 20:05:04,126 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 20:05:04,126 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:05:04,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 20:05:04,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:05:04,219 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 25 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:05:04,219 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:05:04,219 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2019-11-15 20:05:04,220 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135515533] [2019-11-15 20:05:04,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-15 20:05:04,220 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:05:04,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-15 20:05:04,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-11-15 20:05:04,221 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 22 states. [2019-11-15 20:05:04,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:05:04,634 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2019-11-15 20:05:04,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-15 20:05:04,634 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 36 [2019-11-15 20:05:04,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:05:04,635 INFO L225 Difference]: With dead ends: 63 [2019-11-15 20:05:04,635 INFO L226 Difference]: Without dead ends: 59 [2019-11-15 20:05:04,636 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=265, Invalid=857, Unknown=0, NotChecked=0, Total=1122 [2019-11-15 20:05:04,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-15 20:05:04,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 43. [2019-11-15 20:05:04,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-15 20:05:04,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2019-11-15 20:05:04,648 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 36 [2019-11-15 20:05:04,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:05:04,648 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2019-11-15 20:05:04,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-15 20:05:04,648 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2019-11-15 20:05:04,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-15 20:05:04,649 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:05:04,649 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:05:04,852 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:05:04,852 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:05:04,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:05:04,852 INFO L82 PathProgramCache]: Analyzing trace with hash -127223707, now seen corresponding path program 15 times [2019-11-15 20:05:04,852 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:05:04,852 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21651248] [2019-11-15 20:05:04,853 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:04,853 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:04,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:05:04,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:04,980 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 38 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:05:04,981 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21651248] [2019-11-15 20:05:04,981 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777518013] [2019-11-15 20:05:04,981 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/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-15 20:05:05,089 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-11-15 20:05:05,089 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:05:05,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 20:05:05,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:05:05,227 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 51 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:05:05,227 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:05:05,227 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2019-11-15 20:05:05,227 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802716506] [2019-11-15 20:05:05,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-15 20:05:05,228 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:05:05,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-15 20:05:05,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2019-11-15 20:05:05,228 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 22 states. [2019-11-15 20:05:05,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:05:05,533 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2019-11-15 20:05:05,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 20:05:05,533 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 37 [2019-11-15 20:05:05,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:05:05,534 INFO L225 Difference]: With dead ends: 67 [2019-11-15 20:05:05,534 INFO L226 Difference]: Without dead ends: 43 [2019-11-15 20:05:05,535 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-11-15 20:05:05,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-15 20:05:05,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2019-11-15 20:05:05,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-15 20:05:05,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-11-15 20:05:05,547 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 37 [2019-11-15 20:05:05,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:05:05,547 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-11-15 20:05:05,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-15 20:05:05,548 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-11-15 20:05:05,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 20:05:05,550 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:05:05,550 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:05:05,754 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:05:05,754 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:05:05,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:05:05,754 INFO L82 PathProgramCache]: Analyzing trace with hash 639592647, now seen corresponding path program 16 times [2019-11-15 20:05:05,754 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:05:05,754 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322022071] [2019-11-15 20:05:05,755 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:05,755 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:05:05,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:05:05,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:05:06,902 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:05:06,902 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322022071] [2019-11-15 20:05:06,902 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642649273] [2019-11-15 20:05:06,903 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/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-15 20:05:06,996 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 20:05:06,996 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:05:06,998 WARN L254 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 65 conjunts are in the unsatisfiable core [2019-11-15 20:05:06,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:05:07,004 INFO L375 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-15 20:05:07,004 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:05:07,010 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:05:07,011 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:05:07,011 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-15 20:05:07,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:05:07,054 INFO L375 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-15 20:05:07,054 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:05:07,065 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:05:07,065 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:05:07,065 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2019-11-15 20:05:07,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:05:07,174 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:05:07,174 INFO L375 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-15 20:05:07,175 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:05:07,204 INFO L567 ElimStorePlain]: treesize reduction 36, result has 56.1 percent of original size [2019-11-15 20:05:07,204 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-15 20:05:07,205 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:46 [2019-11-15 20:05:07,338 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:05:07,366 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:05:07,366 INFO L375 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-15 20:05:07,367 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:05:07,410 INFO L567 ElimStorePlain]: treesize reduction 72, result has 46.3 percent of original size [2019-11-15 20:05:07,411 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-15 20:05:07,411 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:66, output treesize:62 [2019-11-15 20:05:07,610 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:05:07,660 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:05:07,661 INFO L375 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-15 20:05:07,661 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:05:07,739 INFO L567 ElimStorePlain]: treesize reduction 108, result has 41.9 percent of original size [2019-11-15 20:05:07,739 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-15 20:05:07,739 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:82, output treesize:78 [2019-11-15 20:05:07,905 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:05:07,984 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:05:07,985 INFO L375 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-15 20:05:07,985 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:05:08,065 INFO L567 ElimStorePlain]: treesize reduction 144, result has 39.5 percent of original size [2019-11-15 20:05:08,065 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-15 20:05:08,066 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:98, output treesize:94 [2019-11-15 20:05:08,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:05:08,407 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-11-15 20:05:08,407 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:05:08,407 INFO L375 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-15 20:05:08,408 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:05:08,508 INFO L567 ElimStorePlain]: treesize reduction 180, result has 37.9 percent of original size [2019-11-15 20:05:08,508 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-15 20:05:08,509 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:114, output treesize:110 [2019-11-15 20:05:15,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:05:15,743 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-11-15 20:05:15,743 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:05:15,744 INFO L375 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 110 treesize of output 447 [2019-11-15 20:05:15,745 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:05:15,884 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 66 [2019-11-15 20:05:15,885 INFO L567 ElimStorePlain]: treesize reduction 560, result has 19.3 percent of original size [2019-11-15 20:05:15,885 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-15 20:05:15,885 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:151, output treesize:134 [2019-11-15 20:05:16,225 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:05:16,589 WARN L191 SmtUtils]: Spent 362.00 ms on a formula simplification that was a NOOP. DAG size: 147 [2019-11-15 20:05:16,589 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:05:16,590 INFO L375 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 129 treesize of output 573 [2019-11-15 20:05:16,593 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:05:16,825 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 74 [2019-11-15 20:05:16,825 INFO L567 ElimStorePlain]: treesize reduction 680, result has 19.0 percent of original size [2019-11-15 20:05:16,825 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-15 20:05:16,826 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:175, output treesize:160 [2019-11-15 20:05:17,268 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:05:17,543 WARN L191 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-11-15 20:05:17,543 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:05:17,543 INFO L375 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 150 treesize of output 717 [2019-11-15 20:05:17,546 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:05:17,712 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 82 [2019-11-15 20:05:17,713 INFO L567 ElimStorePlain]: treesize reduction 528, result has 24.1 percent of original size [2019-11-15 20:05:17,713 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2019-11-15 20:05:17,713 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:201, output treesize:168 [2019-11-15 20:05:18,356 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:05:18,727 WARN L191 SmtUtils]: Spent 369.00 ms on a formula simplification that was a NOOP. DAG size: 223 [2019-11-15 20:05:18,727 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:05:18,728 INFO L375 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 153 treesize of output 875 [2019-11-15 20:05:18,733 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:05:19,044 WARN L191 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 240 DAG size of output: 90 [2019-11-15 20:05:19,045 INFO L567 ElimStorePlain]: treesize reduction 1158, result has 13.5 percent of original size [2019-11-15 20:05:19,045 INFO L496 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2019-11-15 20:05:19,045 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 10 variables, input treesize:209, output treesize:180 [2019-11-15 20:05:20,131 WARN L191 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-11-15 20:05:20,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:05:20,692 WARN L191 SmtUtils]: Spent 539.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2019-11-15 20:05:20,692 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:05:20,692 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 1 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 55 case distinctions, treesize of input 160 treesize of output 1049 [2019-11-15 20:05:20,698 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:05:21,033 WARN L191 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 268 DAG size of output: 97 [2019-11-15 20:05:21,033 INFO L567 ElimStorePlain]: treesize reduction 1324, result has 12.9 percent of original size [2019-11-15 20:05:21,034 INFO L496 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-2 vars, End of recursive call: 10 dim-0 vars, and 1 xjuncts. [2019-11-15 20:05:21,034 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 11 variables, input treesize:221, output treesize:196 [2019-11-15 20:05:21,703 WARN L191 SmtUtils]: Spent 494.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-11-15 20:05:23,986 WARN L191 SmtUtils]: Spent 399.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-11-15 20:05:26,661 WARN L191 SmtUtils]: Spent 2.30 s on a formula simplification. DAG size of input: 110 DAG size of output: 108 [2019-11-15 20:05:26,672 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:05:27,408 WARN L191 SmtUtils]: Spent 732.00 ms on a formula simplification that was a NOOP. DAG size: 315 [2019-11-15 20:05:27,408 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:05:27,409 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 1 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 66 case distinctions, treesize of input 164 treesize of output 1236 [2019-11-15 20:05:27,414 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:05:27,756 WARN L191 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 272 DAG size of output: 83 [2019-11-15 20:05:27,757 INFO L567 ElimStorePlain]: treesize reduction 1399, result has 9.9 percent of original size [2019-11-15 20:05:27,973 INFO L496 ElimStorePlain]: Start of recursive call 1: 14 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2019-11-15 20:05:27,973 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 15 variables, input treesize:233, output treesize:130 [2019-11-15 20:05:28,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:05:28,337 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:05:28,338 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:05:28,338 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 35] total 65 [2019-11-15 20:05:28,338 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654343413] [2019-11-15 20:05:28,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-11-15 20:05:28,338 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:05:28,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-11-15 20:05:28,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=3929, Unknown=1, NotChecked=0, Total=4160 [2019-11-15 20:05:28,340 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 65 states. [2019-11-15 20:05:50,027 WARN L191 SmtUtils]: Spent 5.56 s on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-11-15 20:06:30,478 WARN L191 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 99 DAG size of output: 84 [2019-11-15 20:06:52,481 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 87 [2019-11-15 20:07:11,300 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 104 [2019-11-15 20:07:25,923 WARN L191 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 108 DAG size of output: 91 [2019-11-15 20:07:36,742 WARN L191 SmtUtils]: Spent 1.70 s on a formula simplification. DAG size of input: 116 DAG size of output: 100 [2019-11-15 20:07:46,573 WARN L191 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 116 DAG size of output: 105 [2019-11-15 20:08:00,300 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 95 [2019-11-15 20:08:24,802 WARN L191 SmtUtils]: Spent 6.60 s on a formula simplification. DAG size of input: 125 DAG size of output: 105 [2019-11-15 20:08:50,476 WARN L191 SmtUtils]: Spent 7.14 s on a formula simplification. DAG size of input: 125 DAG size of output: 110 [2019-11-15 20:09:11,497 WARN L191 SmtUtils]: Spent 723.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 106 [2019-11-15 20:09:31,250 WARN L191 SmtUtils]: Spent 3.69 s on a formula simplification. DAG size of input: 128 DAG size of output: 120 [2019-11-15 20:10:04,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:10:04,080 INFO L93 Difference]: Finished difference Result 87 states and 99 transitions. [2019-11-15 20:10:04,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-11-15 20:10:04,082 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 39 [2019-11-15 20:10:04,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:10:04,082 INFO L225 Difference]: With dead ends: 87 [2019-11-15 20:10:04,082 INFO L226 Difference]: Without dead ends: 64 [2019-11-15 20:10:04,085 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2187 ImplicationChecksByTransitivity, 63.8s TimeCoverageRelationStatistics Valid=564, Invalid=8746, Unknown=2, NotChecked=0, Total=9312 [2019-11-15 20:10:04,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-15 20:10:04,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2019-11-15 20:10:04,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-15 20:10:04,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2019-11-15 20:10:04,096 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 39 [2019-11-15 20:10:04,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:10:04,097 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2019-11-15 20:10:04,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-11-15 20:10:04,097 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2019-11-15 20:10:04,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-15 20:10:04,097 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:10:04,097 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:10:04,298 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:10:04,298 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:10:04,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:10:04,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1184266071, now seen corresponding path program 17 times [2019-11-15 20:10:04,298 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:10:04,298 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489814669] [2019-11-15 20:10:04,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:04,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:04,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:10:04,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:10:04,467 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 25 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:10:04,467 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489814669] [2019-11-15 20:10:04,467 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064155992] [2019-11-15 20:10:04,467 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/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-15 20:10:04,618 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-11-15 20:10:04,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:10:04,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 20:10:04,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:10:04,734 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:10:04,734 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:10:04,734 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2019-11-15 20:10:04,735 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944326089] [2019-11-15 20:10:04,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-15 20:10:04,735 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:10:04,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-15 20:10:04,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2019-11-15 20:10:04,736 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 25 states. [2019-11-15 20:10:05,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:10:05,263 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2019-11-15 20:10:05,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-15 20:10:05,263 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 41 [2019-11-15 20:10:05,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:10:05,264 INFO L225 Difference]: With dead ends: 71 [2019-11-15 20:10:05,264 INFO L226 Difference]: Without dead ends: 67 [2019-11-15 20:10:05,265 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=342, Invalid=1140, Unknown=0, NotChecked=0, Total=1482 [2019-11-15 20:10:05,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-15 20:10:05,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2019-11-15 20:10:05,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-15 20:10:05,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2019-11-15 20:10:05,273 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 41 [2019-11-15 20:10:05,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:10:05,273 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2019-11-15 20:10:05,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-15 20:10:05,274 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2019-11-15 20:10:05,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-15 20:10:05,274 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:10:05,274 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:10:05,475 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:10:05,475 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:10:05,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:10:05,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1126332488, now seen corresponding path program 18 times [2019-11-15 20:10:05,475 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:10:05,475 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862008436] [2019-11-15 20:10:05,475 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:05,475 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:05,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:10:05,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:10:05,605 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 54 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:10:05,605 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862008436] [2019-11-15 20:10:05,606 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225771808] [2019-11-15 20:10:05,606 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/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-15 20:10:05,721 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-11-15 20:10:05,721 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:10:05,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 20:10:05,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:10:05,840 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 70 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:10:05,840 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:10:05,840 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2019-11-15 20:10:05,840 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175597877] [2019-11-15 20:10:05,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-15 20:10:05,841 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:10:05,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-15 20:10:05,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=451, Unknown=0, NotChecked=0, Total=600 [2019-11-15 20:10:05,841 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 25 states. [2019-11-15 20:10:06,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:10:06,033 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2019-11-15 20:10:06,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 20:10:06,034 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 42 [2019-11-15 20:10:06,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:10:06,034 INFO L225 Difference]: With dead ends: 75 [2019-11-15 20:10:06,034 INFO L226 Difference]: Without dead ends: 48 [2019-11-15 20:10:06,035 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=247, Invalid=745, Unknown=0, NotChecked=0, Total=992 [2019-11-15 20:10:06,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-15 20:10:06,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2019-11-15 20:10:06,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-15 20:10:06,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2019-11-15 20:10:06,041 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 42 [2019-11-15 20:10:06,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:10:06,041 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2019-11-15 20:10:06,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-15 20:10:06,041 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2019-11-15 20:10:06,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 20:10:06,042 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:10:06,042 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:10:06,242 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:10:06,242 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:10:06,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:10:06,243 INFO L82 PathProgramCache]: Analyzing trace with hash -70138730, now seen corresponding path program 19 times [2019-11-15 20:10:06,243 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:10:06,243 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008553878] [2019-11-15 20:10:06,243 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:06,243 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:06,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:10:06,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:10:07,703 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:10:07,704 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008553878] [2019-11-15 20:10:07,704 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632564205] [2019-11-15 20:10:07,704 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/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-15 20:10:07,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:10:07,790 WARN L254 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 73 conjunts are in the unsatisfiable core [2019-11-15 20:10:07,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:10:07,795 INFO L375 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-15 20:10:07,795 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:10:07,801 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:10:07,801 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:10:07,801 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-15 20:10:07,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:07,848 INFO L375 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-15 20:10:07,848 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:10:07,856 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:10:07,856 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:10:07,857 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2019-11-15 20:10:07,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:07,970 INFO L341 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2019-11-15 20:10:07,971 INFO L375 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 35 treesize of output 37 [2019-11-15 20:10:07,971 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:10:07,982 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:10:07,982 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:10:07,982 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:42 [2019-11-15 20:10:08,101 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:08,117 INFO L341 Elim1Store]: treesize reduction 96, result has 20.7 percent of original size [2019-11-15 20:10:08,117 INFO L375 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 47 treesize of output 52 [2019-11-15 20:10:08,117 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:10:08,130 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:10:08,130 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:10:08,131 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:58, output treesize:54 [2019-11-15 20:10:08,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:08,297 INFO L341 Elim1Store]: treesize reduction 171, result has 17.8 percent of original size [2019-11-15 20:10:08,297 INFO L375 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 59 treesize of output 67 [2019-11-15 20:10:08,297 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:10:08,312 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:10:08,312 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:10:08,312 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:70, output treesize:66 [2019-11-15 20:10:08,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:08,546 INFO L341 Elim1Store]: treesize reduction 66, result has 69.3 percent of original size [2019-11-15 20:10:08,546 INFO L375 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-15 20:10:08,547 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:10:08,601 INFO L567 ElimStorePlain]: treesize reduction 114, result has 36.0 percent of original size [2019-11-15 20:10:08,601 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:10:08,601 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:68, output treesize:64 [2019-11-15 20:10:08,750 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:08,870 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 51 [2019-11-15 20:10:08,871 INFO L341 Elim1Store]: treesize reduction 163, result has 49.7 percent of original size [2019-11-15 20:10:08,871 INFO L375 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 69 treesize of output 197 [2019-11-15 20:10:08,871 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:10:08,935 INFO L567 ElimStorePlain]: treesize reduction 114, result has 40.0 percent of original size [2019-11-15 20:10:08,935 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:10:08,935 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:80, output treesize:76 [2019-11-15 20:10:09,095 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:09,228 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 56 [2019-11-15 20:10:09,228 INFO L341 Elim1Store]: treesize reduction 278, result has 38.4 percent of original size [2019-11-15 20:10:09,229 INFO L375 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 81 treesize of output 212 [2019-11-15 20:10:09,229 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:10:09,300 INFO L567 ElimStorePlain]: treesize reduction 114, result has 44.4 percent of original size [2019-11-15 20:10:09,301 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:10:09,301 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:95, output treesize:91 [2019-11-15 20:10:09,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:09,813 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 53 [2019-11-15 20:10:09,813 INFO L341 Elim1Store]: treesize reduction 240, result has 28.8 percent of original size [2019-11-15 20:10:09,814 INFO L375 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 105 treesize of output 205 [2019-11-15 20:10:09,815 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:10:09,897 INFO L567 ElimStorePlain]: treesize reduction 142, result has 40.1 percent of original size [2019-11-15 20:10:09,897 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-15 20:10:09,897 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:116, output treesize:95 [2019-11-15 20:10:10,215 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:10,338 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 53 [2019-11-15 20:10:10,338 INFO L341 Elim1Store]: treesize reduction 240, result has 28.8 percent of original size [2019-11-15 20:10:10,338 INFO L375 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 105 treesize of output 205 [2019-11-15 20:10:10,340 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:10:10,422 INFO L567 ElimStorePlain]: treesize reduction 180, result has 35.9 percent of original size [2019-11-15 20:10:10,423 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-15 20:10:10,423 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:116, output treesize:101 [2019-11-15 20:10:10,750 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:10,999 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 89 [2019-11-15 20:10:10,999 INFO L341 Elim1Store]: treesize reduction 240, result has 46.5 percent of original size [2019-11-15 20:10:11,000 INFO L375 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 126 treesize of output 333 [2019-11-15 20:10:11,001 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:10:11,091 INFO L567 ElimStorePlain]: treesize reduction 368, result has 24.7 percent of original size [2019-11-15 20:10:11,092 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-15 20:10:11,092 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:137, output treesize:121 [2019-11-15 20:10:11,425 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:11,797 WARN L191 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 129 [2019-11-15 20:10:11,797 INFO L341 Elim1Store]: treesize reduction 240, result has 58.4 percent of original size [2019-11-15 20:10:11,797 INFO L375 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 146 treesize of output 476 [2019-11-15 20:10:11,799 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:10:11,900 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 60 [2019-11-15 20:10:11,901 INFO L567 ElimStorePlain]: treesize reduction 228, result has 34.3 percent of original size [2019-11-15 20:10:11,901 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-15 20:10:11,901 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:157, output treesize:119 [2019-11-15 20:10:12,163 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:12,246 INFO L341 Elim1Store]: treesize reduction 240, result has 28.8 percent of original size [2019-11-15 20:10:12,247 INFO L375 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 105 treesize of output 205 [2019-11-15 20:10:12,248 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:10:12,336 INFO L567 ElimStorePlain]: treesize reduction 156, result has 38.3 percent of original size [2019-11-15 20:10:12,336 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-15 20:10:12,336 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:116, output treesize:97 [2019-11-15 20:10:12,939 WARN L191 SmtUtils]: Spent 507.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-15 20:10:13,584 WARN L191 SmtUtils]: Spent 544.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-15 20:10:13,589 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:13,784 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 89 [2019-11-15 20:10:13,784 INFO L341 Elim1Store]: treesize reduction 240, result has 46.5 percent of original size [2019-11-15 20:10:13,784 INFO L375 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 122 treesize of output 333 [2019-11-15 20:10:13,786 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:10:13,876 INFO L567 ElimStorePlain]: treesize reduction 404, result has 23.0 percent of original size [2019-11-15 20:10:13,876 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-15 20:10:13,876 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:133, output treesize:121 [2019-11-15 20:10:14,171 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:14,509 WARN L191 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 129 [2019-11-15 20:10:14,509 INFO L341 Elim1Store]: treesize reduction 240, result has 58.4 percent of original size [2019-11-15 20:10:14,509 INFO L375 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 146 treesize of output 476 [2019-11-15 20:10:14,512 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:10:14,688 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 61 [2019-11-15 20:10:14,689 INFO L567 ElimStorePlain]: treesize reduction 544, result has 20.2 percent of original size [2019-11-15 20:10:14,689 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-15 20:10:14,689 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:157, output treesize:138 [2019-11-15 20:10:14,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:10:14,946 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:10:14,946 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:10:14,946 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 33] total 67 [2019-11-15 20:10:14,946 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088933584] [2019-11-15 20:10:14,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-11-15 20:10:14,946 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:10:14,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-11-15 20:10:14,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=4214, Unknown=0, NotChecked=0, Total=4422 [2019-11-15 20:10:14,948 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 67 states. [2019-11-15 20:10:16,721 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-11-15 20:10:16,899 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-11-15 20:10:17,541 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-11-15 20:10:17,896 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-11-15 20:10:18,183 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-11-15 20:10:18,707 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-11-15 20:10:20,357 WARN L191 SmtUtils]: Spent 611.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 47 [2019-11-15 20:10:21,498 WARN L191 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2019-11-15 20:10:22,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:10:22,480 INFO L93 Difference]: Finished difference Result 106 states and 122 transitions. [2019-11-15 20:10:22,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-11-15 20:10:22,481 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 44 [2019-11-15 20:10:22,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:10:22,481 INFO L225 Difference]: With dead ends: 106 [2019-11-15 20:10:22,481 INFO L226 Difference]: Without dead ends: 78 [2019-11-15 20:10:22,484 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 14 SyntacticMatches, 6 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2599 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=478, Invalid=9223, Unknown=1, NotChecked=0, Total=9702 [2019-11-15 20:10:22,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-15 20:10:22,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 65. [2019-11-15 20:10:22,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-15 20:10:22,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2019-11-15 20:10:22,494 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 44 [2019-11-15 20:10:22,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:10:22,494 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2019-11-15 20:10:22,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-11-15 20:10:22,495 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2019-11-15 20:10:22,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 20:10:22,495 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:10:22,495 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:10:22,695 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:10:22,696 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:10:22,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:10:22,696 INFO L82 PathProgramCache]: Analyzing trace with hash 609919640, now seen corresponding path program 4 times [2019-11-15 20:10:22,696 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:10:22,696 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660386522] [2019-11-15 20:10:22,696 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:22,696 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:22,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:10:22,703 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 20:10:22,703 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1206535420] [2019-11-15 20:10:22,704 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/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-15 20:10:22,893 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 20:10:22,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:10:22,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 44 conjunts are in the unsatisfiable core [2019-11-15 20:10:22,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:10:22,977 INFO L375 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-15 20:10:22,977 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:10:22,985 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:10:22,986 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:10:22,986 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-11-15 20:10:23,045 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:10:23,045 INFO L375 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 25 treesize of output 54 [2019-11-15 20:10:23,046 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:10:23,074 INFO L567 ElimStorePlain]: treesize reduction 30, result has 49.2 percent of original size [2019-11-15 20:10:23,074 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:10:23,074 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-11-15 20:10:23,197 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:23,221 INFO L341 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2019-11-15 20:10:23,221 INFO L375 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 44 treesize of output 73 [2019-11-15 20:10:23,222 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:10:23,249 INFO L567 ElimStorePlain]: treesize reduction 50, result has 37.5 percent of original size [2019-11-15 20:10:23,249 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:10:23,249 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:30 [2019-11-15 20:10:23,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:23,307 INFO L341 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2019-11-15 20:10:23,307 INFO L375 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 44 treesize of output 73 [2019-11-15 20:10:23,307 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:10:23,327 INFO L567 ElimStorePlain]: treesize reduction 50, result has 37.5 percent of original size [2019-11-15 20:10:23,327 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:10:23,328 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:30 [2019-11-15 20:10:23,356 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:23,373 INFO L341 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2019-11-15 20:10:23,373 INFO L375 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 44 treesize of output 73 [2019-11-15 20:10:23,374 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:10:23,392 INFO L567 ElimStorePlain]: treesize reduction 56, result has 34.9 percent of original size [2019-11-15 20:10:23,393 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:10:23,393 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:30 [2019-11-15 20:10:23,430 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:23,448 INFO L341 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2019-11-15 20:10:23,449 INFO L375 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 44 treesize of output 73 [2019-11-15 20:10:23,449 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:10:23,471 INFO L567 ElimStorePlain]: treesize reduction 44, result has 40.5 percent of original size [2019-11-15 20:10:23,472 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:10:23,472 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:30 [2019-11-15 20:10:23,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:23,527 INFO L341 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2019-11-15 20:10:23,527 INFO L375 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 44 treesize of output 73 [2019-11-15 20:10:23,528 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:10:23,551 INFO L567 ElimStorePlain]: treesize reduction 50, result has 37.5 percent of original size [2019-11-15 20:10:23,552 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-15 20:10:23,552 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:25 [2019-11-15 20:10:23,621 INFO L341 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2019-11-15 20:10:23,622 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2019-11-15 20:10:23,622 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:10:23,643 INFO L567 ElimStorePlain]: treesize reduction 25, result has 28.6 percent of original size [2019-11-15 20:10:23,643 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-15 20:10:23,643 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:10 [2019-11-15 20:10:23,671 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 28 proven. 89 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 20:10:23,671 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660386522] [2019-11-15 20:10:23,671 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 20:10:23,671 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206535420] [2019-11-15 20:10:23,671 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:10:23,671 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-11-15 20:10:23,672 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70035549] [2019-11-15 20:10:23,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-15 20:10:23,672 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:10:23,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-15 20:10:23,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2019-11-15 20:10:23,672 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand 21 states. [2019-11-15 20:10:24,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:10:24,191 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2019-11-15 20:10:24,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-15 20:10:24,191 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 44 [2019-11-15 20:10:24,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:10:24,192 INFO L225 Difference]: With dead ends: 99 [2019-11-15 20:10:24,192 INFO L226 Difference]: Without dead ends: 90 [2019-11-15 20:10:24,192 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2019-11-15 20:10:24,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-15 20:10:24,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 68. [2019-11-15 20:10:24,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-15 20:10:24,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2019-11-15 20:10:24,205 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 44 [2019-11-15 20:10:24,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:10:24,205 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2019-11-15 20:10:24,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-15 20:10:24,205 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2019-11-15 20:10:24,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 20:10:24,206 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:10:24,206 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:10:24,406 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:10:24,406 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:10:24,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:10:24,407 INFO L82 PathProgramCache]: Analyzing trace with hash 188026708, now seen corresponding path program 5 times [2019-11-15 20:10:24,407 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:10:24,407 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775990485] [2019-11-15 20:10:24,407 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:24,407 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:24,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:10:24,413 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 20:10:24,413 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1621228619] [2019-11-15 20:10:24,413 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/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-15 20:10:24,710 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-11-15 20:10:24,710 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:10:24,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 41 conjunts are in the unsatisfiable core [2019-11-15 20:10:24,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:10:24,755 INFO L375 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-15 20:10:24,755 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:10:24,762 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:10:24,762 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:10:24,762 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2019-11-15 20:10:24,793 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:24,793 INFO L375 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-15 20:10:24,794 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:10:24,802 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:10:24,802 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:10:24,802 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-11-15 20:10:24,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:24,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:24,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:24,846 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2019-11-15 20:10:24,846 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:10:24,856 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:10:24,856 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-15 20:10:24,856 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:41 [2019-11-15 20:10:25,177 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-11-15 20:10:25,276 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:25,278 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:25,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:25,281 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:25,293 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:25,295 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:25,296 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:25,297 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 59 [2019-11-15 20:10:25,297 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:10:25,322 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:10:25,323 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-15 20:10:25,323 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:69, output treesize:44 [2019-11-15 20:10:25,470 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-11-15 20:10:25,475 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:25,477 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:25,478 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:25,479 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:25,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:25,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:25,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:25,482 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 59 [2019-11-15 20:10:25,483 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:10:25,496 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:10:25,497 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-15 20:10:25,497 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:69, output treesize:44 [2019-11-15 20:10:25,580 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:25,581 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:25,583 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:25,584 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:25,585 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:25,586 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:25,586 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:25,587 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 59 [2019-11-15 20:10:25,588 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:10:25,602 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:10:25,603 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-15 20:10:25,603 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:69, output treesize:44 [2019-11-15 20:10:25,713 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:25,715 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:25,716 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:25,718 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:25,719 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:25,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:25,722 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:25,723 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 59 [2019-11-15 20:10:25,723 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:10:25,744 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:10:25,745 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-15 20:10:25,745 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:69, output treesize:39 [2019-11-15 20:10:25,903 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-11-15 20:10:25,970 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:25,971 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:25,972 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:10:25,972 INFO L375 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 31 treesize of output 13 [2019-11-15 20:10:25,973 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:10:25,976 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:10:25,977 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-15 20:10:25,977 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:3 [2019-11-15 20:10:26,004 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 37 proven. 75 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-15 20:10:26,004 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775990485] [2019-11-15 20:10:26,004 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 20:10:26,005 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621228619] [2019-11-15 20:10:26,005 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:10:26,005 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-11-15 20:10:26,005 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728849800] [2019-11-15 20:10:26,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-15 20:10:26,005 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:10:26,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-15 20:10:26,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2019-11-15 20:10:26,006 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 19 states. [2019-11-15 20:10:27,234 WARN L191 SmtUtils]: Spent 730.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2019-11-15 20:10:29,322 WARN L191 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2019-11-15 20:10:30,376 WARN L191 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2019-11-15 20:10:31,406 WARN L191 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-11-15 20:10:31,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:10:31,480 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2019-11-15 20:10:31,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 20:10:31,481 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 44 [2019-11-15 20:10:31,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:10:31,481 INFO L225 Difference]: With dead ends: 84 [2019-11-15 20:10:31,481 INFO L226 Difference]: Without dead ends: 69 [2019-11-15 20:10:31,481 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2019-11-15 20:10:31,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-15 20:10:31,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-11-15 20:10:31,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-15 20:10:31,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2019-11-15 20:10:31,491 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 44 [2019-11-15 20:10:31,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:10:31,491 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2019-11-15 20:10:31,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-15 20:10:31,491 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2019-11-15 20:10:31,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-15 20:10:31,492 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:10:31,492 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:10:31,692 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:10:31,692 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:10:31,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:10:31,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1319780852, now seen corresponding path program 20 times [2019-11-15 20:10:31,693 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:10:31,693 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621505440] [2019-11-15 20:10:31,693 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:31,693 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:31,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:10:31,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:10:31,871 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 36 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:10:31,872 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621505440] [2019-11-15 20:10:31,872 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142766168] [2019-11-15 20:10:31,872 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/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-15 20:10:31,957 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 20:10:31,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:10:31,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-15 20:10:31,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:10:32,091 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 49 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:10:32,092 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:10:32,092 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 28 [2019-11-15 20:10:32,092 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589946501] [2019-11-15 20:10:32,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-15 20:10:32,092 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:10:32,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-15 20:10:32,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-11-15 20:10:32,093 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 28 states. [2019-11-15 20:10:32,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:10:32,685 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2019-11-15 20:10:32,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-15 20:10:32,685 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 46 [2019-11-15 20:10:32,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:10:32,686 INFO L225 Difference]: With dead ends: 79 [2019-11-15 20:10:32,686 INFO L226 Difference]: Without dead ends: 75 [2019-11-15 20:10:32,686 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 38 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-15 20:10:32,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-15 20:10:32,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 53. [2019-11-15 20:10:32,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-15 20:10:32,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2019-11-15 20:10:32,694 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 46 [2019-11-15 20:10:32,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:10:32,695 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2019-11-15 20:10:32,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-15 20:10:32,695 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2019-11-15 20:10:32,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 20:10:32,696 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:10:32,696 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:10:32,899 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:10:32,899 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:10:32,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:10:32,899 INFO L82 PathProgramCache]: Analyzing trace with hash -609786487, now seen corresponding path program 21 times [2019-11-15 20:10:32,899 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:10:32,900 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165537025] [2019-11-15 20:10:32,900 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:32,900 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:32,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:10:32,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:10:33,071 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 73 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:10:33,071 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165537025] [2019-11-15 20:10:33,071 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482027233] [2019-11-15 20:10:33,071 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/bin/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:10:33,239 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-11-15 20:10:33,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:10:33,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-15 20:10:33,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:10:33,390 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 92 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:10:33,390 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:10:33,390 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 28 [2019-11-15 20:10:33,390 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384209586] [2019-11-15 20:10:33,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-15 20:10:33,390 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:10:33,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-15 20:10:33,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=571, Unknown=0, NotChecked=0, Total=756 [2019-11-15 20:10:33,391 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 28 states. [2019-11-15 20:10:33,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:10:33,626 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2019-11-15 20:10:33,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-15 20:10:33,626 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 47 [2019-11-15 20:10:33,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:10:33,627 INFO L225 Difference]: With dead ends: 83 [2019-11-15 20:10:33,627 INFO L226 Difference]: Without dead ends: 53 [2019-11-15 20:10:33,627 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=309, Invalid=951, Unknown=0, NotChecked=0, Total=1260 [2019-11-15 20:10:33,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-15 20:10:33,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2019-11-15 20:10:33,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-15 20:10:33,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-11-15 20:10:33,636 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 47 [2019-11-15 20:10:33,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:10:33,636 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-11-15 20:10:33,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-15 20:10:33,636 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-11-15 20:10:33,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 20:10:33,636 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:10:33,636 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:10:33,837 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:10:33,837 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:10:33,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:10:33,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1295219861, now seen corresponding path program 22 times [2019-11-15 20:10:33,837 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:10:33,837 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456181256] [2019-11-15 20:10:33,838 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:33,838 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:10:33,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:10:33,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:10:35,510 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:10:35,510 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456181256] [2019-11-15 20:10:35,510 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358605842] [2019-11-15 20:10:35,510 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/bin/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:10:35,624 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 20:10:35,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:10:35,627 WARN L254 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 81 conjunts are in the unsatisfiable core [2019-11-15 20:10:35,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:10:35,639 INFO L375 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-15 20:10:35,640 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:10:35,649 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:10:35,649 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:10:35,650 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-15 20:10:35,707 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:35,708 INFO L375 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-15 20:10:35,708 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:10:35,725 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:10:35,725 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:10:35,725 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2019-11-15 20:10:35,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:35,907 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:10:35,907 INFO L375 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-15 20:10:35,907 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:10:35,945 INFO L567 ElimStorePlain]: treesize reduction 36, result has 56.1 percent of original size [2019-11-15 20:10:35,946 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-15 20:10:35,946 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:46 [2019-11-15 20:10:36,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:36,128 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:10:36,128 INFO L375 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-15 20:10:36,128 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:10:36,172 INFO L567 ElimStorePlain]: treesize reduction 72, result has 46.3 percent of original size [2019-11-15 20:10:36,173 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-15 20:10:36,173 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:66, output treesize:62 [2019-11-15 20:10:36,363 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:36,413 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:10:36,414 INFO L375 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-15 20:10:36,414 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:10:36,476 INFO L567 ElimStorePlain]: treesize reduction 108, result has 41.9 percent of original size [2019-11-15 20:10:36,477 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-15 20:10:36,477 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:82, output treesize:78 [2019-11-15 20:10:36,684 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:36,771 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:10:36,771 INFO L375 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-15 20:10:36,771 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:10:36,854 INFO L567 ElimStorePlain]: treesize reduction 144, result has 39.5 percent of original size [2019-11-15 20:10:36,855 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-15 20:10:36,855 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:98, output treesize:94 [2019-11-15 20:10:37,478 WARN L191 SmtUtils]: Spent 522.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-11-15 20:10:37,625 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:37,773 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-11-15 20:10:37,773 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:10:37,773 INFO L375 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-15 20:10:37,774 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:10:37,894 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2019-11-15 20:10:37,894 INFO L567 ElimStorePlain]: treesize reduction 180, result has 37.9 percent of original size [2019-11-15 20:10:37,894 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-15 20:10:37,895 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:114, output treesize:110 [2019-11-15 20:10:38,680 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:38,898 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2019-11-15 20:10:38,898 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:10:38,898 INFO L375 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-15 20:10:38,900 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:10:39,034 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 67 [2019-11-15 20:10:39,034 INFO L567 ElimStorePlain]: treesize reduction 216, result has 36.8 percent of original size [2019-11-15 20:10:39,035 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-15 20:10:39,035 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:130, output treesize:126 [2019-11-15 20:10:48,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:10:49,031 WARN L191 SmtUtils]: Spent 318.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2019-11-15 20:10:49,032 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:10:49,032 INFO L375 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-15 20:10:49,033 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:10:49,193 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 74 [2019-11-15 20:10:49,193 INFO L567 ElimStorePlain]: treesize reduction 252, result has 36.0 percent of original size [2019-11-15 20:10:49,194 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-15 20:10:49,194 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:146, output treesize:142 [2019-11-15 20:12:19,188 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-11-15 20:12:19,389 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:12:19,390 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: 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.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) 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:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) 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: 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.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:580) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.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.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) ... 21 more 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-15 20:12:19,394 INFO L168 Benchmark]: Toolchain (without parser) took 576628.28 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 259.0 MB). Free memory was 944.7 MB in the beginning and 977.4 MB in the end (delta: -32.7 MB). Peak memory consumption was 226.3 MB. Max. memory is 11.5 GB. [2019-11-15 20:12:19,394 INFO L168 Benchmark]: CDTParser took 0.19 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-15 20:12:19,394 INFO L168 Benchmark]: CACSL2BoogieTranslator took 389.03 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -154.9 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-11-15 20:12:19,395 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.53 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:12:19,395 INFO L168 Benchmark]: Boogie Preprocessor took 27.87 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:12:19,395 INFO L168 Benchmark]: RCFGBuilder took 336.89 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2019-11-15 20:12:19,395 INFO L168 Benchmark]: TraceAbstraction took 575828.74 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 149.9 MB). Free memory was 1.1 GB in the beginning and 977.4 MB in the end (delta: 98.1 MB). Peak memory consumption was 248.1 MB. Max. memory is 11.5 GB. [2019-11-15 20:12:19,397 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.19 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 389.03 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -154.9 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.53 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.87 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 336.89 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 575828.74 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 149.9 MB). Free memory was 1.1 GB in the beginning and 977.4 MB in the end (delta: 98.1 MB). Peak memory consumption was 248.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: 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") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: 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") : de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-15 20:12:21,554 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:12:21,555 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:12:21,567 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:12:21,567 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:12:21,568 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:12:21,570 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:12:21,572 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:12:21,573 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:12:21,574 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:12:21,575 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:12:21,576 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:12:21,577 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:12:21,578 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:12:21,578 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:12:21,580 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:12:21,580 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:12:21,581 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:12:21,585 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:12:21,588 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:12:21,593 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:12:21,598 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:12:21,599 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:12:21,600 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:12:21,604 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:12:21,606 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:12:21,606 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:12:21,607 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:12:21,608 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:12:21,609 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:12:21,610 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:12:21,611 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:12:21,611 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:12:21,612 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:12:21,612 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:12:21,612 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:12:21,613 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:12:21,613 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:12:21,613 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:12:21,614 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:12:21,615 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:12:21,615 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-15 20:12:21,638 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:12:21,639 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:12:21,641 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:12:21,641 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:12:21,641 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:12:21,641 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:12:21,642 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:12:21,642 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:12:21,642 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:12:21,642 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:12:21,643 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:12:21,644 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:12:21,644 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 20:12:21,644 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 20:12:21,644 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:12:21,645 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:12:21,645 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:12:21,645 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:12:21,646 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:12:21,646 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:12:21,646 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:12:21,646 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:12:21,647 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:12:21,647 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:12:21,647 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:12:21,647 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:12:21,648 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 20:12:21,648 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 20:12:21,648 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:12:21,648 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 20:12:21,648 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_904d1f1c-914f-4c78-b706-7dfccaa09081/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 -> f0c6762a510921214435f03fd1512220ceb2c5e3 [2019-11-15 20:12:21,685 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:12:21,697 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:12:21,701 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:12:21,703 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:12:21,703 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:12:21,704 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/bin/uautomizer/../../sv-benchmarks/c/array-fpi/s4if.c [2019-11-15 20:12:21,762 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/bin/uautomizer/data/2836ac4a2/d0bf68b6c4a64529bad82d13f022e127/FLAG0c3a63c33 [2019-11-15 20:12:22,203 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:12:22,203 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/sv-benchmarks/c/array-fpi/s4if.c [2019-11-15 20:12:22,210 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/bin/uautomizer/data/2836ac4a2/d0bf68b6c4a64529bad82d13f022e127/FLAG0c3a63c33 [2019-11-15 20:12:22,637 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/bin/uautomizer/data/2836ac4a2/d0bf68b6c4a64529bad82d13f022e127 [2019-11-15 20:12:22,640 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:12:22,641 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:12:22,642 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:12:22,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:12:22,646 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:12:22,647 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:12:22" (1/1) ... [2019-11-15 20:12:22,650 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@282ef840 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:12:22, skipping insertion in model container [2019-11-15 20:12:22,650 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:12:22" (1/1) ... [2019-11-15 20:12:22,655 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:12:22,668 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:12:22,836 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:12:22,846 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:12:22,882 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:12:22,967 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:12:22,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:12:22 WrapperNode [2019-11-15 20:12:22,968 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:12:22,968 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:12:22,969 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:12:22,969 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:12:22,975 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:12:22" (1/1) ... [2019-11-15 20:12:22,984 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:12:22" (1/1) ... [2019-11-15 20:12:23,003 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:12:23,003 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:12:23,004 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:12:23,004 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:12:23,011 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:12:22" (1/1) ... [2019-11-15 20:12:23,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:12:22" (1/1) ... [2019-11-15 20:12:23,014 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:12:22" (1/1) ... [2019-11-15 20:12:23,015 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:12:22" (1/1) ... [2019-11-15 20:12:23,022 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:12:22" (1/1) ... [2019-11-15 20:12:23,029 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:12:22" (1/1) ... [2019-11-15 20:12:23,030 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:12:22" (1/1) ... [2019-11-15 20:12:23,033 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:12:23,033 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:12:23,033 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:12:23,034 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:12:23,034 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:12:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/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-15 20:12:23,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 20:12:23,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2019-11-15 20:12:23,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 20:12:23,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 20:12:23,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:12:23,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:12:23,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2019-11-15 20:12:23,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 20:12:23,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 20:12:23,411 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:12:23,411 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 20:12:23,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:12:23 BoogieIcfgContainer [2019-11-15 20:12:23,412 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:12:23,413 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:12:23,413 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:12:23,416 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:12:23,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:12:22" (1/3) ... [2019-11-15 20:12:23,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6815a91c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:12:23, skipping insertion in model container [2019-11-15 20:12:23,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:12:22" (2/3) ... [2019-11-15 20:12:23,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6815a91c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:12:23, skipping insertion in model container [2019-11-15 20:12:23,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:12:23" (3/3) ... [2019-11-15 20:12:23,419 INFO L109 eAbstractionObserver]: Analyzing ICFG s4if.c [2019-11-15 20:12:23,428 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:12:23,434 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 20:12:23,443 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 20:12:23,464 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:12:23,464 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:12:23,464 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:12:23,465 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:12:23,465 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:12:23,465 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:12:23,465 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:12:23,465 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:12:23,478 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-11-15 20:12:23,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-15 20:12:23,488 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:12:23,489 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:12:23,490 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:12:23,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:12:23,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1476218026, now seen corresponding path program 1 times [2019-11-15 20:12:23,501 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:12:23,502 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1647270328] [2019-11-15 20:12:23,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/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-15 20:12:23,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:12:23,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-15 20:12:23,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:12:23,619 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-15 20:12:23,619 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:12:23,624 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-15 20:12:23,625 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1647270328] [2019-11-15 20:12:23,625 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:12:23,626 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-15 20:12:23,626 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956985196] [2019-11-15 20:12:23,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-15 20:12:23,631 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:12:23,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 20:12:23,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 20:12:23,644 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2019-11-15 20:12:23,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:12:23,657 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2019-11-15 20:12:23,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 20:12:23,659 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-11-15 20:12:23,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:12:23,670 INFO L225 Difference]: With dead ends: 29 [2019-11-15 20:12:23,674 INFO L226 Difference]: Without dead ends: 13 [2019-11-15 20:12:23,680 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 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-15 20:12:23,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-11-15 20:12:23,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-11-15 20:12:23,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-15 20:12:23,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-11-15 20:12:23,715 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 9 [2019-11-15 20:12:23,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:12:23,716 INFO L462 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-11-15 20:12:23,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-15 20:12:23,716 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2019-11-15 20:12:23,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-15 20:12:23,717 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:12:23,717 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:12:23,919 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:12:23,920 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:12:23,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:12:23,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1304115419, now seen corresponding path program 1 times [2019-11-15 20:12:23,920 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:12:23,921 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [662383224] [2019-11-15 20:12:23,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/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-15 20:12:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:12:23,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 20:12:23,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:12:24,025 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-15 20:12:24,026 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:12:24,049 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-15 20:12:24,049 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [662383224] [2019-11-15 20:12:24,049 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:12:24,050 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 20:12:24,050 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629251002] [2019-11-15 20:12:24,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:12:24,051 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:12:24,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:12:24,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:12:24,052 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 4 states. [2019-11-15 20:12:24,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:12:24,168 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2019-11-15 20:12:24,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:12:24,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-15 20:12:24,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:12:24,169 INFO L225 Difference]: With dead ends: 23 [2019-11-15 20:12:24,170 INFO L226 Difference]: Without dead ends: 15 [2019-11-15 20:12:24,170 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 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-15 20:12:24,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-11-15 20:12:24,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-11-15 20:12:24,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-15 20:12:24,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-11-15 20:12:24,174 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 9 [2019-11-15 20:12:24,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:12:24,174 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-11-15 20:12:24,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:12:24,174 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-11-15 20:12:24,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-15 20:12:24,175 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:12:24,175 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:12:24,377 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:12:24,377 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:12:24,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:12:24,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1358761923, now seen corresponding path program 1 times [2019-11-15 20:12:24,379 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:12:24,379 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [528697177] [2019-11-15 20:12:24,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/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-15 20:12:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:12:24,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 20:12:24,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:12:24,547 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-15 20:12:24,547 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:12:24,660 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-15 20:12:24,661 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [528697177] [2019-11-15 20:12:24,661 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:12:24,661 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-15 20:12:24,661 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324388659] [2019-11-15 20:12:24,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 20:12:24,662 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:12:24,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 20:12:24,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:12:24,663 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 10 states. [2019-11-15 20:12:25,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:12:25,182 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2019-11-15 20:12:25,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 20:12:25,183 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2019-11-15 20:12:25,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:12:25,184 INFO L225 Difference]: With dead ends: 39 [2019-11-15 20:12:25,184 INFO L226 Difference]: Without dead ends: 32 [2019-11-15 20:12:25,185 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 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-15 20:12:25,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-15 20:12:25,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 22. [2019-11-15 20:12:25,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-15 20:12:25,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-11-15 20:12:25,202 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 11 [2019-11-15 20:12:25,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:12:25,203 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-11-15 20:12:25,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 20:12:25,204 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-11-15 20:12:25,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-15 20:12:25,205 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:12:25,205 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:12:25,408 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:12:25,409 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:12:25,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:12:25,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1565637502, now seen corresponding path program 1 times [2019-11-15 20:12:25,411 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:12:25,412 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [634188843] [2019-11-15 20:12:25,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/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-15 20:12:25,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:12:25,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 20:12:25,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:12:25,580 INFO L375 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-15 20:12:25,581 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:12:25,597 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:12:25,604 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:12:25,606 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:12:25,611 INFO L375 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-15 20:12:25,611 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:12:25,632 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:12:25,633 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-15 20:12:25,633 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:28 [2019-11-15 20:12:25,662 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:12:25,664 INFO L375 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 36 treesize of output 38 [2019-11-15 20:12:25,665 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:12:25,690 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:12:25,691 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-15 20:12:25,691 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2019-11-15 20:12:25,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:12:25,813 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:12:25,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 20:12:25,912 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [634188843] [2019-11-15 20:12:25,913 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:12:25,913 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 3] imperfect sequences [] total 6 [2019-11-15 20:12:25,913 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535368411] [2019-11-15 20:12:25,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:12:25,914 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:12:25,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:12:25,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:12:25,914 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 6 states. [2019-11-15 20:12:26,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:12:26,197 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2019-11-15 20:12:26,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:12:26,204 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-15 20:12:26,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:12:26,205 INFO L225 Difference]: With dead ends: 31 [2019-11-15 20:12:26,205 INFO L226 Difference]: Without dead ends: 22 [2019-11-15 20:12:26,206 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:12:26,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-11-15 20:12:26,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-11-15 20:12:26,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-15 20:12:26,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-11-15 20:12:26,212 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 14 [2019-11-15 20:12:26,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:12:26,213 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-11-15 20:12:26,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:12:26,213 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-11-15 20:12:26,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-15 20:12:26,214 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:12:26,214 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:12:26,421 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:12:26,422 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:12:26,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:12:26,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1508379200, now seen corresponding path program 1 times [2019-11-15 20:12:26,423 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:12:26,423 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [575666646] [2019-11-15 20:12:26,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/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-15 20:12:26,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:12:26,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 20:12:26,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:12:26,506 INFO L375 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-15 20:12:26,506 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:12:26,511 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:12:26,512 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:12:26,512 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-15 20:12:26,542 INFO L375 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-15 20:12:26,543 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:12:26,548 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:12:26,548 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-15 20:12:26,548 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:3 [2019-11-15 20:12:26,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:12:26,564 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:12:26,626 INFO L375 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-15 20:12:26,643 INFO L375 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-15 20:12:26,644 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:12:26,650 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:12:26,651 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:12:26,654 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:12:26,654 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-15 20:12:26,655 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:7 [2019-11-15 20:12:26,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:12:26,680 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [575666646] [2019-11-15 20:12:26,680 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:12:26,680 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-11-15 20:12:26,680 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834403043] [2019-11-15 20:12:26,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 20:12:26,681 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:12:26,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 20:12:26,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:12:26,682 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 9 states. [2019-11-15 20:12:26,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:12:26,813 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2019-11-15 20:12:26,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:12:26,814 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2019-11-15 20:12:26,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:12:26,814 INFO L225 Difference]: With dead ends: 23 [2019-11-15 20:12:26,814 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 20:12:26,815 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-11-15 20:12:26,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 20:12:26,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 20:12:26,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 20:12:26,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 20:12:26,815 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2019-11-15 20:12:26,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:12:26,816 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:12:26,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 20:12:26,816 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 20:12:26,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 20:12:27,017 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:12:27,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 20:12:27,353 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2019-11-15 20:12:27,355 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 20:12:27,355 INFO L443 ceAbstractionStarter]: For program point L27-2(lines 27 30) no Hoare annotation was computed. [2019-11-15 20:12:27,356 INFO L439 ceAbstractionStarter]: At program point L27-3(lines 27 30) the Hoare annotation is: (let ((.cse4 (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|)) (.cse5 ((_ sign_extend 32) (_ bv0 32)))) (let ((.cse0 (= (_ bv0 32) ULTIMATE.start_main_~a~0.offset)) (.cse1 (= |ULTIMATE.start_main_~#sum~0.offset| (_ bv0 32))) (.cse2 (= (select .cse4 (bvadd |ULTIMATE.start_main_~#sum~0.offset| (_ bv4 32))) ((_ extract 63 32) .cse5))) (.cse3 (= (select .cse4 |ULTIMATE.start_main_~#sum~0.offset|) ((_ extract 31 0) .cse5)))) (or (and (= (_ bv4 32) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)) .cse0 (bvslt (_ bv0 32) ~N~0) .cse1 .cse2 .cse3) (and .cse0 (= (_ bv0 32) ULTIMATE.start_main_~i~0) .cse1 (not (bvsle ~N~0 (_ bv0 32))) .cse2 .cse3 (not (= ULTIMATE.start_main_~a~0.base |ULTIMATE.start_main_~#sum~0.base|)))))) [2019-11-15 20:12:27,356 INFO L443 ceAbstractionStarter]: For program point L27-4(lines 27 30) no Hoare annotation was computed. [2019-11-15 20:12:27,356 INFO L443 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2019-11-15 20:12:27,356 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-11-15 20:12:27,356 INFO L446 ceAbstractionStarter]: At program point L42(lines 16 43) the Hoare annotation is: true [2019-11-15 20:12:27,356 INFO L443 ceAbstractionStarter]: For program point L34(lines 34 38) no Hoare annotation was computed. [2019-11-15 20:12:27,356 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 20:12:27,356 INFO L443 ceAbstractionStarter]: For program point L32-2(lines 32 39) no Hoare annotation was computed. [2019-11-15 20:12:27,356 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 20:12:27,357 INFO L439 ceAbstractionStarter]: At program point L32-3(lines 32 39) the Hoare annotation is: (let ((.cse0 (select |#memory_int| |ULTIMATE.start_main_~#sum~0.base|)) (.cse1 ((_ sign_extend 32) (_ bv0 32)))) (and (= (_ bv4 32) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)) (= (_ bv0 32) ULTIMATE.start_main_~a~0.offset) (= (_ bv0 32) ULTIMATE.start_main_~i~0) (= |ULTIMATE.start_main_~#sum~0.offset| (_ bv0 32)) (not (bvsle ~N~0 (_ bv0 32))) (= (select .cse0 (bvadd |ULTIMATE.start_main_~#sum~0.offset| (_ bv4 32))) ((_ extract 63 32) .cse1)) (= (select .cse0 |ULTIMATE.start_main_~#sum~0.offset|) ((_ extract 31 0) .cse1)))) [2019-11-15 20:12:27,357 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 20:12:27,357 INFO L443 ceAbstractionStarter]: For program point L32-4(lines 32 39) no Hoare annotation was computed. [2019-11-15 20:12:27,357 INFO L443 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2019-11-15 20:12:27,357 INFO L443 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. [2019-11-15 20:12:27,357 INFO L443 ceAbstractionStarter]: For program point L10-3(line 10) no Hoare annotation was computed. [2019-11-15 20:12:27,365 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:12:27,366 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:12:27,366 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:12:27,371 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:12:27,371 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:12:27,372 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:12:27,374 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:12:27,374 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:12:27,374 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:12:27,375 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:12:27,375 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:12:27,376 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:12:27,377 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:12:27,377 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:12:27,377 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:12:27,378 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:12:27,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 08:12:27 BoogieIcfgContainer [2019-11-15 20:12:27,380 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 20:12:27,380 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:12:27,381 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:12:27,381 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:12:27,381 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:12:23" (3/4) ... [2019-11-15 20:12:27,385 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 20:12:27,395 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-11-15 20:12:27,395 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-15 20:12:27,441 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_904d1f1c-914f-4c78-b706-7dfccaa09081/bin/uautomizer/witness.graphml [2019-11-15 20:12:27,442 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:12:27,443 INFO L168 Benchmark]: Toolchain (without parser) took 4801.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 948.3 MB in the beginning and 924.9 MB in the end (delta: 23.4 MB). Peak memory consumption was 177.0 MB. Max. memory is 11.5 GB. [2019-11-15 20:12:27,444 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:12:27,444 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -194.5 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-11-15 20:12:27,445 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:12:27,445 INFO L168 Benchmark]: Boogie Preprocessor took 29.56 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:12:27,446 INFO L168 Benchmark]: RCFGBuilder took 379.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2019-11-15 20:12:27,446 INFO L168 Benchmark]: TraceAbstraction took 3966.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 924.9 MB in the end (delta: 194.0 MB). Peak memory consumption was 194.0 MB. Max. memory is 11.5 GB. [2019-11-15 20:12:27,446 INFO L168 Benchmark]: Witness Printer took 61.42 ms. Allocated memory is still 1.2 GB. Free memory is still 924.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:12:27,449 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 325.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -194.5 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.56 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 379.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3966.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 924.9 MB in the end (delta: 194.0 MB). Peak memory consumption was 194.0 MB. Max. memory is 11.5 GB. * Witness Printer took 61.42 ms. Allocated memory is still 1.2 GB. Free memory is still 924.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 32]: Loop Invariant [2019-11-15 20:12:27,457 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:12:27,457 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:12:27,458 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:12:27,458 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:12:27,459 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:12:27,459 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((4bv32 == unknown-#memory_int-unknown[a][a] && 0bv32 == a) && 0bv32 == i) && sum == 0bv32) && !~bvsle32(N, 0bv32)) && unknown-#memory_int-unknown[sum][~bvadd16(sum, 4bv32)] == ~sign_extendFrom32To64(0bv32)[63:32]) && unknown-#memory_int-unknown[sum][sum] == ~sign_extendFrom32To64(0bv32)[31:0] - InvariantResult [Line: 27]: Loop Invariant [2019-11-15 20:12:27,460 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:12:27,460 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:12:27,461 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:12:27,461 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:12:27,461 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:12:27,462 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:12:27,463 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:12:27,463 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:12:27,463 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:12:27,463 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((4bv32 == unknown-#memory_int-unknown[a][a] && 0bv32 == a) && ~bvslt32(0bv32, N)) && sum == 0bv32) && unknown-#memory_int-unknown[sum][~bvadd16(sum, 4bv32)] == ~sign_extendFrom32To64(0bv32)[63:32]) && unknown-#memory_int-unknown[sum][sum] == ~sign_extendFrom32To64(0bv32)[31:0]) || ((((((0bv32 == a && 0bv32 == i) && sum == 0bv32) && !~bvsle32(N, 0bv32)) && unknown-#memory_int-unknown[sum][~bvadd16(sum, 4bv32)] == ~sign_extendFrom32To64(0bv32)[63:32]) && unknown-#memory_int-unknown[sum][sum] == ~sign_extendFrom32To64(0bv32)[31:0]) && !(a == sum)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. Result: SAFE, OverallTime: 3.8s, OverallIterations: 5, TraceHistogramMax: 1, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 50 SDtfs, 74 SDslu, 29 SDs, 0 SdLazy, 164 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 8 NumberOfFragments, 118 HoareAnnotationTreeSize, 3 FomulaSimplifications, 64 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 97 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 57 NumberOfCodeBlocks, 57 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 104 ConstructedInterpolants, 5 QuantifiedInterpolants, 7240 SizeOfPredicates, 24 NumberOfNonLiveVariables, 181 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 6/10 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...