./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/s1if.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_8d962864-afd4-4f9d-9d56-442a31728383/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/s1if.c -s /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/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 13fdc940912285336197da9ffc7154669004c425 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_8d962864-afd4-4f9d-9d56-442a31728383/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/s1if.c -s /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/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 13fdc940912285336197da9ffc7154669004c425 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalStateException: Do not try to interpolate when trace is feasible --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:47:50,545 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:47:50,551 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:47:50,561 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:47:50,566 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:47:50,567 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:47:50,569 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:47:50,580 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:47:50,581 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:47:50,582 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:47:50,583 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:47:50,584 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:47:50,584 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:47:50,585 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:47:50,586 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:47:50,587 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:47:50,588 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:47:50,588 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:47:50,590 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:47:50,598 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:47:50,600 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:47:50,600 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:47:50,601 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:47:50,602 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:47:50,604 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:47:50,605 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:47:50,605 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:47:50,606 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:47:50,606 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:47:50,607 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:47:50,607 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:47:50,608 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:47:50,608 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:47:50,609 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:47:50,614 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:47:50,614 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:47:50,615 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:47:50,615 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:47:50,616 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:47:50,620 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:47:50,621 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:47:50,622 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:47:50,649 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:47:50,649 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:47:50,651 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:47:50,652 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:47:50,652 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:47:50,652 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:47:50,652 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:47:50,652 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:47:50,653 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:47:50,653 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:47:50,654 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:47:50,654 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:47:50,654 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:47:50,654 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:47:50,655 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:47:50,655 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:47:50,655 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:47:50,655 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:47:50,655 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:47:50,656 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:47:50,656 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:47:50,656 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:47:50,656 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:47:50,657 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:47:50,657 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:47:50,657 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:47:50,657 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:47:50,657 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:47:50,658 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_8d962864-afd4-4f9d-9d56-442a31728383/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 -> 13fdc940912285336197da9ffc7154669004c425 [2019-11-15 23:47:50,686 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:47:50,696 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:47:50,699 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:47:50,700 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:47:50,701 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:47:50,701 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/bin/uautomizer/../../sv-benchmarks/c/array-fpi/s1if.c [2019-11-15 23:47:50,754 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/bin/uautomizer/data/3db76a7ae/acadce8221dd4f7b835361c4de96eb89/FLAGe29b8c192 [2019-11-15 23:47:51,191 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:47:51,191 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/sv-benchmarks/c/array-fpi/s1if.c [2019-11-15 23:47:51,198 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/bin/uautomizer/data/3db76a7ae/acadce8221dd4f7b835361c4de96eb89/FLAGe29b8c192 [2019-11-15 23:47:51,213 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/bin/uautomizer/data/3db76a7ae/acadce8221dd4f7b835361c4de96eb89 [2019-11-15 23:47:51,216 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:47:51,217 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:47:51,218 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:47:51,219 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:47:51,222 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:47:51,223 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:47:51" (1/1) ... [2019-11-15 23:47:51,226 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@aab26d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:47:51, skipping insertion in model container [2019-11-15 23:47:51,226 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:47:51" (1/1) ... [2019-11-15 23:47:51,232 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:47:51,250 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:47:51,462 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:47:51,469 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:47:51,487 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:47:51,500 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:47:51,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:47:51 WrapperNode [2019-11-15 23:47:51,500 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:47:51,501 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:47:51,501 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:47:51,501 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:47:51,508 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:47:51" (1/1) ... [2019-11-15 23:47:51,515 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:47:51" (1/1) ... [2019-11-15 23:47:51,533 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:47:51,533 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:47:51,534 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:47:51,534 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:47:51,540 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:47:51" (1/1) ... [2019-11-15 23:47:51,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:47:51" (1/1) ... [2019-11-15 23:47:51,542 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:47:51" (1/1) ... [2019-11-15 23:47:51,542 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:47:51" (1/1) ... [2019-11-15 23:47:51,548 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:47:51" (1/1) ... [2019-11-15 23:47:51,552 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:47:51" (1/1) ... [2019-11-15 23:47:51,553 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:47:51" (1/1) ... [2019-11-15 23:47:51,555 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:47:51,555 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:47:51,556 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:47:51,556 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:47:51,558 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:47:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/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 23:47:51,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:47:51,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:47:51,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 23:47:51,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:47:51,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:47:51,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:47:51,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:47:51,818 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:47:51,819 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 23:47:51,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:47:51 BoogieIcfgContainer [2019-11-15 23:47:51,820 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:47:51,821 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:47:51,821 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:47:51,824 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:47:51,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:47:51" (1/3) ... [2019-11-15 23:47:51,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@702a6448 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:47:51, skipping insertion in model container [2019-11-15 23:47:51,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:47:51" (2/3) ... [2019-11-15 23:47:51,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@702a6448 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:47:51, skipping insertion in model container [2019-11-15 23:47:51,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:47:51" (3/3) ... [2019-11-15 23:47:51,834 INFO L109 eAbstractionObserver]: Analyzing ICFG s1if.c [2019-11-15 23:47:51,843 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:47:51,849 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:47:51,859 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:47:51,890 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:47:51,890 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:47:51,890 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:47:51,890 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:47:51,891 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:47:51,891 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:47:51,891 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:47:51,891 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:47:51,903 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-11-15 23:47:51,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-15 23:47:51,908 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:47:51,909 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:47:51,911 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:47:51,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:51,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1476218026, now seen corresponding path program 1 times [2019-11-15 23:47:51,924 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:51,924 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010569300] [2019-11-15 23:47:51,924 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:51,924 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:51,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:52,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:52,033 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 23:47:52,034 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010569300] [2019-11-15 23:47:52,034 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:47:52,035 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:47:52,035 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598534333] [2019-11-15 23:47:52,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-15 23:47:52,038 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:47:52,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 23:47:52,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 23:47:52,050 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2019-11-15 23:47:52,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:47:52,064 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2019-11-15 23:47:52,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 23:47:52,065 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-11-15 23:47:52,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:47:52,073 INFO L225 Difference]: With dead ends: 29 [2019-11-15 23:47:52,074 INFO L226 Difference]: Without dead ends: 13 [2019-11-15 23:47:52,076 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 23:47:52,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-11-15 23:47:52,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-11-15 23:47:52,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-15 23:47:52,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-11-15 23:47:52,107 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 9 [2019-11-15 23:47:52,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:47:52,107 INFO L462 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-11-15 23:47:52,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-15 23:47:52,108 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2019-11-15 23:47:52,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-15 23:47:52,108 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:47:52,108 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:47:52,109 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:47:52,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:52,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1304115419, now seen corresponding path program 1 times [2019-11-15 23:47:52,109 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:52,110 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794956622] [2019-11-15 23:47:52,110 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:52,110 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:52,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:52,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:52,180 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 23:47:52,180 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794956622] [2019-11-15 23:47:52,180 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:47:52,180 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:47:52,180 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084941782] [2019-11-15 23:47:52,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:47:52,182 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:47:52,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:47:52,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:47:52,183 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 3 states. [2019-11-15 23:47:52,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:47:52,236 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2019-11-15 23:47:52,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:47:52,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-15 23:47:52,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:47:52,237 INFO L225 Difference]: With dead ends: 23 [2019-11-15 23:47:52,238 INFO L226 Difference]: Without dead ends: 15 [2019-11-15 23:47:52,238 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:47:52,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-11-15 23:47:52,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-11-15 23:47:52,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-15 23:47:52,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-11-15 23:47:52,242 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 9 [2019-11-15 23:47:52,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:47:52,242 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-11-15 23:47:52,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:47:52,243 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-11-15 23:47:52,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-15 23:47:52,243 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:47:52,243 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:47:52,244 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:47:52,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:52,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1358761923, now seen corresponding path program 1 times [2019-11-15 23:47:52,244 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:52,244 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19738214] [2019-11-15 23:47:52,245 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:52,245 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:52,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:52,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:52,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:47:52,306 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19738214] [2019-11-15 23:47:52,306 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:47:52,306 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:47:52,307 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975050410] [2019-11-15 23:47:52,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:47:52,307 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:47:52,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:47:52,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:47:52,308 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 4 states. [2019-11-15 23:47:52,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:47:52,365 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-11-15 23:47:52,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:47:52,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-15 23:47:52,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:47:52,366 INFO L225 Difference]: With dead ends: 22 [2019-11-15 23:47:52,366 INFO L226 Difference]: Without dead ends: 18 [2019-11-15 23:47:52,367 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:47:52,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-11-15 23:47:52,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2019-11-15 23:47:52,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-15 23:47:52,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-11-15 23:47:52,370 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2019-11-15 23:47:52,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:47:52,371 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-11-15 23:47:52,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:47:52,371 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2019-11-15 23:47:52,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-15 23:47:52,371 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:47:52,372 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:47:52,372 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:47:52,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:52,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1565637502, now seen corresponding path program 1 times [2019-11-15 23:47:52,372 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:52,373 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978912524] [2019-11-15 23:47:52,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:52,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:52,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:52,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:52,809 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 23:47:52,809 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978912524] [2019-11-15 23:47:52,809 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364747272] [2019-11-15 23:47:52,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/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 23:47:52,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:52,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-15 23:47:52,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:47:52,944 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 23:47:52,944 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:52,958 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:52,958 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:47:52,958 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2019-11-15 23:47:52,991 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:52,993 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 23:47:52,994 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:53,011 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:53,012 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:47:53,012 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2019-11-15 23:47:53,233 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:53,242 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:53,243 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 57 [2019-11-15 23:47:53,244 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:53,286 INFO L567 ElimStorePlain]: treesize reduction 32, result has 62.8 percent of original size [2019-11-15 23:47:53,288 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-15 23:47:53,288 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:71, output treesize:54 [2019-11-15 23:47:53,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:53,377 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 23:47:53,377 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:47:53,377 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-11-15 23:47:53,377 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653512838] [2019-11-15 23:47:53,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 23:47:53,378 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:47:53,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 23:47:53,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:47:53,379 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 16 states. [2019-11-15 23:47:53,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:47:53,937 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2019-11-15 23:47:53,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:47:53,938 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 14 [2019-11-15 23:47:53,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:47:53,940 INFO L225 Difference]: With dead ends: 33 [2019-11-15 23:47:53,940 INFO L226 Difference]: Without dead ends: 24 [2019-11-15 23:47:53,942 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2019-11-15 23:47:53,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-15 23:47:53,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2019-11-15 23:47:53,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-15 23:47:53,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-11-15 23:47:53,952 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 14 [2019-11-15 23:47:53,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:47:53,953 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-11-15 23:47:53,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 23:47:53,953 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-11-15 23:47:53,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-15 23:47:53,954 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:47:53,954 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:47:54,158 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:47:54,159 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:47:54,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:54,160 INFO L82 PathProgramCache]: Analyzing trace with hash -472130976, now seen corresponding path program 2 times [2019-11-15 23:47:54,160 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:54,160 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100859962] [2019-11-15 23:47:54,160 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:54,160 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:54,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:54,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:54,251 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:47:54,252 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100859962] [2019-11-15 23:47:54,252 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672409096] [2019-11-15 23:47:54,252 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/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 23:47:54,289 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 23:47:54,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:47:54,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:47:54,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:47:54,338 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 23:47:54,338 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:47:54,338 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-11-15 23:47:54,338 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868666510] [2019-11-15 23:47:54,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:47:54,339 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:47:54,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:47:54,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:47:54,339 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 10 states. [2019-11-15 23:47:54,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:47:54,511 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2019-11-15 23:47:54,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:47:54,511 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-11-15 23:47:54,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:47:54,512 INFO L225 Difference]: With dead ends: 31 [2019-11-15 23:47:54,512 INFO L226 Difference]: Without dead ends: 27 [2019-11-15 23:47:54,513 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:47:54,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-15 23:47:54,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2019-11-15 23:47:54,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-15 23:47:54,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-11-15 23:47:54,518 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2019-11-15 23:47:54,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:47:54,519 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-11-15 23:47:54,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:47:54,519 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2019-11-15 23:47:54,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-15 23:47:54,520 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:47:54,520 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:47:54,723 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:47:54,723 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:47:54,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:54,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1317941731, now seen corresponding path program 3 times [2019-11-15 23:47:54,724 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:54,724 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100216605] [2019-11-15 23:47:54,724 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:54,724 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:54,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:54,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:54,784 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:47:54,784 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100216605] [2019-11-15 23:47:54,785 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005157569] [2019-11-15 23:47:54,785 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/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 23:47:54,823 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-15 23:47:54,823 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:47:54,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:47:54,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:47:54,864 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:47:54,864 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:47:54,864 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-11-15 23:47:54,864 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500619982] [2019-11-15 23:47:54,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:47:54,865 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:47:54,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:47:54,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:47:54,865 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 10 states. [2019-11-15 23:47:54,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:47:54,950 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2019-11-15 23:47:54,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:47:54,951 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-15 23:47:54,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:47:54,952 INFO L225 Difference]: With dead ends: 35 [2019-11-15 23:47:54,952 INFO L226 Difference]: Without dead ends: 23 [2019-11-15 23:47:54,952 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:47:54,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-15 23:47:54,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2019-11-15 23:47:54,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-15 23:47:54,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-11-15 23:47:54,956 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 17 [2019-11-15 23:47:54,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:47:54,957 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-11-15 23:47:54,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:47:54,957 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2019-11-15 23:47:54,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 23:47:54,957 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:47:54,957 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:47:55,160 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:47:55,160 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:47:55,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:55,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1991965825, now seen corresponding path program 4 times [2019-11-15 23:47:55,161 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:55,161 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008937409] [2019-11-15 23:47:55,161 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:55,161 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:55,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:55,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:55,594 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:47:55,595 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008937409] [2019-11-15 23:47:55,595 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028864209] [2019-11-15 23:47:55,595 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/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 23:47:55,655 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 23:47:55,655 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:47:55,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-15 23:47:55,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:47:55,671 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 23:47:55,671 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:55,679 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:55,680 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:47:55,680 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-15 23:47:55,718 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:55,719 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 23:47:55,720 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:55,727 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:55,728 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:47:55,728 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2019-11-15 23:47:55,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:55,802 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:55,802 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 72 [2019-11-15 23:47:55,803 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:55,855 INFO L567 ElimStorePlain]: treesize reduction 36, result has 56.1 percent of original size [2019-11-15 23:47:55,856 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:47:55,856 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:46 [2019-11-15 23:47:56,122 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:56,137 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:56,138 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 103 [2019-11-15 23:47:56,139 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:56,200 INFO L567 ElimStorePlain]: treesize reduction 80, result has 46.7 percent of original size [2019-11-15 23:47:56,200 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 23:47:56,201 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:87, output treesize:70 [2019-11-15 23:47:56,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:56,637 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:56,637 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 85 treesize of output 165 [2019-11-15 23:47:56,640 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:56,695 INFO L567 ElimStorePlain]: treesize reduction 94, result has 38.6 percent of original size [2019-11-15 23:47:56,697 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-15 23:47:56,697 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:114, output treesize:49 [2019-11-15 23:47:56,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:47:56,788 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:47:56,788 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:47:56,789 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2019-11-15 23:47:56,789 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193208098] [2019-11-15 23:47:56,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-15 23:47:56,789 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:47:56,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-15 23:47:56,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=629, Unknown=0, NotChecked=0, Total=702 [2019-11-15 23:47:56,790 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 27 states. [2019-11-15 23:47:57,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:47:57,717 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2019-11-15 23:47:57,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 23:47:57,717 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 19 [2019-11-15 23:47:57,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:47:57,718 INFO L225 Difference]: With dead ends: 43 [2019-11-15 23:47:57,718 INFO L226 Difference]: Without dead ends: 32 [2019-11-15 23:47:57,719 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=173, Invalid=1233, Unknown=0, NotChecked=0, Total=1406 [2019-11-15 23:47:57,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-15 23:47:57,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2019-11-15 23:47:57,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-15 23:47:57,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-11-15 23:47:57,725 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 19 [2019-11-15 23:47:57,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:47:57,725 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-11-15 23:47:57,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-15 23:47:57,725 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-11-15 23:47:57,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 23:47:57,726 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:47:57,726 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:47:57,926 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:47:57,927 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:47:57,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:57,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1189058463, now seen corresponding path program 5 times [2019-11-15 23:47:57,927 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:57,927 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069950091] [2019-11-15 23:47:57,927 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:57,928 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:57,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:57,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:57,996 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:47:57,997 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069950091] [2019-11-15 23:47:57,997 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134586968] [2019-11-15 23:47:57,997 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/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 23:47:58,038 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-11-15 23:47:58,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:47:58,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 23:47:58,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:47:58,083 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:47:58,083 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:47:58,084 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-11-15 23:47:58,084 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919360283] [2019-11-15 23:47:58,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-15 23:47:58,084 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:47:58,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 23:47:58,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:47:58,085 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 13 states. [2019-11-15 23:47:58,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:47:58,282 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2019-11-15 23:47:58,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 23:47:58,285 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2019-11-15 23:47:58,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:47:58,286 INFO L225 Difference]: With dead ends: 39 [2019-11-15 23:47:58,286 INFO L226 Difference]: Without dead ends: 35 [2019-11-15 23:47:58,287 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2019-11-15 23:47:58,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-15 23:47:58,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2019-11-15 23:47:58,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-15 23:47:58,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-11-15 23:47:58,292 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 21 [2019-11-15 23:47:58,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:47:58,292 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-11-15 23:47:58,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-15 23:47:58,292 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2019-11-15 23:47:58,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 23:47:58,293 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:47:58,293 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:47:58,493 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:47:58,494 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:47:58,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:58,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1846717952, now seen corresponding path program 6 times [2019-11-15 23:47:58,494 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:58,494 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989736998] [2019-11-15 23:47:58,494 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:58,495 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:58,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:58,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:58,608 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:47:58,608 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989736998] [2019-11-15 23:47:58,608 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692204296] [2019-11-15 23:47:58,608 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/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 23:47:58,670 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-11-15 23:47:58,670 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:47:58,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 23:47:58,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:47:58,727 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:47:58,728 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:47:58,728 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-11-15 23:47:58,728 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361542369] [2019-11-15 23:47:58,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-15 23:47:58,729 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:47:58,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 23:47:58,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:47:58,729 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 13 states. [2019-11-15 23:47:58,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:47:58,870 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2019-11-15 23:47:58,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:47:58,871 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2019-11-15 23:47:58,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:47:58,872 INFO L225 Difference]: With dead ends: 43 [2019-11-15 23:47:58,872 INFO L226 Difference]: Without dead ends: 28 [2019-11-15 23:47:58,872 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:47:58,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-15 23:47:58,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2019-11-15 23:47:58,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-15 23:47:58,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-11-15 23:47:58,877 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 22 [2019-11-15 23:47:58,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:47:58,878 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-11-15 23:47:58,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-15 23:47:58,881 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-11-15 23:47:58,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 23:47:58,882 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:47:58,882 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:47:59,086 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:47:59,086 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:47:59,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:59,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1106368034, now seen corresponding path program 7 times [2019-11-15 23:47:59,087 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:59,087 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299403218] [2019-11-15 23:47:59,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:59,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:59,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:59,582 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:47:59,582 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299403218] [2019-11-15 23:47:59,583 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434216445] [2019-11-15 23:47:59,583 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/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 23:47:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:59,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 41 conjunts are in the unsatisfiable core [2019-11-15 23:47:59,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:47:59,629 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 23:47:59,629 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:59,635 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:59,635 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:47:59,635 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-15 23:47:59,667 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:59,668 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 23:47:59,669 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:59,676 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:59,676 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:47:59,677 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2019-11-15 23:47:59,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:59,746 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:59,746 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 56 [2019-11-15 23:47:59,747 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:59,769 INFO L567 ElimStorePlain]: treesize reduction 24, result has 60.7 percent of original size [2019-11-15 23:47:59,769 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:47:59,769 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2019-11-15 23:47:59,848 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:59,884 INFO L341 Elim1Store]: treesize reduction 10, result has 87.7 percent of original size [2019-11-15 23:47:59,884 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 98 [2019-11-15 23:47:59,885 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:59,933 INFO L567 ElimStorePlain]: treesize reduction 54, result has 47.6 percent of original size [2019-11-15 23:47:59,933 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:47:59,933 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:49 [2019-11-15 23:48:00,123 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:00,149 INFO L341 Elim1Store]: treesize reduction 32, result has 56.2 percent of original size [2019-11-15 23:48:00,149 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 101 [2019-11-15 23:48:00,151 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:00,184 INFO L567 ElimStorePlain]: treesize reduction 56, result has 49.5 percent of original size [2019-11-15 23:48:00,184 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 23:48:00,184 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:80, output treesize:55 [2019-11-15 23:48:00,574 WARN L191 SmtUtils]: Spent 360.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-11-15 23:48:01,558 WARN L191 SmtUtils]: Spent 915.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-15 23:48:01,564 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:01,622 INFO L341 Elim1Store]: treesize reduction 32, result has 75.2 percent of original size [2019-11-15 23:48:01,622 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 171 [2019-11-15 23:48:01,624 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:01,666 INFO L567 ElimStorePlain]: treesize reduction 134, result has 33.0 percent of original size [2019-11-15 23:48:01,667 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 23:48:01,667 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:91, output treesize:66 [2019-11-15 23:48:01,778 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:01,801 INFO L341 Elim1Store]: treesize reduction 32, result has 56.2 percent of original size [2019-11-15 23:48:01,801 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 101 [2019-11-15 23:48:01,802 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:01,834 INFO L567 ElimStorePlain]: treesize reduction 68, result has 48.9 percent of original size [2019-11-15 23:48:01,834 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 23:48:01,835 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:80, output treesize:65 [2019-11-15 23:48:01,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:01,939 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:01,940 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:48:01,940 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 33 [2019-11-15 23:48:01,940 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332651433] [2019-11-15 23:48:01,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-15 23:48:01,941 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:01,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-15 23:48:01,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=953, Unknown=0, NotChecked=0, Total=1056 [2019-11-15 23:48:01,942 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 33 states. [2019-11-15 23:48:03,123 WARN L191 SmtUtils]: Spent 847.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2019-11-15 23:48:03,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:03,448 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2019-11-15 23:48:03,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-15 23:48:03,449 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 24 [2019-11-15 23:48:03,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:03,449 INFO L225 Difference]: With dead ends: 56 [2019-11-15 23:48:03,449 INFO L226 Difference]: Without dead ends: 42 [2019-11-15 23:48:03,451 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=163, Invalid=1397, Unknown=0, NotChecked=0, Total=1560 [2019-11-15 23:48:03,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-15 23:48:03,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2019-11-15 23:48:03,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-15 23:48:03,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2019-11-15 23:48:03,457 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 24 [2019-11-15 23:48:03,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:03,457 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2019-11-15 23:48:03,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-15 23:48:03,457 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2019-11-15 23:48:03,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 23:48:03,458 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:03,458 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:03,661 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:48:03,661 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:03,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:03,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1049109732, now seen corresponding path program 1 times [2019-11-15 23:48:03,662 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:03,662 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754568651] [2019-11-15 23:48:03,662 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:03,662 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:03,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:03,670 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 23:48:03,671 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1283508934] [2019-11-15 23:48:03,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/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 23:48:03,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:03,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-15 23:48:03,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:48:03,771 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 23:48:03,771 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:03,775 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:03,775 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:48:03,775 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-11-15 23:48:03,798 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:03,802 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:03,803 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 47 [2019-11-15 23:48:03,803 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:03,813 INFO L567 ElimStorePlain]: treesize reduction 28, result has 39.1 percent of original size [2019-11-15 23:48:03,813 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:48:03,813 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:18 [2019-11-15 23:48:03,833 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:03,842 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:03,842 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 47 [2019-11-15 23:48:03,843 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:03,852 INFO L567 ElimStorePlain]: treesize reduction 22, result has 45.0 percent of original size [2019-11-15 23:48:03,853 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 23:48:03,853 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:13 [2019-11-15 23:48:03,875 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-11-15 23:48:03,875 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:03,876 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:03,877 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 23:48:03,877 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-11-15 23:48:03,886 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:03,887 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754568651] [2019-11-15 23:48:03,887 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 23:48:03,887 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283508934] [2019-11-15 23:48:03,887 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:48:03,887 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-11-15 23:48:03,887 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774191339] [2019-11-15 23:48:03,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 23:48:03,888 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:03,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 23:48:03,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:48:03,888 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 11 states. [2019-11-15 23:48:04,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:04,051 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2019-11-15 23:48:04,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:48:04,051 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-11-15 23:48:04,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:04,052 INFO L225 Difference]: With dead ends: 47 [2019-11-15 23:48:04,052 INFO L226 Difference]: Without dead ends: 40 [2019-11-15 23:48:04,052 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:48:04,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-15 23:48:04,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-11-15 23:48:04,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-15 23:48:04,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2019-11-15 23:48:04,059 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 24 [2019-11-15 23:48:04,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:04,059 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2019-11-15 23:48:04,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 23:48:04,060 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2019-11-15 23:48:04,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 23:48:04,061 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:04,061 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:04,263 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:48:04,264 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:04,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:04,264 INFO L82 PathProgramCache]: Analyzing trace with hash -426309664, now seen corresponding path program 2 times [2019-11-15 23:48:04,264 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:04,264 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516001445] [2019-11-15 23:48:04,264 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:04,265 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:04,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:04,272 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 23:48:04,272 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1440122139] [2019-11-15 23:48:04,272 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/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 23:48:04,319 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 23:48:04,319 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:48:04,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-15 23:48:04,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:48:04,346 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-15 23:48:04,346 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:04,354 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:04,354 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:48:04,354 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2019-11-15 23:48:04,380 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:04,381 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-11-15 23:48:04,382 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:04,392 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:04,393 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:48:04,393 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2019-11-15 23:48:04,433 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:04,434 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:04,435 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:04,436 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:04,436 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2019-11-15 23:48:04,437 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:04,447 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:04,447 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:48:04,448 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:30 [2019-11-15 23:48:04,496 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:04,497 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:04,497 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2019-11-15 23:48:04,498 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:04,500 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:04,501 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 23:48:04,501 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:3 [2019-11-15 23:48:04,513 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 23:48:04,513 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516001445] [2019-11-15 23:48:04,513 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 23:48:04,513 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440122139] [2019-11-15 23:48:04,513 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:48:04,513 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-11-15 23:48:04,513 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780130170] [2019-11-15 23:48:04,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 23:48:04,514 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:04,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 23:48:04,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:48:04,514 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 11 states. [2019-11-15 23:48:04,996 WARN L191 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 26 [2019-11-15 23:48:05,319 WARN L191 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 28 [2019-11-15 23:48:05,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:05,365 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2019-11-15 23:48:05,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:48:05,365 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-11-15 23:48:05,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:05,365 INFO L225 Difference]: With dead ends: 49 [2019-11-15 23:48:05,366 INFO L226 Difference]: Without dead ends: 39 [2019-11-15 23:48:05,366 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:48:05,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-15 23:48:05,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-11-15 23:48:05,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-15 23:48:05,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-11-15 23:48:05,374 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 24 [2019-11-15 23:48:05,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:05,374 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-11-15 23:48:05,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 23:48:05,374 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-11-15 23:48:05,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 23:48:05,375 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:05,376 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:05,576 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:48:05,576 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:05,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:05,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1700299324, now seen corresponding path program 8 times [2019-11-15 23:48:05,577 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:05,577 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859018450] [2019-11-15 23:48:05,577 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:05,577 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:05,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:05,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:05,661 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:05,661 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859018450] [2019-11-15 23:48:05,662 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723888413] [2019-11-15 23:48:05,662 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/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 23:48:05,711 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 23:48:05,711 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:48:05,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 23:48:05,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:48:05,764 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:05,764 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:48:05,764 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2019-11-15 23:48:05,764 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479755178] [2019-11-15 23:48:05,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 23:48:05,764 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:05,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 23:48:05,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:48:05,765 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 16 states. [2019-11-15 23:48:06,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:06,021 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2019-11-15 23:48:06,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 23:48:06,021 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-11-15 23:48:06,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:06,021 INFO L225 Difference]: With dead ends: 47 [2019-11-15 23:48:06,022 INFO L226 Difference]: Without dead ends: 43 [2019-11-15 23:48:06,022 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2019-11-15 23:48:06,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-15 23:48:06,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 33. [2019-11-15 23:48:06,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-15 23:48:06,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-11-15 23:48:06,028 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 26 [2019-11-15 23:48:06,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:06,028 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-11-15 23:48:06,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 23:48:06,028 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-11-15 23:48:06,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 23:48:06,029 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:06,029 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:06,229 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:48:06,235 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:06,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:06,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1307941697, now seen corresponding path program 9 times [2019-11-15 23:48:06,235 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:06,235 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961431691] [2019-11-15 23:48:06,235 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:06,236 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:06,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:06,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:06,315 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:06,316 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961431691] [2019-11-15 23:48:06,316 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364213690] [2019-11-15 23:48:06,316 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/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 23:48:06,365 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-15 23:48:06,365 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:48:06,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 23:48:06,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:48:06,459 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:06,459 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:48:06,459 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2019-11-15 23:48:06,460 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245551200] [2019-11-15 23:48:06,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 23:48:06,460 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:06,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 23:48:06,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:48:06,461 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 16 states. [2019-11-15 23:48:06,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:06,613 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2019-11-15 23:48:06,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 23:48:06,614 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-11-15 23:48:06,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:06,614 INFO L225 Difference]: With dead ends: 51 [2019-11-15 23:48:06,614 INFO L226 Difference]: Without dead ends: 33 [2019-11-15 23:48:06,615 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2019-11-15 23:48:06,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-15 23:48:06,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2019-11-15 23:48:06,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-15 23:48:06,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-11-15 23:48:06,620 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 27 [2019-11-15 23:48:06,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:06,620 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-11-15 23:48:06,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 23:48:06,620 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-11-15 23:48:06,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 23:48:06,621 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:06,621 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:06,822 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:48:06,822 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:06,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:06,822 INFO L82 PathProgramCache]: Analyzing trace with hash 311885347, now seen corresponding path program 10 times [2019-11-15 23:48:06,822 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:06,822 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961785766] [2019-11-15 23:48:06,822 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:06,823 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:06,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:06,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:07,718 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:07,719 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961785766] [2019-11-15 23:48:07,719 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089730165] [2019-11-15 23:48:07,719 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/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 23:48:07,769 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 23:48:07,769 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:48:07,770 WARN L254 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 49 conjunts are in the unsatisfiable core [2019-11-15 23:48:07,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:48:07,782 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 23:48:07,782 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:07,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:07,787 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:48:07,787 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2019-11-15 23:48:07,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:07,817 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 23:48:07,817 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:07,823 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:07,824 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 23:48:07,824 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:27 [2019-11-15 23:48:07,859 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:07,868 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:07,869 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 72 [2019-11-15 23:48:07,869 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:07,890 INFO L567 ElimStorePlain]: treesize reduction 36, result has 51.4 percent of original size [2019-11-15 23:48:07,890 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 23:48:07,890 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:38 [2019-11-15 23:48:07,924 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:07,934 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:07,934 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 72 [2019-11-15 23:48:07,935 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:07,956 INFO L567 ElimStorePlain]: treesize reduction 36, result has 51.4 percent of original size [2019-11-15 23:48:07,956 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 23:48:07,956 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:38 [2019-11-15 23:48:07,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:07,998 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:07,999 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 72 [2019-11-15 23:48:07,999 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:08,023 INFO L567 ElimStorePlain]: treesize reduction 36, result has 51.4 percent of original size [2019-11-15 23:48:08,023 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 23:48:08,023 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:38 [2019-11-15 23:48:08,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:08,144 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:08,144 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 57 [2019-11-15 23:48:08,145 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:08,165 INFO L567 ElimStorePlain]: treesize reduction 24, result has 63.1 percent of original size [2019-11-15 23:48:08,166 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 23:48:08,166 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:66, output treesize:41 [2019-11-15 23:48:08,291 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:08,294 INFO L341 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2019-11-15 23:48:08,294 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 42 [2019-11-15 23:48:08,294 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:08,304 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:08,304 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:48:08,304 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:42 [2019-11-15 23:48:08,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:08,465 INFO L341 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2019-11-15 23:48:08,465 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 57 [2019-11-15 23:48:08,465 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:08,481 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:08,481 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:48:08,481 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:79, output treesize:54 [2019-11-15 23:48:08,630 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:08,653 INFO L341 Elim1Store]: treesize reduction 32, result has 56.2 percent of original size [2019-11-15 23:48:08,653 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 101 [2019-11-15 23:48:08,654 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:08,688 INFO L567 ElimStorePlain]: treesize reduction 64, result has 50.0 percent of original size [2019-11-15 23:48:08,688 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 23:48:08,688 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:83, output treesize:64 [2019-11-15 23:48:08,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:08,905 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-15 23:48:08,905 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:48:08,905 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 39 [2019-11-15 23:48:08,905 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452667812] [2019-11-15 23:48:08,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-11-15 23:48:08,906 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:08,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-11-15 23:48:08,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1382, Unknown=0, NotChecked=0, Total=1482 [2019-11-15 23:48:08,907 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 39 states. [2019-11-15 23:48:11,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:11,474 INFO L93 Difference]: Finished difference Result 88 states and 102 transitions. [2019-11-15 23:48:11,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-11-15 23:48:11,474 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 29 [2019-11-15 23:48:11,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:11,475 INFO L225 Difference]: With dead ends: 88 [2019-11-15 23:48:11,475 INFO L226 Difference]: Without dead ends: 82 [2019-11-15 23:48:11,476 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 10 SyntacticMatches, 7 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1031 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=360, Invalid=4196, Unknown=0, NotChecked=0, Total=4556 [2019-11-15 23:48:11,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-15 23:48:11,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 55. [2019-11-15 23:48:11,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-15 23:48:11,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2019-11-15 23:48:11,487 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 29 [2019-11-15 23:48:11,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:11,488 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2019-11-15 23:48:11,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-11-15 23:48:11,488 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2019-11-15 23:48:11,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 23:48:11,489 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:11,489 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:11,692 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:48:11,692 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:11,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:11,692 INFO L82 PathProgramCache]: Analyzing trace with hash 369143649, now seen corresponding path program 3 times [2019-11-15 23:48:11,692 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:11,692 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74071742] [2019-11-15 23:48:11,693 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:11,693 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:11,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:11,697 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 23:48:11,697 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1680877956] [2019-11-15 23:48:11,697 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/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 23:48:11,781 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-15 23:48:11,781 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:48:11,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 23:48:11,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:48:11,792 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-15 23:48:11,793 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:11,807 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:11,807 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:48:11,808 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-11-15 23:48:11,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:11,873 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:11,874 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 51 [2019-11-15 23:48:11,874 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:11,890 INFO L567 ElimStorePlain]: treesize reduction 24, result has 51.0 percent of original size [2019-11-15 23:48:11,890 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:48:11,891 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:25 [2019-11-15 23:48:11,900 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:11,905 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:11,905 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 51 [2019-11-15 23:48:11,906 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:11,920 INFO L567 ElimStorePlain]: treesize reduction 24, result has 51.0 percent of original size [2019-11-15 23:48:11,920 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:48:11,921 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:25 [2019-11-15 23:48:11,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:11,940 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:11,941 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 51 [2019-11-15 23:48:11,941 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:11,965 INFO L567 ElimStorePlain]: treesize reduction 32, result has 43.9 percent of original size [2019-11-15 23:48:11,965 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:48:11,966 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:20 [2019-11-15 23:48:12,009 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:12,010 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2019-11-15 23:48:12,010 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 23:48:12,022 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:12,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:12,023 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:48:12,023 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:16 [2019-11-15 23:48:12,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:12,084 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-15 23:48:12,085 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74071742] [2019-11-15 23:48:12,085 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 23:48:12,085 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680877956] [2019-11-15 23:48:12,085 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:48:12,085 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-11-15 23:48:12,085 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738955766] [2019-11-15 23:48:12,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:48:12,088 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:12,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:48:12,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:48:12,088 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 10 states. [2019-11-15 23:48:12,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:12,321 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2019-11-15 23:48:12,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:48:12,322 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-11-15 23:48:12,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:12,323 INFO L225 Difference]: With dead ends: 61 [2019-11-15 23:48:12,323 INFO L226 Difference]: Without dead ends: 57 [2019-11-15 23:48:12,323 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-11-15 23:48:12,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-15 23:48:12,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2019-11-15 23:48:12,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-15 23:48:12,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2019-11-15 23:48:12,339 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 29 [2019-11-15 23:48:12,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:12,341 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2019-11-15 23:48:12,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:48:12,341 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2019-11-15 23:48:12,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 23:48:12,343 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:12,343 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:12,555 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:48:12,555 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:12,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:12,556 INFO L82 PathProgramCache]: Analyzing trace with hash -967978331, now seen corresponding path program 4 times [2019-11-15 23:48:12,556 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:12,556 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169923075] [2019-11-15 23:48:12,556 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:12,556 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:12,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:12,562 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 23:48:12,563 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1375513233] [2019-11-15 23:48:12,563 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/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 23:48:12,625 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 23:48:12,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:48:12,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-15 23:48:12,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:48:12,631 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-15 23:48:12,632 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:12,633 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:12,634 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:48:12,634 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-15 23:48:12,655 INFO L341 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2019-11-15 23:48:12,656 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 28 treesize of output 27 [2019-11-15 23:48:12,656 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:12,660 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:12,660 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:48:12,661 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2019-11-15 23:48:12,707 INFO L341 Elim1Store]: treesize reduction 96, result has 20.7 percent of original size [2019-11-15 23:48:12,707 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 40 treesize of output 42 [2019-11-15 23:48:12,708 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:12,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:12,716 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:48:12,716 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2019-11-15 23:48:12,782 INFO L341 Elim1Store]: treesize reduction 171, result has 17.8 percent of original size [2019-11-15 23:48:12,783 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 57 [2019-11-15 23:48:12,783 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:12,792 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:12,792 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:48:12,792 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:51 [2019-11-15 23:48:12,881 INFO L341 Elim1Store]: treesize reduction 105, result has 39.3 percent of original size [2019-11-15 23:48:12,881 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 83 [2019-11-15 23:48:12,882 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:12,900 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:12,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:12,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:12,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:12,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:12,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:12,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:12,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:12,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:12,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:12,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:12,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:12,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:12,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:12,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:12,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:12,916 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2019-11-15 23:48:12,917 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:67, output treesize:465 [2019-11-15 23:48:12,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:48:13,101 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 13 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:13,101 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169923075] [2019-11-15 23:48:13,101 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 23:48:13,101 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375513233] [2019-11-15 23:48:13,101 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:48:13,102 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-11-15 23:48:13,102 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335437953] [2019-11-15 23:48:13,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-15 23:48:13,102 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:13,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 23:48:13,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2019-11-15 23:48:13,102 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 18 states. [2019-11-15 23:48:13,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:13,599 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2019-11-15 23:48:13,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 23:48:13,600 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 29 [2019-11-15 23:48:13,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:13,600 INFO L225 Difference]: With dead ends: 66 [2019-11-15 23:48:13,600 INFO L226 Difference]: Without dead ends: 62 [2019-11-15 23:48:13,601 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=577, Unknown=0, NotChecked=0, Total=702 [2019-11-15 23:48:13,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-15 23:48:13,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 47. [2019-11-15 23:48:13,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-15 23:48:13,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2019-11-15 23:48:13,610 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 29 [2019-11-15 23:48:13,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:13,613 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2019-11-15 23:48:13,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-15 23:48:13,613 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2019-11-15 23:48:13,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 23:48:13,615 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:13,615 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:13,819 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:48:13,819 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:13,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:13,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1393842980, now seen corresponding path program 11 times [2019-11-15 23:48:13,819 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:13,819 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888327605] [2019-11-15 23:48:13,820 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:13,820 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:13,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:13,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:13,953 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:13,953 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888327605] [2019-11-15 23:48:13,953 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111060462] [2019-11-15 23:48:13,953 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:48:14,047 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-15 23:48:14,047 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:48:14,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 23:48:14,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:48:14,154 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:14,154 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:48:14,154 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2019-11-15 23:48:14,154 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560635496] [2019-11-15 23:48:14,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-15 23:48:14,155 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:14,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-15 23:48:14,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-11-15 23:48:14,155 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand 19 states. [2019-11-15 23:48:14,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:14,377 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2019-11-15 23:48:14,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 23:48:14,377 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2019-11-15 23:48:14,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:14,378 INFO L225 Difference]: With dead ends: 76 [2019-11-15 23:48:14,378 INFO L226 Difference]: Without dead ends: 41 [2019-11-15 23:48:14,379 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2019-11-15 23:48:14,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-15 23:48:14,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2019-11-15 23:48:14,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-15 23:48:14,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-11-15 23:48:14,385 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 32 [2019-11-15 23:48:14,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:14,385 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-11-15 23:48:14,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-15 23:48:14,385 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-11-15 23:48:14,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-15 23:48:14,393 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:14,393 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:14,597 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:48:14,597 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:14,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:14,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1635696442, now seen corresponding path program 12 times [2019-11-15 23:48:14,598 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:14,598 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241423483] [2019-11-15 23:48:14,598 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:14,598 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:14,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:15,545 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:15,546 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241423483] [2019-11-15 23:48:15,546 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953300447] [2019-11-15 23:48:15,546 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:48:15,615 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-11-15 23:48:15,616 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:48:15,617 WARN L254 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 56 conjunts are in the unsatisfiable core [2019-11-15 23:48:15,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:48:15,626 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 23:48:15,627 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:15,633 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:15,633 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:48:15,633 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2019-11-15 23:48:15,683 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:15,684 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 23:48:15,684 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:15,693 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:15,693 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 23:48:15,693 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:27 [2019-11-15 23:48:15,765 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:15,780 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:15,781 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 72 [2019-11-15 23:48:15,781 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:15,802 INFO L567 ElimStorePlain]: treesize reduction 36, result has 51.4 percent of original size [2019-11-15 23:48:15,803 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 23:48:15,803 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:38 [2019-11-15 23:48:15,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:15,854 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:15,854 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 72 [2019-11-15 23:48:15,854 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:15,875 INFO L567 ElimStorePlain]: treesize reduction 36, result has 51.4 percent of original size [2019-11-15 23:48:15,876 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:48:15,876 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:38 [2019-11-15 23:48:15,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:15,950 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:15,951 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 72 [2019-11-15 23:48:15,951 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:15,979 INFO L567 ElimStorePlain]: treesize reduction 36, result has 51.4 percent of original size [2019-11-15 23:48:15,979 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 23:48:15,980 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:38 [2019-11-15 23:48:16,037 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:16,050 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:16,050 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 72 [2019-11-15 23:48:16,051 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:16,088 INFO L567 ElimStorePlain]: treesize reduction 36, result has 51.4 percent of original size [2019-11-15 23:48:16,088 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 23:48:16,088 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:38 [2019-11-15 23:48:16,215 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:16,219 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:16,219 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 57 [2019-11-15 23:48:16,219 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:16,251 INFO L567 ElimStorePlain]: treesize reduction 24, result has 67.1 percent of original size [2019-11-15 23:48:16,251 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 23:48:16,251 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:66, output treesize:49 [2019-11-15 23:48:16,399 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:16,403 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:16,404 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 49 [2019-11-15 23:48:16,404 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:16,423 INFO L567 ElimStorePlain]: treesize reduction 18, result has 70.5 percent of original size [2019-11-15 23:48:16,423 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:48:16,423 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:66, output treesize:43 [2019-11-15 23:48:16,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:16,612 INFO L341 Elim1Store]: treesize reduction 17, result has 60.5 percent of original size [2019-11-15 23:48:16,612 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 79 [2019-11-15 23:48:16,613 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:16,638 INFO L567 ElimStorePlain]: treesize reduction 41, result has 59.0 percent of original size [2019-11-15 23:48:16,638 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:48:16,638 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:80, output treesize:59 [2019-11-15 23:48:16,814 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:16,838 INFO L341 Elim1Store]: treesize reduction 52, result has 42.9 percent of original size [2019-11-15 23:48:16,838 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 107 [2019-11-15 23:48:16,839 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:16,865 INFO L567 ElimStorePlain]: treesize reduction 19, result has 77.9 percent of original size [2019-11-15 23:48:16,865 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:48:16,865 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:97, output treesize:67 [2019-11-15 23:48:17,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:17,105 INFO L341 Elim1Store]: treesize reduction 66, result has 45.5 percent of original size [2019-11-15 23:48:17,105 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 84 treesize of output 129 [2019-11-15 23:48:17,106 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:17,162 INFO L567 ElimStorePlain]: treesize reduction 108, result has 46.0 percent of original size [2019-11-15 23:48:17,163 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 23:48:17,163 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:98, output treesize:92 [2019-11-15 23:48:17,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:17,473 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 5 proven. 35 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-15 23:48:17,473 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:48:17,473 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 22] total 46 [2019-11-15 23:48:17,473 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737620921] [2019-11-15 23:48:17,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-11-15 23:48:17,473 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:17,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-11-15 23:48:17,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1955, Unknown=0, NotChecked=0, Total=2070 [2019-11-15 23:48:17,475 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 46 states. [2019-11-15 23:48:21,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:21,241 INFO L93 Difference]: Finished difference Result 100 states and 118 transitions. [2019-11-15 23:48:21,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-11-15 23:48:21,241 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 34 [2019-11-15 23:48:21,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:21,242 INFO L225 Difference]: With dead ends: 100 [2019-11-15 23:48:21,242 INFO L226 Difference]: Without dead ends: 94 [2019-11-15 23:48:21,244 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 11 SyntacticMatches, 8 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1440 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=387, Invalid=6093, Unknown=0, NotChecked=0, Total=6480 [2019-11-15 23:48:21,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-15 23:48:21,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 63. [2019-11-15 23:48:21,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-15 23:48:21,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2019-11-15 23:48:21,255 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 34 [2019-11-15 23:48:21,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:21,256 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2019-11-15 23:48:21,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-11-15 23:48:21,256 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2019-11-15 23:48:21,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-15 23:48:21,257 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:21,257 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:21,458 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:48:21,458 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:21,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:21,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1979212484, now seen corresponding path program 5 times [2019-11-15 23:48:21,458 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:21,459 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858746361] [2019-11-15 23:48:21,459 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:21,459 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:21,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:21,466 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 23:48:21,466 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1276889484] [2019-11-15 23:48:21,467 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:48:21,573 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-15 23:48:21,573 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:48:21,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-15 23:48:21,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:48:21,622 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-15 23:48:21,622 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:21,628 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:21,629 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:48:21,629 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-11-15 23:48:21,673 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:21,673 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 54 [2019-11-15 23:48:21,673 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:21,692 INFO L567 ElimStorePlain]: treesize reduction 30, result has 49.2 percent of original size [2019-11-15 23:48:21,692 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 23:48:21,693 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:29 [2019-11-15 23:48:21,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:21,760 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:21,760 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 91 [2019-11-15 23:48:21,761 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:21,780 INFO L567 ElimStorePlain]: treesize reduction 72, result has 30.8 percent of original size [2019-11-15 23:48:21,780 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 23:48:21,780 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:57, output treesize:32 [2019-11-15 23:48:21,811 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:21,825 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:21,825 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 91 [2019-11-15 23:48:21,826 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:21,847 INFO L567 ElimStorePlain]: treesize reduction 76, result has 29.6 percent of original size [2019-11-15 23:48:21,847 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 23:48:21,848 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:57, output treesize:32 [2019-11-15 23:48:21,879 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:21,896 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:21,896 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 91 [2019-11-15 23:48:21,896 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:21,914 INFO L567 ElimStorePlain]: treesize reduction 46, result has 41.0 percent of original size [2019-11-15 23:48:21,915 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:48:21,915 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:57, output treesize:27 [2019-11-15 23:48:21,958 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:21,959 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 24 [2019-11-15 23:48:21,959 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:21,962 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:21,962 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:48:21,962 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:3 [2019-11-15 23:48:21,978 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 18 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 23:48:21,978 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858746361] [2019-11-15 23:48:21,978 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 23:48:21,979 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276889484] [2019-11-15 23:48:21,979 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:48:21,979 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-11-15 23:48:21,979 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381619773] [2019-11-15 23:48:21,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-15 23:48:21,979 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:21,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 23:48:21,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-11-15 23:48:21,980 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand 15 states. [2019-11-15 23:48:22,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:22,539 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2019-11-15 23:48:22,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 23:48:22,539 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2019-11-15 23:48:22,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:22,539 INFO L225 Difference]: With dead ends: 76 [2019-11-15 23:48:22,540 INFO L226 Difference]: Without dead ends: 67 [2019-11-15 23:48:22,540 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2019-11-15 23:48:22,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-15 23:48:22,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-11-15 23:48:22,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-15 23:48:22,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2019-11-15 23:48:22,552 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 34 [2019-11-15 23:48:22,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:22,552 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2019-11-15 23:48:22,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-15 23:48:22,552 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2019-11-15 23:48:22,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-15 23:48:22,553 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:22,553 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:22,756 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:48:22,756 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:22,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:22,757 INFO L82 PathProgramCache]: Analyzing trace with hash -358448264, now seen corresponding path program 6 times [2019-11-15 23:48:22,757 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:22,757 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186337296] [2019-11-15 23:48:22,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:22,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:22,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:22,761 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 23:48:22,762 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1084560287] [2019-11-15 23:48:22,762 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:48:22,855 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-11-15 23:48:22,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:48:22,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-15 23:48:22,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:48:22,867 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-15 23:48:22,867 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:22,872 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:22,873 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:48:22,873 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-11-15 23:48:22,899 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:22,900 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 23:48:22,900 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:22,912 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:22,913 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:48:22,913 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-11-15 23:48:22,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:22,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:22,943 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:22,944 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:22,944 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2019-11-15 23:48:22,944 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:22,953 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:22,954 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 23:48:22,954 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:41 [2019-11-15 23:48:23,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:23,001 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:23,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:23,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:23,004 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:23,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:23,006 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:23,006 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 50 [2019-11-15 23:48:23,006 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:23,020 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:23,021 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 23:48:23,021 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:61, output treesize:57 [2019-11-15 23:48:24,584 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:24,586 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:24,587 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:24,588 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:24,590 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:24,592 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:24,594 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:24,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:24,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:24,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:24,598 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:24,598 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 64 [2019-11-15 23:48:24,599 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:24,617 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:24,618 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-15 23:48:24,618 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:73 [2019-11-15 23:48:34,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:34,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:34,828 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:34,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:34,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:34,836 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:34,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:34,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:34,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:34,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:34,850 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:34,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:34,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:34,854 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:48:34,856 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:34,856 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 53 treesize of output 22 [2019-11-15 23:48:34,856 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:34,872 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:34,873 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:48:34,873 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:74, output treesize:7 [2019-11-15 23:48:34,899 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 18 proven. 16 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-15 23:48:34,900 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186337296] [2019-11-15 23:48:34,900 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 23:48:34,900 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084560287] [2019-11-15 23:48:34,900 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:48:34,900 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-11-15 23:48:34,900 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731672995] [2019-11-15 23:48:34,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 23:48:34,901 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:34,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 23:48:34,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=133, Unknown=5, NotChecked=0, Total=182 [2019-11-15 23:48:34,902 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand 14 states. [2019-11-15 23:48:40,190 WARN L191 SmtUtils]: Spent 899.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-11-15 23:48:42,219 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 42 [2019-11-15 23:48:42,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:42,279 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2019-11-15 23:48:42,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 23:48:42,279 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2019-11-15 23:48:42,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:42,279 INFO L225 Difference]: With dead ends: 76 [2019-11-15 23:48:42,279 INFO L226 Difference]: Without dead ends: 43 [2019-11-15 23:48:42,280 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=69, Invalid=198, Unknown=5, NotChecked=0, Total=272 [2019-11-15 23:48:42,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-15 23:48:42,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2019-11-15 23:48:42,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-15 23:48:42,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2019-11-15 23:48:42,287 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 34 [2019-11-15 23:48:42,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:42,287 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2019-11-15 23:48:42,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 23:48:42,287 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2019-11-15 23:48:42,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-15 23:48:42,288 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:42,288 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:42,491 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:48:42,491 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:42,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:42,492 INFO L82 PathProgramCache]: Analyzing trace with hash -127223707, now seen corresponding path program 13 times [2019-11-15 23:48:42,492 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:42,492 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115710457] [2019-11-15 23:48:42,492 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:42,492 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:42,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:42,609 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 38 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:42,610 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115710457] [2019-11-15 23:48:42,610 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308320807] [2019-11-15 23:48:42,610 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:48:42,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:42,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 23:48:42,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:48:42,760 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 51 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:42,761 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:48:42,761 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2019-11-15 23:48:42,761 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118458483] [2019-11-15 23:48:42,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-15 23:48:42,761 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:42,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-15 23:48:42,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2019-11-15 23:48:42,762 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 22 states. [2019-11-15 23:48:42,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:42,950 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2019-11-15 23:48:42,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 23:48:42,951 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 37 [2019-11-15 23:48:42,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:42,951 INFO L225 Difference]: With dead ends: 72 [2019-11-15 23:48:42,951 INFO L226 Difference]: Without dead ends: 46 [2019-11-15 23:48:42,952 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-11-15 23:48:42,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-15 23:48:42,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2019-11-15 23:48:42,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-15 23:48:42,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2019-11-15 23:48:42,959 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 37 [2019-11-15 23:48:42,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:42,959 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2019-11-15 23:48:42,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-15 23:48:42,960 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2019-11-15 23:48:42,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 23:48:42,960 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:42,960 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:43,163 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:48:43,163 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:43,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:43,163 INFO L82 PathProgramCache]: Analyzing trace with hash 639592647, now seen corresponding path program 14 times [2019-11-15 23:48:43,163 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:43,164 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612126346] [2019-11-15 23:48:43,164 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:43,164 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:43,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:43,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:44,101 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:44,101 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612126346] [2019-11-15 23:48:44,101 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009080243] [2019-11-15 23:48:44,101 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:48:44,167 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 23:48:44,167 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:48:44,170 WARN L254 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 65 conjunts are in the unsatisfiable core [2019-11-15 23:48:44,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:48:44,179 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 23:48:44,179 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:44,185 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:44,185 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:48:44,186 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-15 23:48:44,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:44,239 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 23:48:44,239 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:44,248 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:44,248 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:48:44,248 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2019-11-15 23:48:44,334 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:44,345 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:44,346 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 56 [2019-11-15 23:48:44,346 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:44,376 INFO L567 ElimStorePlain]: treesize reduction 24, result has 60.7 percent of original size [2019-11-15 23:48:44,376 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:48:44,376 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2019-11-15 23:48:44,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:44,492 INFO L341 Elim1Store]: treesize reduction 52, result has 45.8 percent of original size [2019-11-15 23:48:44,492 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 42 treesize of output 71 [2019-11-15 23:48:44,492 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:44,519 INFO L567 ElimStorePlain]: treesize reduction 24, result has 67.1 percent of original size [2019-11-15 23:48:44,519 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:48:44,519 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:49 [2019-11-15 23:48:44,619 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:44,675 INFO L341 Elim1Store]: treesize reduction 32, result has 77.5 percent of original size [2019-11-15 23:48:44,675 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 140 [2019-11-15 23:48:44,676 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:44,718 INFO L567 ElimStorePlain]: treesize reduction 84, result has 39.6 percent of original size [2019-11-15 23:48:44,718 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:48:44,718 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:55 [2019-11-15 23:48:44,828 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:44,901 INFO L341 Elim1Store]: treesize reduction 114, result has 51.7 percent of original size [2019-11-15 23:48:44,901 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 60 treesize of output 155 [2019-11-15 23:48:44,902 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:44,946 INFO L567 ElimStorePlain]: treesize reduction 84, result has 44.4 percent of original size [2019-11-15 23:48:44,947 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:48:44,947 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:71, output treesize:67 [2019-11-15 23:48:45,078 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:45,187 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 47 [2019-11-15 23:48:45,187 INFO L341 Elim1Store]: treesize reduction 214, result has 38.5 percent of original size [2019-11-15 23:48:45,187 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 72 treesize of output 170 [2019-11-15 23:48:45,188 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:45,243 INFO L567 ElimStorePlain]: treesize reduction 84, result has 49.4 percent of original size [2019-11-15 23:48:45,244 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:48:45,244 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:86, output treesize:82 [2019-11-15 23:48:45,548 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:45,612 INFO L341 Elim1Store]: treesize reduction 170, result has 32.8 percent of original size [2019-11-15 23:48:45,613 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 96 treesize of output 179 [2019-11-15 23:48:45,614 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:45,662 INFO L567 ElimStorePlain]: treesize reduction 110, result has 43.9 percent of original size [2019-11-15 23:48:45,663 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 23:48:45,663 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:107, output treesize:86 [2019-11-15 23:48:46,157 WARN L191 SmtUtils]: Spent 436.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-15 23:48:46,793 WARN L191 SmtUtils]: Spent 572.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-11-15 23:48:46,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:47,033 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 78 [2019-11-15 23:48:47,034 INFO L341 Elim1Store]: treesize reduction 170, result has 51.6 percent of original size [2019-11-15 23:48:47,034 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 111 treesize of output 291 [2019-11-15 23:48:47,036 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:47,154 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 52 [2019-11-15 23:48:47,154 INFO L567 ElimStorePlain]: treesize reduction 238, result has 29.4 percent of original size [2019-11-15 23:48:47,155 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 23:48:47,155 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:122, output treesize:99 [2019-11-15 23:48:48,187 WARN L191 SmtUtils]: Spent 928.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-11-15 23:48:48,296 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:48,361 INFO L341 Elim1Store]: treesize reduction 170, result has 32.8 percent of original size [2019-11-15 23:48:48,361 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 96 treesize of output 179 [2019-11-15 23:48:48,362 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:48,412 INFO L567 ElimStorePlain]: treesize reduction 76, result has 51.9 percent of original size [2019-11-15 23:48:48,412 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 23:48:48,412 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:107, output treesize:82 [2019-11-15 23:48:48,900 WARN L191 SmtUtils]: Spent 427.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-15 23:48:49,430 WARN L191 SmtUtils]: Spent 463.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-11-15 23:48:49,435 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:49,577 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 78 [2019-11-15 23:48:49,577 INFO L341 Elim1Store]: treesize reduction 170, result has 51.6 percent of original size [2019-11-15 23:48:49,577 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 107 treesize of output 291 [2019-11-15 23:48:49,579 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:49,677 INFO L567 ElimStorePlain]: treesize reduction 278, result has 27.0 percent of original size [2019-11-15 23:48:49,678 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 23:48:49,678 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:118, output treesize:103 [2019-11-15 23:48:49,901 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:50,043 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 78 [2019-11-15 23:48:50,043 INFO L341 Elim1Store]: treesize reduction 170, result has 51.6 percent of original size [2019-11-15 23:48:50,043 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 117 treesize of output 293 [2019-11-15 23:48:50,045 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:50,139 INFO L567 ElimStorePlain]: treesize reduction 384, result has 23.5 percent of original size [2019-11-15 23:48:50,139 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 23:48:50,140 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:128, output treesize:118 [2019-11-15 23:48:50,349 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:50,778 WARN L191 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 114 [2019-11-15 23:48:50,779 INFO L341 Elim1Store]: treesize reduction 170, result has 63.4 percent of original size [2019-11-15 23:48:50,779 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 1 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 36 case distinctions, treesize of input 143 treesize of output 424 [2019-11-15 23:48:50,782 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:50,910 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 57 [2019-11-15 23:48:50,910 INFO L567 ElimStorePlain]: treesize reduction 460, result has 19.9 percent of original size [2019-11-15 23:48:50,910 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-15 23:48:50,911 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:154, output treesize:114 [2019-11-15 23:48:51,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:51,076 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:51,076 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:48:51,077 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 57 [2019-11-15 23:48:51,077 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348880902] [2019-11-15 23:48:51,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-11-15 23:48:51,077 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:51,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-11-15 23:48:51,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=3008, Unknown=0, NotChecked=0, Total=3192 [2019-11-15 23:48:51,079 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 57 states. [2019-11-15 23:48:52,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:52,769 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2019-11-15 23:48:52,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-11-15 23:48:52,770 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 39 [2019-11-15 23:48:52,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:52,771 INFO L225 Difference]: With dead ends: 69 [2019-11-15 23:48:52,771 INFO L226 Difference]: Without dead ends: 65 [2019-11-15 23:48:52,772 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1179 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=268, Invalid=4154, Unknown=0, NotChecked=0, Total=4422 [2019-11-15 23:48:52,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-15 23:48:52,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2019-11-15 23:48:52,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-15 23:48:52,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2019-11-15 23:48:52,783 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 39 [2019-11-15 23:48:52,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:52,783 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2019-11-15 23:48:52,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-11-15 23:48:52,783 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2019-11-15 23:48:52,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 23:48:52,784 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:52,784 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:52,984 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:48:52,984 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:52,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:52,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1319651017, now seen corresponding path program 7 times [2019-11-15 23:48:52,985 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:52,985 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671363668] [2019-11-15 23:48:52,985 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:52,985 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:52,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:52,991 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 23:48:52,991 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [559253901] [2019-11-15 23:48:52,991 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:48:53,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:53,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-15 23:48:53,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:48:53,110 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-15 23:48:53,111 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:53,116 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:53,116 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:48:53,116 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-11-15 23:48:53,150 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:53,151 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 54 [2019-11-15 23:48:53,151 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:53,167 INFO L567 ElimStorePlain]: treesize reduction 30, result has 49.2 percent of original size [2019-11-15 23:48:53,168 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 23:48:53,168 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:29 [2019-11-15 23:48:53,215 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:53,227 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:53,227 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 91 [2019-11-15 23:48:53,228 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:53,247 INFO L567 ElimStorePlain]: treesize reduction 76, result has 29.6 percent of original size [2019-11-15 23:48:53,247 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 23:48:53,247 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:57, output treesize:32 [2019-11-15 23:48:53,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:53,310 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:53,310 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 91 [2019-11-15 23:48:53,311 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:53,329 INFO L567 ElimStorePlain]: treesize reduction 46, result has 41.0 percent of original size [2019-11-15 23:48:53,329 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 23:48:53,329 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:57, output treesize:32 [2019-11-15 23:48:53,366 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:53,378 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:53,378 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 91 [2019-11-15 23:48:53,379 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:53,398 INFO L567 ElimStorePlain]: treesize reduction 72, result has 30.8 percent of original size [2019-11-15 23:48:53,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 23:48:53,398 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:57, output treesize:32 [2019-11-15 23:48:53,437 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:53,448 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:53,449 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 91 [2019-11-15 23:48:53,449 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:53,468 INFO L567 ElimStorePlain]: treesize reduction 72, result has 30.8 percent of original size [2019-11-15 23:48:53,468 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:48:53,469 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:57, output treesize:27 [2019-11-15 23:48:53,532 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:53,532 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 24 [2019-11-15 23:48:53,532 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:53,535 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:53,536 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:48:53,536 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:3 [2019-11-15 23:48:53,557 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 23 proven. 62 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 23:48:53,557 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671363668] [2019-11-15 23:48:53,557 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 23:48:53,558 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559253901] [2019-11-15 23:48:53,558 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:48:53,558 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-11-15 23:48:53,558 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132013590] [2019-11-15 23:48:53,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-15 23:48:53,559 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:53,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-15 23:48:53,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-11-15 23:48:53,559 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 17 states. [2019-11-15 23:48:53,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:53,903 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2019-11-15 23:48:53,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 23:48:53,903 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 39 [2019-11-15 23:48:53,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:53,904 INFO L225 Difference]: With dead ends: 70 [2019-11-15 23:48:53,904 INFO L226 Difference]: Without dead ends: 61 [2019-11-15 23:48:53,904 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2019-11-15 23:48:53,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-15 23:48:53,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-11-15 23:48:53,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-15 23:48:53,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2019-11-15 23:48:53,916 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 39 [2019-11-15 23:48:53,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:53,917 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2019-11-15 23:48:53,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-15 23:48:53,917 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2019-11-15 23:48:53,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-15 23:48:53,917 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:53,918 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:54,120 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:48:54,120 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:54,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:54,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1184266071, now seen corresponding path program 15 times [2019-11-15 23:48:54,121 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:54,121 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521614125] [2019-11-15 23:48:54,121 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:54,121 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:54,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:54,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:54,301 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 25 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:54,301 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521614125] [2019-11-15 23:48:54,301 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509085454] [2019-11-15 23:48:54,301 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:48:54,418 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-11-15 23:48:54,419 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:48:54,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 23:48:54,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:48:54,522 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:54,522 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:48:54,522 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2019-11-15 23:48:54,522 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208532809] [2019-11-15 23:48:54,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-15 23:48:54,523 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:54,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-15 23:48:54,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2019-11-15 23:48:54,523 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 25 states. [2019-11-15 23:48:54,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:54,942 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2019-11-15 23:48:54,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-15 23:48:54,942 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 41 [2019-11-15 23:48:54,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:54,943 INFO L225 Difference]: With dead ends: 76 [2019-11-15 23:48:54,943 INFO L226 Difference]: Without dead ends: 72 [2019-11-15 23:48:54,943 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=342, Invalid=1140, Unknown=0, NotChecked=0, Total=1482 [2019-11-15 23:48:54,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-15 23:48:54,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 43. [2019-11-15 23:48:54,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-15 23:48:54,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2019-11-15 23:48:54,950 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 41 [2019-11-15 23:48:54,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:54,950 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2019-11-15 23:48:54,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-15 23:48:54,950 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2019-11-15 23:48:54,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-15 23:48:54,950 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:54,951 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:55,153 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:48:55,154 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:55,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:55,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1126332488, now seen corresponding path program 16 times [2019-11-15 23:48:55,154 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:55,155 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567805143] [2019-11-15 23:48:55,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:55,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:55,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:55,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:55,274 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 54 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:55,274 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567805143] [2019-11-15 23:48:55,274 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201067931] [2019-11-15 23:48:55,274 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/bin/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:48:55,361 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 23:48:55,361 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:48:55,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 23:48:55,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:48:55,473 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 70 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:55,473 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:48:55,473 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2019-11-15 23:48:55,473 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112247993] [2019-11-15 23:48:55,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-15 23:48:55,474 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:55,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-15 23:48:55,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=451, Unknown=0, NotChecked=0, Total=600 [2019-11-15 23:48:55,474 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 25 states. [2019-11-15 23:48:55,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:55,681 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2019-11-15 23:48:55,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 23:48:55,681 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 42 [2019-11-15 23:48:55,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:55,681 INFO L225 Difference]: With dead ends: 80 [2019-11-15 23:48:55,681 INFO L226 Difference]: Without dead ends: 51 [2019-11-15 23:48:55,682 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=247, Invalid=745, Unknown=0, NotChecked=0, Total=992 [2019-11-15 23:48:55,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-15 23:48:55,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2019-11-15 23:48:55,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-15 23:48:55,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2019-11-15 23:48:55,689 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 42 [2019-11-15 23:48:55,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:55,689 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2019-11-15 23:48:55,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-15 23:48:55,689 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2019-11-15 23:48:55,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 23:48:55,689 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:55,689 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:55,890 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:48:55,890 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:55,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:55,890 INFO L82 PathProgramCache]: Analyzing trace with hash -70138730, now seen corresponding path program 17 times [2019-11-15 23:48:55,890 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:55,890 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371633777] [2019-11-15 23:48:55,890 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:55,890 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:55,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:55,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:56,899 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:56,900 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371633777] [2019-11-15 23:48:56,900 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011062249] [2019-11-15 23:48:56,900 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/bin/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:48:57,027 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-11-15 23:48:57,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:48:57,029 WARN L254 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 73 conjunts are in the unsatisfiable core [2019-11-15 23:48:57,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:48:57,048 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 23:48:57,048 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:57,057 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:57,057 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:48:57,057 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-15 23:48:57,101 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:57,102 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 23:48:57,102 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:57,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:57,111 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:48:57,111 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2019-11-15 23:48:57,213 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:57,223 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:57,224 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 72 [2019-11-15 23:48:57,224 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:57,254 INFO L567 ElimStorePlain]: treesize reduction 36, result has 56.1 percent of original size [2019-11-15 23:48:57,254 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 23:48:57,255 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:46 [2019-11-15 23:48:57,404 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:57,429 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:57,429 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 138 [2019-11-15 23:48:57,430 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:57,505 INFO L567 ElimStorePlain]: treesize reduction 72, result has 46.3 percent of original size [2019-11-15 23:48:57,506 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 23:48:57,506 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:66, output treesize:62 [2019-11-15 23:48:57,654 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:57,700 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:57,700 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 220 [2019-11-15 23:48:57,701 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:57,761 INFO L567 ElimStorePlain]: treesize reduction 108, result has 41.9 percent of original size [2019-11-15 23:48:57,762 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 23:48:57,762 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:82, output treesize:78 [2019-11-15 23:48:57,932 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:58,012 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:58,013 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 67 treesize of output 318 [2019-11-15 23:48:58,013 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:58,090 INFO L567 ElimStorePlain]: treesize reduction 144, result has 39.5 percent of original size [2019-11-15 23:48:58,090 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-15 23:48:58,090 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:98, output treesize:94 [2019-11-15 23:48:58,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:58,437 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2019-11-15 23:48:58,437 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:58,437 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 78 treesize of output 432 [2019-11-15 23:48:58,438 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:58,537 INFO L567 ElimStorePlain]: treesize reduction 180, result has 37.9 percent of original size [2019-11-15 23:48:58,537 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-15 23:48:58,538 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:114, output treesize:110 [2019-11-15 23:48:59,180 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:48:59,372 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2019-11-15 23:48:59,372 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:59,373 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 89 treesize of output 562 [2019-11-15 23:48:59,374 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:59,495 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 67 [2019-11-15 23:48:59,496 INFO L567 ElimStorePlain]: treesize reduction 216, result has 36.8 percent of original size [2019-11-15 23:48:59,496 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-11-15 23:48:59,496 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:130, output treesize:126 [2019-11-15 23:49:26,184 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-11-15 23:49:59,664 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:49:59,841 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 147 [2019-11-15 23:49:59,841 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:59,842 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 121 treesize of output 573 [2019-11-15 23:49:59,844 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:50:00,009 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 73 [2019-11-15 23:50:00,009 INFO L567 ElimStorePlain]: treesize reduction 652, result has 18.3 percent of original size [2019-11-15 23:50:00,010 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-11-15 23:50:00,010 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:167, output treesize:146 [2019-11-15 23:50:00,430 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:00,814 WARN L191 SmtUtils]: Spent 382.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-11-15 23:50:00,815 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:50:00,815 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 1 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 36 case distinctions, treesize of input 136 treesize of output 715 [2019-11-15 23:50:00,819 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:50:01,115 WARN L191 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 80 [2019-11-15 23:50:01,115 INFO L567 ElimStorePlain]: treesize reduction 672, result has 19.0 percent of original size [2019-11-15 23:50:01,116 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2019-11-15 23:50:01,117 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:187, output treesize:158 [2019-11-15 23:50:01,903 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-11-15 23:50:01,915 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:02,288 WARN L191 SmtUtils]: Spent 371.00 ms on a formula simplification that was a NOOP. DAG size: 223 [2019-11-15 23:50:02,289 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:50:02,289 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 1 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 45 case distinctions, treesize of input 143 treesize of output 873 [2019-11-15 23:50:02,294 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:50:02,525 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 88 [2019-11-15 23:50:02,526 INFO L567 ElimStorePlain]: treesize reduction 920, result has 15.9 percent of original size [2019-11-15 23:50:02,526 INFO L496 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2019-11-15 23:50:02,527 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 10 variables, input treesize:199, output treesize:174 [2019-11-15 23:50:02,867 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-11-15 23:50:03,548 WARN L191 SmtUtils]: Spent 332.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-11-15 23:50:03,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:04,075 WARN L191 SmtUtils]: Spent 515.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2019-11-15 23:50:04,075 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:50:04,076 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 1 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 55 case distinctions, treesize of input 154 treesize of output 1047 [2019-11-15 23:50:04,081 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:50:04,409 WARN L191 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 96 [2019-11-15 23:50:04,409 INFO L567 ElimStorePlain]: treesize reduction 1344, result has 13.0 percent of original size [2019-11-15 23:50:04,410 INFO L496 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-2 vars, End of recursive call: 10 dim-0 vars, and 1 xjuncts. [2019-11-15 23:50:04,410 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 11 variables, input treesize:215, output treesize:200 [2019-11-15 23:50:04,863 WARN L191 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-11-15 23:50:06,450 WARN L191 SmtUtils]: Spent 336.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-11-15 23:50:08,729 WARN L191 SmtUtils]: Spent 1.75 s on a formula simplification that was a NOOP. DAG size: 108 [2019-11-15 23:50:08,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:09,461 WARN L191 SmtUtils]: Spent 718.00 ms on a formula simplification that was a NOOP. DAG size: 315 [2019-11-15 23:50:09,461 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:50:09,462 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 1 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 66 case distinctions, treesize of input 175 treesize of output 1239 [2019-11-15 23:50:09,467 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:50:09,846 WARN L191 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 270 DAG size of output: 102 [2019-11-15 23:50:09,846 INFO L567 ElimStorePlain]: treesize reduction 1344, result has 13.8 percent of original size [2019-11-15 23:50:09,847 INFO L496 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 1 dim-2 vars, End of recursive call: 11 dim-0 vars, and 1 xjuncts. [2019-11-15 23:50:09,847 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 12 variables, input treesize:241, output treesize:216 [2019-11-15 23:50:12,235 WARN L191 SmtUtils]: Spent 1.63 s on a formula simplification that was a NOOP. DAG size: 106 [2019-11-15 23:50:34,625 WARN L191 SmtUtils]: Spent 1.99 s on a formula simplification that was a NOOP. DAG size: 109 [2019-11-15 23:50:51,696 WARN L191 SmtUtils]: Spent 9.99 s on a formula simplification that was a NOOP. DAG size: 114 [2019-11-15 23:50:51,706 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:50:52,684 WARN L191 SmtUtils]: Spent 976.00 ms on a formula simplification that was a NOOP. DAG size: 367 [2019-11-15 23:50:52,684 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:50:52,685 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 14 select indices, 14 select index equivalence classes, 1 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 78 case distinctions, treesize of input 186 treesize of output 1445 [2019-11-15 23:50:52,691 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:50:53,040 WARN L191 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 249 DAG size of output: 111 [2019-11-15 23:50:53,040 INFO L567 ElimStorePlain]: treesize reduction 1164, result has 17.5 percent of original size [2019-11-15 23:50:53,041 INFO L496 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 1 dim-2 vars, End of recursive call: 12 dim-0 vars, and 1 xjuncts. [2019-11-15 23:50:53,041 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 13 variables, input treesize:257, output treesize:247 [2019-11-15 23:51:34,573 WARN L191 SmtUtils]: Spent 7.69 s on a formula simplification that was a NOOP. DAG size: 115 [2019-11-15 23:56:13,175 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-11-15 23:56:13,376 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:56:13,376 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:153) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:140) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:934) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:580) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) ... 21 more Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 42 more [2019-11-15 23:56:13,379 INFO L168 Benchmark]: Toolchain (without parser) took 502162.33 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 440.4 MB). Free memory was 944.7 MB in the beginning and 991.2 MB in the end (delta: -46.4 MB). Peak memory consumption was 394.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:56:13,379 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:56:13,380 INFO L168 Benchmark]: CACSL2BoogieTranslator took 282.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -184.4 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:56:13,380 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.39 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 23:56:13,380 INFO L168 Benchmark]: Boogie Preprocessor took 21.70 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 23:56:13,380 INFO L168 Benchmark]: RCFGBuilder took 264.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:56:13,381 INFO L168 Benchmark]: TraceAbstraction took 501557.49 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 302.0 MB). Free memory was 1.1 GB in the beginning and 991.2 MB in the end (delta: 114.0 MB). Peak memory consumption was 416.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:56:13,382 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 282.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -184.4 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.39 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 21.70 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 264.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 501557.49 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 302.0 MB). Free memory was 1.1 GB in the beginning and 991.2 MB in the end (delta: 114.0 MB). Peak memory consumption was 416.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-15 23:56:15,463 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:56:15,465 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:56:15,476 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:56:15,477 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:56:15,478 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:56:15,479 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:56:15,481 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:56:15,483 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:56:15,484 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:56:15,485 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:56:15,486 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:56:15,487 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:56:15,488 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:56:15,489 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:56:15,490 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:56:15,491 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:56:15,492 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:56:15,494 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:56:15,496 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:56:15,498 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:56:15,499 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:56:15,500 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:56:15,501 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:56:15,504 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:56:15,504 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:56:15,504 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:56:15,505 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:56:15,506 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:56:15,507 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:56:15,507 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:56:15,508 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:56:15,509 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:56:15,509 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:56:15,511 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:56:15,511 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:56:15,512 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:56:15,512 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:56:15,512 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:56:15,513 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:56:15,514 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:56:15,515 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-15 23:56:15,530 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:56:15,531 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:56:15,532 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:56:15,532 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:56:15,533 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:56:15,533 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:56:15,533 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:56:15,533 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:56:15,534 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:56:15,534 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:56:15,534 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:56:15,535 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:56:15,535 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 23:56:15,535 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 23:56:15,535 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:56:15,536 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:56:15,536 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:56:15,536 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:56:15,536 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:56:15,537 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:56:15,537 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:56:15,537 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:56:15,537 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:56:15,538 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:56:15,538 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:56:15,538 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:56:15,538 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 23:56:15,539 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 23:56:15,539 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:56:15,539 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 23:56:15,540 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_8d962864-afd4-4f9d-9d56-442a31728383/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 -> 13fdc940912285336197da9ffc7154669004c425 [2019-11-15 23:56:15,574 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:56:15,585 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:56:15,593 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:56:15,594 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:56:15,595 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:56:15,596 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/bin/uautomizer/../../sv-benchmarks/c/array-fpi/s1if.c [2019-11-15 23:56:15,663 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/bin/uautomizer/data/314e17386/4fe6f8e55ab74a82b0e8e9175c484319/FLAGd313fd714 [2019-11-15 23:56:16,107 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:56:16,108 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/sv-benchmarks/c/array-fpi/s1if.c [2019-11-15 23:56:16,114 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/bin/uautomizer/data/314e17386/4fe6f8e55ab74a82b0e8e9175c484319/FLAGd313fd714 [2019-11-15 23:56:16,492 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/bin/uautomizer/data/314e17386/4fe6f8e55ab74a82b0e8e9175c484319 [2019-11-15 23:56:16,497 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:56:16,498 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:56:16,499 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:56:16,499 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:56:16,503 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:56:16,504 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:56:16" (1/1) ... [2019-11-15 23:56:16,507 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4704ae57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:16, skipping insertion in model container [2019-11-15 23:56:16,507 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:56:16" (1/1) ... [2019-11-15 23:56:16,515 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:56:16,537 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:56:16,771 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:56:16,785 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:56:16,810 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:56:16,895 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:56:16,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:16 WrapperNode [2019-11-15 23:56:16,896 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:56:16,897 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:56:16,897 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:56:16,898 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:56:16,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:16" (1/1) ... [2019-11-15 23:56:16,918 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:16" (1/1) ... [2019-11-15 23:56:16,938 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:56:16,939 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:56:16,939 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:56:16,939 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:56:16,946 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:16" (1/1) ... [2019-11-15 23:56:16,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:16" (1/1) ... [2019-11-15 23:56:16,949 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:16" (1/1) ... [2019-11-15 23:56:16,949 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:16" (1/1) ... [2019-11-15 23:56:16,957 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:16" (1/1) ... [2019-11-15 23:56:16,962 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:16" (1/1) ... [2019-11-15 23:56:16,965 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:16" (1/1) ... [2019-11-15 23:56:16,968 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:56:16,968 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:56:16,968 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:56:16,969 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:56:16,969 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/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 23:56:17,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:56:17,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 23:56:17,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 23:56:17,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:56:17,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:56:17,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:56:17,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 23:56:17,291 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:56:17,291 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 23:56:17,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:56:17 BoogieIcfgContainer [2019-11-15 23:56:17,292 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:56:17,293 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:56:17,293 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:56:17,296 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:56:17,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:56:16" (1/3) ... [2019-11-15 23:56:17,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15ea216b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:56:17, skipping insertion in model container [2019-11-15 23:56:17,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:16" (2/3) ... [2019-11-15 23:56:17,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15ea216b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:56:17, skipping insertion in model container [2019-11-15 23:56:17,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:56:17" (3/3) ... [2019-11-15 23:56:17,300 INFO L109 eAbstractionObserver]: Analyzing ICFG s1if.c [2019-11-15 23:56:17,309 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:56:17,315 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:56:17,325 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:56:17,346 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:56:17,346 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:56:17,347 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:56:17,347 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:56:17,347 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:56:17,347 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:56:17,347 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:56:17,347 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:56:17,359 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-11-15 23:56:17,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-15 23:56:17,366 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:17,366 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:17,368 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:17,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:17,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1476218026, now seen corresponding path program 1 times [2019-11-15 23:56:17,384 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:56:17,385 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1739585134] [2019-11-15 23:56:17,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/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 23:56:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:17,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-15 23:56:17,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:56:17,495 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 23:56:17,496 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:56:17,499 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 23:56:17,500 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1739585134] [2019-11-15 23:56:17,500 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:17,501 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-15 23:56:17,501 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464843522] [2019-11-15 23:56:17,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-15 23:56:17,505 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:56:17,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 23:56:17,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 23:56:17,516 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2019-11-15 23:56:17,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:17,531 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2019-11-15 23:56:17,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 23:56:17,533 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-11-15 23:56:17,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:17,541 INFO L225 Difference]: With dead ends: 29 [2019-11-15 23:56:17,541 INFO L226 Difference]: Without dead ends: 13 [2019-11-15 23:56:17,544 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 23:56:17,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-11-15 23:56:17,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-11-15 23:56:17,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-15 23:56:17,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-11-15 23:56:17,576 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 9 [2019-11-15 23:56:17,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:17,576 INFO L462 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-11-15 23:56:17,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-15 23:56:17,576 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2019-11-15 23:56:17,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-15 23:56:17,577 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:17,577 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:17,777 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:56:17,778 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:17,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:17,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1304115419, now seen corresponding path program 1 times [2019-11-15 23:56:17,778 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:56:17,779 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [468241787] [2019-11-15 23:56:17,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/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 23:56:17,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:17,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:56:17,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:56:17,923 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 23:56:17,924 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:56:17,940 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 23:56:17,940 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [468241787] [2019-11-15 23:56:17,941 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:17,941 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 23:56:17,941 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384374137] [2019-11-15 23:56:17,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:17,943 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:56:17,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:17,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:17,944 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 4 states. [2019-11-15 23:56:18,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:18,042 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2019-11-15 23:56:18,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:18,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-15 23:56:18,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:18,044 INFO L225 Difference]: With dead ends: 23 [2019-11-15 23:56:18,045 INFO L226 Difference]: Without dead ends: 15 [2019-11-15 23:56:18,046 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:18,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-11-15 23:56:18,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-11-15 23:56:18,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-15 23:56:18,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-11-15 23:56:18,050 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 9 [2019-11-15 23:56:18,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:18,051 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-11-15 23:56:18,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:18,051 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-11-15 23:56:18,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-15 23:56:18,051 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:18,052 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:18,259 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:56:18,260 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:18,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:18,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1358761923, now seen corresponding path program 1 times [2019-11-15 23:56:18,261 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:56:18,261 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1555351240] [2019-11-15 23:56:18,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/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 23:56:18,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:18,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:56:18,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:56:18,449 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 23:56:18,450 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:56:18,580 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 23:56:18,580 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1555351240] [2019-11-15 23:56:18,581 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:56:18,581 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-15 23:56:18,581 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111040908] [2019-11-15 23:56:18,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:56:18,582 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:56:18,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:56:18,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:56:18,583 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 10 states. [2019-11-15 23:56:18,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:18,977 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2019-11-15 23:56:18,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:56:18,978 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2019-11-15 23:56:18,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:18,979 INFO L225 Difference]: With dead ends: 39 [2019-11-15 23:56:18,979 INFO L226 Difference]: Without dead ends: 32 [2019-11-15 23:56:18,980 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:56:18,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-15 23:56:18,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 22. [2019-11-15 23:56:18,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-15 23:56:18,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-11-15 23:56:18,991 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 11 [2019-11-15 23:56:18,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:18,992 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-11-15 23:56:18,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:56:18,992 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-11-15 23:56:18,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-15 23:56:18,993 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:18,993 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:19,203 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:56:19,204 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:19,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:19,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1565637502, now seen corresponding path program 1 times [2019-11-15 23:56:19,206 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:56:19,206 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1416931232] [2019-11-15 23:56:19,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/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 23:56:19,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:19,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 23:56:19,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:56:19,351 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 23:56:19,353 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:56:19,377 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:56:19,386 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 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 23:56:19,386 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:56:19,409 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:56:19,409 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 23:56:19,410 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2019-11-15 23:56:19,457 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 23:56:19,458 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:56:19,493 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:56:19,494 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:56:19,494 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2019-11-15 23:56:19,725 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:56:19,725 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 49 [2019-11-15 23:56:19,727 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:56:19,810 INFO L567 ElimStorePlain]: treesize reduction 16, result has 71.4 percent of original size [2019-11-15 23:56:19,812 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 23:56:19,812 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:63, output treesize:40 [2019-11-15 23:56:19,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:19,924 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 23:56:19,924 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:56:20,980 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 23:56:20,980 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1416931232] [2019-11-15 23:56:20,981 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:56:20,981 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-11-15 23:56:20,981 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071572260] [2019-11-15 23:56:20,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 23:56:20,982 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:56:20,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 23:56:20,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:56:20,983 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 16 states. [2019-11-15 23:56:23,332 WARN L191 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 37 DAG size of output: 23 [2019-11-15 23:56:25,498 WARN L191 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2019-11-15 23:56:25,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:25,872 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-11-15 23:56:25,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 23:56:25,890 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 14 [2019-11-15 23:56:25,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:25,891 INFO L225 Difference]: With dead ends: 31 [2019-11-15 23:56:25,891 INFO L226 Difference]: Without dead ends: 18 [2019-11-15 23:56:25,892 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2019-11-15 23:56:25,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-11-15 23:56:25,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-11-15 23:56:25,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-15 23:56:25,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-11-15 23:56:25,896 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 14 [2019-11-15 23:56:25,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:25,897 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-11-15 23:56:25,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 23:56:25,897 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-11-15 23:56:25,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-15 23:56:25,898 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:25,898 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:26,103 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:56:26,103 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:26,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:26,104 INFO L82 PathProgramCache]: Analyzing trace with hash -472130976, now seen corresponding path program 2 times [2019-11-15 23:56:26,104 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:56:26,104 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1945363229] [2019-11-15 23:56:26,105 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:56:26,188 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 23:56:26,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:56:26,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 23:56:26,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:56:26,319 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:56:26,319 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:56:26,541 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:56:26,541 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1945363229] [2019-11-15 23:56:26,541 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:56:26,541 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-11-15 23:56:26,542 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024184562] [2019-11-15 23:56:26,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 23:56:26,542 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:56:26,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 23:56:26,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:56:26,543 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 16 states. [2019-11-15 23:56:26,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:26,934 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2019-11-15 23:56:26,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 23:56:26,950 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-11-15 23:56:26,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:26,951 INFO L225 Difference]: With dead ends: 42 [2019-11-15 23:56:26,952 INFO L226 Difference]: Without dead ends: 35 [2019-11-15 23:56:26,952 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2019-11-15 23:56:26,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-15 23:56:26,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2019-11-15 23:56:26,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-15 23:56:26,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2019-11-15 23:56:26,968 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 16 [2019-11-15 23:56:26,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:26,969 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-11-15 23:56:26,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 23:56:26,969 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2019-11-15 23:56:26,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 23:56:26,979 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:26,979 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:27,179 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:56:27,180 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:27,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:27,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1991965825, now seen corresponding path program 3 times [2019-11-15 23:56:27,181 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:56:27,181 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [174537843] [2019-11-15 23:56:27,181 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/bin/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:56:27,283 ERROR L273 tionRefinementEngine]: Caught known exception: Array theory solver does not yet support write-chains connecting two different constant arrays [2019-11-15 23:56:27,283 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1912829365] [2019-11-15 23:56:27,284 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d962864-afd4-4f9d-9d56-442a31728383/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 23:56:27,359 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-15 23:56:27,359 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:56:27,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-15 23:56:27,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:56:27,406 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 23:56:27,407 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:56:27,428 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:56:27,439 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 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 23:56:27,439 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:56:27,485 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:56:27,486 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 23:56:27,486 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2019-11-15 23:56:27,512 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 23:56:27,513 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:56:27,569 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:56:27,569 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:56:27,569 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2019-11-15 23:56:27,649 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:56:27,649 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 56 [2019-11-15 23:56:27,650 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:56:27,705 INFO L567 ElimStorePlain]: treesize reduction 28, result has 59.4 percent of original size [2019-11-15 23:56:27,706 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:56:27,706 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:41 [2019-11-15 23:56:27,957 INFO L341 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2019-11-15 23:56:27,958 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 77 [2019-11-15 23:56:27,959 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:56:28,038 INFO L567 ElimStorePlain]: treesize reduction 34, result has 60.5 percent of original size [2019-11-15 23:56:28,039 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 23:56:28,039 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:73, output treesize:52 [2019-11-15 23:56:28,296 INFO L341 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2019-11-15 23:56:28,297 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 77 [2019-11-15 23:56:28,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:56:28,388 INFO L567 ElimStorePlain]: treesize reduction 16, result has 75.8 percent of original size [2019-11-15 23:56:28,389 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 23:56:28,389 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:73, output treesize:50 [2019-11-15 23:56:28,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:28,568 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:56:28,568 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:56:34,471 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:56:34,472 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [174537843] [2019-11-15 23:56:34,672 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:56:34,673 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: Do not try to interpolate when trace is feasible at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:328) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-15 23:56:34,677 INFO L168 Benchmark]: Toolchain (without parser) took 18178.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 190.8 MB). Free memory was 951.0 MB in the beginning and 1.0 GB in the end (delta: -90.4 MB). Peak memory consumption was 100.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:56:34,677 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:56:34,678 INFO L168 Benchmark]: CACSL2BoogieTranslator took 397.62 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -164.9 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:56:34,679 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:56:34,679 INFO L168 Benchmark]: Boogie Preprocessor took 29.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:56:34,680 INFO L168 Benchmark]: RCFGBuilder took 324.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:56:34,680 INFO L168 Benchmark]: TraceAbstraction took 17382.09 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.1 MB). Peak memory consumption was 117.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:56:34,684 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 397.62 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -164.9 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 324.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17382.09 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.1 MB). Peak memory consumption was 117.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: Do not try to interpolate when trace is feasible de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: Do not try to interpolate when trace is feasible : de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:328) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...