./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/eqn2.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_c27a1c6d-5a4e-467b-a4e6-30b7f8aba8bf/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c27a1c6d-5a4e-467b-a4e6-30b7f8aba8bf/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c27a1c6d-5a4e-467b-a4e6-30b7f8aba8bf/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c27a1c6d-5a4e-467b-a4e6-30b7f8aba8bf/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/eqn2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c27a1c6d-5a4e-467b-a4e6-30b7f8aba8bf/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c27a1c6d-5a4e-467b-a4e6-30b7f8aba8bf/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 cffe3fba3d3039f496843dc159f920a408a85343 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_c27a1c6d-5a4e-467b-a4e6-30b7f8aba8bf/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c27a1c6d-5a4e-467b-a4e6-30b7f8aba8bf/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c27a1c6d-5a4e-467b-a4e6-30b7f8aba8bf/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c27a1c6d-5a4e-467b-a4e6-30b7f8aba8bf/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/eqn2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c27a1c6d-5a4e-467b-a4e6-30b7f8aba8bf/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c27a1c6d-5a4e-467b-a4e6-30b7f8aba8bf/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 cffe3fba3d3039f496843dc159f920a408a85343 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 20:28:40,406 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:28:40,408 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:28:40,423 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:28:40,424 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:28:40,425 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:28:40,427 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:28:40,436 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:28:40,441 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:28:40,445 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:28:40,446 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:28:40,449 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:28:40,449 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:28:40,451 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:28:40,452 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:28:40,453 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:28:40,454 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:28:40,456 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:28:40,458 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:28:40,462 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:28:40,465 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:28:40,467 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:28:40,470 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:28:40,471 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:28:40,474 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:28:40,474 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:28:40,475 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:28:40,476 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:28:40,477 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:28:40,477 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:28:40,478 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:28:40,478 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:28:40,479 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:28:40,479 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:28:40,481 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:28:40,481 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:28:40,482 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:28:40,482 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:28:40,482 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:28:40,483 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:28:40,483 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:28:40,484 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c27a1c6d-5a4e-467b-a4e6-30b7f8aba8bf/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 20:28:40,510 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:28:40,510 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:28:40,511 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:28:40,512 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:28:40,512 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:28:40,512 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:28:40,512 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:28:40,512 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:28:40,513 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:28:40,513 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:28:40,513 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:28:40,513 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:28:40,513 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:28:40,514 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:28:40,514 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:28:40,514 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:28:40,514 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:28:40,515 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:28:40,515 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:28:40,515 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:28:40,515 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:28:40,515 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:28:40,516 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:28:40,516 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:28:40,516 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:28:40,516 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:28:40,516 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 20:28:40,517 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:28:40,517 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_c27a1c6d-5a4e-467b-a4e6-30b7f8aba8bf/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 -> cffe3fba3d3039f496843dc159f920a408a85343 [2019-11-15 20:28:40,542 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:28:40,551 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:28:40,557 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:28:40,559 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:28:40,559 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:28:40,561 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c27a1c6d-5a4e-467b-a4e6-30b7f8aba8bf/bin/uautomizer/../../sv-benchmarks/c/array-fpi/eqn2.c [2019-11-15 20:28:40,615 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c27a1c6d-5a4e-467b-a4e6-30b7f8aba8bf/bin/uautomizer/data/efff18f41/247a22a1943b4e0c8dc03cb10955648f/FLAGa7abaf476 [2019-11-15 20:28:41,002 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:28:41,002 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c27a1c6d-5a4e-467b-a4e6-30b7f8aba8bf/sv-benchmarks/c/array-fpi/eqn2.c [2019-11-15 20:28:41,008 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c27a1c6d-5a4e-467b-a4e6-30b7f8aba8bf/bin/uautomizer/data/efff18f41/247a22a1943b4e0c8dc03cb10955648f/FLAGa7abaf476 [2019-11-15 20:28:41,384 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c27a1c6d-5a4e-467b-a4e6-30b7f8aba8bf/bin/uautomizer/data/efff18f41/247a22a1943b4e0c8dc03cb10955648f [2019-11-15 20:28:41,386 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:28:41,387 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:28:41,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:28:41,390 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:28:41,394 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:28:41,395 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:28:41" (1/1) ... [2019-11-15 20:28:41,397 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a1f1e6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:28:41, skipping insertion in model container [2019-11-15 20:28:41,397 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:28:41" (1/1) ... [2019-11-15 20:28:41,405 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:28:41,420 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:28:41,700 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:28:41,712 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:28:41,731 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:28:41,745 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:28:41,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:28:41 WrapperNode [2019-11-15 20:28:41,746 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:28:41,746 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:28:41,747 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:28:41,747 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:28:41,755 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:28:41" (1/1) ... [2019-11-15 20:28:41,763 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:28:41" (1/1) ... [2019-11-15 20:28:41,780 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:28:41,781 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:28:41,781 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:28:41,781 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:28:41,787 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:28:41" (1/1) ... [2019-11-15 20:28:41,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:28:41" (1/1) ... [2019-11-15 20:28:41,789 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:28:41" (1/1) ... [2019-11-15 20:28:41,790 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:28:41" (1/1) ... [2019-11-15 20:28:41,795 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:28:41" (1/1) ... [2019-11-15 20:28:41,799 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:28:41" (1/1) ... [2019-11-15 20:28:41,801 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:28:41" (1/1) ... [2019-11-15 20:28:41,803 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:28:41,804 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:28:41,804 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:28:41,804 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:28:41,805 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:28:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c27a1c6d-5a4e-467b-a4e6-30b7f8aba8bf/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:28:41,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 20:28:41,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 20:28:41,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:28:41,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:28:41,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 20:28:42,061 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:28:42,061 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-15 20:28:42,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:28:42 BoogieIcfgContainer [2019-11-15 20:28:42,063 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:28:42,063 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:28:42,064 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:28:42,066 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:28:42,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:28:41" (1/3) ... [2019-11-15 20:28:42,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f1f8dd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:28:42, skipping insertion in model container [2019-11-15 20:28:42,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:28:41" (2/3) ... [2019-11-15 20:28:42,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f1f8dd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:28:42, skipping insertion in model container [2019-11-15 20:28:42,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:28:42" (3/3) ... [2019-11-15 20:28:42,070 INFO L109 eAbstractionObserver]: Analyzing ICFG eqn2.c [2019-11-15 20:28:42,078 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:28:42,084 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 20:28:42,094 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 20:28:42,114 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:28:42,115 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:28:42,115 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:28:42,115 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:28:42,115 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:28:42,115 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:28:42,115 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:28:42,116 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:28:42,129 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-11-15 20:28:42,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 20:28:42,135 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:28:42,136 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:28:42,138 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:28:42,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:28:42,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1486647931, now seen corresponding path program 1 times [2019-11-15 20:28:42,151 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:28:42,152 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103130403] [2019-11-15 20:28:42,152 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:42,152 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:42,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:28:42,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:42,283 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:28:42,284 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103130403] [2019-11-15 20:28:42,285 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:28:42,285 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:28:42,286 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352559016] [2019-11-15 20:28:42,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-15 20:28:42,290 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:28:42,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 20:28:42,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 20:28:42,302 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2019-11-15 20:28:42,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:28:42,315 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2019-11-15 20:28:42,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 20:28:42,317 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-15 20:28:42,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:28:42,323 INFO L225 Difference]: With dead ends: 33 [2019-11-15 20:28:42,324 INFO L226 Difference]: Without dead ends: 15 [2019-11-15 20:28:42,326 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:28:42,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-11-15 20:28:42,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-11-15 20:28:42,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-15 20:28:42,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-11-15 20:28:42,351 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 10 [2019-11-15 20:28:42,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:28:42,351 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-11-15 20:28:42,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-15 20:28:42,352 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2019-11-15 20:28:42,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 20:28:42,352 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:28:42,352 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:28:42,353 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:28:42,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:28:42,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1772723449, now seen corresponding path program 1 times [2019-11-15 20:28:42,353 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:28:42,354 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757361838] [2019-11-15 20:28:42,354 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:42,354 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:42,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:28:42,375 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 20:28:42,376 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [366649862] [2019-11-15 20:28:42,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c27a1c6d-5a4e-467b-a4e6-30b7f8aba8bf/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:28:42,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:42,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 20:28:42,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:28:42,519 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:42,519 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 39 [2019-11-15 20:28:42,520 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:42,567 INFO L567 ElimStorePlain]: treesize reduction 16, result has 59.0 percent of original size [2019-11-15 20:28:42,568 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:28:42,569 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:7 [2019-11-15 20:28:42,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:42,601 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:28:42,601 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757361838] [2019-11-15 20:28:42,601 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 20:28:42,601 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366649862] [2019-11-15 20:28:42,602 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:28:42,602 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:28:42,602 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058792801] [2019-11-15 20:28:42,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:28:42,604 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:28:42,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:28:42,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:28:42,604 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 5 states. [2019-11-15 20:28:42,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:28:42,705 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2019-11-15 20:28:42,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:28:42,706 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-15 20:28:42,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:28:42,707 INFO L225 Difference]: With dead ends: 32 [2019-11-15 20:28:42,707 INFO L226 Difference]: Without dead ends: 30 [2019-11-15 20:28:42,708 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:28:42,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-15 20:28:42,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 21. [2019-11-15 20:28:42,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-15 20:28:42,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-11-15 20:28:42,713 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 10 [2019-11-15 20:28:42,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:28:42,714 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-11-15 20:28:42,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:28:42,714 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-11-15 20:28:42,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-15 20:28:42,715 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:28:42,715 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:28:42,920 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:28:42,920 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:28:42,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:28:42,920 INFO L82 PathProgramCache]: Analyzing trace with hash 130601367, now seen corresponding path program 1 times [2019-11-15 20:28:42,920 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:28:42,921 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140109080] [2019-11-15 20:28:42,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:42,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:42,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:28:42,941 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 20:28:42,942 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2100926682] [2019-11-15 20:28:42,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c27a1c6d-5a4e-467b-a4e6-30b7f8aba8bf/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:28:43,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:43,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:28:43,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:28:43,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:28:43,033 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140109080] [2019-11-15 20:28:43,034 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 20:28:43,034 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100926682] [2019-11-15 20:28:43,034 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:28:43,034 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:28:43,034 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769291591] [2019-11-15 20:28:43,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:28:43,035 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:28:43,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:28:43,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:28:43,036 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2019-11-15 20:28:43,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:28:43,118 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2019-11-15 20:28:43,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:28:43,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-15 20:28:43,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:28:43,120 INFO L225 Difference]: With dead ends: 47 [2019-11-15 20:28:43,120 INFO L226 Difference]: Without dead ends: 38 [2019-11-15 20:28:43,120 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:28:43,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-15 20:28:43,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 21. [2019-11-15 20:28:43,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-15 20:28:43,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-11-15 20:28:43,125 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 12 [2019-11-15 20:28:43,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:28:43,125 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-11-15 20:28:43,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:28:43,126 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-11-15 20:28:43,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-15 20:28:43,126 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:28:43,126 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:28:43,331 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:28:43,331 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:28:43,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:28:43,332 INFO L82 PathProgramCache]: Analyzing trace with hash 827904471, now seen corresponding path program 1 times [2019-11-15 20:28:43,332 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:28:43,332 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288766643] [2019-11-15 20:28:43,332 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:43,333 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:43,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:28:43,360 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 20:28:43,360 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [648749143] [2019-11-15 20:28:43,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c27a1c6d-5a4e-467b-a4e6-30b7f8aba8bf/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:28:43,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:43,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:28:43,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:28:43,442 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:28:43,443 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288766643] [2019-11-15 20:28:43,443 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 20:28:43,443 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648749143] [2019-11-15 20:28:43,443 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:28:43,443 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-11-15 20:28:43,444 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006420941] [2019-11-15 20:28:43,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:28:43,444 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:28:43,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:28:43,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:28:43,445 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 5 states. [2019-11-15 20:28:43,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:28:43,544 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-11-15 20:28:43,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:28:43,545 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-15 20:28:43,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:28:43,546 INFO L225 Difference]: With dead ends: 42 [2019-11-15 20:28:43,546 INFO L226 Difference]: Without dead ends: 35 [2019-11-15 20:28:43,546 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:28:43,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-15 20:28:43,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 22. [2019-11-15 20:28:43,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-15 20:28:43,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-11-15 20:28:43,551 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 12 [2019-11-15 20:28:43,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:28:43,551 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-11-15 20:28:43,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:28:43,551 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-11-15 20:28:43,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-15 20:28:43,552 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:28:43,552 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:28:43,752 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:28:43,753 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:28:43,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:28:43,753 INFO L82 PathProgramCache]: Analyzing trace with hash 437833903, now seen corresponding path program 1 times [2019-11-15 20:28:43,753 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:28:43,753 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367250863] [2019-11-15 20:28:43,753 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:43,754 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:43,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:28:43,763 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 20:28:43,763 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [94054910] [2019-11-15 20:28:43,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c27a1c6d-5a4e-467b-a4e6-30b7f8aba8bf/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:28:43,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:43,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 20:28:43,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:28:43,858 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:28:43,858 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367250863] [2019-11-15 20:28:43,858 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 20:28:43,858 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94054910] [2019-11-15 20:28:43,858 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:28:43,859 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:28:43,859 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72395572] [2019-11-15 20:28:43,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:28:43,859 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:28:43,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:28:43,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:28:43,860 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 6 states. [2019-11-15 20:28:43,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:28:43,951 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2019-11-15 20:28:43,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:28:43,955 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-15 20:28:43,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:28:43,955 INFO L225 Difference]: With dead ends: 39 [2019-11-15 20:28:43,955 INFO L226 Difference]: Without dead ends: 25 [2019-11-15 20:28:43,956 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:28:43,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-15 20:28:43,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2019-11-15 20:28:43,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-15 20:28:43,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-11-15 20:28:43,959 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 14 [2019-11-15 20:28:43,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:28:43,959 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-11-15 20:28:43,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:28:43,960 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-11-15 20:28:43,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-15 20:28:43,960 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:28:43,960 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:28:44,161 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:28:44,162 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:28:44,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:28:44,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1602337035, now seen corresponding path program 1 times [2019-11-15 20:28:44,162 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:28:44,163 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227823455] [2019-11-15 20:28:44,163 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:44,163 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:44,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:28:44,189 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 20:28:44,193 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1019418254] [2019-11-15 20:28:44,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c27a1c6d-5a4e-467b-a4e6-30b7f8aba8bf/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:28:44,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:44,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-15 20:28:44,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:28:44,267 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:28:44,267 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:44,274 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:44,279 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-15 20:28:44,280 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:44,287 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:44,288 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:28:44,288 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:19 [2019-11-15 20:28:44,358 INFO L341 Elim1Store]: treesize reduction 54, result has 46.0 percent of original size [2019-11-15 20:28:44,358 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 41 treesize of output 72 [2019-11-15 20:28:44,360 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:44,391 INFO L567 ElimStorePlain]: treesize reduction 27, result has 64.5 percent of original size [2019-11-15 20:28:44,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:44,393 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:28:44,394 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:49 [2019-11-15 20:28:44,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:44,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:44,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:44,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:44,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:44,557 INFO L392 ElimStorePlain]: Different costs {12=[v_prenex_4], 20=[|v_#memory_int_12|]} [2019-11-15 20:28:44,564 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:44,569 INFO L341 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-15 20:28:44,570 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 47 [2019-11-15 20:28:44,571 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:44,613 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:44,626 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:44,661 INFO L341 Elim1Store]: treesize reduction 17, result has 60.5 percent of original size [2019-11-15 20:28:44,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, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 89 [2019-11-15 20:28:44,663 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:44,731 INFO L567 ElimStorePlain]: treesize reduction 51, result has 66.9 percent of original size [2019-11-15 20:28:44,733 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-11-15 20:28:44,733 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:115, output treesize:103 [2019-11-15 20:28:44,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:44,865 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:28:44,866 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227823455] [2019-11-15 20:28:44,866 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 20:28:44,866 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019418254] [2019-11-15 20:28:44,866 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:28:44,866 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-11-15 20:28:44,867 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587208508] [2019-11-15 20:28:44,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 20:28:44,867 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:28:44,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 20:28:44,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:28:44,868 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 8 states. [2019-11-15 20:28:45,177 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-11-15 20:28:45,569 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 66 [2019-11-15 20:28:45,724 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2019-11-15 20:28:45,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:28:45,760 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-11-15 20:28:45,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 20:28:45,765 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-11-15 20:28:45,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:28:45,765 INFO L225 Difference]: With dead ends: 42 [2019-11-15 20:28:45,766 INFO L226 Difference]: Without dead ends: 40 [2019-11-15 20:28:45,766 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-11-15 20:28:45,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-15 20:28:45,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 26. [2019-11-15 20:28:45,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-15 20:28:45,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-11-15 20:28:45,772 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 14 [2019-11-15 20:28:45,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:28:45,773 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-11-15 20:28:45,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 20:28:45,773 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-11-15 20:28:45,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-15 20:28:45,774 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:28:45,774 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:28:45,977 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:28:45,977 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:28:45,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:28:45,977 INFO L82 PathProgramCache]: Analyzing trace with hash -602215277, now seen corresponding path program 2 times [2019-11-15 20:28:45,977 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:28:45,978 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287835481] [2019-11-15 20:28:45,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:45,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:45,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:28:45,991 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 20:28:45,991 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [737467251] [2019-11-15 20:28:45,991 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c27a1c6d-5a4e-467b-a4e6-30b7f8aba8bf/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:28:46,048 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 20:28:46,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:28:46,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 20:28:46,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:28:46,095 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:28:46,096 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287835481] [2019-11-15 20:28:46,096 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 20:28:46,096 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737467251] [2019-11-15 20:28:46,096 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:28:46,096 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-11-15 20:28:46,096 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120147202] [2019-11-15 20:28:46,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:28:46,097 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:28:46,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:28:46,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:28:46,098 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 7 states. [2019-11-15 20:28:46,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:28:46,262 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2019-11-15 20:28:46,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 20:28:46,263 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-11-15 20:28:46,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:28:46,264 INFO L225 Difference]: With dead ends: 59 [2019-11-15 20:28:46,264 INFO L226 Difference]: Without dead ends: 50 [2019-11-15 20:28:46,265 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-11-15 20:28:46,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-15 20:28:46,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 26. [2019-11-15 20:28:46,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-15 20:28:46,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2019-11-15 20:28:46,270 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 16 [2019-11-15 20:28:46,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:28:46,271 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-11-15 20:28:46,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:28:46,271 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2019-11-15 20:28:46,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-15 20:28:46,272 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:28:46,272 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:28:46,477 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:28:46,478 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:28:46,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:28:46,478 INFO L82 PathProgramCache]: Analyzing trace with hash -508830509, now seen corresponding path program 3 times [2019-11-15 20:28:46,478 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:28:46,478 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254832506] [2019-11-15 20:28:46,478 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:46,479 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:46,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:28:46,486 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 20:28:46,487 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1625457364] [2019-11-15 20:28:46,487 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c27a1c6d-5a4e-467b-a4e6-30b7f8aba8bf/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:28:46,525 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-15 20:28:46,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:28:46,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 20:28:46,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:28:46,568 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:28:46,568 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254832506] [2019-11-15 20:28:46,568 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 20:28:46,568 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625457364] [2019-11-15 20:28:46,568 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:28:46,569 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-11-15 20:28:46,569 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865689183] [2019-11-15 20:28:46,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:28:46,569 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:28:46,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:28:46,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:28:46,570 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 7 states. [2019-11-15 20:28:46,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:28:46,673 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2019-11-15 20:28:46,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 20:28:46,673 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-11-15 20:28:46,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:28:46,674 INFO L225 Difference]: With dead ends: 54 [2019-11-15 20:28:46,674 INFO L226 Difference]: Without dead ends: 47 [2019-11-15 20:28:46,674 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:28:46,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-15 20:28:46,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 28. [2019-11-15 20:28:46,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-15 20:28:46,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2019-11-15 20:28:46,679 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 16 [2019-11-15 20:28:46,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:28:46,680 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-11-15 20:28:46,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:28:46,680 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2019-11-15 20:28:46,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 20:28:46,680 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:28:46,680 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:28:46,881 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:28:46,881 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:28:46,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:28:46,881 INFO L82 PathProgramCache]: Analyzing trace with hash 575675563, now seen corresponding path program 1 times [2019-11-15 20:28:46,881 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:28:46,882 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652866229] [2019-11-15 20:28:46,882 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:46,882 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:46,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:28:46,892 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 20:28:46,895 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [316206691] [2019-11-15 20:28:46,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c27a1c6d-5a4e-467b-a4e6-30b7f8aba8bf/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:28:46,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:46,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-15 20:28:46,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:28:46,963 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:28:46,963 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:46,972 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:46,980 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-15 20:28:46,980 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:46,988 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:46,988 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:28:46,989 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:22 [2019-11-15 20:28:47,013 INFO L341 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2019-11-15 20:28:47,013 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 32 [2019-11-15 20:28:47,014 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:47,023 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:47,023 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:28:47,023 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:36 [2019-11-15 20:28:47,071 INFO L341 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2019-11-15 20:28:47,072 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 2 case distinctions, treesize of input 55 treesize of output 46 [2019-11-15 20:28:47,073 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:47,089 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:47,090 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:28:47,090 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:59, output treesize:47 [2019-11-15 20:28:47,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:47,285 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:28:47,286 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652866229] [2019-11-15 20:28:47,286 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 20:28:47,287 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316206691] [2019-11-15 20:28:47,288 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:28:47,288 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-11-15 20:28:47,288 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988505578] [2019-11-15 20:28:47,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 20:28:47,289 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:28:47,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 20:28:47,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:28:47,290 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 10 states. [2019-11-15 20:28:47,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:28:47,826 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-11-15 20:28:47,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 20:28:47,827 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-11-15 20:28:47,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:28:47,827 INFO L225 Difference]: With dead ends: 43 [2019-11-15 20:28:47,827 INFO L226 Difference]: Without dead ends: 41 [2019-11-15 20:28:47,828 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-11-15 20:28:47,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-15 20:28:47,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2019-11-15 20:28:47,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-15 20:28:47,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2019-11-15 20:28:47,840 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 18 [2019-11-15 20:28:47,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:28:47,841 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2019-11-15 20:28:47,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 20:28:47,841 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2019-11-15 20:28:47,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 20:28:47,842 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:28:47,842 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:28:48,042 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:28:48,043 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:28:48,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:28:48,043 INFO L82 PathProgramCache]: Analyzing trace with hash -2009431311, now seen corresponding path program 4 times [2019-11-15 20:28:48,043 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:28:48,043 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529523624] [2019-11-15 20:28:48,043 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:48,044 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:48,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:28:48,053 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 20:28:48,053 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [595469360] [2019-11-15 20:28:48,054 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c27a1c6d-5a4e-467b-a4e6-30b7f8aba8bf/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:28:48,096 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 20:28:48,096 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:28:48,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-15 20:28:48,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:28:48,121 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:48,121 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-11-15 20:28:48,121 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:48,151 INFO L567 ElimStorePlain]: treesize reduction 12, result has 70.0 percent of original size [2019-11-15 20:28:48,152 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:28:48,152 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:28 [2019-11-15 20:28:48,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:48,179 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:48,184 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:48,255 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:48,255 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 50 treesize of output 153 [2019-11-15 20:28:48,257 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:48,263 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:48,283 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:48,284 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 2 case distinctions, treesize of input 46 treesize of output 87 [2019-11-15 20:28:48,285 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:48,372 INFO L567 ElimStorePlain]: treesize reduction 165, result has 38.9 percent of original size [2019-11-15 20:28:48,372 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 20:28:48,372 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:97, output treesize:105 [2019-11-15 20:28:48,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:48,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:48,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:48,652 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-11-15 20:28:48,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 20:28:48,678 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:48,688 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:48,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:48,746 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:48,746 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 240 [2019-11-15 20:28:48,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:48,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:48,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:48,750 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:48,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:48,777 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:48,801 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:48,873 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:48,874 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 73 treesize of output 259 [2019-11-15 20:28:48,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:48,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:48,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:48,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:48,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:48,880 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:48,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:48,917 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:48,932 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:49,013 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:49,013 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 61 treesize of output 214 [2019-11-15 20:28:49,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:49,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:49,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:49,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:49,017 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:49,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:49,056 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:49,227 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-11-15 20:28:49,227 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:49,227 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 77 treesize of output 358 [2019-11-15 20:28:49,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:49,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:49,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:49,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:49,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:49,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:49,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:49,237 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:49,829 WARN L191 SmtUtils]: Spent 591.00 ms on a formula simplification. DAG size of input: 309 DAG size of output: 84 [2019-11-15 20:28:49,829 INFO L567 ElimStorePlain]: treesize reduction 2222, result has 13.8 percent of original size [2019-11-15 20:28:49,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:49,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:49,832 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-11-15 20:28:49,832 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:293, output treesize:275 [2019-11-15 20:28:49,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 20:28:49,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:49,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:49,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:49,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:50,296 WARN L191 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 76 [2019-11-15 20:28:50,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-15 20:28:50,532 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 107 [2019-11-15 20:28:50,695 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-11-15 20:28:50,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-15 20:28:50,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:50,740 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:28:50,741 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:28:50,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:50,763 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:28:50,763 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:28:50,802 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:50,803 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 85 treesize of output 191 [2019-11-15 20:28:50,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:50,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:50,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:50,806 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:50,818 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:50,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:50,821 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:28:50,824 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:50,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:50,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:50,830 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:50,838 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:28:50,852 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 85 [2019-11-15 20:28:50,853 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:50,878 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:50,886 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:50,887 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:50,888 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:28:50,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:50,909 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:28:50,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:50,917 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:50,919 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:50,920 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:28:50,924 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:50,925 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 84 [2019-11-15 20:28:50,925 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:50,948 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:50,950 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:50,955 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:50,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:50,962 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:28:50,970 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:28:50,976 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:50,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:50,980 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:51,000 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:28:51,005 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:28:51,054 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:51,054 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 117 treesize of output 221 [2019-11-15 20:28:51,055 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:51,066 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:28:51,070 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:51,072 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:28:51,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:51,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:51,078 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:28:51,090 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:28:51,107 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:51,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:51,169 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:51,169 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 17 case distinctions, treesize of input 97 treesize of output 261 [2019-11-15 20:28:51,171 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:51,180 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:28:51,184 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:51,185 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:28:51,186 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:51,248 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:51,248 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 89 treesize of output 270 [2019-11-15 20:28:51,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:51,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:51,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:51,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:51,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:51,254 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:51,900 WARN L191 SmtUtils]: Spent 645.00 ms on a formula simplification. DAG size of input: 262 DAG size of output: 124 [2019-11-15 20:28:51,901 INFO L567 ElimStorePlain]: treesize reduction 1318, result has 30.5 percent of original size [2019-11-15 20:28:51,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:51,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:51,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:51,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:51,904 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 6 xjuncts. [2019-11-15 20:28:51,905 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:550, output treesize:577 [2019-11-15 20:28:51,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:51,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:51,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:28:52,127 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-11-15 20:28:52,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-15 20:28:52,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:52,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:52,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:28:52,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:52,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:28:52,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:52,545 WARN L191 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 114 [2019-11-15 20:28:52,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-15 20:28:52,576 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:52,582 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:52,585 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:52,589 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:52,590 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:28:52,590 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:28:52,592 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:52,607 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:28:52,608 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:28:52,613 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 56 [2019-11-15 20:28:52,613 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:52,619 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-11-15 20:28:52,619 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:52,629 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-11-15 20:28:52,630 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:52,641 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:52,649 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:52,651 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:52,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:52,655 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:52,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:52,660 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:52,665 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:52,667 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:52,670 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:52,754 INFO L235 Elim1Store]: Index analysis took 115 ms [2019-11-15 20:28:52,766 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:52,772 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:52,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:52,777 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:28:52,851 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:52,851 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 89 treesize of output 296 [2019-11-15 20:28:52,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:52,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:52,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:52,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:52,855 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:52,865 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-11-15 20:28:52,865 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:52,871 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-11-15 20:28:52,872 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:52,879 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:52,879 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:52,880 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:52,881 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:52,882 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:52,883 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:52,885 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:28:52,886 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:52,888 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:52,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:52,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:52,892 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:52,929 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:52,930 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 88 treesize of output 203 [2019-11-15 20:28:52,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:52,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:52,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:52,933 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:53,175 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 72 [2019-11-15 20:28:53,175 INFO L567 ElimStorePlain]: treesize reduction 901, result has 21.1 percent of original size [2019-11-15 20:28:53,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:53,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:53,179 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2019-11-15 20:28:53,179 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:636, output treesize:240 [2019-11-15 20:28:53,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:28:53,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:28:53,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:28:53,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:29:05,673 WARN L191 SmtUtils]: Spent 12.11 s on a formula simplification. DAG size of input: 105 DAG size of output: 68 [2019-11-15 20:29:05,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:05,723 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:29:05,723 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529523624] [2019-11-15 20:29:05,723 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 20:29:05,723 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595469360] [2019-11-15 20:29:05,724 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:29:05,724 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-11-15 20:29:05,724 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016042185] [2019-11-15 20:29:05,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 20:29:05,724 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:29:05,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 20:29:05,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-11-15 20:29:05,725 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 14 states. [2019-11-15 20:29:06,098 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 104 [2019-11-15 20:29:06,790 WARN L191 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 120 [2019-11-15 20:29:07,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:29:07,546 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2019-11-15 20:29:07,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 20:29:07,547 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2019-11-15 20:29:07,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:29:07,547 INFO L225 Difference]: With dead ends: 54 [2019-11-15 20:29:07,547 INFO L226 Difference]: Without dead ends: 52 [2019-11-15 20:29:07,548 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2019-11-15 20:29:07,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-15 20:29:07,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 41. [2019-11-15 20:29:07,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-15 20:29:07,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2019-11-15 20:29:07,557 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 18 [2019-11-15 20:29:07,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:29:07,557 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2019-11-15 20:29:07,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 20:29:07,557 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2019-11-15 20:29:07,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 20:29:07,562 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:29:07,562 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:29:07,766 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:29:07,766 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:29:07,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:29:07,767 INFO L82 PathProgramCache]: Analyzing trace with hash -977790577, now seen corresponding path program 5 times [2019-11-15 20:29:07,767 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:29:07,767 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692285028] [2019-11-15 20:29:07,767 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:29:07,767 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:29:07,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:29:07,780 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 20:29:07,780 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [185365672] [2019-11-15 20:29:07,780 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c27a1c6d-5a4e-467b-a4e6-30b7f8aba8bf/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:29:07,845 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-11-15 20:29:07,845 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:29:07,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 20:29:07,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:29:07,888 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:29:07,888 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692285028] [2019-11-15 20:29:07,888 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 20:29:07,888 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185365672] [2019-11-15 20:29:07,889 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:29:07,889 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-11-15 20:29:07,889 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545035050] [2019-11-15 20:29:07,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 20:29:07,889 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:29:07,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 20:29:07,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:29:07,890 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 9 states. [2019-11-15 20:29:08,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:29:08,025 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2019-11-15 20:29:08,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 20:29:08,029 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-11-15 20:29:08,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:29:08,030 INFO L225 Difference]: With dead ends: 88 [2019-11-15 20:29:08,030 INFO L226 Difference]: Without dead ends: 79 [2019-11-15 20:29:08,031 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2019-11-15 20:29:08,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-15 20:29:08,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 41. [2019-11-15 20:29:08,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-15 20:29:08,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-11-15 20:29:08,044 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 20 [2019-11-15 20:29:08,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:29:08,044 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-11-15 20:29:08,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 20:29:08,044 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-11-15 20:29:08,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 20:29:08,045 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:29:08,045 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:29:08,248 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:29:08,248 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:29:08,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:29:08,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1429341745, now seen corresponding path program 6 times [2019-11-15 20:29:08,249 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:29:08,249 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104948479] [2019-11-15 20:29:08,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:29:08,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:29:08,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:29:08,261 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 20:29:08,262 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1869031719] [2019-11-15 20:29:08,262 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c27a1c6d-5a4e-467b-a4e6-30b7f8aba8bf/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:29:08,306 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-11-15 20:29:08,306 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:29:08,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 20:29:08,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:29:08,350 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:29:08,350 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104948479] [2019-11-15 20:29:08,350 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 20:29:08,350 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869031719] [2019-11-15 20:29:08,350 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:29:08,351 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-11-15 20:29:08,351 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128433112] [2019-11-15 20:29:08,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 20:29:08,351 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:29:08,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 20:29:08,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:29:08,351 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 9 states. [2019-11-15 20:29:08,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:29:08,465 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2019-11-15 20:29:08,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 20:29:08,465 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-11-15 20:29:08,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:29:08,466 INFO L225 Difference]: With dead ends: 75 [2019-11-15 20:29:08,466 INFO L226 Difference]: Without dead ends: 68 [2019-11-15 20:29:08,466 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-11-15 20:29:08,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-15 20:29:08,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 43. [2019-11-15 20:29:08,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-15 20:29:08,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-11-15 20:29:08,474 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 20 [2019-11-15 20:29:08,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:29:08,475 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-11-15 20:29:08,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 20:29:08,475 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-11-15 20:29:08,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 20:29:08,476 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:29:08,476 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:29:08,679 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:29:08,679 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:29:08,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:29:08,679 INFO L82 PathProgramCache]: Analyzing trace with hash 389293921, now seen corresponding path program 2 times [2019-11-15 20:29:08,679 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:29:08,679 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381846289] [2019-11-15 20:29:08,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:29:08,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:29:08,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:29:08,687 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 20:29:08,687 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [175078652] [2019-11-15 20:29:08,687 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c27a1c6d-5a4e-467b-a4e6-30b7f8aba8bf/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:29:08,728 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 20:29:08,728 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:29:08,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 20:29:08,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:29:08,770 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 20:29:08,770 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381846289] [2019-11-15 20:29:08,770 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 20:29:08,770 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175078652] [2019-11-15 20:29:08,770 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:29:08,770 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-11-15 20:29:08,770 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598212855] [2019-11-15 20:29:08,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 20:29:08,771 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:29:08,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 20:29:08,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:29:08,771 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 8 states. [2019-11-15 20:29:08,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:29:08,858 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2019-11-15 20:29:08,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 20:29:08,858 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-11-15 20:29:08,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:29:08,859 INFO L225 Difference]: With dead ends: 66 [2019-11-15 20:29:08,859 INFO L226 Difference]: Without dead ends: 46 [2019-11-15 20:29:08,859 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-11-15 20:29:08,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-15 20:29:08,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2019-11-15 20:29:08,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-15 20:29:08,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2019-11-15 20:29:08,864 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 22 [2019-11-15 20:29:08,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:29:08,864 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2019-11-15 20:29:08,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 20:29:08,864 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2019-11-15 20:29:08,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 20:29:08,865 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:29:08,865 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:29:09,065 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:29:09,066 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:29:09,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:29:09,066 INFO L82 PathProgramCache]: Analyzing trace with hash 425065127, now seen corresponding path program 3 times [2019-11-15 20:29:09,066 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:29:09,066 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769460144] [2019-11-15 20:29:09,066 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:29:09,066 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:29:09,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:29:09,075 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 20:29:09,075 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1618887574] [2019-11-15 20:29:09,075 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c27a1c6d-5a4e-467b-a4e6-30b7f8aba8bf/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:29:09,135 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-15 20:29:09,135 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:29:09,137 WARN L254 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 47 conjunts are in the unsatisfiable core [2019-11-15 20:29:09,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:29:09,151 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:29:09,151 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:29:09,162 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:29:09,165 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-15 20:29:09,166 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:29:09,186 INFO L567 ElimStorePlain]: treesize reduction 4, result has 87.1 percent of original size [2019-11-15 20:29:09,187 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:29:09,187 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:27 [2019-11-15 20:29:09,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:09,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:09,206 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:29:09,216 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-11-15 20:29:09,217 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 41 treesize of output 57 [2019-11-15 20:29:09,218 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:29:09,247 INFO L567 ElimStorePlain]: treesize reduction 16, result has 70.4 percent of original size [2019-11-15 20:29:09,247 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:29:09,248 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:38 [2019-11-15 20:29:09,283 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:09,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:09,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:09,289 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:09,291 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:09,300 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:29:09,300 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 81 [2019-11-15 20:29:09,301 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:29:09,367 INFO L567 ElimStorePlain]: treesize reduction 36, result has 62.9 percent of original size [2019-11-15 20:29:09,368 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:29:09,368 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:61 [2019-11-15 20:29:09,457 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:09,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:09,467 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:29:09,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:09,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:09,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:09,530 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:29:09,530 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 69 treesize of output 160 [2019-11-15 20:29:09,531 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:29:09,607 INFO L567 ElimStorePlain]: treesize reduction 110, result has 40.9 percent of original size [2019-11-15 20:29:09,608 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:29:09,608 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:84, output treesize:76 [2019-11-15 20:29:09,645 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:09,646 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:09,659 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:09,660 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:29:09,661 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:10,219 WARN L191 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 125 [2019-11-15 20:29:10,220 INFO L341 Elim1Store]: treesize reduction 164, result has 74.0 percent of original size [2019-11-15 20:29:10,220 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 5 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 36 case distinctions, treesize of input 90 treesize of output 498 [2019-11-15 20:29:10,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:10,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:10,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:10,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:10,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:10,225 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:29:10,355 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 49 [2019-11-15 20:29:10,356 INFO L567 ElimStorePlain]: treesize reduction 974, result has 9.4 percent of original size [2019-11-15 20:29:10,356 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:29:10,357 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:102, output treesize:101 [2019-11-15 20:29:10,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:10,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:10,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:10,957 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:29:10,958 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769460144] [2019-11-15 20:29:10,958 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 20:29:10,958 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618887574] [2019-11-15 20:29:10,958 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:29:10,959 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-11-15 20:29:10,959 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921257178] [2019-11-15 20:29:10,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-15 20:29:10,959 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:29:10,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 20:29:10,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-11-15 20:29:10,960 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 15 states. [2019-11-15 20:29:11,414 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-11-15 20:29:11,816 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 89 [2019-11-15 20:29:11,975 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 73 [2019-11-15 20:29:12,125 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 82 [2019-11-15 20:29:12,433 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 91 [2019-11-15 20:29:12,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:29:12,741 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2019-11-15 20:29:12,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 20:29:12,742 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2019-11-15 20:29:12,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:29:12,742 INFO L225 Difference]: With dead ends: 50 [2019-11-15 20:29:12,742 INFO L226 Difference]: Without dead ends: 48 [2019-11-15 20:29:12,743 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2019-11-15 20:29:12,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-15 20:29:12,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 37. [2019-11-15 20:29:12,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-15 20:29:12,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2019-11-15 20:29:12,749 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 22 [2019-11-15 20:29:12,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:29:12,750 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2019-11-15 20:29:12,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-15 20:29:12,750 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2019-11-15 20:29:12,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 20:29:12,751 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:29:12,751 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:29:12,957 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:29:12,957 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:29:12,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:29:12,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1004709725, now seen corresponding path program 4 times [2019-11-15 20:29:12,958 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:29:12,958 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728461139] [2019-11-15 20:29:12,958 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:29:12,958 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:29:12,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:29:12,967 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 20:29:12,967 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [577284521] [2019-11-15 20:29:12,968 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c27a1c6d-5a4e-467b-a4e6-30b7f8aba8bf/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:29:13,017 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 20:29:13,018 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:29:13,019 WARN L254 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 44 conjunts are in the unsatisfiable core [2019-11-15 20:29:13,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:29:13,033 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-11-15 20:29:13,034 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 26 treesize of output 26 [2019-11-15 20:29:13,034 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:29:13,036 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:29:13,036 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:29:13,036 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-15 20:29:13,061 INFO L341 Elim1Store]: treesize reduction 100, result has 20.0 percent of original size [2019-11-15 20:29:13,061 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 50 treesize of output 43 [2019-11-15 20:29:13,061 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:29:13,067 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:29:13,068 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:29:13,068 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:49 [2019-11-15 20:29:13,500 WARN L191 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 75 [2019-11-15 20:29:13,500 INFO L341 Elim1Store]: treesize reduction 180, result has 63.0 percent of original size [2019-11-15 20:29:13,500 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 81 treesize of output 329 [2019-11-15 20:29:13,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:13,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:13,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:13,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:13,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:13,506 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:29:13,704 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 75 [2019-11-15 20:29:13,704 INFO L567 ElimStorePlain]: treesize reduction 659, result has 36.2 percent of original size [2019-11-15 20:29:13,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:13,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:13,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:13,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:13,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:13,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:13,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:13,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:13,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:13,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:13,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:13,712 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:29:13,712 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:92, output treesize:373 [2019-11-15 20:29:13,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:13,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:13,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:13,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:13,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:13,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:13,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:13,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:13,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:13,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:13,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:13,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:13,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:13,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:13,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:13,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:13,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:13,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:13,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:13,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:13,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:15,426 WARN L191 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 213 DAG size of output: 132 [2019-11-15 20:29:15,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 11 terms [2019-11-15 20:29:15,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:15,494 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:15,504 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:15,515 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:15,559 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:15,563 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:15,568 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:15,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:15,588 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:15,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:15,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:15,613 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:15,614 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:29:15,622 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:16,334 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:29:16,351 INFO L235 Elim1Store]: Index analysis took 873 ms [2019-11-15 20:29:16,792 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-11-15 20:29:16,793 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:29:16,793 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 12 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 150 treesize of output 563 [2019-11-15 20:29:16,798 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:29:16,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:16,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:16,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:16,894 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:16,923 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:16,929 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:16,953 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:16,974 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:16,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:16,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:17,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:17,035 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:17,036 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:29:17,040 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:17,646 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:29:17,679 INFO L235 Elim1Store]: Index analysis took 819 ms [2019-11-15 20:29:18,098 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-11-15 20:29:18,099 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:29:18,099 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 12 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 131 treesize of output 562 [2019-11-15 20:29:18,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:18,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:18,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:18,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:18,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:18,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:18,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:18,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:18,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:18,108 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:29:18,157 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:18,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:18,174 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:18,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:18,197 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:18,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:18,215 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:18,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:18,292 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:18,661 INFO L235 Elim1Store]: Index analysis took 509 ms [2019-11-15 20:29:18,676 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:29:18,677 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 112 treesize of output 161 [2019-11-15 20:29:18,678 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 20:29:18,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:18,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:18,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:18,835 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:18,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:18,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:18,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:18,867 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:29:18,875 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:18,882 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:18,887 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:18,888 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:29:19,030 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:29:19,091 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:29:19,098 INFO L235 Elim1Store]: Index analysis took 311 ms [2019-11-15 20:29:19,100 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 66 [2019-11-15 20:29:19,100 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 20:29:19,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:19,249 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:19,259 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:19,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:19,316 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:19,334 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:19,343 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:19,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:19,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:19,373 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:29:19,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:19,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:20,071 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:29:20,232 INFO L235 Elim1Store]: Index analysis took 1076 ms [2019-11-15 20:29:20,725 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2019-11-15 20:29:20,725 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:29:20,726 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 10 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 23 case distinctions, treesize of input 150 treesize of output 594 [2019-11-15 20:29:20,731 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 20:29:20,756 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-11-15 20:29:20,756 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 20:29:20,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:20,812 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:20,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:20,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:20,823 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:20,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:20,834 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:29:20,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:20,858 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:20,863 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:20,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:20,878 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:20,892 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:20,905 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:20,912 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:20,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:20,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:20,981 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:29:21,383 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:29:21,399 INFO L235 Elim1Store]: Index analysis took 595 ms [2019-11-15 20:29:21,413 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:29:21,413 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 12 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 136 treesize of output 172 [2019-11-15 20:29:21,414 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-15 20:29:21,438 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-11-15 20:29:21,438 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-15 20:29:21,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:21,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:21,502 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:21,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:21,511 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:21,514 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:21,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:21,525 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:21,530 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:21,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:21,538 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:21,538 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:29:21,542 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:21,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:21,773 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:29:21,825 INFO L235 Elim1Store]: Index analysis took 359 ms [2019-11-15 20:29:22,172 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-11-15 20:29:22,172 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:29:22,173 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 12 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 148 treesize of output 561 [2019-11-15 20:29:22,176 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-15 20:29:22,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:22,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:22,255 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:22,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:22,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:22,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:22,289 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:22,293 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:22,297 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:22,301 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:22,310 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:29:22,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:22,321 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:22,327 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:29:22,340 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:29:22,533 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:29:22,561 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:29:22,567 INFO L235 Elim1Store]: Index analysis took 337 ms [2019-11-15 20:29:22,597 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:29:22,598 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 7 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 136 treesize of output 187 [2019-11-15 20:29:22,599 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-15 20:29:22,633 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:22,638 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:29:22,644 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:22,646 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:22,649 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:22,651 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:22,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:22,655 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:22,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:22,663 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:22,665 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:22,667 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:22,672 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:22,672 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:29:22,675 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:22,677 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:22,679 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:29:22,694 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:29:22,694 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 12 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 137 treesize of output 205 [2019-11-15 20:29:22,695 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-15 20:29:25,994 WARN L191 SmtUtils]: Spent 3.30 s on a formula simplification. DAG size of input: 622 DAG size of output: 259 [2019-11-15 20:29:25,995 INFO L567 ElimStorePlain]: treesize reduction 4497, result has 27.7 percent of original size [2019-11-15 20:29:25,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:25,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:25,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:25,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:25,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:25,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,049 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 16 dim-0 vars, and 9 xjuncts. [2019-11-15 20:29:26,049 INFO L221 ElimStorePlain]: Needed 12 recursive calls to eliminate 8 variables, input treesize:1352, output treesize:1725 [2019-11-15 20:29:26,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:26,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,777 WARN L191 SmtUtils]: Spent 40.49 s on a formula simplification. DAG size of input: 352 DAG size of output: 254 [2019-11-15 20:30:06,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-15 20:30:06,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:06,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:41,760 WARN L191 SmtUtils]: Spent 32.59 s on a formula simplification. DAG size of input: 373 DAG size of output: 267 [2019-11-15 20:30:41,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 13 terms [2019-11-15 20:30:44,349 WARN L191 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 111 [2019-11-15 20:30:44,857 WARN L191 SmtUtils]: Spent 408.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2019-11-15 20:30:47,172 WARN L191 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 134 [2019-11-15 20:30:47,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 10 terms [2019-11-15 20:30:48,166 WARN L191 SmtUtils]: Spent 868.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2019-11-15 20:30:48,825 WARN L191 SmtUtils]: Spent 518.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-11-15 20:30:52,340 WARN L191 SmtUtils]: Spent 3.39 s on a formula simplification. DAG size of input: 144 DAG size of output: 142 [2019-11-15 20:30:52,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-11-15 20:30:52,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:30:52,721 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:30:52,721 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728461139] [2019-11-15 20:30:52,721 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 20:30:52,721 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577284521] [2019-11-15 20:30:52,721 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:30:52,721 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-11-15 20:30:52,721 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712921052] [2019-11-15 20:30:52,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-15 20:30:52,722 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:30:52,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-15 20:30:52,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=362, Unknown=4, NotChecked=0, Total=420 [2019-11-15 20:30:52,722 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 21 states. [2019-11-15 20:31:09,442 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-11-15 20:31:09,643 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:31:09,644 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:100) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.pop(ManagedScript.java:130) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPostcondition(IncrementalHoareTripleChecker.java:660) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:264) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:279) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.ProtectiveHoareTripleChecker.releaseLock(ProtectiveHoareTripleChecker.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.releaseLock(EfficientHoareTripleChecker.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:684) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:597) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:454) 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: java.io.IOException: Stream closed at java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:433) at java.io.OutputStream.write(OutputStream.java:116) at java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:82) at java.io.BufferedOutputStream.flush(BufferedOutputStream.java:140) at sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:297) at sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:141) at java.io.OutputStreamWriter.flush(OutputStreamWriter.java:229) at java.io.BufferedWriter.flush(BufferedWriter.java:254) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:120) ... 30 more [2019-11-15 20:31:09,648 INFO L168 Benchmark]: Toolchain (without parser) took 148260.80 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 356.0 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -201.1 MB). Peak memory consumption was 154.8 MB. Max. memory is 11.5 GB. [2019-11-15 20:31:09,648 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:31:09,648 INFO L168 Benchmark]: CACSL2BoogieTranslator took 357.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -195.7 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-11-15 20:31:09,649 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.83 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:31:09,649 INFO L168 Benchmark]: Boogie Preprocessor took 22.72 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:31:09,649 INFO L168 Benchmark]: RCFGBuilder took 259.13 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: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2019-11-15 20:31:09,650 INFO L168 Benchmark]: TraceAbstraction took 147583.25 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 205.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -29.0 MB). Peak memory consumption was 176.0 MB. Max. memory is 11.5 GB. [2019-11-15 20:31:09,651 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.36 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 357.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -195.7 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.83 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 22.72 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 259.13 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: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 147583.25 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 205.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -29.0 MB). Peak memory consumption was 176.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) 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:31:11,889 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:31:11,891 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:31:11,903 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:31:11,903 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:31:11,904 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:31:11,906 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:31:11,908 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:31:11,910 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:31:11,911 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:31:11,912 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:31:11,913 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:31:11,913 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:31:11,914 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:31:11,915 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:31:11,917 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:31:11,917 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:31:11,918 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:31:11,920 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:31:11,922 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:31:11,924 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:31:11,925 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:31:11,926 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:31:11,927 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:31:11,930 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:31:11,931 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:31:11,931 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:31:11,932 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:31:11,932 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:31:11,934 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:31:11,934 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:31:11,935 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:31:11,936 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:31:11,936 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:31:11,938 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:31:11,938 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:31:11,939 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:31:11,939 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:31:11,939 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:31:11,940 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:31:11,941 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:31:11,942 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c27a1c6d-5a4e-467b-a4e6-30b7f8aba8bf/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-15 20:31:11,956 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:31:11,957 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:31:11,958 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:31:11,958 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:31:11,959 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:31:11,959 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:31:11,959 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:31:11,959 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:31:11,960 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:31:11,960 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:31:11,960 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:31:11,960 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:31:11,961 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 20:31:11,961 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 20:31:11,961 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:31:11,961 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:31:11,962 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:31:11,962 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:31:11,962 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:31:11,963 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:31:11,963 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:31:11,963 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:31:11,963 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:31:11,964 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:31:11,964 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:31:11,964 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:31:11,964 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 20:31:11,965 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 20:31:11,965 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:31:11,965 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 20:31:11,965 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_c27a1c6d-5a4e-467b-a4e6-30b7f8aba8bf/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 -> cffe3fba3d3039f496843dc159f920a408a85343 [2019-11-15 20:31:11,999 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:31:12,011 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:31:12,015 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:31:12,016 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:31:12,017 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:31:12,018 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c27a1c6d-5a4e-467b-a4e6-30b7f8aba8bf/bin/uautomizer/../../sv-benchmarks/c/array-fpi/eqn2.c [2019-11-15 20:31:12,076 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c27a1c6d-5a4e-467b-a4e6-30b7f8aba8bf/bin/uautomizer/data/678304f2f/13834e61e7a24bf487b7d66070dbe309/FLAG8abb054df [2019-11-15 20:31:12,500 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:31:12,500 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c27a1c6d-5a4e-467b-a4e6-30b7f8aba8bf/sv-benchmarks/c/array-fpi/eqn2.c [2019-11-15 20:31:12,506 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c27a1c6d-5a4e-467b-a4e6-30b7f8aba8bf/bin/uautomizer/data/678304f2f/13834e61e7a24bf487b7d66070dbe309/FLAG8abb054df [2019-11-15 20:31:12,911 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c27a1c6d-5a4e-467b-a4e6-30b7f8aba8bf/bin/uautomizer/data/678304f2f/13834e61e7a24bf487b7d66070dbe309 [2019-11-15 20:31:12,913 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:31:12,915 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:31:12,917 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:31:12,917 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:31:12,920 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:31:12,921 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:31:12" (1/1) ... [2019-11-15 20:31:12,924 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b157855 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:31:12, skipping insertion in model container [2019-11-15 20:31:12,924 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:31:12" (1/1) ... [2019-11-15 20:31:12,931 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:31:12,946 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:31:13,124 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:31:13,138 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:31:13,165 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:31:13,240 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:31:13,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:31:13 WrapperNode [2019-11-15 20:31:13,241 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:31:13,242 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:31:13,242 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:31:13,243 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:31:13,250 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:31:13" (1/1) ... [2019-11-15 20:31:13,260 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:31:13" (1/1) ... [2019-11-15 20:31:13,281 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:31:13,281 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:31:13,281 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:31:13,281 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:31:13,288 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:31:13" (1/1) ... [2019-11-15 20:31:13,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:31:13" (1/1) ... [2019-11-15 20:31:13,291 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:31:13" (1/1) ... [2019-11-15 20:31:13,291 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:31:13" (1/1) ... [2019-11-15 20:31:13,298 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:31:13" (1/1) ... [2019-11-15 20:31:13,303 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:31:13" (1/1) ... [2019-11-15 20:31:13,305 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:31:13" (1/1) ... [2019-11-15 20:31:13,307 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:31:13,308 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:31:13,308 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:31:13,308 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:31:13,309 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:31:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c27a1c6d-5a4e-467b-a4e6-30b7f8aba8bf/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:31:13,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2019-11-15 20:31:13,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 20:31:13,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:31:13,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:31:13,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2019-11-15 20:31:13,685 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:31:13,686 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-15 20:31:13,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:31:13 BoogieIcfgContainer [2019-11-15 20:31:13,687 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:31:13,688 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:31:13,688 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:31:13,691 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:31:13,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:31:12" (1/3) ... [2019-11-15 20:31:13,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cb7c463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:31:13, skipping insertion in model container [2019-11-15 20:31:13,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:31:13" (2/3) ... [2019-11-15 20:31:13,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cb7c463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:31:13, skipping insertion in model container [2019-11-15 20:31:13,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:31:13" (3/3) ... [2019-11-15 20:31:13,694 INFO L109 eAbstractionObserver]: Analyzing ICFG eqn2.c [2019-11-15 20:31:13,701 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:31:13,706 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 20:31:13,718 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 20:31:13,736 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:31:13,737 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:31:13,737 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:31:13,737 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:31:13,737 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:31:13,738 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:31:13,738 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:31:13,738 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:31:13,749 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-11-15 20:31:13,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 20:31:13,753 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:31:13,754 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:31:13,756 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:31:13,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:31:13,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1486647931, now seen corresponding path program 1 times [2019-11-15 20:31:13,770 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:31:13,770 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [502413485] [2019-11-15 20:31:13,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c27a1c6d-5a4e-467b-a4e6-30b7f8aba8bf/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:31:13,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:13,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-15 20:31:13,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:31:13,878 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:31:13,881 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:31:13,885 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:31:13,886 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [502413485] [2019-11-15 20:31:13,886 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:31:13,887 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-15 20:31:13,887 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247823204] [2019-11-15 20:31:13,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-15 20:31:13,891 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:31:13,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 20:31:13,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 20:31:13,901 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2019-11-15 20:31:13,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:31:13,914 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2019-11-15 20:31:13,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 20:31:13,915 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-15 20:31:13,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:31:13,922 INFO L225 Difference]: With dead ends: 33 [2019-11-15 20:31:13,922 INFO L226 Difference]: Without dead ends: 15 [2019-11-15 20:31:13,925 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 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:31:13,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-11-15 20:31:13,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-11-15 20:31:13,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-15 20:31:13,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-11-15 20:31:13,949 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 10 [2019-11-15 20:31:13,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:31:13,950 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-11-15 20:31:13,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-15 20:31:13,950 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2019-11-15 20:31:13,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 20:31:13,951 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:31:13,951 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:31:14,153 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:31:14,154 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:31:14,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:31:14,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1772723449, now seen corresponding path program 1 times [2019-11-15 20:31:14,154 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:31:14,155 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1981223426] [2019-11-15 20:31:14,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c27a1c6d-5a4e-467b-a4e6-30b7f8aba8bf/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:31:14,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:14,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 20:31:14,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:31:14,312 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:31:14,313 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:31:14,315 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:31:14,409 INFO L341 Elim1Store]: treesize reduction 45, result has 40.0 percent of original size [2019-11-15 20:31:14,410 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 50 [2019-11-15 20:31:14,411 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:31:14,456 INFO L567 ElimStorePlain]: treesize reduction 20, result has 62.3 percent of original size [2019-11-15 20:31:14,458 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:31:14,458 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:33 [2019-11-15 20:31:14,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:14,570 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:31:14,571 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:31:14,797 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:31:14,798 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1981223426] [2019-11-15 20:31:14,798 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:31:14,798 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-15 20:31:14,798 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224966820] [2019-11-15 20:31:14,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 20:31:14,800 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:31:14,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 20:31:14,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:31:14,802 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 8 states. [2019-11-15 20:31:15,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:31:15,365 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2019-11-15 20:31:15,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:31:15,369 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-11-15 20:31:15,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:31:15,370 INFO L225 Difference]: With dead ends: 22 [2019-11-15 20:31:15,370 INFO L226 Difference]: Without dead ends: 20 [2019-11-15 20:31:15,371 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-11-15 20:31:15,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-11-15 20:31:15,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-11-15 20:31:15,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-15 20:31:15,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-11-15 20:31:15,376 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 10 [2019-11-15 20:31:15,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:31:15,377 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-11-15 20:31:15,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 20:31:15,377 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-11-15 20:31:15,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-15 20:31:15,379 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:31:15,379 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:31:15,579 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:31:15,580 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:31:15,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:31:15,581 INFO L82 PathProgramCache]: Analyzing trace with hash 437833903, now seen corresponding path program 1 times [2019-11-15 20:31:15,581 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:31:15,581 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1484909189] [2019-11-15 20:31:15,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c27a1c6d-5a4e-467b-a4e6-30b7f8aba8bf/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:31:15,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:15,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 20:31:15,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:31:15,773 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:31:15,773 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:31:15,852 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:31:15,852 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1484909189] [2019-11-15 20:31:15,853 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:31:15,853 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-15 20:31:15,853 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303840822] [2019-11-15 20:31:15,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 20:31:15,854 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:31:15,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 20:31:15,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:31:15,855 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 10 states. [2019-11-15 20:31:16,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:31:16,203 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2019-11-15 20:31:16,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 20:31:16,207 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2019-11-15 20:31:16,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:31:16,208 INFO L225 Difference]: With dead ends: 45 [2019-11-15 20:31:16,208 INFO L226 Difference]: Without dead ends: 20 [2019-11-15 20:31:16,209 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:31:16,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-11-15 20:31:16,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-11-15 20:31:16,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-15 20:31:16,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-11-15 20:31:16,214 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 14 [2019-11-15 20:31:16,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:31:16,215 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-11-15 20:31:16,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 20:31:16,215 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-11-15 20:31:16,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 20:31:16,216 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:31:16,216 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:31:16,427 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:31:16,428 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:31:16,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:31:16,428 INFO L82 PathProgramCache]: Analyzing trace with hash 575675563, now seen corresponding path program 1 times [2019-11-15 20:31:16,429 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:31:16,429 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [914837098] [2019-11-15 20:31:16,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c27a1c6d-5a4e-467b-a4e6-30b7f8aba8bf/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:31:16,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:16,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-15 20:31:16,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:31:16,860 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:31:16,869 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 5 treesize of output 3 [2019-11-15 20:31:16,870 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:31:16,938 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:31:16,954 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:31:16,955 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:31:16,956 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:31:16,957 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:31:16,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:31:16,984 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:31:16,984 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 80 [2019-11-15 20:31:16,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:31:17,006 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:31:17,007 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 0 case distinctions, treesize of input 21 treesize of output 11 [2019-11-15 20:31:17,007 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 20:31:17,045 INFO L567 ElimStorePlain]: treesize reduction 23, result has 59.6 percent of original size [2019-11-15 20:31:17,046 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:31:17,078 INFO L567 ElimStorePlain]: treesize reduction 4, result has 90.7 percent of original size [2019-11-15 20:31:17,079 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:31:17,079 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:111, output treesize:39 [2019-11-15 20:31:17,131 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:31:17,133 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:31:17,135 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:31:17,137 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:31:17,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:31:17,141 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:31:17,160 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:31:17,161 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 79 [2019-11-15 20:31:17,163 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:31:17,222 INFO L567 ElimStorePlain]: treesize reduction 32, result has 65.6 percent of original size [2019-11-15 20:31:17,222 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:31:17,222 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:65, output treesize:61 [2019-11-15 20:31:17,314 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:31:17,316 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:31:17,317 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:31:17,320 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:31:17,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:31:17,324 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:31:17,326 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:31:17,327 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:31:17,329 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:31:17,372 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:31:17,373 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 127 treesize of output 140 [2019-11-15 20:31:17,377 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:31:17,447 INFO L567 ElimStorePlain]: treesize reduction 63, result has 64.0 percent of original size [2019-11-15 20:31:17,448 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:31:17,448 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:130, output treesize:112 [2019-11-15 20:31:17,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:17,663 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:31:17,664 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:31:21,981 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-15 20:31:21,999 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:31:22,000 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [914837098] [2019-11-15 20:31:22,000 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:31:22,000 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2019-11-15 20:31:22,000 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294525772] [2019-11-15 20:31:22,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 20:31:22,001 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:31:22,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 20:31:22,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=204, Unknown=1, NotChecked=0, Total=240 [2019-11-15 20:31:22,002 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 16 states. [2019-11-15 20:31:53,759 WARN L191 SmtUtils]: Spent 31.10 s on a formula simplification. DAG size of input: 104 DAG size of output: 83 [2019-11-15 20:32:03,632 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-11-15 20:32:08,616 WARN L191 SmtUtils]: Spent 692.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-11-15 20:32:11,705 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-11-15 20:32:29,533 WARN L191 SmtUtils]: Spent 7.38 s on a formula simplification. DAG size of input: 84 DAG size of output: 55 [2019-11-15 20:32:41,518 WARN L191 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 59 [2019-11-15 20:32:43,842 WARN L191 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 129 DAG size of output: 61 [2019-11-15 20:32:46,066 WARN L191 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 136 DAG size of output: 65 [2019-11-15 20:32:49,620 WARN L191 SmtUtils]: Spent 621.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 65 [2019-11-15 20:32:50,442 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-15 20:32:51,164 WARN L191 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-11-15 20:32:53,035 WARN L191 SmtUtils]: Spent 942.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 63 [2019-11-15 20:32:55,378 WARN L191 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 120 DAG size of output: 65 [2019-11-15 20:32:56,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:32:56,473 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2019-11-15 20:32:56,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-15 20:32:56,473 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2019-11-15 20:32:56,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:32:56,474 INFO L225 Difference]: With dead ends: 63 [2019-11-15 20:32:56,474 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 20:32:56,475 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 74.7s TimeCoverageRelationStatistics Valid=316, Invalid=1236, Unknown=8, NotChecked=0, Total=1560 [2019-11-15 20:32:56,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 20:32:56,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 20:32:56,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 20:32:56,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 20:32:56,475 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2019-11-15 20:32:56,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:32:56,476 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:32:56,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 20:32:56,476 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 20:32:56,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 20:32:56,676 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:32:56,679 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 20:32:57,023 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-11-15 20:33:11,809 WARN L191 SmtUtils]: Spent 14.78 s on a formula simplification. DAG size of input: 94 DAG size of output: 60 [2019-11-15 20:33:12,609 WARN L191 SmtUtils]: Spent 798.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 68 [2019-11-15 20:33:12,611 INFO L443 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2019-11-15 20:33:12,611 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 20:33:12,611 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 20:33:12,611 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 20:33:12,612 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 20:33:12,612 INFO L443 ceAbstractionStarter]: For program point L29-2(lines 29 32) no Hoare annotation was computed. [2019-11-15 20:33:12,612 INFO L439 ceAbstractionStarter]: At program point L29-3(lines 29 32) the Hoare annotation is: (let ((.cse3 (select |#memory_int| ULTIMATE.start_main_~a~0.base)) (.cse11 (select |#memory_int| ULTIMATE.start_main_~b~0.base))) (let ((.cse13 (select .cse11 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv4 32)))) (.cse4 ((_ sign_extend 32) (_ bv4 32))) (.cse16 (select .cse3 ULTIMATE.start_main_~a~0.offset)) (.cse15 ((_ sign_extend 32) (_ bv1 32))) (.cse14 (select .cse11 ULTIMATE.start_main_~b~0.offset))) (let ((.cse0 (= ((_ extract 31 0) .cse15) .cse14)) (.cse1 (= (_ bv0 32) ULTIMATE.start_main_~a~0.offset)) (.cse2 (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset)) (.cse5 (concat (select .cse3 (bvadd ULTIMATE.start_main_~a~0.offset (_ bv4 32))) .cse16)) (.cse6 (= ((_ extract 31 0) .cse4) .cse16)) (.cse7 (= ((_ extract 63 32) .cse15) .cse13))) (or (and .cse0 .cse1 .cse2 (= (select .cse3 (bvadd ULTIMATE.start_main_~a~0.offset (_ bv8 32))) ((_ extract 31 0) (bvadd .cse4 .cse5))) .cse6 .cse7) (and .cse0 .cse1 .cse2 (not (bvsle ~N~0 (_ bv0 32))) (let ((.cse12 (bvadd (concat .cse13 .cse14) .cse5))) (let ((.cse8 ((_ extract 63 32) .cse12))) (let ((.cse9 (store .cse11 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv12 32)) .cse8)) (.cse10 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv8 32)))) (or (= (concat .cse8 (select .cse9 .cse10)) ((_ sign_extend 32) (_ bv5 32))) (not (= (store |#memory_int| ULTIMATE.start_main_~b~0.base .cse9) (store |#memory_int| ULTIMATE.start_main_~b~0.base (store .cse11 .cse10 ((_ extract 31 0) .cse12))))))))) .cse6 .cse7 (= (_ bv1 32) ULTIMATE.start_main_~i~0)))))) [2019-11-15 20:33:12,612 INFO L443 ceAbstractionStarter]: For program point L29-4(lines 29 32) no Hoare annotation was computed. [2019-11-15 20:33:12,612 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-11-15 20:33:12,613 INFO L443 ceAbstractionStarter]: For program point L34-2(lines 34 37) no Hoare annotation was computed. [2019-11-15 20:33:12,613 INFO L439 ceAbstractionStarter]: At program point L34-3(lines 34 37) the Hoare annotation is: (let ((.cse6 ((_ sign_extend 32) (_ bv1 32))) (.cse7 (select |#memory_int| ULTIMATE.start_main_~b~0.base))) (let ((.cse0 (= ((_ extract 31 0) .cse6) (select .cse7 ULTIMATE.start_main_~b~0.offset))) (.cse1 (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset)) (.cse5 (= ((_ extract 63 32) .cse6) (select .cse7 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv4 32)))))) (or (let ((.cse2 (select |#memory_int| ULTIMATE.start_main_~a~0.base))) (let ((.cse3 ((_ sign_extend 32) (_ bv4 32))) (.cse4 (select .cse2 ULTIMATE.start_main_~a~0.offset))) (and .cse0 (= (_ bv0 32) ULTIMATE.start_main_~a~0.offset) .cse1 (= (select .cse2 (bvadd ULTIMATE.start_main_~a~0.offset (_ bv8 32))) ((_ extract 31 0) (bvadd .cse3 (concat (select .cse2 (bvadd ULTIMATE.start_main_~a~0.offset (_ bv4 32))) .cse4)))) (= ((_ extract 31 0) .cse3) .cse4) .cse5))) (and .cse0 .cse1 (not (bvslt (_ bv1 32) ~N~0)) (not (bvsle ~N~0 (_ bv0 32))) (exists ((ULTIMATE.start_main_~a~0.base (_ BitVec 32)) (ULTIMATE.start_main_~a~0.offset (_ BitVec 32))) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv4 32))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset))) .cse5 (= (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))))) [2019-11-15 20:33:12,613 INFO L443 ceAbstractionStarter]: For program point L34-4(lines 34 37) no Hoare annotation was computed. [2019-11-15 20:33:12,613 INFO L446 ceAbstractionStarter]: At program point L43(lines 16 44) the Hoare annotation is: true [2019-11-15 20:33:12,613 INFO L443 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2019-11-15 20:33:12,613 INFO L443 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. [2019-11-15 20:33:12,613 INFO L443 ceAbstractionStarter]: For program point L10-3(line 10) no Hoare annotation was computed. [2019-11-15 20:33:12,613 INFO L443 ceAbstractionStarter]: For program point L39-2(lines 39 42) no Hoare annotation was computed. [2019-11-15 20:33:12,614 INFO L439 ceAbstractionStarter]: At program point L39-3(lines 39 42) the Hoare annotation is: (let ((.cse14 (select |#memory_int| ULTIMATE.start_main_~a~0.base)) (.cse15 ((_ sign_extend 32) (_ bv1 32))) (.cse1 (select |#memory_int| ULTIMATE.start_main_~b~0.base))) (let ((.cse9 (= ((_ extract 31 0) .cse15) (select .cse1 ULTIMATE.start_main_~b~0.offset))) (.cse4 (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset)) (.cse10 (exists ((ULTIMATE.start_main_~a~0.base (_ BitVec 32)) (ULTIMATE.start_main_~a~0.offset (_ BitVec 32))) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv4 32))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)))) (.cse11 (= ((_ extract 63 32) .cse15) (select .cse1 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv4 32))))) (.cse12 ((_ sign_extend 32) (_ bv4 32))) (.cse13 (select .cse14 ULTIMATE.start_main_~a~0.offset))) (let ((.cse3 (= (_ bv0 32) ULTIMATE.start_main_~a~0.offset)) (.cse6 (= (select .cse14 (bvadd ULTIMATE.start_main_~a~0.offset (_ bv8 32))) ((_ extract 31 0) (bvadd .cse12 (concat (select .cse14 (bvadd ULTIMATE.start_main_~a~0.offset (_ bv4 32))) .cse13))))) (.cse7 (= ((_ extract 31 0) .cse12) .cse13)) (.cse5 (= (_ bv0 32) ULTIMATE.start_main_~i~0)) (.cse8 (and .cse9 .cse4 (not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32))) .cse10 .cse11))) (or (and (= ((_ sign_extend 32) (let ((.cse0 (bvmul ULTIMATE.start_main_~i~0 (_ bv2 32)))) (bvadd (bvmul .cse0 ULTIMATE.start_main_~i~0) .cse0 (_ bv1 32)))) (let ((.cse2 (bvmul ULTIMATE.start_main_~i~0 (_ bv8 32)))) (concat (select .cse1 (bvadd .cse2 ULTIMATE.start_main_~b~0.offset (_ bv4 32))) (select .cse1 (bvadd .cse2 ULTIMATE.start_main_~b~0.offset))))) .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse3 (= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) .cse6 .cse7 .cse8) (and .cse9 .cse4 .cse5 .cse10 .cse11 (not (bvslt (bvadd ULTIMATE.start_main_~i~0 (_ bv1 32)) ~N~0))) (and (not (bvslt (_ bv1 32) ~N~0)) (not (bvslt ULTIMATE.start_main_~i~0 ~N~0)) .cse8))))) [2019-11-15 20:33:12,614 INFO L443 ceAbstractionStarter]: For program point L39-4(lines 39 42) no Hoare annotation was computed. [2019-11-15 20:33:12,618 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:555) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:255) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:212) 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) [2019-11-15 20:33:12,635 INFO L168 Benchmark]: Toolchain (without parser) took 119716.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 210.2 MB). Free memory was 952.4 MB in the beginning and 846.6 MB in the end (delta: 105.8 MB). Peak memory consumption was 316.0 MB. Max. memory is 11.5 GB. [2019-11-15 20:33:12,635 INFO L168 Benchmark]: CDTParser took 0.28 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:33:12,636 INFO L168 Benchmark]: CACSL2BoogieTranslator took 324.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 952.4 MB in the beginning and 1.2 GB in the end (delta: -201.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-15 20:33:12,637 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-15 20:33:12,637 INFO L168 Benchmark]: Boogie Preprocessor took 26.57 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:33:12,637 INFO L168 Benchmark]: RCFGBuilder took 379.23 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.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:33:12,638 INFO L168 Benchmark]: TraceAbstraction took 118941.61 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 51.9 MB). Free memory was 1.1 GB in the beginning and 846.6 MB in the end (delta: 276.5 MB). Peak memory consumption was 328.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:33:12,640 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.28 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 324.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 952.4 MB in the beginning and 1.2 GB in the end (delta: -201.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.57 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.23 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.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 118941.61 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 51.9 MB). Free memory was 1.1 GB in the beginning and 846.6 MB in the end (delta: 276.5 MB). Peak memory consumption was 328.4 MB. Max. memory is 11.5 GB. * 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 - ExceptionOrErrorResult: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...