./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/eqn3.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_e3a9e6eb-4538-4928-9c09-185b07da8fa4/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e3a9e6eb-4538-4928-9c09-185b07da8fa4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e3a9e6eb-4538-4928-9c09-185b07da8fa4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e3a9e6eb-4538-4928-9c09-185b07da8fa4/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/eqn3.c -s /tmp/vcloud-vcloud-master/worker/run_dir_e3a9e6eb-4538-4928-9c09-185b07da8fa4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e3a9e6eb-4538-4928-9c09-185b07da8fa4/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 ccef52befb042c9cb85d0ad94e261a151e50814b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_e3a9e6eb-4538-4928-9c09-185b07da8fa4/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e3a9e6eb-4538-4928-9c09-185b07da8fa4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e3a9e6eb-4538-4928-9c09-185b07da8fa4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e3a9e6eb-4538-4928-9c09-185b07da8fa4/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/eqn3.c -s /tmp/vcloud-vcloud-master/worker/run_dir_e3a9e6eb-4538-4928-9c09-185b07da8fa4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e3a9e6eb-4538-4928-9c09-185b07da8fa4/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 ccef52befb042c9cb85d0ad94e261a151e50814b ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:22:27,245 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:22:27,247 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:22:27,260 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:22:27,261 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:22:27,262 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:22:27,264 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:22:27,272 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:22:27,277 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:22:27,281 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:22:27,281 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:22:27,282 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:22:27,282 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:22:27,283 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:22:27,285 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:22:27,286 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:22:27,287 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:22:27,288 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:22:27,291 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:22:27,295 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:22:27,298 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:22:27,299 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:22:27,302 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:22:27,303 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:22:27,306 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:22:27,306 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:22:27,306 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:22:27,308 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:22:27,308 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:22:27,309 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:22:27,310 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:22:27,310 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:22:27,311 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:22:27,312 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:22:27,313 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:22:27,313 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:22:27,314 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:22:27,314 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:22:27,314 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:22:27,315 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:22:27,315 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:22:27,316 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e3a9e6eb-4538-4928-9c09-185b07da8fa4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 20:22:27,341 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:22:27,341 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:22:27,342 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:22:27,342 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:22:27,342 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:22:27,343 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:22:27,343 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:22:27,343 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:22:27,343 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:22:27,344 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:22:27,344 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:22:27,344 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:22:27,344 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:22:27,344 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:22:27,344 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:22:27,345 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:22:27,345 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:22:27,345 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:22:27,345 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:22:27,346 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:22:27,346 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:22:27,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:22:27,346 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:22:27,346 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:22:27,347 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:22:27,347 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:22:27,347 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 20:22:27,347 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:22:27,347 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_e3a9e6eb-4538-4928-9c09-185b07da8fa4/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 -> ccef52befb042c9cb85d0ad94e261a151e50814b [2019-11-15 20:22:27,390 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:22:27,404 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:22:27,406 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:22:27,408 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:22:27,408 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:22:27,409 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e3a9e6eb-4538-4928-9c09-185b07da8fa4/bin/uautomizer/../../sv-benchmarks/c/array-fpi/eqn3.c [2019-11-15 20:22:27,465 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e3a9e6eb-4538-4928-9c09-185b07da8fa4/bin/uautomizer/data/d6822884f/003ed392861243d88bb11f275c8d78e7/FLAG854bb52cf [2019-11-15 20:22:27,858 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:22:27,859 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e3a9e6eb-4538-4928-9c09-185b07da8fa4/sv-benchmarks/c/array-fpi/eqn3.c [2019-11-15 20:22:27,865 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e3a9e6eb-4538-4928-9c09-185b07da8fa4/bin/uautomizer/data/d6822884f/003ed392861243d88bb11f275c8d78e7/FLAG854bb52cf [2019-11-15 20:22:28,276 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e3a9e6eb-4538-4928-9c09-185b07da8fa4/bin/uautomizer/data/d6822884f/003ed392861243d88bb11f275c8d78e7 [2019-11-15 20:22:28,279 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:22:28,280 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:22:28,281 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:22:28,281 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:22:28,284 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:22:28,285 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:22:28" (1/1) ... [2019-11-15 20:22:28,287 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a32a016 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:22:28, skipping insertion in model container [2019-11-15 20:22:28,288 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:22:28" (1/1) ... [2019-11-15 20:22:28,297 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:22:28,315 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:22:28,514 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:22:28,525 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:22:28,543 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:22:28,557 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:22:28,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:22:28 WrapperNode [2019-11-15 20:22:28,558 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:22:28,558 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:22:28,559 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:22:28,559 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:22:28,567 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:22:28" (1/1) ... [2019-11-15 20:22:28,575 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:22:28" (1/1) ... [2019-11-15 20:22:28,593 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:22:28,594 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:22:28,594 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:22:28,594 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:22:28,603 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:22:28" (1/1) ... [2019-11-15 20:22:28,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:22:28" (1/1) ... [2019-11-15 20:22:28,610 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:22:28" (1/1) ... [2019-11-15 20:22:28,611 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:22:28" (1/1) ... [2019-11-15 20:22:28,617 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:22:28" (1/1) ... [2019-11-15 20:22:28,621 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:22:28" (1/1) ... [2019-11-15 20:22:28,622 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:22:28" (1/1) ... [2019-11-15 20:22:28,624 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:22:28,625 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:22:28,625 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:22:28,625 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:22:28,626 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:22:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3a9e6eb-4538-4928-9c09-185b07da8fa4/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:22:28,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 20:22:28,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 20:22:28,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:22:28,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:22:28,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 20:22:28,940 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:22:28,940 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-15 20:22:28,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:22:28 BoogieIcfgContainer [2019-11-15 20:22:28,941 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:22:28,942 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:22:28,943 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:22:28,946 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:22:28,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:22:28" (1/3) ... [2019-11-15 20:22:28,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c685431 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:22:28, skipping insertion in model container [2019-11-15 20:22:28,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:22:28" (2/3) ... [2019-11-15 20:22:28,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c685431 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:22:28, skipping insertion in model container [2019-11-15 20:22:28,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:22:28" (3/3) ... [2019-11-15 20:22:28,949 INFO L109 eAbstractionObserver]: Analyzing ICFG eqn3.c [2019-11-15 20:22:28,959 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:22:28,965 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 20:22:28,976 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 20:22:28,997 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:22:28,998 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:22:28,998 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:22:28,998 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:22:28,998 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:22:28,998 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:22:28,998 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:22:28,998 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:22:29,028 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-11-15 20:22:29,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 20:22:29,033 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:22:29,034 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:22:29,036 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:22:29,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:22:29,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1486647931, now seen corresponding path program 1 times [2019-11-15 20:22:29,054 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:22:29,054 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027381690] [2019-11-15 20:22:29,054 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:29,054 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:29,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:22:29,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:22:29,262 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:22:29,262 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027381690] [2019-11-15 20:22:29,263 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:22:29,263 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:22:29,265 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146026401] [2019-11-15 20:22:29,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-15 20:22:29,270 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:22:29,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 20:22:29,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 20:22:29,286 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2019-11-15 20:22:29,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:22:29,304 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2019-11-15 20:22:29,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 20:22:29,305 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-15 20:22:29,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:22:29,312 INFO L225 Difference]: With dead ends: 33 [2019-11-15 20:22:29,312 INFO L226 Difference]: Without dead ends: 15 [2019-11-15 20:22:29,315 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:22:29,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-11-15 20:22:29,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-11-15 20:22:29,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-15 20:22:29,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-11-15 20:22:29,346 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 10 [2019-11-15 20:22:29,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:22:29,347 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-11-15 20:22:29,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-15 20:22:29,347 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2019-11-15 20:22:29,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 20:22:29,347 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:22:29,348 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:22:29,348 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:22:29,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:22:29,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1772723449, now seen corresponding path program 1 times [2019-11-15 20:22:29,349 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:22:29,349 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614220401] [2019-11-15 20:22:29,349 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:29,349 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:29,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:22:29,364 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 20:22:29,364 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [845115961] [2019-11-15 20:22:29,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3a9e6eb-4538-4928-9c09-185b07da8fa4/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:22:29,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:22:29,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 20:22:29,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:22:29,523 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:22:29,524 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:22:29,525 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:22:29,569 INFO L567 ElimStorePlain]: treesize reduction 16, result has 59.0 percent of original size [2019-11-15 20:22:29,570 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:22:29,571 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:7 [2019-11-15 20:22:29,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:29,617 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:22:29,618 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614220401] [2019-11-15 20:22:29,618 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 20:22:29,618 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845115961] [2019-11-15 20:22:29,618 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:22:29,618 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:22:29,619 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366418548] [2019-11-15 20:22:29,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:22:29,620 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:22:29,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:22:29,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:22:29,621 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 5 states. [2019-11-15 20:22:29,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:22:29,739 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2019-11-15 20:22:29,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:22:29,742 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-15 20:22:29,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:22:29,743 INFO L225 Difference]: With dead ends: 32 [2019-11-15 20:22:29,743 INFO L226 Difference]: Without dead ends: 30 [2019-11-15 20:22:29,744 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:22:29,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-15 20:22:29,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 21. [2019-11-15 20:22:29,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-15 20:22:29,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-11-15 20:22:29,752 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 10 [2019-11-15 20:22:29,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:22:29,753 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-11-15 20:22:29,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:22:29,753 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-11-15 20:22:29,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-15 20:22:29,757 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:22:29,758 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:22:29,958 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:22:29,959 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:22:29,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:22:29,959 INFO L82 PathProgramCache]: Analyzing trace with hash 130601367, now seen corresponding path program 1 times [2019-11-15 20:22:29,959 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:22:29,959 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373324678] [2019-11-15 20:22:29,959 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:29,960 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:29,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:22:29,975 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 20:22:29,976 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1685220687] [2019-11-15 20:22:29,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3a9e6eb-4538-4928-9c09-185b07da8fa4/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:22:30,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:22:30,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:22:30,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:22:30,064 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:22:30,064 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373324678] [2019-11-15 20:22:30,065 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 20:22:30,065 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685220687] [2019-11-15 20:22:30,065 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:22:30,065 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:22:30,065 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517683675] [2019-11-15 20:22:30,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:22:30,066 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:22:30,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:22:30,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:22:30,066 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2019-11-15 20:22:30,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:22:30,161 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2019-11-15 20:22:30,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:22:30,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-15 20:22:30,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:22:30,163 INFO L225 Difference]: With dead ends: 47 [2019-11-15 20:22:30,163 INFO L226 Difference]: Without dead ends: 38 [2019-11-15 20:22:30,163 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:22:30,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-15 20:22:30,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 21. [2019-11-15 20:22:30,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-15 20:22:30,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-11-15 20:22:30,168 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 12 [2019-11-15 20:22:30,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:22:30,168 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-11-15 20:22:30,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:22:30,169 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-11-15 20:22:30,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-15 20:22:30,169 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:22:30,169 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:22:30,370 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:22:30,371 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:22:30,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:22:30,371 INFO L82 PathProgramCache]: Analyzing trace with hash 827904471, now seen corresponding path program 1 times [2019-11-15 20:22:30,371 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:22:30,372 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686232855] [2019-11-15 20:22:30,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:30,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:30,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:22:30,392 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 20:22:30,392 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2126346714] [2019-11-15 20:22:30,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3a9e6eb-4538-4928-9c09-185b07da8fa4/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:22:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:22:30,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:22:30,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:22:30,464 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:22:30,465 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686232855] [2019-11-15 20:22:30,465 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 20:22:30,465 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126346714] [2019-11-15 20:22:30,465 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:22:30,465 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-11-15 20:22:30,465 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156050569] [2019-11-15 20:22:30,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:22:30,466 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:22:30,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:22:30,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:22:30,467 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 5 states. [2019-11-15 20:22:30,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:22:30,565 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-11-15 20:22:30,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:22:30,566 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-15 20:22:30,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:22:30,567 INFO L225 Difference]: With dead ends: 42 [2019-11-15 20:22:30,567 INFO L226 Difference]: Without dead ends: 35 [2019-11-15 20:22:30,567 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:22:30,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-15 20:22:30,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 22. [2019-11-15 20:22:30,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-15 20:22:30,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-11-15 20:22:30,572 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 12 [2019-11-15 20:22:30,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:22:30,572 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-11-15 20:22:30,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:22:30,572 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-11-15 20:22:30,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-15 20:22:30,573 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:22:30,573 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:22:30,776 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:22:30,776 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:22:30,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:22:30,776 INFO L82 PathProgramCache]: Analyzing trace with hash 437833903, now seen corresponding path program 1 times [2019-11-15 20:22:30,777 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:22:30,777 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005586728] [2019-11-15 20:22:30,777 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:30,777 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:30,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:22:30,787 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 20:22:30,788 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [126751587] [2019-11-15 20:22:30,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3a9e6eb-4538-4928-9c09-185b07da8fa4/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:22:30,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:22:30,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 20:22:30,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:22:30,884 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:22:30,884 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005586728] [2019-11-15 20:22:30,884 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 20:22:30,885 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126751587] [2019-11-15 20:22:30,885 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:22:30,885 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:22:30,885 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949643853] [2019-11-15 20:22:30,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:22:30,886 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:22:30,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:22:30,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:22:30,886 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 6 states. [2019-11-15 20:22:30,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:22:30,984 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2019-11-15 20:22:30,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:22:30,987 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-15 20:22:30,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:22:30,988 INFO L225 Difference]: With dead ends: 39 [2019-11-15 20:22:30,988 INFO L226 Difference]: Without dead ends: 25 [2019-11-15 20:22:30,989 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:22:30,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-15 20:22:30,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2019-11-15 20:22:30,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-15 20:22:30,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-11-15 20:22:30,992 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 14 [2019-11-15 20:22:30,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:22:30,992 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-11-15 20:22:30,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:22:30,992 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-11-15 20:22:30,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-15 20:22:30,993 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:22:30,993 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:22:31,193 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:22:31,194 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:22:31,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:22:31,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1602337035, now seen corresponding path program 1 times [2019-11-15 20:22:31,194 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:22:31,195 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341060102] [2019-11-15 20:22:31,195 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:31,195 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:31,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:22:31,206 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 20:22:31,207 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2072897551] [2019-11-15 20:22:31,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3a9e6eb-4538-4928-9c09-185b07da8fa4/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:22:31,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:22:31,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-15 20:22:31,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:22:31,273 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:22:31,274 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:22:31,281 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:22:31,286 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:22:31,287 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:22:31,298 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:22:31,298 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:22:31,298 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:19 [2019-11-15 20:22:31,356 INFO L341 Elim1Store]: treesize reduction 54, result has 46.0 percent of original size [2019-11-15 20:22:31,357 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:22:31,358 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:22:31,396 INFO L567 ElimStorePlain]: treesize reduction 24, result has 67.1 percent of original size [2019-11-15 20:22:31,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:31,398 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:22:31,399 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:49 [2019-11-15 20:22:31,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:31,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:31,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:31,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:31,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:31,533 INFO L392 ElimStorePlain]: Different costs {12=[|v_#memory_int_12|], 20=[v_prenex_4]} [2019-11-15 20:22:31,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:31,543 INFO L341 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-15 20:22:31,544 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:22:31,546 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:22:31,584 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:22:31,591 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:31,634 INFO L341 Elim1Store]: treesize reduction 17, result has 60.5 percent of original size [2019-11-15 20:22:31,635 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:22:31,637 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:22:31,709 INFO L567 ElimStorePlain]: treesize reduction 59, result has 65.7 percent of original size [2019-11-15 20:22:31,711 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:22:31,711 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:115, output treesize:113 [2019-11-15 20:22:31,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:31,888 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:22:31,889 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341060102] [2019-11-15 20:22:31,889 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 20:22:31,889 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072897551] [2019-11-15 20:22:31,889 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:22:31,889 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-11-15 20:22:31,890 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776015890] [2019-11-15 20:22:31,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 20:22:31,890 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:22:31,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 20:22:31,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:22:31,891 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 8 states. [2019-11-15 20:22:32,171 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2019-11-15 20:22:32,311 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 66 [2019-11-15 20:22:32,497 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 68 [2019-11-15 20:22:32,758 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 70 [2019-11-15 20:22:32,975 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 66 [2019-11-15 20:22:33,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:22:33,030 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-11-15 20:22:33,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 20:22:33,031 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-11-15 20:22:33,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:22:33,032 INFO L225 Difference]: With dead ends: 42 [2019-11-15 20:22:33,032 INFO L226 Difference]: Without dead ends: 40 [2019-11-15 20:22:33,033 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-11-15 20:22:33,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-15 20:22:33,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 26. [2019-11-15 20:22:33,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-15 20:22:33,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-11-15 20:22:33,039 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 14 [2019-11-15 20:22:33,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:22:33,039 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-11-15 20:22:33,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 20:22:33,040 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-11-15 20:22:33,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-15 20:22:33,040 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:22:33,040 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:22:33,243 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:22:33,243 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:22:33,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:22:33,244 INFO L82 PathProgramCache]: Analyzing trace with hash -602215277, now seen corresponding path program 2 times [2019-11-15 20:22:33,244 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:22:33,244 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400204501] [2019-11-15 20:22:33,244 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:33,244 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:33,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:22:33,272 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 20:22:33,277 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1384795783] [2019-11-15 20:22:33,278 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3a9e6eb-4538-4928-9c09-185b07da8fa4/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:22:33,323 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 20:22:33,323 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:22:33,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 20:22:33,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:22:33,373 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:22:33,374 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400204501] [2019-11-15 20:22:33,374 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 20:22:33,374 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384795783] [2019-11-15 20:22:33,374 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:22:33,374 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-11-15 20:22:33,374 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659651950] [2019-11-15 20:22:33,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:22:33,375 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:22:33,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:22:33,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:22:33,375 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 7 states. [2019-11-15 20:22:33,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:22:33,479 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2019-11-15 20:22:33,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 20:22:33,481 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-11-15 20:22:33,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:22:33,481 INFO L225 Difference]: With dead ends: 59 [2019-11-15 20:22:33,482 INFO L226 Difference]: Without dead ends: 50 [2019-11-15 20:22:33,482 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:22:33,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-15 20:22:33,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 26. [2019-11-15 20:22:33,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-15 20:22:33,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2019-11-15 20:22:33,488 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 16 [2019-11-15 20:22:33,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:22:33,488 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-11-15 20:22:33,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:22:33,488 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2019-11-15 20:22:33,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-15 20:22:33,489 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:22:33,489 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:22:33,692 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:22:33,693 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:22:33,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:22:33,693 INFO L82 PathProgramCache]: Analyzing trace with hash -508830509, now seen corresponding path program 3 times [2019-11-15 20:22:33,693 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:22:33,693 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850065096] [2019-11-15 20:22:33,693 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:33,693 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:33,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:22:33,704 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 20:22:33,705 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1457104872] [2019-11-15 20:22:33,705 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3a9e6eb-4538-4928-9c09-185b07da8fa4/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:22:33,746 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-15 20:22:33,746 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:22:33,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 20:22:33,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:22:33,801 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:22:33,801 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850065096] [2019-11-15 20:22:33,801 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 20:22:33,801 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457104872] [2019-11-15 20:22:33,801 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:22:33,802 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-11-15 20:22:33,802 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510357614] [2019-11-15 20:22:33,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:22:33,802 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:22:33,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:22:33,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:22:33,802 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 7 states. [2019-11-15 20:22:33,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:22:33,916 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2019-11-15 20:22:33,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 20:22:33,917 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-11-15 20:22:33,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:22:33,917 INFO L225 Difference]: With dead ends: 54 [2019-11-15 20:22:33,918 INFO L226 Difference]: Without dead ends: 47 [2019-11-15 20:22:33,918 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:22:33,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-15 20:22:33,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 28. [2019-11-15 20:22:33,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-15 20:22:33,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2019-11-15 20:22:33,924 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 16 [2019-11-15 20:22:33,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:22:33,925 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-11-15 20:22:33,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:22:33,925 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2019-11-15 20:22:33,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 20:22:33,926 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:22:33,926 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:22:34,126 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:22:34,131 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:22:34,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:22:34,131 INFO L82 PathProgramCache]: Analyzing trace with hash 575675563, now seen corresponding path program 1 times [2019-11-15 20:22:34,131 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:22:34,131 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513620699] [2019-11-15 20:22:34,131 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:34,132 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:34,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:22:34,142 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 20:22:34,142 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1282075880] [2019-11-15 20:22:34,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3a9e6eb-4538-4928-9c09-185b07da8fa4/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:22:34,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:22:34,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-15 20:22:34,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:22:34,214 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:22:34,215 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:22:34,226 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:22:34,234 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:22:34,234 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:22:34,246 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:22:34,246 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:22:34,247 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:22 [2019-11-15 20:22:34,265 INFO L341 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2019-11-15 20:22:34,266 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:22:34,266 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:22:34,273 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:22:34,273 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:22:34,273 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:36 [2019-11-15 20:22:34,322 INFO L341 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2019-11-15 20:22:34,322 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:22:34,323 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:22:34,335 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:22:34,336 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:22:34,336 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:59, output treesize:47 [2019-11-15 20:22:34,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:34,517 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:22:34,518 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513620699] [2019-11-15 20:22:34,518 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 20:22:34,518 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282075880] [2019-11-15 20:22:34,518 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:22:34,518 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-11-15 20:22:34,519 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897508379] [2019-11-15 20:22:34,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 20:22:34,519 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:22:34,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 20:22:34,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:22:34,520 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 10 states. [2019-11-15 20:22:34,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:22:34,914 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-11-15 20:22:34,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 20:22:34,915 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-11-15 20:22:34,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:22:34,916 INFO L225 Difference]: With dead ends: 43 [2019-11-15 20:22:34,916 INFO L226 Difference]: Without dead ends: 41 [2019-11-15 20:22:34,916 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:22:34,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-15 20:22:34,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2019-11-15 20:22:34,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-15 20:22:34,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2019-11-15 20:22:34,922 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 18 [2019-11-15 20:22:34,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:22:34,922 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2019-11-15 20:22:34,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 20:22:34,922 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2019-11-15 20:22:34,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 20:22:34,923 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:22:34,923 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:22:35,123 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:22:35,124 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:22:35,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:22:35,124 INFO L82 PathProgramCache]: Analyzing trace with hash -2009431311, now seen corresponding path program 4 times [2019-11-15 20:22:35,124 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:22:35,124 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114204220] [2019-11-15 20:22:35,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:35,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:35,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:22:35,146 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 20:22:35,146 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [941553966] [2019-11-15 20:22:35,146 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3a9e6eb-4538-4928-9c09-185b07da8fa4/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:22:35,192 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 20:22:35,193 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:22:35,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-15 20:22:35,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:22:35,218 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:22:35,218 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:22:35,219 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:22:35,250 INFO L567 ElimStorePlain]: treesize reduction 12, result has 70.0 percent of original size [2019-11-15 20:22:35,250 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:22:35,250 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:28 [2019-11-15 20:22:35,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:35,273 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:35,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:35,295 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:22:35,295 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 87 [2019-11-15 20:22:35,296 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:22:35,302 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:35,365 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:22:35,365 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 5 case distinctions, treesize of input 50 treesize of output 153 [2019-11-15 20:22:35,367 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:22:35,452 INFO L567 ElimStorePlain]: treesize reduction 165, result has 38.9 percent of original size [2019-11-15 20:22:35,452 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 20:22:35,452 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:97, output treesize:105 [2019-11-15 20:22:35,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:35,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:35,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:35,697 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-11-15 20:22:35,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 20:22:35,716 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:35,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:35,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:35,847 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:22:35,847 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:22:35,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:35,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:35,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:35,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:35,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:35,854 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:22:35,885 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:35,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:35,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:36,085 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-11-15 20:22:36,086 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:22:36,086 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 77 treesize of output 358 [2019-11-15 20:22:36,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:36,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:36,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:36,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:36,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:36,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:36,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:36,096 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:22:36,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:36,132 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:36,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:36,228 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:22:36,229 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:22:36,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:36,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:36,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:36,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:36,233 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 20:22:36,255 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:36,260 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:36,309 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:22:36,310 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 4 case distinctions, treesize of input 81 treesize of output 240 [2019-11-15 20:22:36,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:36,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:36,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:36,313 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 20:22:36,990 WARN L191 SmtUtils]: Spent 676.00 ms on a formula simplification. DAG size of input: 311 DAG size of output: 84 [2019-11-15 20:22:36,991 INFO L567 ElimStorePlain]: treesize reduction 2221, result has 13.8 percent of original size [2019-11-15 20:22:36,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:36,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:36,993 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:22:36,993 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:293, output treesize:275 [2019-11-15 20:22:37,126 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-11-15 20:22:37,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 20:22:37,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:37,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:37,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:37,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:37,527 WARN L191 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 76 [2019-11-15 20:22:37,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-15 20:22:37,792 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 107 [2019-11-15 20:22:37,954 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-11-15 20:22:37,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-15 20:22:37,973 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:37,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:37,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:37,979 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:22:37,980 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:38,000 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:22:38,008 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:38,009 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:38,012 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:38,012 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:22:38,016 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:22:38,017 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:22:38,019 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:22:38,034 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:38,037 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:38,037 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:22:38,041 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:38,043 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:38,047 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:38,055 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:38,066 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:22:38,086 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:22:38,087 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:22:38,095 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:22:38,100 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:38,102 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:22:38,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:38,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:38,107 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:22:38,135 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:22:38,153 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:38,154 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:38,227 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:22:38,227 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:22:38,230 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 20:22:38,242 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:22:38,244 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:22:38,246 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:38,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:38,258 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:22:38,261 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:22:38,302 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:22:38,303 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:22:38,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:38,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:38,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:38,305 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 20:22:38,317 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:22:38,334 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:22:38,336 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:38,338 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:38,338 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:22:38,356 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:22:38,430 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:22:38,430 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:22:38,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:38,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:38,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:38,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:38,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:38,434 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 20:22:38,460 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:38,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:38,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:38,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:38,474 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:38,475 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:22:38,475 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:22:38,477 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:38,479 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:38,511 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:22:38,512 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:22:38,515 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 20:22:38,957 WARN L191 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 275 DAG size of output: 126 [2019-11-15 20:22:38,958 INFO L567 ElimStorePlain]: treesize reduction 1356, result has 29.2 percent of original size [2019-11-15 20:22:38,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:38,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:38,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:38,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:38,962 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:22:38,963 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:550, output treesize:557 [2019-11-15 20:22:38,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:38,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:22:38,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:39,149 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 141 [2019-11-15 20:22:39,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-15 20:22:39,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:39,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:22:39,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:39,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:22:39,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:39,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:39,629 WARN L191 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 115 [2019-11-15 20:22:39,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-15 20:22:39,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:39,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:39,660 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:39,664 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:39,665 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:22:39,665 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:22:39,667 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:39,678 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:22:39,678 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:22:39,682 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 64 treesize of output 52 [2019-11-15 20:22:39,682 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:22:39,690 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-11-15 20:22:39,690 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:22:39,695 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-11-15 20:22:39,695 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 20:22:39,701 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:39,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:39,704 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:39,707 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:39,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:39,719 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:39,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:39,722 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:39,723 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:39,724 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:39,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:39,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:39,728 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:39,735 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:22:39,808 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:22:39,809 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 95 treesize of output 298 [2019-11-15 20:22:39,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:39,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:39,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:39,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:39,813 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 20:22:39,820 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-11-15 20:22:39,820 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 20:22:39,826 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-11-15 20:22:39,826 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 20:22:39,833 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:39,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:39,836 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:39,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:39,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:39,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:39,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:39,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:39,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:39,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:39,850 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:22:39,851 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:39,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:39,887 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:22:39,887 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 82 treesize of output 201 [2019-11-15 20:22:39,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:39,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:39,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:39,890 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-15 20:22:40,084 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 72 [2019-11-15 20:22:40,084 INFO L567 ElimStorePlain]: treesize reduction 904, result has 20.3 percent of original size [2019-11-15 20:22:40,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:40,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:40,087 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:22:40,087 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:612, output treesize:229 [2019-11-15 20:22:40,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:22:40,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:22:40,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:22:40,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:22:40,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:40,573 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:22:40,573 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114204220] [2019-11-15 20:22:40,573 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 20:22:40,573 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941553966] [2019-11-15 20:22:40,574 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:22:40,574 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-11-15 20:22:40,574 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381239149] [2019-11-15 20:22:40,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 20:22:40,574 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:22:40,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 20:22:40,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-11-15 20:22:40,575 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 14 states. [2019-11-15 20:22:40,968 WARN L191 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 107 [2019-11-15 20:22:41,630 WARN L191 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 110 [2019-11-15 20:22:42,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:22:42,454 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2019-11-15 20:22:42,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 20:22:42,455 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2019-11-15 20:22:42,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:22:42,456 INFO L225 Difference]: With dead ends: 54 [2019-11-15 20:22:42,456 INFO L226 Difference]: Without dead ends: 52 [2019-11-15 20:22:42,456 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2019-11-15 20:22:42,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-15 20:22:42,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 41. [2019-11-15 20:22:42,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-15 20:22:42,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2019-11-15 20:22:42,464 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 18 [2019-11-15 20:22:42,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:22:42,464 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2019-11-15 20:22:42,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 20:22:42,465 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2019-11-15 20:22:42,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 20:22:42,465 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:22:42,466 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:22:42,668 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:22:42,669 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:22:42,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:22:42,669 INFO L82 PathProgramCache]: Analyzing trace with hash -977790577, now seen corresponding path program 5 times [2019-11-15 20:22:42,670 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:22:42,670 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682696972] [2019-11-15 20:22:42,670 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:42,670 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:42,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:22:42,698 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 20:22:42,711 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1043481569] [2019-11-15 20:22:42,712 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3a9e6eb-4538-4928-9c09-185b07da8fa4/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:22:42,771 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-11-15 20:22:42,772 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:22:42,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 20:22:42,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:22:42,829 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:22:42,830 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682696972] [2019-11-15 20:22:42,830 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 20:22:42,830 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043481569] [2019-11-15 20:22:42,830 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:22:42,830 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-11-15 20:22:42,830 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527263923] [2019-11-15 20:22:42,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 20:22:42,831 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:22:42,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 20:22:42,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:22:42,831 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 9 states. [2019-11-15 20:22:42,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:22:42,970 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2019-11-15 20:22:42,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 20:22:42,970 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-11-15 20:22:42,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:22:42,971 INFO L225 Difference]: With dead ends: 88 [2019-11-15 20:22:42,971 INFO L226 Difference]: Without dead ends: 79 [2019-11-15 20:22:42,972 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:22:42,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-15 20:22:42,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 41. [2019-11-15 20:22:42,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-15 20:22:42,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-11-15 20:22:42,984 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 20 [2019-11-15 20:22:42,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:22:42,985 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-11-15 20:22:42,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 20:22:42,985 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-11-15 20:22:42,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 20:22:42,986 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:22:42,986 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:22:43,189 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:22:43,189 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:22:43,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:22:43,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1429341745, now seen corresponding path program 6 times [2019-11-15 20:22:43,190 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:22:43,190 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290445732] [2019-11-15 20:22:43,190 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:43,190 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:43,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:22:43,202 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 20:22:43,202 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [236590329] [2019-11-15 20:22:43,202 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3a9e6eb-4538-4928-9c09-185b07da8fa4/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:22:43,255 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-11-15 20:22:43,255 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:22:43,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 20:22:43,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:22:43,302 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:22:43,302 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290445732] [2019-11-15 20:22:43,302 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 20:22:43,303 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236590329] [2019-11-15 20:22:43,303 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:22:43,303 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-11-15 20:22:43,303 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576256289] [2019-11-15 20:22:43,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 20:22:43,303 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:22:43,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 20:22:43,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:22:43,304 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 9 states. [2019-11-15 20:22:43,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:22:43,445 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2019-11-15 20:22:43,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 20:22:43,446 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-11-15 20:22:43,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:22:43,446 INFO L225 Difference]: With dead ends: 75 [2019-11-15 20:22:43,446 INFO L226 Difference]: Without dead ends: 68 [2019-11-15 20:22:43,447 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:22:43,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-15 20:22:43,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 43. [2019-11-15 20:22:43,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-15 20:22:43,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-11-15 20:22:43,456 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 20 [2019-11-15 20:22:43,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:22:43,456 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-11-15 20:22:43,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 20:22:43,456 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-11-15 20:22:43,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 20:22:43,457 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:22:43,457 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:22:43,657 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:22:43,658 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:22:43,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:22:43,658 INFO L82 PathProgramCache]: Analyzing trace with hash 389293921, now seen corresponding path program 2 times [2019-11-15 20:22:43,658 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:22:43,658 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295448308] [2019-11-15 20:22:43,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:43,666 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:43,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:22:43,674 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 20:22:43,674 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1430745405] [2019-11-15 20:22:43,674 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3a9e6eb-4538-4928-9c09-185b07da8fa4/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:22:43,729 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 20:22:43,729 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:22:43,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 20:22:43,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:22:43,766 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:22:43,766 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295448308] [2019-11-15 20:22:43,766 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 20:22:43,766 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430745405] [2019-11-15 20:22:43,766 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:22:43,766 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-11-15 20:22:43,766 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147501745] [2019-11-15 20:22:43,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 20:22:43,766 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:22:43,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 20:22:43,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:22:43,767 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 8 states. [2019-11-15 20:22:43,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:22:43,854 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2019-11-15 20:22:43,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 20:22:43,854 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-11-15 20:22:43,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:22:43,855 INFO L225 Difference]: With dead ends: 66 [2019-11-15 20:22:43,855 INFO L226 Difference]: Without dead ends: 46 [2019-11-15 20:22:43,855 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:22:43,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-15 20:22:43,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2019-11-15 20:22:43,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-15 20:22:43,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2019-11-15 20:22:43,860 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 22 [2019-11-15 20:22:43,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:22:43,860 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2019-11-15 20:22:43,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 20:22:43,861 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2019-11-15 20:22:43,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 20:22:43,861 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:22:43,861 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:22:44,064 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:22:44,065 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:22:44,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:22:44,065 INFO L82 PathProgramCache]: Analyzing trace with hash 425065127, now seen corresponding path program 3 times [2019-11-15 20:22:44,065 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:22:44,065 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366320871] [2019-11-15 20:22:44,065 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:44,065 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:44,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:22:44,072 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 20:22:44,072 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [493226794] [2019-11-15 20:22:44,072 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3a9e6eb-4538-4928-9c09-185b07da8fa4/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:22:44,128 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-15 20:22:44,128 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:22:44,130 WARN L254 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 47 conjunts are in the unsatisfiable core [2019-11-15 20:22:44,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:22:44,154 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:22:44,154 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:22:44,167 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:22:44,171 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:22:44,171 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:22:44,189 INFO L567 ElimStorePlain]: treesize reduction 4, result has 87.1 percent of original size [2019-11-15 20:22:44,190 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:22:44,190 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:27 [2019-11-15 20:22:44,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:44,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:44,211 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:22:44,221 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-11-15 20:22:44,222 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:22:44,222 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:22:44,244 INFO L567 ElimStorePlain]: treesize reduction 28, result has 61.1 percent of original size [2019-11-15 20:22:44,245 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:22:44,245 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:44 [2019-11-15 20:22:44,294 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:44,295 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:44,297 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:44,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:44,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:44,307 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:22:44,308 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 56 treesize of output 83 [2019-11-15 20:22:44,308 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:22:44,342 INFO L567 ElimStorePlain]: treesize reduction 46, result has 59.3 percent of original size [2019-11-15 20:22:44,342 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:22:44,343 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:71, output treesize:67 [2019-11-15 20:22:44,402 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:44,407 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:44,407 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:22:44,408 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:44,409 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:44,411 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:44,441 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:22:44,441 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 75 treesize of output 162 [2019-11-15 20:22:44,442 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:22:44,525 INFO L567 ElimStorePlain]: treesize reduction 116, result has 41.4 percent of original size [2019-11-15 20:22:44,525 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:22:44,526 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:90, output treesize:82 [2019-11-15 20:22:44,576 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:44,578 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:44,580 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:44,580 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:22:44,582 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:45,119 WARN L191 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 125 [2019-11-15 20:22:45,119 INFO L341 Elim1Store]: treesize reduction 164, result has 74.0 percent of original size [2019-11-15 20:22:45,120 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 96 treesize of output 500 [2019-11-15 20:22:45,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:45,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:45,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:45,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:45,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:45,126 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:22:45,248 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 50 [2019-11-15 20:22:45,248 INFO L567 ElimStorePlain]: treesize reduction 959, result has 9.5 percent of original size [2019-11-15 20:22:45,248 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:22:45,249 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:108, output treesize:101 [2019-11-15 20:22:45,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:45,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:45,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:45,599 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:22:45,599 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366320871] [2019-11-15 20:22:45,600 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 20:22:45,600 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493226794] [2019-11-15 20:22:45,600 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:22:45,600 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-11-15 20:22:45,600 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449722379] [2019-11-15 20:22:45,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-15 20:22:45,600 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:22:45,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 20:22:45,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-11-15 20:22:45,601 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 15 states. [2019-11-15 20:22:46,118 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-11-15 20:22:46,416 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 81 [2019-11-15 20:22:46,682 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2019-11-15 20:22:46,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:22:46,849 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2019-11-15 20:22:46,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 20:22:46,850 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2019-11-15 20:22:46,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:22:46,850 INFO L225 Difference]: With dead ends: 50 [2019-11-15 20:22:46,850 INFO L226 Difference]: Without dead ends: 48 [2019-11-15 20:22:46,851 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2019-11-15 20:22:46,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-15 20:22:46,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 37. [2019-11-15 20:22:46,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-15 20:22:46,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2019-11-15 20:22:46,859 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 22 [2019-11-15 20:22:46,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:22:46,860 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2019-11-15 20:22:46,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-15 20:22:46,860 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2019-11-15 20:22:46,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 20:22:46,861 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:22:46,861 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:22:47,069 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:22:47,070 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:22:47,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:22:47,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1004709725, now seen corresponding path program 4 times [2019-11-15 20:22:47,070 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:22:47,070 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261985475] [2019-11-15 20:22:47,070 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:47,071 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:47,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:22:47,079 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 20:22:47,079 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2012223770] [2019-11-15 20:22:47,079 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3a9e6eb-4538-4928-9c09-185b07da8fa4/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:22:47,139 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 20:22:47,139 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:22:47,140 WARN L254 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 44 conjunts are in the unsatisfiable core [2019-11-15 20:22:47,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:22:47,155 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-11-15 20:22:47,155 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:22:47,155 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:22:47,157 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:22:47,157 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:22:47,157 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-15 20:22:47,194 INFO L341 Elim1Store]: treesize reduction 100, result has 20.0 percent of original size [2019-11-15 20:22:47,195 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:22:47,195 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:22:47,203 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:22:47,203 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:22:47,204 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:49 [2019-11-15 20:22:47,616 WARN L191 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 75 [2019-11-15 20:22:47,617 INFO L341 Elim1Store]: treesize reduction 180, result has 63.0 percent of original size [2019-11-15 20:22:47,617 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:22:47,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:47,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:47,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:47,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:47,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:47,623 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:22:48,032 WARN L191 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 88 [2019-11-15 20:22:48,033 INFO L567 ElimStorePlain]: treesize reduction 519, result has 50.0 percent of original size [2019-11-15 20:22:48,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:48,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:48,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:48,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:48,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:48,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:48,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:48,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:48,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:48,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:48,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:48,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:48,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:48,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:48,045 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:22:48,046 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:92, output treesize:517 [2019-11-15 20:22:48,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:48,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:48,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:48,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:48,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:48,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:48,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:48,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:48,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:48,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:48,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:48,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:48,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:48,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:48,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:48,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:48,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:48,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:48,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:48,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:48,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:48,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:48,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:48,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:48,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:48,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:48,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:50,262 WARN L191 SmtUtils]: Spent 1.95 s on a formula simplification. DAG size of input: 212 DAG size of output: 139 [2019-11-15 20:22:50,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 11 terms [2019-11-15 20:22:50,338 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:50,341 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:50,348 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:50,356 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:50,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:50,393 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:50,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:50,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:50,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:50,480 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:22:50,489 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:50,496 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:51,017 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:22:51,111 INFO L235 Elim1Store]: Index analysis took 804 ms [2019-11-15 20:22:51,542 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2019-11-15 20:22:51,542 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:22:51,542 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 156 treesize of output 596 [2019-11-15 20:22:51,545 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:22:51,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:51,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:51,609 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:51,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:51,622 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:51,628 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:51,634 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:51,635 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:22:51,641 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:51,647 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:51,654 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:51,654 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:22:51,745 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:22:51,796 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:22:51,808 INFO L235 Elim1Store]: Index analysis took 216 ms [2019-11-15 20:22:51,810 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 93 treesize of output 68 [2019-11-15 20:22:51,810 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:22:51,830 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-11-15 20:22:51,830 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 20:22:51,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:51,878 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:51,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:51,888 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:51,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:51,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:51,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:51,991 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:52,006 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:52,017 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:52,028 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:52,038 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:52,039 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:22:52,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:52,731 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:22:52,752 INFO L235 Elim1Store]: Index analysis took 886 ms [2019-11-15 20:22:53,155 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-11-15 20:22:53,156 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:22:53,156 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:22:53,160 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 20:22:53,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:53,223 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:53,239 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:53,244 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:53,267 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:53,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:53,281 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:53,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:53,294 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:53,299 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:53,307 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:22:53,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:53,319 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:53,330 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:22:53,358 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:22:53,606 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:22:53,633 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:22:53,638 INFO L235 Elim1Store]: Index analysis took 440 ms [2019-11-15 20:22:53,653 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:22:53,653 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:22:53,654 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 20:22:53,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:53,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:53,713 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:53,717 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:53,739 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:53,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:53,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:53,756 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:53,764 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:53,942 INFO L235 Elim1Store]: Index analysis took 252 ms [2019-11-15 20:22:53,957 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:22:53,958 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:22:53,958 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 20:22:53,972 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-11-15 20:22:53,972 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-15 20:22:54,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:54,009 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:54,017 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:54,050 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:54,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:54,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:54,110 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:54,125 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:54,138 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:54,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:54,154 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:54,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:54,178 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:22:54,186 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:54,572 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:22:54,579 INFO L235 Elim1Store]: Index analysis took 578 ms [2019-11-15 20:22:55,030 WARN L191 SmtUtils]: Spent 327.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-11-15 20:22:55,030 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:22:55,031 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:22:55,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:55,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:55,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:55,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:55,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:55,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:55,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:55,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:55,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:55,042 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-15 20:22:55,070 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:55,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:55,078 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:55,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:55,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:55,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:55,118 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:22:55,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:55,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:55,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:55,146 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:55,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:55,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:55,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:55,169 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:55,177 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:55,180 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:55,196 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:22:55,349 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:22:55,354 INFO L235 Elim1Store]: Index analysis took 286 ms [2019-11-15 20:22:55,368 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:22:55,368 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:22:55,369 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-15 20:22:55,408 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:55,410 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:22:55,419 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:55,421 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:55,424 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:55,426 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:55,428 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:55,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:55,440 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:55,448 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:55,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:55,453 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:55,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:55,463 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:22:55,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:55,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:55,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:55,497 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:22:55,554 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:22:55,567 INFO L235 Elim1Store]: Index analysis took 164 ms [2019-11-15 20:22:55,582 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:22:55,583 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:22:55,584 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-15 20:22:55,608 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:55,611 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:55,616 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:55,623 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:55,625 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:55,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:55,628 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:55,630 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:55,632 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:55,635 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:55,636 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:55,639 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:55,639 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:22:55,641 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:22:55,900 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-11-15 20:22:55,901 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:22:55,901 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:22:55,904 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-15 20:22:58,384 WARN L191 SmtUtils]: Spent 2.48 s on a formula simplification. DAG size of input: 626 DAG size of output: 253 [2019-11-15 20:22:58,384 INFO L567 ElimStorePlain]: treesize reduction 4625, result has 26.2 percent of original size [2019-11-15 20:22:58,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,439 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:22:58,439 INFO L221 ElimStorePlain]: Needed 12 recursive calls to eliminate 8 variables, input treesize:1369, output treesize:1638 [2019-11-15 20:22:58,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:22:58,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,285 WARN L191 SmtUtils]: Spent 41.67 s on a formula simplification. DAG size of input: 346 DAG size of output: 248 [2019-11-15 20:23:40,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-15 20:23:40,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:23:40,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:24:05,468 WARN L191 SmtUtils]: Spent 22.71 s on a formula simplification. DAG size of input: 363 DAG size of output: 261 [2019-11-15 20:24:05,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 13 terms [2019-11-15 20:24:06,388 WARN L191 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 111 [2019-11-15 20:24:06,944 WARN L191 SmtUtils]: Spent 443.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2019-11-15 20:24:10,032 WARN L191 SmtUtils]: Spent 2.98 s on a formula simplification that was a NOOP. DAG size: 135 [2019-11-15 20:24:10,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 10 terms [2019-11-15 20:24:11,192 WARN L191 SmtUtils]: Spent 999.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2019-11-15 20:24:12,199 WARN L191 SmtUtils]: Spent 876.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2019-11-15 20:24:15,379 WARN L191 SmtUtils]: Spent 3.06 s on a formula simplification. DAG size of input: 145 DAG size of output: 143 [2019-11-15 20:24:15,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-11-15 20:24:15,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:24:15,806 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:24:15,807 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261985475] [2019-11-15 20:24:15,807 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 20:24:15,807 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012223770] [2019-11-15 20:24:15,807 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:24:15,807 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-11-15 20:24:15,807 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232689958] [2019-11-15 20:24:15,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-15 20:24:15,808 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:24:15,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-15 20:24:15,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=365, Unknown=1, NotChecked=0, Total=420 [2019-11-15 20:24:15,809 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 21 states. [2019-11-15 20:24:35,420 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-11-15 20:24:35,621 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:24:35,621 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:24:35,624 INFO L168 Benchmark]: Toolchain (without parser) took 127345.17 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 255.3 MB). Free memory was 944.7 MB in the beginning and 915.3 MB in the end (delta: 29.4 MB). Peak memory consumption was 284.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:24:35,625 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:24:35,625 INFO L168 Benchmark]: CACSL2BoogieTranslator took 277.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -192.2 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-15 20:24:35,625 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.05 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:24:35,625 INFO L168 Benchmark]: Boogie Preprocessor took 30.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:24:35,626 INFO L168 Benchmark]: RCFGBuilder took 316.42 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: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-15 20:24:35,626 INFO L168 Benchmark]: TraceAbstraction took 126681.45 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 113.2 MB). Free memory was 1.1 GB in the beginning and 915.3 MB in the end (delta: 197.9 MB). Peak memory consumption was 311.2 MB. Max. memory is 11.5 GB. [2019-11-15 20:24:35,628 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 277.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -192.2 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.05 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 30.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 316.42 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: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 126681.45 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 113.2 MB). Free memory was 1.1 GB in the beginning and 915.3 MB in the end (delta: 197.9 MB). Peak memory consumption was 311.2 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:24:37,617 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:24:37,619 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:24:37,629 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:24:37,629 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:24:37,630 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:24:37,632 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:24:37,634 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:24:37,635 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:24:37,636 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:24:37,637 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:24:37,638 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:24:37,639 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:24:37,640 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:24:37,641 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:24:37,642 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:24:37,643 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:24:37,644 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:24:37,646 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:24:37,648 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:24:37,649 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:24:37,654 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:24:37,655 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:24:37,656 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:24:37,659 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:24:37,662 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:24:37,662 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:24:37,663 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:24:37,663 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:24:37,666 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:24:37,666 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:24:37,667 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:24:37,668 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:24:37,669 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:24:37,670 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:24:37,672 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:24:37,673 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:24:37,674 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:24:37,674 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:24:37,675 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:24:37,679 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:24:37,682 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e3a9e6eb-4538-4928-9c09-185b07da8fa4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-15 20:24:37,695 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:24:37,699 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:24:37,701 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:24:37,701 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:24:37,701 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:24:37,701 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:24:37,702 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:24:37,702 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:24:37,702 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:24:37,702 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:24:37,702 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:24:37,703 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:24:37,703 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 20:24:37,703 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 20:24:37,703 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:24:37,704 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:24:37,704 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:24:37,704 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:24:37,704 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:24:37,704 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:24:37,705 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:24:37,705 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:24:37,705 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:24:37,705 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:24:37,706 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:24:37,706 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:24:37,706 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 20:24:37,706 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 20:24:37,706 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:24:37,707 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 20:24:37,707 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_e3a9e6eb-4538-4928-9c09-185b07da8fa4/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 -> ccef52befb042c9cb85d0ad94e261a151e50814b [2019-11-15 20:24:37,736 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:24:37,747 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:24:37,750 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:24:37,751 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:24:37,752 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:24:37,754 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e3a9e6eb-4538-4928-9c09-185b07da8fa4/bin/uautomizer/../../sv-benchmarks/c/array-fpi/eqn3.c [2019-11-15 20:24:37,815 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e3a9e6eb-4538-4928-9c09-185b07da8fa4/bin/uautomizer/data/1ec751cc2/b8b4135e19b54230a7acb16420c58833/FLAGf09ba9dcf [2019-11-15 20:24:38,227 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:24:38,228 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e3a9e6eb-4538-4928-9c09-185b07da8fa4/sv-benchmarks/c/array-fpi/eqn3.c [2019-11-15 20:24:38,234 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e3a9e6eb-4538-4928-9c09-185b07da8fa4/bin/uautomizer/data/1ec751cc2/b8b4135e19b54230a7acb16420c58833/FLAGf09ba9dcf [2019-11-15 20:24:38,661 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e3a9e6eb-4538-4928-9c09-185b07da8fa4/bin/uautomizer/data/1ec751cc2/b8b4135e19b54230a7acb16420c58833 [2019-11-15 20:24:38,665 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:24:38,667 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:24:38,668 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:24:38,669 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:24:38,672 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:24:38,673 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:24:38" (1/1) ... [2019-11-15 20:24:38,675 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24dd52aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:24:38, skipping insertion in model container [2019-11-15 20:24:38,676 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:24:38" (1/1) ... [2019-11-15 20:24:38,682 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:24:38,701 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:24:38,900 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:24:38,929 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:24:39,021 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:24:39,040 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:24:39,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:24:39 WrapperNode [2019-11-15 20:24:39,041 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:24:39,042 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:24:39,042 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:24:39,042 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:24:39,051 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:24:39" (1/1) ... [2019-11-15 20:24:39,070 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:24:39" (1/1) ... [2019-11-15 20:24:39,097 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:24:39,098 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:24:39,098 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:24:39,098 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:24:39,107 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:24:39" (1/1) ... [2019-11-15 20:24:39,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:24:39" (1/1) ... [2019-11-15 20:24:39,112 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:24:39" (1/1) ... [2019-11-15 20:24:39,112 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:24:39" (1/1) ... [2019-11-15 20:24:39,129 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:24:39" (1/1) ... [2019-11-15 20:24:39,135 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:24:39" (1/1) ... [2019-11-15 20:24:39,145 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:24:39" (1/1) ... [2019-11-15 20:24:39,147 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:24:39,150 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:24:39,150 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:24:39,151 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:24:39,152 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:24:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3a9e6eb-4538-4928-9c09-185b07da8fa4/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:24:39,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2019-11-15 20:24:39,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 20:24:39,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:24:39,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:24:39,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2019-11-15 20:24:39,532 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:24:39,532 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-15 20:24:39,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:24:39 BoogieIcfgContainer [2019-11-15 20:24:39,533 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:24:39,538 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:24:39,538 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:24:39,541 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:24:39,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:24:38" (1/3) ... [2019-11-15 20:24:39,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ca56857 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:24:39, skipping insertion in model container [2019-11-15 20:24:39,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:24:39" (2/3) ... [2019-11-15 20:24:39,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ca56857 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:24:39, skipping insertion in model container [2019-11-15 20:24:39,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:24:39" (3/3) ... [2019-11-15 20:24:39,545 INFO L109 eAbstractionObserver]: Analyzing ICFG eqn3.c [2019-11-15 20:24:39,554 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:24:39,576 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 20:24:39,588 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 20:24:39,613 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:24:39,614 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:24:39,614 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:24:39,614 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:24:39,614 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:24:39,614 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:24:39,614 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:24:39,615 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:24:39,630 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-11-15 20:24:39,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 20:24:39,639 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:24:39,640 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:24:39,642 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:24:39,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:24:39,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1486647931, now seen corresponding path program 1 times [2019-11-15 20:24:39,659 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:24:39,659 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2116711819] [2019-11-15 20:24:39,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3a9e6eb-4538-4928-9c09-185b07da8fa4/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:24:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:24:39,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-15 20:24:39,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:24:39,792 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:24:39,793 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:24:39,796 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:24:39,797 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2116711819] [2019-11-15 20:24:39,798 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:24:39,798 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-15 20:24:39,799 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310427398] [2019-11-15 20:24:39,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-15 20:24:39,803 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:24:39,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 20:24:39,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 20:24:39,818 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2019-11-15 20:24:39,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:24:39,835 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2019-11-15 20:24:39,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 20:24:39,837 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-15 20:24:39,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:24:39,844 INFO L225 Difference]: With dead ends: 33 [2019-11-15 20:24:39,844 INFO L226 Difference]: Without dead ends: 15 [2019-11-15 20:24:39,847 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:24:39,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-11-15 20:24:39,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-11-15 20:24:39,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-15 20:24:39,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-11-15 20:24:39,879 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 10 [2019-11-15 20:24:39,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:24:39,879 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-11-15 20:24:39,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-15 20:24:39,880 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2019-11-15 20:24:39,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 20:24:39,881 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:24:39,881 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:24:40,083 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:24:40,084 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:24:40,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:24:40,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1772723449, now seen corresponding path program 1 times [2019-11-15 20:24:40,086 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:24:40,086 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1939842926] [2019-11-15 20:24:40,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3a9e6eb-4538-4928-9c09-185b07da8fa4/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:24:40,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:24:40,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 20:24:40,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:24:40,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:24:40,262 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:24:40,268 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:24:40,395 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 22 [2019-11-15 20:24:40,396 INFO L341 Elim1Store]: treesize reduction 45, result has 40.0 percent of original size [2019-11-15 20:24:40,397 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:24:40,398 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:24:40,442 INFO L567 ElimStorePlain]: treesize reduction 20, result has 62.3 percent of original size [2019-11-15 20:24:40,443 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:24:40,444 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:33 [2019-11-15 20:24:40,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:24:40,563 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:24:40,564 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:24:40,750 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:24:40,751 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1939842926] [2019-11-15 20:24:40,751 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:24:40,751 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-15 20:24:40,751 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619196772] [2019-11-15 20:24:40,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 20:24:40,752 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:24:40,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 20:24:40,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:24:40,753 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 8 states. [2019-11-15 20:24:41,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:24:41,345 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2019-11-15 20:24:41,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:24:41,348 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-11-15 20:24:41,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:24:41,348 INFO L225 Difference]: With dead ends: 22 [2019-11-15 20:24:41,349 INFO L226 Difference]: Without dead ends: 20 [2019-11-15 20:24:41,350 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:24:41,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-11-15 20:24:41,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-11-15 20:24:41,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-15 20:24:41,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-11-15 20:24:41,355 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 10 [2019-11-15 20:24:41,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:24:41,356 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-11-15 20:24:41,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 20:24:41,356 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-11-15 20:24:41,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-15 20:24:41,357 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:24:41,357 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:24:41,560 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:24:41,560 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:24:41,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:24:41,561 INFO L82 PathProgramCache]: Analyzing trace with hash 437833903, now seen corresponding path program 1 times [2019-11-15 20:24:41,561 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:24:41,561 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1848792262] [2019-11-15 20:24:41,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3a9e6eb-4538-4928-9c09-185b07da8fa4/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:24:41,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:24:41,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 20:24:41,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:24:41,797 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:24:41,797 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:24:41,887 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:24:41,887 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1848792262] [2019-11-15 20:24:41,887 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:24:41,887 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-15 20:24:41,887 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046693881] [2019-11-15 20:24:41,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 20:24:41,888 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:24:41,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 20:24:41,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:24:41,889 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 10 states. [2019-11-15 20:24:42,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:24:42,284 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2019-11-15 20:24:42,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 20:24:42,287 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2019-11-15 20:24:42,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:24:42,288 INFO L225 Difference]: With dead ends: 45 [2019-11-15 20:24:42,288 INFO L226 Difference]: Without dead ends: 20 [2019-11-15 20:24:42,289 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:24:42,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-11-15 20:24:42,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-11-15 20:24:42,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-15 20:24:42,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-11-15 20:24:42,294 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 14 [2019-11-15 20:24:42,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:24:42,294 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-11-15 20:24:42,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 20:24:42,294 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-11-15 20:24:42,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 20:24:42,295 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:24:42,295 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:24:42,498 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:24:42,498 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:24:42,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:24:42,498 INFO L82 PathProgramCache]: Analyzing trace with hash 575675563, now seen corresponding path program 1 times [2019-11-15 20:24:42,499 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:24:42,499 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [459618469] [2019-11-15 20:24:42,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3a9e6eb-4538-4928-9c09-185b07da8fa4/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:24:43,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:24:43,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-15 20:24:43,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:24:43,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:24:43,075 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:24:43,076 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:24:43,132 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:24:43,143 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:24:43,144 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:24:43,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:24:43,146 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:24:43,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:24:43,148 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:24:43,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:24:43,169 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:24:43,170 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:24:43,176 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:24:43,183 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:24:43,185 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:24:43,185 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 20:24:43,238 INFO L567 ElimStorePlain]: treesize reduction 23, result has 59.6 percent of original size [2019-11-15 20:24:43,238 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:24:43,291 INFO L567 ElimStorePlain]: treesize reduction 4, result has 90.7 percent of original size [2019-11-15 20:24:43,292 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:24:43,292 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:111, output treesize:39 [2019-11-15 20:24:43,346 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:24:43,349 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:24:43,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:24:43,355 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:24:43,356 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:24:43,357 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:24:43,382 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:24:43,383 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:24:43,385 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:24:43,450 INFO L567 ElimStorePlain]: treesize reduction 32, result has 65.6 percent of original size [2019-11-15 20:24:43,450 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:24:43,450 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:65, output treesize:61 [2019-11-15 20:24:43,563 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:24:43,566 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:24:43,567 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:24:43,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:24:43,575 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:24:43,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:24:43,579 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:24:43,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:24:43,594 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:24:43,675 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:24:43,676 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:24:43,680 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:24:43,792 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-11-15 20:24:43,792 INFO L567 ElimStorePlain]: treesize reduction 86, result has 56.6 percent of original size [2019-11-15 20:24:43,793 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:24:43,794 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:130, output treesize:112 [2019-11-15 20:24:44,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:24:44,056 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:24:44,056 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:24:48,812 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:24:48,813 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [459618469] [2019-11-15 20:24:48,813 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:24:48,813 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2019-11-15 20:24:48,814 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017012552] [2019-11-15 20:24:48,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 20:24:48,814 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:24:48,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 20:24:48,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=204, Unknown=1, NotChecked=0, Total=240 [2019-11-15 20:24:48,815 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 16 states. [2019-11-15 20:25:08,251 WARN L191 SmtUtils]: Spent 18.90 s on a formula simplification that was a NOOP. DAG size: 105 [2019-11-15 20:25:18,717 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-15 20:25:46,842 WARN L191 SmtUtils]: Spent 12.33 s on a formula simplification that was a NOOP. DAG size: 85 [2019-11-15 20:25:47,974 WARN L191 SmtUtils]: Spent 672.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 62 [2019-11-15 20:25:49,954 WARN L191 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 115 DAG size of output: 60 [2019-11-15 20:25:52,022 WARN L191 SmtUtils]: Spent 969.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 62 [2019-11-15 20:25:53,748 WARN L191 SmtUtils]: Spent 681.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 66 [2019-11-15 20:25:55,559 WARN L191 SmtUtils]: Spent 821.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 66 [2019-11-15 20:25:57,869 WARN L191 SmtUtils]: Spent 927.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 64 [2019-11-15 20:25:59,974 WARN L191 SmtUtils]: Spent 889.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 66 [2019-11-15 20:26:00,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:26:00,542 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2019-11-15 20:26:00,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-15 20:26:00,544 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2019-11-15 20:26:00,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:26:00,544 INFO L225 Difference]: With dead ends: 49 [2019-11-15 20:26:00,544 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 20:26:00,545 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 61.7s TimeCoverageRelationStatistics Valid=255, Invalid=928, Unknown=7, NotChecked=0, Total=1190 [2019-11-15 20:26:00,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 20:26:00,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 20:26:00,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 20:26:00,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 20:26:00,546 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2019-11-15 20:26:00,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:26:00,546 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:26:00,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 20:26:00,546 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 20:26:00,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 20:26:00,747 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:26:00,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 20:26:01,315 WARN L191 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-11-15 20:26:44,045 WARN L191 SmtUtils]: Spent 42.73 s on a formula simplification. DAG size of input: 116 DAG size of output: 115 [2019-11-15 20:26:44,534 WARN L191 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2019-11-15 20:26:44,535 INFO L443 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2019-11-15 20:26:44,535 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 20:26:44,535 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 20:26:44,535 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 20:26:44,535 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 20:26:44,536 INFO L443 ceAbstractionStarter]: For program point L29-2(lines 29 32) no Hoare annotation was computed. [2019-11-15 20:26:44,536 INFO L439 ceAbstractionStarter]: At program point L29-3(lines 29 32) the Hoare annotation is: (let ((.cse7 (select |#memory_int| ULTIMATE.start_main_~a~0.base)) (.cse12 (select |#memory_int| ULTIMATE.start_main_~b~0.base)) (.cse21 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv4 32)))) (let ((.cse27 (select .cse12 .cse21)) (.cse6 ((_ sign_extend 32) (_ bv6 32))) (.cse23 (bvadd ULTIMATE.start_main_~a~0.offset (_ bv4 32))) (.cse30 (select .cse7 ULTIMATE.start_main_~a~0.offset)) (.cse29 ((_ sign_extend 32) (_ bv1 32))) (.cse28 (select .cse12 ULTIMATE.start_main_~b~0.offset))) (let ((.cse0 (= ((_ extract 31 0) .cse29) .cse28)) (.cse1 (= (_ bv0 32) ULTIMATE.start_main_~a~0.offset)) (.cse2 (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset)) (.cse5 (concat (select .cse7 .cse23) .cse30)) (.cse3 (= ((_ extract 31 0) .cse6) .cse30)) (.cse4 (= ((_ extract 63 32) .cse29) .cse27))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ((_ extract 63 32) (bvadd .cse5 .cse6)) (select .cse7 (bvadd ULTIMATE.start_main_~a~0.offset (_ bv12 32))))) (let ((.cse13 (bvmul ULTIMATE.start_main_~i~0 (_ bv8 32)))) (let ((.cse15 (concat (select .cse7 (bvadd ULTIMATE.start_main_~a~0.offset .cse13 (_ bv4294967292 32))) (select .cse7 (bvadd ULTIMATE.start_main_~a~0.offset .cse13 (_ bv4294967288 32))))) (.cse11 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv8 32))) (.cse8 ((_ sign_extend 32) (_ bv7 32))) (.cse10 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv12 32)))) (and .cse0 .cse1 .cse2 (not (bvsle ~N~0 (_ bv0 32))) (let ((.cse14 (bvadd (concat (select .cse12 (bvadd .cse13 ULTIMATE.start_main_~b~0.offset (_ bv4294967292 32))) (select .cse12 (bvadd .cse13 ULTIMATE.start_main_~b~0.offset (_ bv4294967288 32)))) .cse15))) (let ((.cse9 (store .cse12 (bvadd .cse13 ULTIMATE.start_main_~b~0.offset (_ bv4 32)) ((_ extract 63 32) .cse14)))) (or (= .cse8 (concat (select .cse9 .cse10) (select .cse9 .cse11))) (not (= (store |#memory_int| ULTIMATE.start_main_~b~0.base .cse9) (store |#memory_int| ULTIMATE.start_main_~b~0.base (store .cse12 (bvadd .cse13 ULTIMATE.start_main_~b~0.offset) ((_ extract 31 0) .cse14)))))))) (let ((.cse22 (store .cse7 (bvadd ULTIMATE.start_main_~a~0.offset .cse13 (_ bv4 32)) ((_ extract 63 32) (bvadd .cse15 .cse6))))) (let ((.cse16 (store |#memory_int| ULTIMATE.start_main_~a~0.base .cse22))) (let ((.cse18 (select .cse16 ULTIMATE.start_main_~b~0.base))) (let ((.cse19 (bvadd (concat (select .cse18 .cse21) (select .cse18 ULTIMATE.start_main_~b~0.offset)) (concat (select .cse22 .cse23) (select .cse22 ULTIMATE.start_main_~a~0.offset))))) (let ((.cse20 ((_ extract 63 32) .cse19))) (let ((.cse17 (store .cse18 .cse10 .cse20))) (or (not (= (store .cse16 ULTIMATE.start_main_~b~0.base .cse17) (store .cse16 ULTIMATE.start_main_~b~0.base (store .cse18 .cse11 ((_ extract 31 0) .cse19))))) (= .cse8 (concat .cse20 (select .cse17 .cse11)))))))))) (let ((.cse25 (bvadd (concat .cse27 .cse28) .cse5))) (let ((.cse26 ((_ extract 63 32) .cse25))) (let ((.cse24 (store .cse12 .cse10 .cse26))) (or (not (= (store |#memory_int| ULTIMATE.start_main_~b~0.base .cse24) (store |#memory_int| ULTIMATE.start_main_~b~0.base (store .cse12 .cse11 ((_ extract 31 0) .cse25))))) (= (concat .cse26 (select .cse24 .cse11)) .cse8))))) .cse3 .cse4 (= (_ bv1 32) ULTIMATE.start_main_~i~0)))))))) [2019-11-15 20:26:44,536 INFO L443 ceAbstractionStarter]: For program point L29-4(lines 29 32) no Hoare annotation was computed. [2019-11-15 20:26:44,536 INFO L443 ceAbstractionStarter]: For program point L34-2(lines 34 37) no Hoare annotation was computed. [2019-11-15 20:26:44,536 INFO L439 ceAbstractionStarter]: At program point L34-3(lines 34 37) the Hoare annotation is: (let ((.cse12 (select |#memory_int| ULTIMATE.start_main_~a~0.base))) (let ((.cse14 ((_ sign_extend 32) (_ bv6 32))) (.cse13 (select .cse12 ULTIMATE.start_main_~a~0.offset)) (.cse15 ((_ sign_extend 32) (_ bv1 32))) (.cse16 (select |#memory_int| ULTIMATE.start_main_~b~0.base))) (let ((.cse0 (= ((_ extract 31 0) .cse15) (select .cse16 ULTIMATE.start_main_~b~0.offset))) (.cse1 (= (_ bv0 32) ULTIMATE.start_main_~a~0.offset)) (.cse2 (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset)) (.cse3 (= ((_ extract 31 0) .cse14) .cse13)) (.cse4 (= ((_ extract 63 32) .cse15) (select .cse16 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv4 32))))) (.cse5 (= ((_ extract 63 32) (bvadd (concat (select .cse12 (bvadd ULTIMATE.start_main_~a~0.offset (_ bv4 32))) .cse13) .cse14)) (select .cse12 (bvadd ULTIMATE.start_main_~a~0.offset (_ bv12 32)))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (_ bv1 32) ULTIMATE.start_main_~i~0) .cse5) (and .cse0 .cse2 (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) (_ bv6 32))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset))) .cse4 (= (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) (and .cse0 .cse1 .cse2 (exists ((ULTIMATE.start_main_~a~0.base (_ BitVec 32))) (let ((.cse11 ((_ sign_extend 32) (_ bv6 32)))) (let ((.cse7 (select |#memory_int| ULTIMATE.start_main_~a~0.base)) (.cse6 ((_ extract 31 0) .cse11))) (let ((.cse8 (select |#memory_int| ULTIMATE.start_main_~b~0.base)) (.cse10 (concat (select .cse7 (_ bv4 32)) .cse6))) (let ((.cse9 (bvadd (concat (select .cse8 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv4 32))) ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32)))) .cse10))) (and (= .cse6 (select .cse7 (_ bv0 32))) (= (select .cse8 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv12 32))) ((_ extract 63 32) .cse9)) (= ((_ extract 63 32) (bvadd .cse10 .cse11)) (select .cse7 (_ bv12 32))) (= ((_ extract 31 0) .cse9) (select .cse8 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv8 32)))))))))) .cse3 .cse4 .cse5))))) [2019-11-15 20:26:44,536 INFO L443 ceAbstractionStarter]: For program point L34-4(lines 34 37) no Hoare annotation was computed. [2019-11-15 20:26:44,537 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-11-15 20:26:44,537 INFO L446 ceAbstractionStarter]: At program point L43(lines 16 44) the Hoare annotation is: true [2019-11-15 20:26:44,537 INFO L443 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2019-11-15 20:26:44,537 INFO L443 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. [2019-11-15 20:26:44,537 INFO L443 ceAbstractionStarter]: For program point L10-3(line 10) no Hoare annotation was computed. [2019-11-15 20:26:44,537 INFO L443 ceAbstractionStarter]: For program point L39-2(lines 39 42) no Hoare annotation was computed. [2019-11-15 20:26:44,537 INFO L439 ceAbstractionStarter]: At program point L39-3(lines 39 42) the Hoare annotation is: (let ((.cse19 ((_ sign_extend 32) (_ bv1 32))) (.cse20 (select |#memory_int| ULTIMATE.start_main_~b~0.base)) (.cse10 (select |#memory_int| ULTIMATE.start_main_~a~0.base))) (let ((.cse12 ((_ sign_extend 32) (_ bv6 32))) (.cse11 (select .cse10 ULTIMATE.start_main_~a~0.offset)) (.cse0 (= ((_ extract 31 0) .cse19) (select .cse20 ULTIMATE.start_main_~b~0.offset))) (.cse2 (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset)) (.cse9 (exists ((ULTIMATE.start_main_~a~0.base (_ BitVec 32)) (ULTIMATE.start_main_~a~0.offset (_ BitVec 32))) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv6 32))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)))) (.cse6 (= ((_ extract 63 32) .cse19) (select .cse20 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv4 32)))))) (let ((.cse3 (= (_ bv0 32) ULTIMATE.start_main_~i~0)) (.cse1 (= (_ bv0 32) ULTIMATE.start_main_~a~0.offset)) (.cse4 (exists ((ULTIMATE.start_main_~a~0.base (_ BitVec 32))) (let ((.cse18 ((_ sign_extend 32) (_ bv6 32)))) (let ((.cse14 (select |#memory_int| ULTIMATE.start_main_~a~0.base)) (.cse13 ((_ extract 31 0) .cse18))) (let ((.cse15 (select |#memory_int| ULTIMATE.start_main_~b~0.base)) (.cse17 (concat (select .cse14 (_ bv4 32)) .cse13))) (let ((.cse16 (bvadd (concat (select .cse15 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv4 32))) ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32)))) .cse17))) (and (= .cse13 (select .cse14 (_ bv0 32))) (= (select .cse15 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv12 32))) ((_ extract 63 32) .cse16)) (= ((_ extract 63 32) (bvadd .cse17 .cse18)) (select .cse14 (_ bv12 32))) (= ((_ extract 31 0) .cse16) (select .cse15 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv8 32))))))))))) (.cse8 (and .cse0 .cse2 .cse9 (not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32))) .cse6)) (.cse5 (= ((_ extract 31 0) .cse12) .cse11)) (.cse7 (= ((_ extract 63 32) (bvadd (concat (select .cse10 (bvadd ULTIMATE.start_main_~a~0.offset (_ bv4 32))) .cse11) .cse12)) (select .cse10 (bvadd ULTIMATE.start_main_~a~0.offset (_ bv12 32)))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (not (bvslt (_ bv1 32) ~N~0)) (not (bvslt ULTIMATE.start_main_~i~0 ~N~0)) .cse8) (and .cse0 .cse2 .cse3 .cse9 .cse6 (not (bvslt (bvadd ULTIMATE.start_main_~i~0 (_ bv1 32)) ~N~0))) (and .cse1 (= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) .cse4 .cse8 .cse5 .cse7))))) [2019-11-15 20:26:44,537 INFO L443 ceAbstractionStarter]: For program point L39-4(lines 39 42) no Hoare annotation was computed. [2019-11-15 20:26:44,540 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:26:44,544 INFO L168 Benchmark]: Toolchain (without parser) took 125877.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 194.5 MB). Free memory was 952.4 MB in the beginning and 885.2 MB in the end (delta: 67.2 MB). Peak memory consumption was 261.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:26:44,545 INFO L168 Benchmark]: CDTParser took 0.33 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:26:44,545 INFO L168 Benchmark]: CACSL2BoogieTranslator took 372.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -181.6 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-15 20:26:44,546 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.72 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: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 11.5 GB. [2019-11-15 20:26:44,546 INFO L168 Benchmark]: Boogie Preprocessor took 52.31 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:26:44,547 INFO L168 Benchmark]: RCFGBuilder took 383.36 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: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-11-15 20:26:44,547 INFO L168 Benchmark]: TraceAbstraction took 125004.88 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 56.6 MB). Free memory was 1.1 GB in the beginning and 885.2 MB in the end (delta: 222.7 MB). Peak memory consumption was 279.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:26:44,550 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.33 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 372.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -181.6 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.72 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: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.31 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 383.36 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: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 125004.88 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 56.6 MB). Free memory was 1.1 GB in the beginning and 885.2 MB in the end (delta: 222.7 MB). Peak memory consumption was 279.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...