./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops/insertion_sort-1.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_69a7431c-a629-4141-88bf-f035d31638de/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_69a7431c-a629-4141-88bf-f035d31638de/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_69a7431c-a629-4141-88bf-f035d31638de/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_69a7431c-a629-4141-88bf-f035d31638de/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops/insertion_sort-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_69a7431c-a629-4141-88bf-f035d31638de/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_69a7431c-a629-4141-88bf-f035d31638de/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 5e4c5ca624cdf20709f1f0e007d5ebfc90b8f799 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:40:04,553 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:40:04,555 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:40:04,568 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:40:04,569 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:40:04,570 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:40:04,572 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:40:04,574 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:40:04,577 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:40:04,578 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:40:04,579 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:40:04,581 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:40:04,582 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:40:04,583 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:40:04,584 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:40:04,586 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:40:04,587 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:40:04,588 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:40:04,591 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:40:04,594 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:40:04,596 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:40:04,597 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:40:04,599 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:40:04,600 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:40:04,603 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:40:04,604 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:40:04,604 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:40:04,605 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:40:04,606 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:40:04,607 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:40:04,607 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:40:04,608 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:40:04,609 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:40:04,610 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:40:04,611 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:40:04,612 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:40:04,613 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:40:04,613 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:40:04,613 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:40:04,614 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:40:04,615 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:40:04,616 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_69a7431c-a629-4141-88bf-f035d31638de/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 22:40:04,633 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:40:04,634 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:40:04,635 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:40:04,636 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:40:04,636 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:40:04,636 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:40:04,637 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:40:04,637 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:40:04,637 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:40:04,638 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:40:04,638 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:40:04,638 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:40:04,639 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:40:04,639 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:40:04,639 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:40:04,640 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:40:04,640 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:40:04,640 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:40:04,641 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:40:04,641 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:40:04,641 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:40:04,641 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:40:04,642 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:40:04,642 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:40:04,642 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:40:04,643 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:40:04,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:40:04,643 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:40:04,644 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_69a7431c-a629-4141-88bf-f035d31638de/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 -> 5e4c5ca624cdf20709f1f0e007d5ebfc90b8f799 [2019-11-15 22:40:04,699 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:40:04,713 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:40:04,717 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:40:04,720 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:40:04,721 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:40:04,723 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_69a7431c-a629-4141-88bf-f035d31638de/bin/uautomizer/../../sv-benchmarks/c/loops/insertion_sort-1.c [2019-11-15 22:40:04,812 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_69a7431c-a629-4141-88bf-f035d31638de/bin/uautomizer/data/fe886d8a7/7c054c117e964ac8bf53bfb7a6bc9eb0/FLAG8d20d42b9 [2019-11-15 22:40:05,208 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:40:05,209 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_69a7431c-a629-4141-88bf-f035d31638de/sv-benchmarks/c/loops/insertion_sort-1.c [2019-11-15 22:40:05,216 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_69a7431c-a629-4141-88bf-f035d31638de/bin/uautomizer/data/fe886d8a7/7c054c117e964ac8bf53bfb7a6bc9eb0/FLAG8d20d42b9 [2019-11-15 22:40:05,586 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_69a7431c-a629-4141-88bf-f035d31638de/bin/uautomizer/data/fe886d8a7/7c054c117e964ac8bf53bfb7a6bc9eb0 [2019-11-15 22:40:05,589 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:40:05,591 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:40:05,592 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:40:05,592 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:40:05,596 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:40:05,597 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:40:05" (1/1) ... [2019-11-15 22:40:05,600 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b38c14d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:40:05, skipping insertion in model container [2019-11-15 22:40:05,601 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:40:05" (1/1) ... [2019-11-15 22:40:05,609 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:40:05,631 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:40:05,881 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:40:05,886 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:40:06,049 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:40:06,069 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:40:06,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:40:06 WrapperNode [2019-11-15 22:40:06,070 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:40:06,071 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:40:06,071 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:40:06,071 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:40:06,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:40:06" (1/1) ... [2019-11-15 22:40:06,095 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:40:06" (1/1) ... [2019-11-15 22:40:06,126 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:40:06,128 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:40:06,128 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:40:06,129 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:40:06,138 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:40:06" (1/1) ... [2019-11-15 22:40:06,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:40:06" (1/1) ... [2019-11-15 22:40:06,140 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:40:06" (1/1) ... [2019-11-15 22:40:06,140 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:40:06" (1/1) ... [2019-11-15 22:40:06,146 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:40:06" (1/1) ... [2019-11-15 22:40:06,151 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:40:06" (1/1) ... [2019-11-15 22:40:06,153 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:40:06" (1/1) ... [2019-11-15 22:40:06,156 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:40:06,156 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:40:06,157 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:40:06,157 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:40:06,158 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:40:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69a7431c-a629-4141-88bf-f035d31638de/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 22:40:06,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:40:06,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:40:06,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:40:06,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:40:06,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:40:06,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:40:06,500 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:40:06,500 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-15 22:40:06,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:40:06 BoogieIcfgContainer [2019-11-15 22:40:06,502 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:40:06,503 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:40:06,503 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:40:06,507 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:40:06,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:40:05" (1/3) ... [2019-11-15 22:40:06,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f697458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:40:06, skipping insertion in model container [2019-11-15 22:40:06,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:40:06" (2/3) ... [2019-11-15 22:40:06,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f697458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:40:06, skipping insertion in model container [2019-11-15 22:40:06,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:40:06" (3/3) ... [2019-11-15 22:40:06,510 INFO L109 eAbstractionObserver]: Analyzing ICFG insertion_sort-1.c [2019-11-15 22:40:06,521 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:40:06,533 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:40:06,563 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:40:06,624 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:40:06,624 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:40:06,624 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:40:06,624 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:40:06,625 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:40:06,625 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:40:06,625 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:40:06,625 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:40:06,642 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-11-15 22:40:06,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-15 22:40:06,649 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:06,650 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:06,652 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:06,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:06,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1808788559, now seen corresponding path program 1 times [2019-11-15 22:40:06,668 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:06,668 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629049108] [2019-11-15 22:40:06,668 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:06,669 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:06,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:06,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:07,054 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 22:40:07,055 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629049108] [2019-11-15 22:40:07,055 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:40:07,056 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:40:07,056 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543528430] [2019-11-15 22:40:07,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:40:07,061 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:07,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:40:07,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:40:07,075 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2019-11-15 22:40:07,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:07,186 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2019-11-15 22:40:07,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:40:07,189 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-11-15 22:40:07,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:07,199 INFO L225 Difference]: With dead ends: 54 [2019-11-15 22:40:07,199 INFO L226 Difference]: Without dead ends: 25 [2019-11-15 22:40:07,203 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:40:07,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-15 22:40:07,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 18. [2019-11-15 22:40:07,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-15 22:40:07,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2019-11-15 22:40:07,247 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 7 [2019-11-15 22:40:07,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:07,249 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2019-11-15 22:40:07,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:40:07,250 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2019-11-15 22:40:07,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-15 22:40:07,251 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:07,251 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:07,251 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:07,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:07,252 INFO L82 PathProgramCache]: Analyzing trace with hash 616714882, now seen corresponding path program 1 times [2019-11-15 22:40:07,252 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:07,253 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015933403] [2019-11-15 22:40:07,253 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:07,253 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:07,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:07,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:08,126 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 22:40:08,127 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015933403] [2019-11-15 22:40:08,127 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796459450] [2019-11-15 22:40:08,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69a7431c-a629-4141-88bf-f035d31638de/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 22:40:08,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:08,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-15 22:40:08,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:40:08,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:40:08,539 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:08,544 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 28 treesize of output 27 [2019-11-15 22:40:08,546 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:40:08,562 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:40:08,563 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 22:40:08,563 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2019-11-15 22:40:08,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:40:08,637 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 22:40:08,638 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:40:08,638 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2019-11-15 22:40:08,638 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455450193] [2019-11-15 22:40:08,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-15 22:40:08,640 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:08,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-15 22:40:08,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-11-15 22:40:08,641 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 17 states. [2019-11-15 22:40:09,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:09,475 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2019-11-15 22:40:09,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 22:40:09,476 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 13 [2019-11-15 22:40:09,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:09,478 INFO L225 Difference]: With dead ends: 73 [2019-11-15 22:40:09,478 INFO L226 Difference]: Without dead ends: 58 [2019-11-15 22:40:09,481 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2019-11-15 22:40:09,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-15 22:40:09,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 30. [2019-11-15 22:40:09,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-15 22:40:09,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2019-11-15 22:40:09,502 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 13 [2019-11-15 22:40:09,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:09,503 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2019-11-15 22:40:09,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-15 22:40:09,503 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2019-11-15 22:40:09,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-15 22:40:09,504 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:09,504 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:09,705 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:40:09,705 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:09,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:09,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1296773252, now seen corresponding path program 1 times [2019-11-15 22:40:09,706 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:09,706 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885343057] [2019-11-15 22:40:09,707 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:09,707 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:09,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:09,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:09,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:40:09,751 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885343057] [2019-11-15 22:40:09,751 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:40:09,751 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:40:09,751 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317688171] [2019-11-15 22:40:09,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:40:09,752 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:09,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:40:09,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:40:09,753 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand 5 states. [2019-11-15 22:40:09,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:09,841 INFO L93 Difference]: Finished difference Result 83 states and 106 transitions. [2019-11-15 22:40:09,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:40:09,842 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-15 22:40:09,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:09,845 INFO L225 Difference]: With dead ends: 83 [2019-11-15 22:40:09,845 INFO L226 Difference]: Without dead ends: 56 [2019-11-15 22:40:09,846 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:40:09,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-15 22:40:09,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 34. [2019-11-15 22:40:09,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-15 22:40:09,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2019-11-15 22:40:09,863 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 13 [2019-11-15 22:40:09,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:09,865 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2019-11-15 22:40:09,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:40:09,865 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2019-11-15 22:40:09,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-15 22:40:09,866 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:09,867 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:09,867 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:09,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:09,868 INFO L82 PathProgramCache]: Analyzing trace with hash -2022971496, now seen corresponding path program 1 times [2019-11-15 22:40:09,868 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:09,869 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318930547] [2019-11-15 22:40:09,869 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:09,870 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:09,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:09,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:10,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:40:10,099 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318930547] [2019-11-15 22:40:10,099 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370739284] [2019-11-15 22:40:10,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69a7431c-a629-4141-88bf-f035d31638de/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 22:40:10,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:10,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 22:40:10,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:40:10,236 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:40:10,236 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:40:10,236 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-11-15 22:40:10,237 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866307264] [2019-11-15 22:40:10,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:40:10,237 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:10,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:40:10,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:40:10,238 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand 9 states. [2019-11-15 22:40:10,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:10,369 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2019-11-15 22:40:10,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:40:10,369 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-11-15 22:40:10,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:10,370 INFO L225 Difference]: With dead ends: 60 [2019-11-15 22:40:10,371 INFO L226 Difference]: Without dead ends: 48 [2019-11-15 22:40:10,371 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:40:10,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-15 22:40:10,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 37. [2019-11-15 22:40:10,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-15 22:40:10,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2019-11-15 22:40:10,379 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 17 [2019-11-15 22:40:10,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:10,380 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2019-11-15 22:40:10,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:40:10,380 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2019-11-15 22:40:10,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 22:40:10,381 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:10,381 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:10,589 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:40:10,589 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:10,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:10,590 INFO L82 PathProgramCache]: Analyzing trace with hash 958971857, now seen corresponding path program 1 times [2019-11-15 22:40:10,590 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:10,590 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005268395] [2019-11-15 22:40:10,590 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:10,590 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:10,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:10,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:11,409 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:40:11,409 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005268395] [2019-11-15 22:40:11,410 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745893039] [2019-11-15 22:40:11,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69a7431c-a629-4141-88bf-f035d31638de/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 22:40:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:11,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-15 22:40:11,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:40:11,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:40:11,657 INFO L341 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2019-11-15 22:40:11,657 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 38 treesize of output 29 [2019-11-15 22:40:11,658 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:40:11,673 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:40:11,674 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:40:11,674 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2019-11-15 22:40:12,025 INFO L341 Elim1Store]: treesize reduction 17, result has 85.8 percent of original size [2019-11-15 22:40:12,026 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 123 [2019-11-15 22:40:12,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:40:12,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:40:12,029 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:40:12,084 INFO L567 ElimStorePlain]: treesize reduction 132, result has 21.9 percent of original size [2019-11-15 22:40:12,085 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 22:40:12,086 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:64, output treesize:29 [2019-11-15 22:40:12,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:40:12,222 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:40:12,222 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:40:12,222 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2019-11-15 22:40:12,223 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370619227] [2019-11-15 22:40:12,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-15 22:40:12,224 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:12,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-15 22:40:12,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2019-11-15 22:40:12,225 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 26 states. [2019-11-15 22:40:12,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:12,887 INFO L93 Difference]: Finished difference Result 78 states and 97 transitions. [2019-11-15 22:40:12,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 22:40:12,888 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 18 [2019-11-15 22:40:12,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:12,889 INFO L225 Difference]: With dead ends: 78 [2019-11-15 22:40:12,889 INFO L226 Difference]: Without dead ends: 43 [2019-11-15 22:40:12,891 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=186, Invalid=1004, Unknown=0, NotChecked=0, Total=1190 [2019-11-15 22:40:12,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-15 22:40:12,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2019-11-15 22:40:12,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-15 22:40:12,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-11-15 22:40:12,897 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 18 [2019-11-15 22:40:12,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:12,898 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-11-15 22:40:12,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-15 22:40:12,898 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2019-11-15 22:40:12,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 22:40:12,899 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:12,899 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:13,102 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:40:13,103 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:13,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:13,103 INFO L82 PathProgramCache]: Analyzing trace with hash 632161909, now seen corresponding path program 2 times [2019-11-15 22:40:13,103 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:13,103 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355232553] [2019-11-15 22:40:13,104 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:13,104 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:13,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:13,811 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:40:13,811 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355232553] [2019-11-15 22:40:13,811 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156104756] [2019-11-15 22:40:13,812 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69a7431c-a629-4141-88bf-f035d31638de/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 22:40:13,868 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:40:13,868 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:40:13,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-15 22:40:13,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:40:13,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:40:13,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:13,979 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 28 treesize of output 27 [2019-11-15 22:40:13,979 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:40:13,999 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:40:14,000 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:40:14,000 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2019-11-15 22:40:14,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:14,088 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:14,090 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:14,092 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:40:14,092 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 32 treesize of output 34 [2019-11-15 22:40:14,093 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:40:14,107 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:40:14,108 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 22:40:14,109 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:25 [2019-11-15 22:40:14,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:40:14,179 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:40:14,179 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:40:14,179 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2019-11-15 22:40:14,179 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621553252] [2019-11-15 22:40:14,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-15 22:40:14,180 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:14,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 22:40:14,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2019-11-15 22:40:14,181 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 18 states. [2019-11-15 22:40:15,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:15,037 INFO L93 Difference]: Finished difference Result 104 states and 127 transitions. [2019-11-15 22:40:15,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-15 22:40:15,042 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 19 [2019-11-15 22:40:15,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:15,044 INFO L225 Difference]: With dead ends: 104 [2019-11-15 22:40:15,044 INFO L226 Difference]: Without dead ends: 87 [2019-11-15 22:40:15,045 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 10 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=195, Invalid=797, Unknown=0, NotChecked=0, Total=992 [2019-11-15 22:40:15,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-15 22:40:15,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 47. [2019-11-15 22:40:15,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-15 22:40:15,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2019-11-15 22:40:15,059 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 19 [2019-11-15 22:40:15,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:15,059 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2019-11-15 22:40:15,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-15 22:40:15,059 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2019-11-15 22:40:15,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 22:40:15,060 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:15,060 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:15,260 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:40:15,261 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:15,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:15,261 INFO L82 PathProgramCache]: Analyzing trace with hash 44460555, now seen corresponding path program 2 times [2019-11-15 22:40:15,261 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:15,261 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097721404] [2019-11-15 22:40:15,262 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:15,262 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:15,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:15,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:15,566 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:40:15,566 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097721404] [2019-11-15 22:40:15,567 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326690379] [2019-11-15 22:40:15,567 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69a7431c-a629-4141-88bf-f035d31638de/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 22:40:15,624 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:40:15,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:40:15,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-15 22:40:15,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:40:15,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:40:15,798 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:15,799 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 22:40:15,799 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:40:15,808 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:40:15,808 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:40:15,809 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-15 22:40:15,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:40:16,011 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:40:16,012 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:40:16,012 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-11-15 22:40:16,012 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585093959] [2019-11-15 22:40:16,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-15 22:40:16,013 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:16,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-15 22:40:16,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2019-11-15 22:40:16,014 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 22 states. [2019-11-15 22:40:16,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:16,808 INFO L93 Difference]: Finished difference Result 122 states and 149 transitions. [2019-11-15 22:40:16,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 22:40:16,810 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 23 [2019-11-15 22:40:16,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:16,811 INFO L225 Difference]: With dead ends: 122 [2019-11-15 22:40:16,811 INFO L226 Difference]: Without dead ends: 105 [2019-11-15 22:40:16,812 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=211, Invalid=979, Unknown=0, NotChecked=0, Total=1190 [2019-11-15 22:40:16,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-15 22:40:16,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 64. [2019-11-15 22:40:16,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-15 22:40:16,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2019-11-15 22:40:16,823 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 23 [2019-11-15 22:40:16,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:16,823 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2019-11-15 22:40:16,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-15 22:40:16,824 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2019-11-15 22:40:16,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 22:40:16,825 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:16,825 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:17,029 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:40:17,029 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:17,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:17,030 INFO L82 PathProgramCache]: Analyzing trace with hash -55202372, now seen corresponding path program 1 times [2019-11-15 22:40:17,030 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:17,030 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823657320] [2019-11-15 22:40:17,031 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:17,031 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:17,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:17,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:17,388 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 22:40:17,388 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823657320] [2019-11-15 22:40:17,389 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16670657] [2019-11-15 22:40:17,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69a7431c-a629-4141-88bf-f035d31638de/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 22:40:17,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:17,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-15 22:40:17,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:40:17,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:40:17,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:17,658 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 32 treesize of output 31 [2019-11-15 22:40:17,659 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:40:17,675 INFO L567 ElimStorePlain]: treesize reduction 5, result has 86.1 percent of original size [2019-11-15 22:40:17,676 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:40:17,676 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:28 [2019-11-15 22:40:17,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:40:17,726 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:40:17,727 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:40:17,727 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2019-11-15 22:40:17,727 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849842818] [2019-11-15 22:40:17,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-15 22:40:17,727 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:17,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-15 22:40:17,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2019-11-15 22:40:17,728 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand 17 states. [2019-11-15 22:40:19,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:19,194 INFO L93 Difference]: Finished difference Result 169 states and 207 transitions. [2019-11-15 22:40:19,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-11-15 22:40:19,195 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2019-11-15 22:40:19,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:19,196 INFO L225 Difference]: With dead ends: 169 [2019-11-15 22:40:19,196 INFO L226 Difference]: Without dead ends: 152 [2019-11-15 22:40:19,198 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 771 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=437, Invalid=2215, Unknown=0, NotChecked=0, Total=2652 [2019-11-15 22:40:19,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-15 22:40:19,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 82. [2019-11-15 22:40:19,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-15 22:40:19,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 102 transitions. [2019-11-15 22:40:19,230 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 102 transitions. Word has length 24 [2019-11-15 22:40:19,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:19,231 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 102 transitions. [2019-11-15 22:40:19,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-15 22:40:19,231 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 102 transitions. [2019-11-15 22:40:19,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 22:40:19,233 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:19,233 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:19,446 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:40:19,446 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:19,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:19,447 INFO L82 PathProgramCache]: Analyzing trace with hash 624855998, now seen corresponding path program 2 times [2019-11-15 22:40:19,447 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:19,447 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026680705] [2019-11-15 22:40:19,447 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:19,448 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:19,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:19,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:19,502 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:40:19,503 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026680705] [2019-11-15 22:40:19,503 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818495380] [2019-11-15 22:40:19,503 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69a7431c-a629-4141-88bf-f035d31638de/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 22:40:19,563 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:40:19,563 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:40:19,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 22:40:19,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:40:19,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:40:19,570 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:40:19,570 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:40:19,570 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-11-15 22:40:19,571 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271980403] [2019-11-15 22:40:19,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:40:19,571 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:19,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:40:19,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:40:19,572 INFO L87 Difference]: Start difference. First operand 82 states and 102 transitions. Second operand 7 states. [2019-11-15 22:40:19,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:19,743 INFO L93 Difference]: Finished difference Result 164 states and 207 transitions. [2019-11-15 22:40:19,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:40:19,744 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-11-15 22:40:19,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:19,745 INFO L225 Difference]: With dead ends: 164 [2019-11-15 22:40:19,745 INFO L226 Difference]: Without dead ends: 128 [2019-11-15 22:40:19,746 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:40:19,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-15 22:40:19,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 93. [2019-11-15 22:40:19,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-15 22:40:19,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 116 transitions. [2019-11-15 22:40:19,770 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 116 transitions. Word has length 24 [2019-11-15 22:40:19,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:19,770 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 116 transitions. [2019-11-15 22:40:19,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:40:19,770 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 116 transitions. [2019-11-15 22:40:19,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 22:40:19,772 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:19,772 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:19,976 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:40:19,977 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:19,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:19,977 INFO L82 PathProgramCache]: Analyzing trace with hash 802880644, now seen corresponding path program 3 times [2019-11-15 22:40:19,977 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:19,978 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114285203] [2019-11-15 22:40:19,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:19,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:19,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:20,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:20,586 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:40:20,586 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114285203] [2019-11-15 22:40:20,587 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438934684] [2019-11-15 22:40:20,587 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69a7431c-a629-4141-88bf-f035d31638de/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 22:40:20,659 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-15 22:40:20,659 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:40:20,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-15 22:40:20,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:40:20,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:40:20,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:20,744 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 38 treesize of output 29 [2019-11-15 22:40:20,745 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:40:20,757 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:40:20,757 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:40:20,757 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2019-11-15 22:40:21,031 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:21,033 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:40:21,034 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:40:21,035 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 51 treesize of output 44 [2019-11-15 22:40:21,036 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:40:21,074 INFO L567 ElimStorePlain]: treesize reduction 12, result has 76.9 percent of original size [2019-11-15 22:40:21,075 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 22:40:21,075 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:65, output treesize:32 [2019-11-15 22:40:21,337 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:21,339 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:21,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:21,347 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:40:21,347 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 22:40:21,348 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:40:21,372 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:40:21,373 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 22:40:21,373 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:54, output treesize:35 [2019-11-15 22:40:21,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:40:21,486 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:40:21,487 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:40:21,488 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 25 [2019-11-15 22:40:21,488 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543350883] [2019-11-15 22:40:21,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-15 22:40:21,489 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:21,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-15 22:40:21,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2019-11-15 22:40:21,491 INFO L87 Difference]: Start difference. First operand 93 states and 116 transitions. Second operand 25 states. [2019-11-15 22:40:22,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:22,669 INFO L93 Difference]: Finished difference Result 140 states and 169 transitions. [2019-11-15 22:40:22,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-15 22:40:22,669 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2019-11-15 22:40:22,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:22,671 INFO L225 Difference]: With dead ends: 140 [2019-11-15 22:40:22,671 INFO L226 Difference]: Without dead ends: 138 [2019-11-15 22:40:22,672 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 10 SyntacticMatches, 7 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=241, Invalid=1399, Unknown=0, NotChecked=0, Total=1640 [2019-11-15 22:40:22,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-11-15 22:40:22,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 90. [2019-11-15 22:40:22,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-15 22:40:22,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 112 transitions. [2019-11-15 22:40:22,695 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 112 transitions. Word has length 24 [2019-11-15 22:40:22,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:22,695 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 112 transitions. [2019-11-15 22:40:22,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-15 22:40:22,696 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 112 transitions. [2019-11-15 22:40:22,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 22:40:22,702 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:22,702 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:22,907 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:40:22,907 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:22,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:22,908 INFO L82 PathProgramCache]: Analyzing trace with hash 519508641, now seen corresponding path program 3 times [2019-11-15 22:40:22,908 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:22,908 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889024207] [2019-11-15 22:40:22,908 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:22,908 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:22,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:22,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:23,086 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:40:23,086 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889024207] [2019-11-15 22:40:23,086 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953492007] [2019-11-15 22:40:23,087 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69a7431c-a629-4141-88bf-f035d31638de/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 22:40:23,180 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-15 22:40:23,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:40:23,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 22:40:23,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:40:23,275 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:40:23,275 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:40:23,275 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2019-11-15 22:40:23,276 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933861696] [2019-11-15 22:40:23,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 22:40:23,276 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:23,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 22:40:23,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:40:23,277 INFO L87 Difference]: Start difference. First operand 90 states and 112 transitions. Second operand 12 states. [2019-11-15 22:40:23,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:23,456 INFO L93 Difference]: Finished difference Result 169 states and 209 transitions. [2019-11-15 22:40:23,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:40:23,457 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2019-11-15 22:40:23,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:23,458 INFO L225 Difference]: With dead ends: 169 [2019-11-15 22:40:23,459 INFO L226 Difference]: Without dead ends: 153 [2019-11-15 22:40:23,459 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-11-15 22:40:23,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-15 22:40:23,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 110. [2019-11-15 22:40:23,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-15 22:40:23,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 136 transitions. [2019-11-15 22:40:23,484 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 136 transitions. Word has length 27 [2019-11-15 22:40:23,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:23,486 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 136 transitions. [2019-11-15 22:40:23,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 22:40:23,487 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 136 transitions. [2019-11-15 22:40:23,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 22:40:23,490 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:23,491 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:23,695 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:40:23,695 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:23,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:23,696 INFO L82 PathProgramCache]: Analyzing trace with hash 862655954, now seen corresponding path program 1 times [2019-11-15 22:40:23,696 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:23,696 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813287443] [2019-11-15 22:40:23,697 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:23,697 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:23,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:24,259 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:40:24,260 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813287443] [2019-11-15 22:40:24,260 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625948166] [2019-11-15 22:40:24,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69a7431c-a629-4141-88bf-f035d31638de/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 22:40:24,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:24,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-15 22:40:24,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:40:24,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:40:24,503 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:24,506 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 38 treesize of output 29 [2019-11-15 22:40:24,507 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:40:24,525 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:40:24,525 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:40:24,526 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:41 [2019-11-15 22:40:24,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:24,711 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:40:24,712 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:40:24,713 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 43 treesize of output 39 [2019-11-15 22:40:24,713 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:40:24,750 INFO L567 ElimStorePlain]: treesize reduction 12, result has 71.4 percent of original size [2019-11-15 22:40:24,750 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 22:40:24,750 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:21 [2019-11-15 22:40:24,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:40:24,924 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:40:24,924 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:40:24,924 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 29 [2019-11-15 22:40:24,924 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197853432] [2019-11-15 22:40:24,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-15 22:40:24,925 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:24,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-15 22:40:24,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=716, Unknown=0, NotChecked=0, Total=812 [2019-11-15 22:40:24,925 INFO L87 Difference]: Start difference. First operand 110 states and 136 transitions. Second operand 29 states. [2019-11-15 22:40:25,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:25,742 INFO L93 Difference]: Finished difference Result 136 states and 167 transitions. [2019-11-15 22:40:25,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 22:40:25,743 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2019-11-15 22:40:25,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:25,744 INFO L225 Difference]: With dead ends: 136 [2019-11-15 22:40:25,745 INFO L226 Difference]: Without dead ends: 127 [2019-11-15 22:40:25,746 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=198, Invalid=1362, Unknown=0, NotChecked=0, Total=1560 [2019-11-15 22:40:25,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-15 22:40:25,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 114. [2019-11-15 22:40:25,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-15 22:40:25,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 141 transitions. [2019-11-15 22:40:25,760 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 141 transitions. Word has length 28 [2019-11-15 22:40:25,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:25,760 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 141 transitions. [2019-11-15 22:40:25,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-15 22:40:25,761 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 141 transitions. [2019-11-15 22:40:25,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 22:40:25,762 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:25,762 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:25,974 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:40:25,975 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:25,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:25,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1474562622, now seen corresponding path program 4 times [2019-11-15 22:40:25,975 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:25,975 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691631940] [2019-11-15 22:40:25,976 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:25,976 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:25,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:25,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:26,314 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:40:26,315 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691631940] [2019-11-15 22:40:26,316 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814993269] [2019-11-15 22:40:26,316 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69a7431c-a629-4141-88bf-f035d31638de/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 22:40:26,397 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 22:40:26,397 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:40:26,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-15 22:40:26,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:40:26,458 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 22:40:26,458 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:40:26,471 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:40:26,471 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:40:26,472 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2019-11-15 22:40:26,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:40:26,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:26,603 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 28 treesize of output 27 [2019-11-15 22:40:26,604 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:40:26,618 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:40:26,618 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:40:26,618 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2019-11-15 22:40:26,701 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:26,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:26,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:26,705 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:40:26,705 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 32 treesize of output 34 [2019-11-15 22:40:26,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:40:26,714 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:40:26,715 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 22:40:26,715 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2019-11-15 22:40:26,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:40:26,862 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:40:26,862 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:40:26,862 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 28 [2019-11-15 22:40:26,862 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817710924] [2019-11-15 22:40:26,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-15 22:40:26,863 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:26,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-15 22:40:26,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=653, Unknown=0, NotChecked=0, Total=756 [2019-11-15 22:40:26,864 INFO L87 Difference]: Start difference. First operand 114 states and 141 transitions. Second operand 28 states. [2019-11-15 22:40:27,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:27,613 INFO L93 Difference]: Finished difference Result 191 states and 239 transitions. [2019-11-15 22:40:27,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 22:40:27,613 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 29 [2019-11-15 22:40:27,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:27,615 INFO L225 Difference]: With dead ends: 191 [2019-11-15 22:40:27,615 INFO L226 Difference]: Without dead ends: 145 [2019-11-15 22:40:27,616 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=246, Invalid=1314, Unknown=0, NotChecked=0, Total=1560 [2019-11-15 22:40:27,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-11-15 22:40:27,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 121. [2019-11-15 22:40:27,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-15 22:40:27,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 148 transitions. [2019-11-15 22:40:27,632 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 148 transitions. Word has length 29 [2019-11-15 22:40:27,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:27,632 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 148 transitions. [2019-11-15 22:40:27,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-15 22:40:27,632 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 148 transitions. [2019-11-15 22:40:27,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 22:40:27,633 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:27,633 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:27,837 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:40:27,837 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:27,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:27,838 INFO L82 PathProgramCache]: Analyzing trace with hash 219109591, now seen corresponding path program 4 times [2019-11-15 22:40:27,838 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:27,838 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901508264] [2019-11-15 22:40:27,838 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:27,838 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:27,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:27,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:28,307 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:40:28,308 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901508264] [2019-11-15 22:40:28,308 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932675727] [2019-11-15 22:40:28,308 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69a7431c-a629-4141-88bf-f035d31638de/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 22:40:28,386 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 22:40:28,386 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:40:28,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-15 22:40:28,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:40:28,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:40:28,545 INFO L341 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2019-11-15 22:40:28,545 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 38 treesize of output 29 [2019-11-15 22:40:28,546 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:40:28,555 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:40:28,556 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:40:28,556 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2019-11-15 22:40:29,253 INFO L341 Elim1Store]: treesize reduction 17, result has 85.8 percent of original size [2019-11-15 22:40:29,254 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 123 [2019-11-15 22:40:29,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:40:29,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:40:29,257 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:40:29,321 INFO L567 ElimStorePlain]: treesize reduction 128, result has 22.4 percent of original size [2019-11-15 22:40:29,322 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 22:40:29,323 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:61, output treesize:29 [2019-11-15 22:40:29,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:40:29,495 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 22:40:29,496 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:40:29,496 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2019-11-15 22:40:29,497 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49465008] [2019-11-15 22:40:29,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-15 22:40:29,498 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:29,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-15 22:40:29,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2019-11-15 22:40:29,499 INFO L87 Difference]: Start difference. First operand 121 states and 148 transitions. Second operand 25 states. [2019-11-15 22:40:34,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:34,812 INFO L93 Difference]: Finished difference Result 265 states and 330 transitions. [2019-11-15 22:40:34,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-11-15 22:40:34,813 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 29 [2019-11-15 22:40:34,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:34,815 INFO L225 Difference]: With dead ends: 265 [2019-11-15 22:40:34,815 INFO L226 Difference]: Without dead ends: 197 [2019-11-15 22:40:34,818 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2031 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=738, Invalid=5582, Unknown=0, NotChecked=0, Total=6320 [2019-11-15 22:40:34,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-11-15 22:40:34,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 141. [2019-11-15 22:40:34,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-15 22:40:34,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 170 transitions. [2019-11-15 22:40:34,834 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 170 transitions. Word has length 29 [2019-11-15 22:40:34,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:34,835 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 170 transitions. [2019-11-15 22:40:34,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-15 22:40:34,835 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 170 transitions. [2019-11-15 22:40:34,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 22:40:34,836 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:34,836 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:35,041 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:40:35,041 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:35,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:35,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1586454183, now seen corresponding path program 1 times [2019-11-15 22:40:35,042 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:35,042 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779340069] [2019-11-15 22:40:35,042 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:35,042 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:35,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:35,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:35,850 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:40:35,850 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779340069] [2019-11-15 22:40:35,850 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581918010] [2019-11-15 22:40:35,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69a7431c-a629-4141-88bf-f035d31638de/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 22:40:35,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:35,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-15 22:40:35,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:40:36,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:40:36,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:36,099 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 28 treesize of output 27 [2019-11-15 22:40:36,099 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:40:36,109 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:40:36,109 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:40:36,109 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2019-11-15 22:40:36,194 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 0 case distinctions, treesize of input 37 treesize of output 30 [2019-11-15 22:40:36,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:36,197 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:36,198 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:36,203 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:36,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:36,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:36,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:36,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:36,209 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 29 [2019-11-15 22:40:36,210 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:40:36,214 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:40:36,215 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:40:36,222 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:40:36,223 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:40:36,223 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:17 [2019-11-15 22:40:36,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:36,274 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:36,275 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:36,276 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:40:36,276 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 30 treesize of output 32 [2019-11-15 22:40:36,277 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:40:36,285 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:40:36,285 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 22:40:36,286 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:17 [2019-11-15 22:40:36,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:40:36,329 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 22:40:36,329 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:40:36,329 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 24 [2019-11-15 22:40:36,330 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819596187] [2019-11-15 22:40:36,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-15 22:40:36,330 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:36,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-15 22:40:36,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2019-11-15 22:40:36,331 INFO L87 Difference]: Start difference. First operand 141 states and 170 transitions. Second operand 24 states. [2019-11-15 22:40:37,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:37,414 INFO L93 Difference]: Finished difference Result 316 states and 386 transitions. [2019-11-15 22:40:37,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-15 22:40:37,414 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 30 [2019-11-15 22:40:37,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:37,416 INFO L225 Difference]: With dead ends: 316 [2019-11-15 22:40:37,416 INFO L226 Difference]: Without dead ends: 267 [2019-11-15 22:40:37,417 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 16 SyntacticMatches, 10 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=333, Invalid=1647, Unknown=0, NotChecked=0, Total=1980 [2019-11-15 22:40:37,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-11-15 22:40:37,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 170. [2019-11-15 22:40:37,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-11-15 22:40:37,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 209 transitions. [2019-11-15 22:40:37,437 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 209 transitions. Word has length 30 [2019-11-15 22:40:37,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:37,438 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 209 transitions. [2019-11-15 22:40:37,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-15 22:40:37,438 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 209 transitions. [2019-11-15 22:40:37,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 22:40:37,439 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:37,439 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:37,640 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:40:37,640 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:37,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:37,640 INFO L82 PathProgramCache]: Analyzing trace with hash -828731857, now seen corresponding path program 2 times [2019-11-15 22:40:37,640 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:37,640 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629923481] [2019-11-15 22:40:37,640 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:37,641 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:37,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:37,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:38,205 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:40:38,205 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629923481] [2019-11-15 22:40:38,206 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561589777] [2019-11-15 22:40:38,206 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69a7431c-a629-4141-88bf-f035d31638de/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 22:40:38,311 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:40:38,312 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:40:38,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-15 22:40:38,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:40:38,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:40:38,552 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:38,553 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 28 treesize of output 27 [2019-11-15 22:40:38,554 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:40:38,577 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:40:38,578 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 22:40:38,578 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2019-11-15 22:40:38,683 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:38,685 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:38,686 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:38,687 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:40:38,687 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 30 treesize of output 32 [2019-11-15 22:40:38,688 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:40:38,701 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:40:38,701 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 22:40:38,702 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:17 [2019-11-15 22:40:38,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:40:38,748 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:40:38,748 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:40:38,748 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 24 [2019-11-15 22:40:38,748 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898059316] [2019-11-15 22:40:38,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-15 22:40:38,749 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:38,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-15 22:40:38,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2019-11-15 22:40:38,749 INFO L87 Difference]: Start difference. First operand 170 states and 209 transitions. Second operand 24 states. [2019-11-15 22:40:40,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:40,003 INFO L93 Difference]: Finished difference Result 315 states and 389 transitions. [2019-11-15 22:40:40,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-11-15 22:40:40,003 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 30 [2019-11-15 22:40:40,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:40,005 INFO L225 Difference]: With dead ends: 315 [2019-11-15 22:40:40,005 INFO L226 Difference]: Without dead ends: 266 [2019-11-15 22:40:40,007 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=399, Invalid=1857, Unknown=0, NotChecked=0, Total=2256 [2019-11-15 22:40:40,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-15 22:40:40,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 187. [2019-11-15 22:40:40,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-11-15 22:40:40,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 232 transitions. [2019-11-15 22:40:40,030 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 232 transitions. Word has length 30 [2019-11-15 22:40:40,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:40,031 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 232 transitions. [2019-11-15 22:40:40,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-15 22:40:40,031 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 232 transitions. [2019-11-15 22:40:40,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 22:40:40,032 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:40,032 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:40,236 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:40:40,236 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:40,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:40,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1597202772, now seen corresponding path program 5 times [2019-11-15 22:40:40,237 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:40,237 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712281486] [2019-11-15 22:40:40,238 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:40,238 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:40,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:40,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:40,677 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:40:40,678 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712281486] [2019-11-15 22:40:40,678 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472209628] [2019-11-15 22:40:40,678 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69a7431c-a629-4141-88bf-f035d31638de/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 22:40:40,791 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-11-15 22:40:40,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:40:40,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-15 22:40:40,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:40:40,880 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 22:40:40,881 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:40:40,887 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:40:40,888 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:40:40,888 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2019-11-15 22:40:40,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:40:40,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:41,001 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 22:40:41,001 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:40:41,011 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:40:41,012 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:40:41,012 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-15 22:40:41,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:40:41,222 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:40:41,223 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:40:41,223 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2019-11-15 22:40:41,223 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208175779] [2019-11-15 22:40:41,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-15 22:40:41,223 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:41,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-15 22:40:41,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2019-11-15 22:40:41,224 INFO L87 Difference]: Start difference. First operand 187 states and 232 transitions. Second operand 28 states. [2019-11-15 22:40:42,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:42,027 INFO L93 Difference]: Finished difference Result 377 states and 464 transitions. [2019-11-15 22:40:42,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-15 22:40:42,027 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 33 [2019-11-15 22:40:42,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:42,029 INFO L225 Difference]: With dead ends: 377 [2019-11-15 22:40:42,029 INFO L226 Difference]: Without dead ends: 324 [2019-11-15 22:40:42,030 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=234, Invalid=1488, Unknown=0, NotChecked=0, Total=1722 [2019-11-15 22:40:42,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-11-15 22:40:42,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 221. [2019-11-15 22:40:42,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-11-15 22:40:42,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 274 transitions. [2019-11-15 22:40:42,056 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 274 transitions. Word has length 33 [2019-11-15 22:40:42,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:42,056 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 274 transitions. [2019-11-15 22:40:42,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-15 22:40:42,056 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 274 transitions. [2019-11-15 22:40:42,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 22:40:42,057 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:42,057 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:42,261 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:40:42,261 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:42,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:42,261 INFO L82 PathProgramCache]: Analyzing trace with hash -629949587, now seen corresponding path program 1 times [2019-11-15 22:40:42,261 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:42,262 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799450744] [2019-11-15 22:40:42,262 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:42,262 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:42,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:42,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:43,346 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:40:43,347 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799450744] [2019-11-15 22:40:43,347 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475717960] [2019-11-15 22:40:43,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69a7431c-a629-4141-88bf-f035d31638de/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 22:40:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:43,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 41 conjunts are in the unsatisfiable core [2019-11-15 22:40:43,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:40:43,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:40:43,535 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:43,535 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 28 treesize of output 27 [2019-11-15 22:40:43,536 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:40:43,544 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:40:43,545 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:40:43,545 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2019-11-15 22:40:43,683 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:43,685 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:43,686 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:43,687 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:40:43,688 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 40 treesize of output 34 [2019-11-15 22:40:43,688 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:40:43,701 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:40:43,701 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:40:43,702 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2019-11-15 22:40:43,968 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:43,969 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:40:43,970 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:43,972 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:43,974 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:43,975 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:43,977 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:40:43,979 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:40:43,980 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 63 [2019-11-15 22:40:43,980 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:40:44,019 INFO L567 ElimStorePlain]: treesize reduction 40, result has 56.0 percent of original size [2019-11-15 22:40:44,020 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 22:40:44,020 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:80, output treesize:51 [2019-11-15 22:40:44,338 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:44,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:44,348 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:44,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:44,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:44,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:44,353 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:40:44,389 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:40:44,389 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 53 treesize of output 128 [2019-11-15 22:40:44,390 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:40:44,454 INFO L567 ElimStorePlain]: treesize reduction 67, result has 55.6 percent of original size [2019-11-15 22:40:44,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:40:44,456 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 22:40:44,457 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:70, output treesize:72 [2019-11-15 22:40:44,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:40:44,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:40:44,776 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:40:44,776 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:40:44,776 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 36 [2019-11-15 22:40:44,777 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702907685] [2019-11-15 22:40:44,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-11-15 22:40:44,777 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:44,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-11-15 22:40:44,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1137, Unknown=0, NotChecked=0, Total=1260 [2019-11-15 22:40:44,778 INFO L87 Difference]: Start difference. First operand 221 states and 274 transitions. Second operand 36 states. [2019-11-15 22:40:46,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:46,866 INFO L93 Difference]: Finished difference Result 262 states and 319 transitions. [2019-11-15 22:40:46,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-11-15 22:40:46,869 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 33 [2019-11-15 22:40:46,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:46,871 INFO L225 Difference]: With dead ends: 262 [2019-11-15 22:40:46,871 INFO L226 Difference]: Without dead ends: 253 [2019-11-15 22:40:46,873 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 17 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 916 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=329, Invalid=2751, Unknown=0, NotChecked=0, Total=3080 [2019-11-15 22:40:46,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-11-15 22:40:46,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 234. [2019-11-15 22:40:46,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-15 22:40:46,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 288 transitions. [2019-11-15 22:40:46,898 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 288 transitions. Word has length 33 [2019-11-15 22:40:46,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:46,899 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 288 transitions. [2019-11-15 22:40:46,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-11-15 22:40:46,899 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 288 transitions. [2019-11-15 22:40:46,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-15 22:40:46,900 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:46,900 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:47,104 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:40:47,105 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:47,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:47,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1109632707, now seen corresponding path program 1 times [2019-11-15 22:40:47,105 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:47,105 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823220664] [2019-11-15 22:40:47,105 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:47,106 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:47,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:47,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:47,330 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:40:47,331 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823220664] [2019-11-15 22:40:47,331 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263857617] [2019-11-15 22:40:47,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69a7431c-a629-4141-88bf-f035d31638de/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 22:40:47,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:47,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 37 conjunts are in the unsatisfiable core [2019-11-15 22:40:47,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:40:47,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:40:47,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:40:47,624 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:47,625 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 28 treesize of output 27 [2019-11-15 22:40:47,625 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:40:47,635 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:40:47,635 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 22:40:47,636 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2019-11-15 22:40:47,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:40:47,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:40:47,823 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:40:47,823 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:40:47,823 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 28 [2019-11-15 22:40:47,824 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968516434] [2019-11-15 22:40:47,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-15 22:40:47,824 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:47,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-15 22:40:47,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=646, Unknown=0, NotChecked=0, Total=756 [2019-11-15 22:40:47,825 INFO L87 Difference]: Start difference. First operand 234 states and 288 transitions. Second operand 28 states. [2019-11-15 22:40:49,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:49,711 INFO L93 Difference]: Finished difference Result 636 states and 799 transitions. [2019-11-15 22:40:49,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-11-15 22:40:49,712 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 34 [2019-11-15 22:40:49,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:49,716 INFO L225 Difference]: With dead ends: 636 [2019-11-15 22:40:49,716 INFO L226 Difference]: Without dead ends: 566 [2019-11-15 22:40:49,718 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1570 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=767, Invalid=4063, Unknown=0, NotChecked=0, Total=4830 [2019-11-15 22:40:49,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2019-11-15 22:40:49,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 265. [2019-11-15 22:40:49,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-11-15 22:40:49,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 327 transitions. [2019-11-15 22:40:49,758 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 327 transitions. Word has length 34 [2019-11-15 22:40:49,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:49,759 INFO L462 AbstractCegarLoop]: Abstraction has 265 states and 327 transitions. [2019-11-15 22:40:49,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-15 22:40:49,759 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 327 transitions. [2019-11-15 22:40:49,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-15 22:40:49,760 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:49,760 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:49,966 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:40:49,966 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:49,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:49,966 INFO L82 PathProgramCache]: Analyzing trace with hash -835418939, now seen corresponding path program 2 times [2019-11-15 22:40:49,967 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:49,967 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118679545] [2019-11-15 22:40:49,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:49,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:49,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:50,433 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:40:50,433 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118679545] [2019-11-15 22:40:50,434 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344898748] [2019-11-15 22:40:50,434 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69a7431c-a629-4141-88bf-f035d31638de/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 22:40:50,550 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:40:50,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:40:50,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-15 22:40:50,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:40:50,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:40:50,799 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:50,800 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 38 treesize of output 29 [2019-11-15 22:40:50,801 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:40:50,818 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:40:50,818 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:40:50,818 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:46 [2019-11-15 22:40:51,078 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:51,080 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:40:51,081 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:40:51,082 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 50 treesize of output 44 [2019-11-15 22:40:51,082 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:40:51,111 INFO L567 ElimStorePlain]: treesize reduction 12, result has 76.9 percent of original size [2019-11-15 22:40:51,112 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 22:40:51,112 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:32 [2019-11-15 22:40:51,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:51,274 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:51,275 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:51,276 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:40:51,276 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 31 treesize of output 33 [2019-11-15 22:40:51,277 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:40:51,288 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:40:51,289 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:40:51,289 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:21 [2019-11-15 22:40:51,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:40:51,550 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:40:51,551 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:40:51,551 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 33 [2019-11-15 22:40:51,551 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089055293] [2019-11-15 22:40:51,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-15 22:40:51,552 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:51,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-15 22:40:51,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=921, Unknown=0, NotChecked=0, Total=1056 [2019-11-15 22:40:51,553 INFO L87 Difference]: Start difference. First operand 265 states and 327 transitions. Second operand 33 states. [2019-11-15 22:40:52,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:52,576 INFO L93 Difference]: Finished difference Result 296 states and 361 transitions. [2019-11-15 22:40:52,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-15 22:40:52,577 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 34 [2019-11-15 22:40:52,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:52,579 INFO L225 Difference]: With dead ends: 296 [2019-11-15 22:40:52,579 INFO L226 Difference]: Without dead ends: 294 [2019-11-15 22:40:52,580 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=229, Invalid=1577, Unknown=0, NotChecked=0, Total=1806 [2019-11-15 22:40:52,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-11-15 22:40:52,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 262. [2019-11-15 22:40:52,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-11-15 22:40:52,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 324 transitions. [2019-11-15 22:40:52,616 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 324 transitions. Word has length 34 [2019-11-15 22:40:52,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:52,616 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 324 transitions. [2019-11-15 22:40:52,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-15 22:40:52,617 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 324 transitions. [2019-11-15 22:40:52,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 22:40:52,618 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:52,618 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:52,822 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:40:52,823 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:52,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:52,823 INFO L82 PathProgramCache]: Analyzing trace with hash -703579894, now seen corresponding path program 5 times [2019-11-15 22:40:52,823 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:52,824 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466418232] [2019-11-15 22:40:52,824 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:52,824 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:52,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:52,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:53,689 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:40:53,690 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466418232] [2019-11-15 22:40:53,690 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865310105] [2019-11-15 22:40:53,690 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69a7431c-a629-4141-88bf-f035d31638de/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 22:40:53,803 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-15 22:40:53,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:40:53,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-15 22:40:53,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:40:53,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:40:53,992 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:53,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 38 treesize of output 29 [2019-11-15 22:40:53,993 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:40:54,006 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:40:54,007 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:40:54,007 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2019-11-15 22:40:54,114 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:54,115 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:40:54,116 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 72 treesize of output 43 [2019-11-15 22:40:54,116 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:40:54,138 INFO L567 ElimStorePlain]: treesize reduction 7, result has 86.0 percent of original size [2019-11-15 22:40:54,139 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:40:54,139 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:85, output treesize:40 [2019-11-15 22:40:54,213 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:54,215 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:54,216 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:54,217 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:40:54,218 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 32 treesize of output 34 [2019-11-15 22:40:54,218 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:40:54,229 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:40:54,230 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 22:40:54,230 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:19 [2019-11-15 22:40:54,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:40:54,295 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 29 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:40:54,295 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:40:54,295 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 28 [2019-11-15 22:40:54,296 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115246444] [2019-11-15 22:40:54,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-15 22:40:54,296 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:54,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-15 22:40:54,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2019-11-15 22:40:54,297 INFO L87 Difference]: Start difference. First operand 262 states and 324 transitions. Second operand 28 states. [2019-11-15 22:40:56,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:56,253 INFO L93 Difference]: Finished difference Result 546 states and 676 transitions. [2019-11-15 22:40:56,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-11-15 22:40:56,257 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 35 [2019-11-15 22:40:56,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:56,259 INFO L225 Difference]: With dead ends: 546 [2019-11-15 22:40:56,259 INFO L226 Difference]: Without dead ends: 407 [2019-11-15 22:40:56,260 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1203 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=672, Invalid=3360, Unknown=0, NotChecked=0, Total=4032 [2019-11-15 22:40:56,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2019-11-15 22:40:56,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 243. [2019-11-15 22:40:56,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-11-15 22:40:56,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 297 transitions. [2019-11-15 22:40:56,298 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 297 transitions. Word has length 35 [2019-11-15 22:40:56,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:56,298 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 297 transitions. [2019-11-15 22:40:56,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-15 22:40:56,299 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 297 transitions. [2019-11-15 22:40:56,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 22:40:56,300 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:56,300 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:40:56,503 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:40:56,504 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:40:56,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:40:56,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1456121544, now seen corresponding path program 1 times [2019-11-15 22:40:56,504 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:40:56,504 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053084356] [2019-11-15 22:40:56,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:56,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:40:56,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:40:56,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:57,465 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 1 proven. 41 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 22:40:57,466 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053084356] [2019-11-15 22:40:57,466 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754896322] [2019-11-15 22:40:57,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69a7431c-a629-4141-88bf-f035d31638de/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 22:40:57,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:40:57,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-15 22:40:57,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:40:57,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:40:57,661 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:57,662 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 38 treesize of output 29 [2019-11-15 22:40:57,662 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:40:57,673 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:40:57,673 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:40:57,673 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:50 [2019-11-15 22:40:57,876 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:57,877 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:40:57,880 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:40:57,881 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 59 treesize of output 50 [2019-11-15 22:40:57,881 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:40:57,909 INFO L567 ElimStorePlain]: treesize reduction 12, result has 81.3 percent of original size [2019-11-15 22:40:57,910 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 22:40:57,910 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:79, output treesize:44 [2019-11-15 22:40:58,003 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 0 case distinctions, treesize of input 34 treesize of output 27 [2019-11-15 22:40:58,006 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:58,007 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:58,008 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:58,009 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:58,015 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:58,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:58,017 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:58,018 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 31 [2019-11-15 22:40:58,019 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:40:58,023 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:40:58,024 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:40:58,030 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:40:58,030 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:40:58,030 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:19 [2019-11-15 22:40:58,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:58,092 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:58,094 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:40:58,095 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:40:58,095 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 32 treesize of output 34 [2019-11-15 22:40:58,095 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:40:58,104 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:40:58,104 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 22:40:58,104 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:19 [2019-11-15 22:40:58,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:40:58,158 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 39 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 22:40:58,159 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:40:58,159 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 27 [2019-11-15 22:40:58,159 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26965447] [2019-11-15 22:40:58,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-15 22:40:58,159 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:40:58,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-15 22:40:58,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2019-11-15 22:40:58,160 INFO L87 Difference]: Start difference. First operand 243 states and 297 transitions. Second operand 27 states. [2019-11-15 22:40:59,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:40:59,938 INFO L93 Difference]: Finished difference Result 421 states and 507 transitions. [2019-11-15 22:40:59,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-11-15 22:40:59,940 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 35 [2019-11-15 22:40:59,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:40:59,942 INFO L225 Difference]: With dead ends: 421 [2019-11-15 22:40:59,942 INFO L226 Difference]: Without dead ends: 371 [2019-11-15 22:40:59,944 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 18 SyntacticMatches, 11 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1066 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=446, Invalid=2746, Unknown=0, NotChecked=0, Total=3192 [2019-11-15 22:40:59,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-11-15 22:40:59,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 276. [2019-11-15 22:40:59,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-11-15 22:40:59,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 341 transitions. [2019-11-15 22:40:59,986 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 341 transitions. Word has length 35 [2019-11-15 22:40:59,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:40:59,986 INFO L462 AbstractCegarLoop]: Abstraction has 276 states and 341 transitions. [2019-11-15 22:40:59,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-15 22:40:59,987 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 341 transitions. [2019-11-15 22:40:59,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 22:40:59,988 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:40:59,988 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:41:00,192 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:41:00,192 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:41:00,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:00,192 INFO L82 PathProgramCache]: Analyzing trace with hash -2003194092, now seen corresponding path program 2 times [2019-11-15 22:41:00,192 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:00,192 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943021617] [2019-11-15 22:41:00,192 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:00,193 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:00,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:00,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:01,312 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:01,313 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943021617] [2019-11-15 22:41:01,313 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276039918] [2019-11-15 22:41:01,313 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69a7431c-a629-4141-88bf-f035d31638de/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 22:41:01,432 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:41:01,432 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:41:01,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-15 22:41:01,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:41:01,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:41:01,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:01,630 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 28 treesize of output 27 [2019-11-15 22:41:01,631 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:41:01,647 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:41:01,647 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 22:41:01,648 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2019-11-15 22:41:01,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:01,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:01,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:01,736 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:41:01,736 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 32 treesize of output 34 [2019-11-15 22:41:01,736 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:41:01,750 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:41:01,750 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:41:01,751 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:25 [2019-11-15 22:41:01,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:01,818 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:01,818 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:01,819 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:41:01,820 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 29 treesize of output 31 [2019-11-15 22:41:01,820 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:41:01,828 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:41:01,829 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:41:01,829 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:20 [2019-11-15 22:41:01,945 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:01,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:01,948 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:01,949 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:41:01,949 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 27 treesize of output 29 [2019-11-15 22:41:01,950 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:41:01,959 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:41:01,959 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:41:01,959 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:17 [2019-11-15 22:41:01,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:41:02,015 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:02,015 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:41:02,015 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 30 [2019-11-15 22:41:02,015 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156285868] [2019-11-15 22:41:02,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-15 22:41:02,016 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:41:02,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-15 22:41:02,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=749, Unknown=0, NotChecked=0, Total=870 [2019-11-15 22:41:02,017 INFO L87 Difference]: Start difference. First operand 276 states and 341 transitions. Second operand 30 states. [2019-11-15 22:41:04,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:41:04,729 INFO L93 Difference]: Finished difference Result 563 states and 688 transitions. [2019-11-15 22:41:04,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-11-15 22:41:04,730 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 36 [2019-11-15 22:41:04,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:41:04,732 INFO L225 Difference]: With dead ends: 563 [2019-11-15 22:41:04,733 INFO L226 Difference]: Without dead ends: 501 [2019-11-15 22:41:04,735 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1565 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=732, Invalid=4380, Unknown=0, NotChecked=0, Total=5112 [2019-11-15 22:41:04,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2019-11-15 22:41:04,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 323. [2019-11-15 22:41:04,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-11-15 22:41:04,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 400 transitions. [2019-11-15 22:41:04,784 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 400 transitions. Word has length 36 [2019-11-15 22:41:04,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:41:04,784 INFO L462 AbstractCegarLoop]: Abstraction has 323 states and 400 transitions. [2019-11-15 22:41:04,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-15 22:41:04,784 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 400 transitions. [2019-11-15 22:41:04,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-15 22:41:04,785 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:41:04,786 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2019-11-15 22:41:04,990 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:41:04,990 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:41:04,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:04,990 INFO L82 PathProgramCache]: Analyzing trace with hash -231391894, now seen corresponding path program 6 times [2019-11-15 22:41:04,990 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:04,991 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826617920] [2019-11-15 22:41:04,991 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:04,991 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:04,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:05,193 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:05,194 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826617920] [2019-11-15 22:41:05,194 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310972474] [2019-11-15 22:41:05,194 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69a7431c-a629-4141-88bf-f035d31638de/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 22:41:05,329 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-11-15 22:41:05,330 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:41:05,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-15 22:41:05,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:41:05,492 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:05,492 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:41:05,492 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2019-11-15 22:41:05,493 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656472334] [2019-11-15 22:41:05,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 22:41:05,494 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:41:05,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 22:41:05,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-11-15 22:41:05,494 INFO L87 Difference]: Start difference. First operand 323 states and 400 transitions. Second operand 14 states. [2019-11-15 22:41:06,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:41:06,033 INFO L93 Difference]: Finished difference Result 511 states and 627 transitions. [2019-11-15 22:41:06,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 22:41:06,034 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2019-11-15 22:41:06,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:41:06,037 INFO L225 Difference]: With dead ends: 511 [2019-11-15 22:41:06,037 INFO L226 Difference]: Without dead ends: 491 [2019-11-15 22:41:06,038 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2019-11-15 22:41:06,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2019-11-15 22:41:06,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 367. [2019-11-15 22:41:06,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-11-15 22:41:06,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 455 transitions. [2019-11-15 22:41:06,098 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 455 transitions. Word has length 37 [2019-11-15 22:41:06,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:41:06,098 INFO L462 AbstractCegarLoop]: Abstraction has 367 states and 455 transitions. [2019-11-15 22:41:06,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 22:41:06,099 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 455 transitions. [2019-11-15 22:41:06,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-15 22:41:06,100 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:41:06,100 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:41:06,304 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:41:06,305 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:41:06,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:06,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1650333907, now seen corresponding path program 2 times [2019-11-15 22:41:06,305 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:06,305 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059253591] [2019-11-15 22:41:06,305 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:06,305 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:06,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:06,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:06,672 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:06,672 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059253591] [2019-11-15 22:41:06,672 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923832012] [2019-11-15 22:41:06,672 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69a7431c-a629-4141-88bf-f035d31638de/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 22:41:06,800 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:41:06,800 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:41:06,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-15 22:41:06,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:41:07,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:07,022 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 26 treesize of output 25 [2019-11-15 22:41:07,023 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:41:07,035 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:41:07,035 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 22:41:07,036 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:28 [2019-11-15 22:41:07,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:41:07,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:41:07,406 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:07,406 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:41:07,406 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2019-11-15 22:41:07,407 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321064080] [2019-11-15 22:41:07,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-15 22:41:07,407 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:41:07,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-15 22:41:07,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2019-11-15 22:41:07,408 INFO L87 Difference]: Start difference. First operand 367 states and 455 transitions. Second operand 26 states. [2019-11-15 22:41:08,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:41:08,791 INFO L93 Difference]: Finished difference Result 433 states and 527 transitions. [2019-11-15 22:41:08,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-15 22:41:08,792 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 38 [2019-11-15 22:41:08,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:41:08,794 INFO L225 Difference]: With dead ends: 433 [2019-11-15 22:41:08,794 INFO L226 Difference]: Without dead ends: 420 [2019-11-15 22:41:08,795 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=266, Invalid=1714, Unknown=0, NotChecked=0, Total=1980 [2019-11-15 22:41:08,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2019-11-15 22:41:08,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 359. [2019-11-15 22:41:08,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-11-15 22:41:08,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 443 transitions. [2019-11-15 22:41:08,845 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 443 transitions. Word has length 38 [2019-11-15 22:41:08,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:41:08,846 INFO L462 AbstractCegarLoop]: Abstraction has 359 states and 443 transitions. [2019-11-15 22:41:08,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-15 22:41:08,846 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 443 transitions. [2019-11-15 22:41:08,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-15 22:41:08,847 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:41:08,848 INFO L380 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:41:09,051 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:41:09,051 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:41:09,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:09,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1013617860, now seen corresponding path program 2 times [2019-11-15 22:41:09,051 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:09,052 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946114993] [2019-11-15 22:41:09,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:09,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:09,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:09,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:10,521 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:10,525 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946114993] [2019-11-15 22:41:10,525 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491540084] [2019-11-15 22:41:10,525 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69a7431c-a629-4141-88bf-f035d31638de/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 22:41:10,631 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:41:10,631 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:41:10,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-15 22:41:10,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:41:10,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:41:10,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:10,721 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 38 treesize of output 29 [2019-11-15 22:41:10,721 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:41:10,733 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:41:10,733 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:41:10,734 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2019-11-15 22:41:10,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:10,916 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:41:10,916 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 51 treesize of output 32 [2019-11-15 22:41:10,917 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:41:10,930 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:41:10,931 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:41:10,931 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:32 [2019-11-15 22:41:11,045 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:11,046 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:11,047 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:11,048 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:41:11,049 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 42 treesize of output 36 [2019-11-15 22:41:11,049 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:41:11,059 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:41:11,059 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:41:11,059 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:51, output treesize:48 [2019-11-15 22:41:11,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:11,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:11,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:11,291 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:41:11,292 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:11,293 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:41:11,294 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:41:11,295 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 65 [2019-11-15 22:41:11,295 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:41:11,325 INFO L567 ElimStorePlain]: treesize reduction 40, result has 58.8 percent of original size [2019-11-15 22:41:11,325 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 22:41:11,325 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:83, output treesize:57 [2019-11-15 22:41:11,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:11,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:11,554 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:11,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:11,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:11,572 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:41:11,573 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 94 [2019-11-15 22:41:11,573 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:41:11,618 INFO L567 ElimStorePlain]: treesize reduction 25, result has 77.5 percent of original size [2019-11-15 22:41:11,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:41:11,620 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 22:41:11,620 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:74 [2019-11-15 22:41:11,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:41:11,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:41:11,860 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:11,860 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:41:11,861 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 40 [2019-11-15 22:41:11,861 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051856922] [2019-11-15 22:41:11,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-11-15 22:41:11,862 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:41:11,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-11-15 22:41:11,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1417, Unknown=0, NotChecked=0, Total=1560 [2019-11-15 22:41:11,863 INFO L87 Difference]: Start difference. First operand 359 states and 443 transitions. Second operand 40 states. [2019-11-15 22:41:13,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:41:13,345 INFO L93 Difference]: Finished difference Result 383 states and 468 transitions. [2019-11-15 22:41:13,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-15 22:41:13,346 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 38 [2019-11-15 22:41:13,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:41:13,347 INFO L225 Difference]: With dead ends: 383 [2019-11-15 22:41:13,347 INFO L226 Difference]: Without dead ends: 374 [2019-11-15 22:41:13,348 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 18 SyntacticMatches, 9 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 925 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=252, Invalid=2504, Unknown=0, NotChecked=0, Total=2756 [2019-11-15 22:41:13,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-11-15 22:41:13,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 346. [2019-11-15 22:41:13,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-11-15 22:41:13,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 428 transitions. [2019-11-15 22:41:13,402 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 428 transitions. Word has length 38 [2019-11-15 22:41:13,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:41:13,403 INFO L462 AbstractCegarLoop]: Abstraction has 346 states and 428 transitions. [2019-11-15 22:41:13,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-11-15 22:41:13,403 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 428 transitions. [2019-11-15 22:41:13,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 22:41:13,404 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:41:13,404 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-15 22:41:13,607 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:41:13,608 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:41:13,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:13,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1518821945, now seen corresponding path program 7 times [2019-11-15 22:41:13,608 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:13,608 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526938475] [2019-11-15 22:41:13,608 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:13,609 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:13,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:13,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:13,981 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:13,982 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526938475] [2019-11-15 22:41:13,982 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589551906] [2019-11-15 22:41:13,982 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69a7431c-a629-4141-88bf-f035d31638de/bin/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:41:14,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:14,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-15 22:41:14,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:41:14,256 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 22:41:14,256 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:41:14,264 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:41:14,264 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:41:14,265 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2019-11-15 22:41:14,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:41:14,456 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:14,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 28 treesize of output 27 [2019-11-15 22:41:14,457 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:41:14,465 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:41:14,466 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:41:14,466 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2019-11-15 22:41:14,563 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:14,564 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:14,566 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:14,567 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:41:14,567 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 32 treesize of output 34 [2019-11-15 22:41:14,567 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:41:14,575 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:41:14,575 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 22:41:14,576 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2019-11-15 22:41:14,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:41:14,769 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:14,769 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:41:14,769 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 32 [2019-11-15 22:41:14,769 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533891549] [2019-11-15 22:41:14,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-15 22:41:14,770 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:41:14,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-15 22:41:14,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2019-11-15 22:41:14,771 INFO L87 Difference]: Start difference. First operand 346 states and 428 transitions. Second operand 32 states. [2019-11-15 22:41:15,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:41:15,873 INFO L93 Difference]: Finished difference Result 490 states and 602 transitions. [2019-11-15 22:41:15,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-15 22:41:15,874 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 39 [2019-11-15 22:41:15,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:41:15,876 INFO L225 Difference]: With dead ends: 490 [2019-11-15 22:41:15,876 INFO L226 Difference]: Without dead ends: 440 [2019-11-15 22:41:15,877 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=395, Invalid=2467, Unknown=0, NotChecked=0, Total=2862 [2019-11-15 22:41:15,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2019-11-15 22:41:15,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 381. [2019-11-15 22:41:15,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-11-15 22:41:15,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 472 transitions. [2019-11-15 22:41:15,931 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 472 transitions. Word has length 39 [2019-11-15 22:41:15,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:41:15,931 INFO L462 AbstractCegarLoop]: Abstraction has 381 states and 472 transitions. [2019-11-15 22:41:15,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-15 22:41:15,931 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 472 transitions. [2019-11-15 22:41:15,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 22:41:15,933 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:41:15,933 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:41:16,135 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:41:16,135 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:41:16,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:16,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1558500832, now seen corresponding path program 1 times [2019-11-15 22:41:16,135 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:16,135 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554335860] [2019-11-15 22:41:16,135 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:16,136 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:16,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:16,403 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:16,403 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554335860] [2019-11-15 22:41:16,404 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016498966] [2019-11-15 22:41:16,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69a7431c-a629-4141-88bf-f035d31638de/bin/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:41:16,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:16,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-15 22:41:16,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:41:16,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:41:16,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:16,748 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 38 treesize of output 29 [2019-11-15 22:41:16,748 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:41:16,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:41:16,758 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:41:16,758 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:44 [2019-11-15 22:41:16,997 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:41:16,999 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:17,000 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:41:17,001 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 51 treesize of output 44 [2019-11-15 22:41:17,001 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:41:17,027 INFO L567 ElimStorePlain]: treesize reduction 14, result has 74.5 percent of original size [2019-11-15 22:41:17,028 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:41:17,028 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:68, output treesize:38 [2019-11-15 22:41:17,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:41:17,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:41:17,385 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 7 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:17,386 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:41:17,386 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 33 [2019-11-15 22:41:17,386 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257278969] [2019-11-15 22:41:17,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-15 22:41:17,387 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:41:17,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-15 22:41:17,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=935, Unknown=0, NotChecked=0, Total=1056 [2019-11-15 22:41:17,387 INFO L87 Difference]: Start difference. First operand 381 states and 472 transitions. Second operand 33 states. [2019-11-15 22:41:20,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:41:20,530 INFO L93 Difference]: Finished difference Result 727 states and 890 transitions. [2019-11-15 22:41:20,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-11-15 22:41:20,530 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 39 [2019-11-15 22:41:20,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:41:20,533 INFO L225 Difference]: With dead ends: 727 [2019-11-15 22:41:20,533 INFO L226 Difference]: Without dead ends: 635 [2019-11-15 22:41:20,534 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3260 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=954, Invalid=8358, Unknown=0, NotChecked=0, Total=9312 [2019-11-15 22:41:20,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-11-15 22:41:20,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 435. [2019-11-15 22:41:20,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-11-15 22:41:20,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 542 transitions. [2019-11-15 22:41:20,613 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 542 transitions. Word has length 39 [2019-11-15 22:41:20,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:41:20,613 INFO L462 AbstractCegarLoop]: Abstraction has 435 states and 542 transitions. [2019-11-15 22:41:20,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-15 22:41:20,614 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 542 transitions. [2019-11-15 22:41:20,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 22:41:20,615 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:41:20,615 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:41:20,819 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:41:20,819 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:41:20,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:20,819 INFO L82 PathProgramCache]: Analyzing trace with hash 2060667424, now seen corresponding path program 3 times [2019-11-15 22:41:20,819 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:20,820 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740716445] [2019-11-15 22:41:20,820 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:20,820 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:20,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:20,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:21,886 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:21,886 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740716445] [2019-11-15 22:41:21,886 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423819157] [2019-11-15 22:41:21,887 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69a7431c-a629-4141-88bf-f035d31638de/bin/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:41:22,015 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-11-15 22:41:22,015 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:41:22,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 43 conjunts are in the unsatisfiable core [2019-11-15 22:41:22,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:41:22,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:41:22,035 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:22,036 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 28 treesize of output 27 [2019-11-15 22:41:22,036 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:41:22,044 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:41:22,045 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:41:22,045 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2019-11-15 22:41:22,076 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 0 case distinctions, treesize of input 57 treesize of output 46 [2019-11-15 22:41:22,078 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:22,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:22,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:22,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:22,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:22,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:22,088 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:22,088 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-11-15 22:41:22,089 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:41:22,102 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:41:22,102 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:41:22,116 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:41:22,116 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:41:22,117 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:66, output treesize:46 [2019-11-15 22:41:22,334 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:22,337 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:22,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:22,341 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:22,346 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:22,393 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:41:22,394 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 61 treesize of output 184 [2019-11-15 22:41:22,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:41:22,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:41:22,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:41:22,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:41:22,396 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:41:22,477 INFO L567 ElimStorePlain]: treesize reduction 330, result has 20.1 percent of original size [2019-11-15 22:41:22,477 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:41:22,478 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:73, output treesize:82 [2019-11-15 22:41:22,790 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:22,790 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:41:22,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:22,793 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:22,794 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:41:22,795 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 52 [2019-11-15 22:41:22,795 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:41:22,826 INFO L567 ElimStorePlain]: treesize reduction 12, result has 78.9 percent of original size [2019-11-15 22:41:22,826 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 22:41:22,827 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:70, output treesize:38 [2019-11-15 22:41:22,931 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:22,932 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:22,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:22,935 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:41:22,935 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 32 treesize of output 34 [2019-11-15 22:41:22,935 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:41:22,943 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:41:22,944 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 22:41:22,944 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2019-11-15 22:41:23,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:41:23,070 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:23,070 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:41:23,070 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 34 [2019-11-15 22:41:23,070 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094504642] [2019-11-15 22:41:23,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-15 22:41:23,071 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:41:23,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-15 22:41:23,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=990, Unknown=0, NotChecked=0, Total=1122 [2019-11-15 22:41:23,071 INFO L87 Difference]: Start difference. First operand 435 states and 542 transitions. Second operand 34 states. [2019-11-15 22:41:25,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:41:25,013 INFO L93 Difference]: Finished difference Result 545 states and 666 transitions. [2019-11-15 22:41:25,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-11-15 22:41:25,013 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 39 [2019-11-15 22:41:25,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:41:25,016 INFO L225 Difference]: With dead ends: 545 [2019-11-15 22:41:25,016 INFO L226 Difference]: Without dead ends: 536 [2019-11-15 22:41:25,016 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 22 SyntacticMatches, 9 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1082 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=418, Invalid=3242, Unknown=0, NotChecked=0, Total=3660 [2019-11-15 22:41:25,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-11-15 22:41:25,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 460. [2019-11-15 22:41:25,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-11-15 22:41:25,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 571 transitions. [2019-11-15 22:41:25,078 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 571 transitions. Word has length 39 [2019-11-15 22:41:25,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:41:25,079 INFO L462 AbstractCegarLoop]: Abstraction has 460 states and 571 transitions. [2019-11-15 22:41:25,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-15 22:41:25,079 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 571 transitions. [2019-11-15 22:41:25,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-15 22:41:25,080 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:41:25,080 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:41:25,284 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:41:25,285 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:41:25,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:25,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1077848874, now seen corresponding path program 3 times [2019-11-15 22:41:25,285 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:25,285 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419656627] [2019-11-15 22:41:25,285 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:25,285 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:25,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:25,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:25,825 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:25,825 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419656627] [2019-11-15 22:41:25,826 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623229948] [2019-11-15 22:41:25,826 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69a7431c-a629-4141-88bf-f035d31638de/bin/uautomizer/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:41:25,961 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-11-15 22:41:25,961 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:41:25,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 43 conjunts are in the unsatisfiable core [2019-11-15 22:41:25,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:41:26,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:41:26,120 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:26,120 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 28 treesize of output 27 [2019-11-15 22:41:26,121 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:41:26,128 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:41:26,129 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:41:26,129 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2019-11-15 22:41:26,245 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:26,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:26,249 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:26,250 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:41:26,250 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 38 treesize of output 40 [2019-11-15 22:41:26,251 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:41:26,267 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:41:26,268 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 22:41:26,268 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:28 [2019-11-15 22:41:26,432 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:26,433 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:26,435 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:26,436 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:41:26,437 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 29 treesize of output 31 [2019-11-15 22:41:26,437 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:41:26,443 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:41:26,444 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:41:26,444 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2019-11-15 22:41:26,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:41:26,616 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:26,616 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:41:26,616 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 35 [2019-11-15 22:41:26,616 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691073526] [2019-11-15 22:41:26,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-11-15 22:41:26,617 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:41:26,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-11-15 22:41:26,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1051, Unknown=0, NotChecked=0, Total=1190 [2019-11-15 22:41:26,618 INFO L87 Difference]: Start difference. First operand 460 states and 571 transitions. Second operand 35 states. [2019-11-15 22:41:28,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:41:28,923 INFO L93 Difference]: Finished difference Result 702 states and 863 transitions. [2019-11-15 22:41:28,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-11-15 22:41:28,925 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 40 [2019-11-15 22:41:28,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:41:28,929 INFO L225 Difference]: With dead ends: 702 [2019-11-15 22:41:28,929 INFO L226 Difference]: Without dead ends: 617 [2019-11-15 22:41:28,930 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1793 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=768, Invalid=4932, Unknown=0, NotChecked=0, Total=5700 [2019-11-15 22:41:28,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-11-15 22:41:29,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 490. [2019-11-15 22:41:29,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-11-15 22:41:29,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 609 transitions. [2019-11-15 22:41:29,012 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 609 transitions. Word has length 40 [2019-11-15 22:41:29,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:41:29,012 INFO L462 AbstractCegarLoop]: Abstraction has 490 states and 609 transitions. [2019-11-15 22:41:29,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-11-15 22:41:29,013 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 609 transitions. [2019-11-15 22:41:29,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-15 22:41:29,014 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:41:29,014 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:41:29,217 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:41:29,217 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:41:29,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:29,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1570917360, now seen corresponding path program 4 times [2019-11-15 22:41:29,218 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:29,218 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674651192] [2019-11-15 22:41:29,218 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:29,218 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:29,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:29,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:29,866 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:29,866 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674651192] [2019-11-15 22:41:29,866 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223107610] [2019-11-15 22:41:29,867 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69a7431c-a629-4141-88bf-f035d31638de/bin/uautomizer/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:41:29,976 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 22:41:29,976 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:41:29,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-15 22:41:29,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:41:30,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:41:30,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:30,209 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 28 treesize of output 27 [2019-11-15 22:41:30,210 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:41:30,222 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:41:30,223 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 22:41:30,223 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2019-11-15 22:41:30,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:30,346 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:30,347 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:30,348 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:41:30,348 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 22:41:30,348 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:41:30,357 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:41:30,357 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 22:41:30,357 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:30 [2019-11-15 22:41:30,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:41:30,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:41:30,581 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 3 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:30,581 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:41:30,581 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 36 [2019-11-15 22:41:30,581 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834777654] [2019-11-15 22:41:30,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-11-15 22:41:30,582 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:41:30,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-11-15 22:41:30,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1108, Unknown=0, NotChecked=0, Total=1260 [2019-11-15 22:41:30,582 INFO L87 Difference]: Start difference. First operand 490 states and 609 transitions. Second operand 36 states. [2019-11-15 22:41:34,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:41:34,158 INFO L93 Difference]: Finished difference Result 892 states and 1106 transitions. [2019-11-15 22:41:34,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-11-15 22:41:34,158 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 40 [2019-11-15 22:41:34,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:41:34,161 INFO L225 Difference]: With dead ends: 892 [2019-11-15 22:41:34,161 INFO L226 Difference]: Without dead ends: 788 [2019-11-15 22:41:34,162 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2365 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=878, Invalid=6432, Unknown=0, NotChecked=0, Total=7310 [2019-11-15 22:41:34,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2019-11-15 22:41:34,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 570. [2019-11-15 22:41:34,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2019-11-15 22:41:34,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 710 transitions. [2019-11-15 22:41:34,234 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 710 transitions. Word has length 40 [2019-11-15 22:41:34,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:41:34,234 INFO L462 AbstractCegarLoop]: Abstraction has 570 states and 710 transitions. [2019-11-15 22:41:34,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-11-15 22:41:34,234 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 710 transitions. [2019-11-15 22:41:34,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-15 22:41:34,236 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:41:34,236 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:41:34,440 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:41:34,440 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:41:34,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:34,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1841450632, now seen corresponding path program 3 times [2019-11-15 22:41:34,440 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:34,441 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898224134] [2019-11-15 22:41:34,441 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:34,441 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:34,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:34,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:35,199 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:35,199 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898224134] [2019-11-15 22:41:35,199 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875697334] [2019-11-15 22:41:35,200 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69a7431c-a629-4141-88bf-f035d31638de/bin/uautomizer/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:41:35,411 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-11-15 22:41:35,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:41:35,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-15 22:41:35,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:41:35,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:41:35,588 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:35,588 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 38 treesize of output 29 [2019-11-15 22:41:35,589 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:41:35,599 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:41:35,599 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:41:35,599 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2019-11-15 22:41:35,798 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:35,799 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:41:35,800 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:41:35,801 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 51 treesize of output 44 [2019-11-15 22:41:35,801 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:41:35,827 INFO L567 ElimStorePlain]: treesize reduction 12, result has 76.9 percent of original size [2019-11-15 22:41:35,827 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 22:41:35,828 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:65, output treesize:32 [2019-11-15 22:41:35,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:35,963 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:35,964 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:35,965 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:41:35,965 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 33 treesize of output 35 [2019-11-15 22:41:35,966 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:41:35,974 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:41:35,974 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:41:35,974 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:24 [2019-11-15 22:41:36,055 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:36,056 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:36,057 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:36,058 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:41:36,058 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 22:41:36,058 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:41:36,066 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:41:36,066 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 22:41:36,066 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:21 [2019-11-15 22:41:36,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:41:36,281 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 1 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:36,281 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:41:36,282 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2019-11-15 22:41:36,282 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530929541] [2019-11-15 22:41:36,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-11-15 22:41:36,282 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:41:36,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-11-15 22:41:36,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1386, Unknown=0, NotChecked=0, Total=1560 [2019-11-15 22:41:36,283 INFO L87 Difference]: Start difference. First operand 570 states and 710 transitions. Second operand 40 states. [2019-11-15 22:41:37,108 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-11-15 22:41:38,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:41:38,051 INFO L93 Difference]: Finished difference Result 637 states and 786 transitions. [2019-11-15 22:41:38,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-11-15 22:41:38,052 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-11-15 22:41:38,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:41:38,054 INFO L225 Difference]: With dead ends: 637 [2019-11-15 22:41:38,054 INFO L226 Difference]: Without dead ends: 635 [2019-11-15 22:41:38,055 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1397 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=527, Invalid=4165, Unknown=0, NotChecked=0, Total=4692 [2019-11-15 22:41:38,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-11-15 22:41:38,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 575. [2019-11-15 22:41:38,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-11-15 22:41:38,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 716 transitions. [2019-11-15 22:41:38,142 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 716 transitions. Word has length 40 [2019-11-15 22:41:38,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:41:38,142 INFO L462 AbstractCegarLoop]: Abstraction has 575 states and 716 transitions. [2019-11-15 22:41:38,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-11-15 22:41:38,143 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 716 transitions. [2019-11-15 22:41:38,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-15 22:41:38,144 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:41:38,144 INFO L380 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:41:38,344 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:41:38,344 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:41:38,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:38,345 INFO L82 PathProgramCache]: Analyzing trace with hash -810378023, now seen corresponding path program 2 times [2019-11-15 22:41:38,345 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:38,345 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434177143] [2019-11-15 22:41:38,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:38,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:38,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:38,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:38,600 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 11 proven. 38 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-15 22:41:38,601 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434177143] [2019-11-15 22:41:38,601 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405511200] [2019-11-15 22:41:38,601 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69a7431c-a629-4141-88bf-f035d31638de/bin/uautomizer/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:41:38,752 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:41:38,752 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:41:38,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-15 22:41:38,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:41:38,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:41:38,875 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:38,876 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 32 treesize of output 31 [2019-11-15 22:41:38,876 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:41:38,889 INFO L567 ElimStorePlain]: treesize reduction 5, result has 86.1 percent of original size [2019-11-15 22:41:38,889 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:41:38,890 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:28 [2019-11-15 22:41:38,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:41:38,928 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 11 proven. 49 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 22:41:38,928 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:41:38,929 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 18 [2019-11-15 22:41:38,929 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633775423] [2019-11-15 22:41:38,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-15 22:41:38,929 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:41:38,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 22:41:38,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2019-11-15 22:41:38,930 INFO L87 Difference]: Start difference. First operand 575 states and 716 transitions. Second operand 18 states. [2019-11-15 22:41:39,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:41:39,945 INFO L93 Difference]: Finished difference Result 657 states and 807 transitions. [2019-11-15 22:41:39,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-11-15 22:41:39,946 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 40 [2019-11-15 22:41:39,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:41:39,949 INFO L225 Difference]: With dead ends: 657 [2019-11-15 22:41:39,949 INFO L226 Difference]: Without dead ends: 655 [2019-11-15 22:41:39,952 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 752 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=578, Invalid=1972, Unknown=0, NotChecked=0, Total=2550 [2019-11-15 22:41:39,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-11-15 22:41:40,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 524. [2019-11-15 22:41:40,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2019-11-15 22:41:40,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 647 transitions. [2019-11-15 22:41:40,047 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 647 transitions. Word has length 40 [2019-11-15 22:41:40,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:41:40,048 INFO L462 AbstractCegarLoop]: Abstraction has 524 states and 647 transitions. [2019-11-15 22:41:40,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-15 22:41:40,048 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 647 transitions. [2019-11-15 22:41:40,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-15 22:41:40,050 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:41:40,050 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:41:40,254 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:41:40,254 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:41:40,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:40,254 INFO L82 PathProgramCache]: Analyzing trace with hash -2136702275, now seen corresponding path program 1 times [2019-11-15 22:41:40,254 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:40,254 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893633364] [2019-11-15 22:41:40,255 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:40,255 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:40,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:40,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:41,156 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 2 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:41,156 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893633364] [2019-11-15 22:41:41,157 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984765030] [2019-11-15 22:41:41,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69a7431c-a629-4141-88bf-f035d31638de/bin/uautomizer/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:41:41,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:41,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 43 conjunts are in the unsatisfiable core [2019-11-15 22:41:41,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:41:41,361 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 22:41:41,362 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:41:41,368 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:41:41,368 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:41:41,369 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2019-11-15 22:41:41,395 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 22:41:41,395 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:41:41,409 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:41:41,409 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:41:41,409 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2019-11-15 22:41:41,509 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:41,510 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 24 treesize of output 24 [2019-11-15 22:41:41,510 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:41:41,519 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:41:41,519 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:41:41,520 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2019-11-15 22:41:41,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:41:41,764 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:41,765 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:41,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:41,767 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:41:41,768 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 42 [2019-11-15 22:41:41,768 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:41:41,779 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:41:41,780 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 22:41:41,780 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:63, output treesize:35 [2019-11-15 22:41:41,897 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:41,899 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:41,900 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:41,901 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:41:41,901 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 30 treesize of output 32 [2019-11-15 22:41:41,901 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:41:41,909 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:41:41,910 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 22:41:41,910 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:17 [2019-11-15 22:41:41,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:41:41,965 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 7 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:41,965 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:41:41,965 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23] total 33 [2019-11-15 22:41:41,965 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849306610] [2019-11-15 22:41:41,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-15 22:41:41,966 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:41:41,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-15 22:41:41,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=923, Unknown=0, NotChecked=0, Total=1056 [2019-11-15 22:41:41,966 INFO L87 Difference]: Start difference. First operand 524 states and 647 transitions. Second operand 33 states. [2019-11-15 22:41:44,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:41:44,751 INFO L93 Difference]: Finished difference Result 928 states and 1142 transitions. [2019-11-15 22:41:44,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-11-15 22:41:44,751 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 41 [2019-11-15 22:41:44,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:41:44,755 INFO L225 Difference]: With dead ends: 928 [2019-11-15 22:41:44,755 INFO L226 Difference]: Without dead ends: 818 [2019-11-15 22:41:44,756 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 23 SyntacticMatches, 9 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2108 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=685, Invalid=5477, Unknown=0, NotChecked=0, Total=6162 [2019-11-15 22:41:44,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2019-11-15 22:41:44,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 562. [2019-11-15 22:41:44,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-11-15 22:41:44,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 695 transitions. [2019-11-15 22:41:44,832 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 695 transitions. Word has length 41 [2019-11-15 22:41:44,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:41:44,832 INFO L462 AbstractCegarLoop]: Abstraction has 562 states and 695 transitions. [2019-11-15 22:41:44,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-15 22:41:44,833 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 695 transitions. [2019-11-15 22:41:44,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-15 22:41:44,834 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:41:44,834 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2019-11-15 22:41:45,034 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:41:45,035 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:41:45,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:45,035 INFO L82 PathProgramCache]: Analyzing trace with hash -506394531, now seen corresponding path program 8 times [2019-11-15 22:41:45,035 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:45,035 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603387616] [2019-11-15 22:41:45,035 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:45,035 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:45,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:45,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:45,397 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:45,397 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603387616] [2019-11-15 22:41:45,398 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83530621] [2019-11-15 22:41:45,398 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69a7431c-a629-4141-88bf-f035d31638de/bin/uautomizer/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:41:45,545 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:41:45,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:41:45,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-15 22:41:45,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:41:45,700 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 22:41:45,700 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:41:45,708 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:41:45,708 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:41:45,709 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2019-11-15 22:41:45,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:41:45,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:41:45,895 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 22:41:45,895 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:41:45,902 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:41:45,902 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:41:45,902 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-15 22:41:46,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:41:46,127 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:46,127 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:41:46,127 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2019-11-15 22:41:46,127 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924863925] [2019-11-15 22:41:46,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-15 22:41:46,128 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:41:46,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-15 22:41:46,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=892, Unknown=0, NotChecked=0, Total=992 [2019-11-15 22:41:46,128 INFO L87 Difference]: Start difference. First operand 562 states and 695 transitions. Second operand 32 states. [2019-11-15 22:41:47,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:41:47,204 INFO L93 Difference]: Finished difference Result 883 states and 1079 transitions. [2019-11-15 22:41:47,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-15 22:41:47,205 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 43 [2019-11-15 22:41:47,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:41:47,208 INFO L225 Difference]: With dead ends: 883 [2019-11-15 22:41:47,208 INFO L226 Difference]: Without dead ends: 881 [2019-11-15 22:41:47,209 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=303, Invalid=2247, Unknown=0, NotChecked=0, Total=2550 [2019-11-15 22:41:47,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2019-11-15 22:41:47,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 617. [2019-11-15 22:41:47,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2019-11-15 22:41:47,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 764 transitions. [2019-11-15 22:41:47,297 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 764 transitions. Word has length 43 [2019-11-15 22:41:47,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:41:47,298 INFO L462 AbstractCegarLoop]: Abstraction has 617 states and 764 transitions. [2019-11-15 22:41:47,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-15 22:41:47,298 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 764 transitions. [2019-11-15 22:41:47,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-15 22:41:47,300 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:41:47,300 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:41:47,503 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:41:47,503 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:41:47,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:47,503 INFO L82 PathProgramCache]: Analyzing trace with hash 432114678, now seen corresponding path program 2 times [2019-11-15 22:41:47,504 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:47,504 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793556245] [2019-11-15 22:41:47,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:47,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:47,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:47,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:47,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:47,597 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:41:47,599 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 22:41:47,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:41:47 BoogieIcfgContainer [2019-11-15 22:41:47,672 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:41:47,672 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:41:47,672 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:41:47,673 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:41:47,673 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:40:06" (3/4) ... [2019-11-15 22:41:47,675 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 22:41:47,763 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_69a7431c-a629-4141-88bf-f035d31638de/bin/uautomizer/witness.graphml [2019-11-15 22:41:47,763 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:41:47,765 INFO L168 Benchmark]: Toolchain (without parser) took 102174.09 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 464.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -154.3 MB). Peak memory consumption was 310.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:41:47,766 INFO L168 Benchmark]: CDTParser took 0.38 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 22:41:47,767 INFO L168 Benchmark]: CACSL2BoogieTranslator took 478.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -171.0 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2019-11-15 22:41:47,767 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.75 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 22:41:47,767 INFO L168 Benchmark]: Boogie Preprocessor took 28.11 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 22:41:47,768 INFO L168 Benchmark]: RCFGBuilder took 345.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:41:47,768 INFO L168 Benchmark]: TraceAbstraction took 101168.70 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 343.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -11.2 MB). Peak memory consumption was 332.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:41:47,768 INFO L168 Benchmark]: Witness Printer took 91.03 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:41:47,775 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.38 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 478.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -171.0 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.75 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 28.11 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 345.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 101168.70 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 343.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -11.2 MB). Peak memory consumption was 332.2 MB. Max. memory is 11.5 GB. * Witness Printer took 91.03 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L11] unsigned int SIZE=__VERIFIER_nondet_uint(); [L12] int i, j, k, key; [L13] int v[SIZE]; [L14] j=1 [L14] COND TRUE j=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) [L17] COND FALSE !((i>=0) && (v[i]>key)) [L22] v[i+1] = key [L14] j++ [L14] COND TRUE j=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) [L17] COND FALSE !((i>=0) && (v[i]>key)) [L22] v[i+1] = key [L14] j++ [L14] COND TRUE j=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) [L17] COND TRUE (i>=0) && (v[i]>key) [L18] COND FALSE !(i<2) [L20] i = i - 1 [L17] (i>=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) [L17] COND TRUE (i>=0) && (v[i]>key) [L18] COND TRUE i<2 [L19] EXPR v[i] [L19] v[i+1] = v[i] [L20] i = i - 1 [L17] (i>=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) [L17] COND FALSE !((i>=0) && (v[i]>key)) [L22] v[i+1] = key [L14] j++ [L14] COND FALSE !(j