./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 f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c5a873d6-a9ae-4cd8-bd7c-404884b999c7/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c5a873d6-a9ae-4cd8-bd7c-404884b999c7/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c5a873d6-a9ae-4cd8-bd7c-404884b999c7/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c5a873d6-a9ae-4cd8-bd7c-404884b999c7/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops/insertion_sort-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c5a873d6-a9ae-4cd8-bd7c-404884b999c7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c5a873d6-a9ae-4cd8-bd7c-404884b999c7/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.25-f470102 [2019-12-07 18:04:53,534 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:04:53,535 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:04:53,542 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:04:53,542 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:04:53,543 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:04:53,544 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:04:53,545 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:04:53,547 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:04:53,548 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:04:53,548 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:04:53,549 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:04:53,549 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:04:53,550 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:04:53,550 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:04:53,551 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:04:53,552 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:04:53,553 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:04:53,554 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:04:53,555 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:04:53,556 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:04:53,557 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:04:53,558 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:04:53,558 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:04:53,560 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:04:53,560 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:04:53,560 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:04:53,560 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:04:53,561 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:04:53,561 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:04:53,562 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:04:53,562 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:04:53,563 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:04:53,563 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:04:53,564 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:04:53,564 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:04:53,565 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:04:53,565 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:04:53,565 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:04:53,566 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:04:53,566 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:04:53,567 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c5a873d6-a9ae-4cd8-bd7c-404884b999c7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:04:53,579 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:04:53,579 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:04:53,580 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:04:53,581 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:04:53,581 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:04:53,581 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:04:53,581 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:04:53,582 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:04:53,582 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:04:53,582 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:04:53,582 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:04:53,582 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:04:53,582 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:04:53,583 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:04:53,583 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:04:53,583 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:04:53,583 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:04:53,583 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:04:53,584 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:04:53,584 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:04:53,584 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:04:53,584 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:04:53,584 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:04:53,585 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:04:53,585 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:04:53,585 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:04:53,585 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:04:53,585 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:04:53,585 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:04:53,586 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_c5a873d6-a9ae-4cd8-bd7c-404884b999c7/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-12-07 18:04:53,692 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:04:53,700 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:04:53,703 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:04:53,705 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:04:53,705 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:04:53,706 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c5a873d6-a9ae-4cd8-bd7c-404884b999c7/bin/uautomizer/../../sv-benchmarks/c/loops/insertion_sort-1.c [2019-12-07 18:04:53,745 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c5a873d6-a9ae-4cd8-bd7c-404884b999c7/bin/uautomizer/data/6b2560d30/9744b6b498164974b7d19e842e158caa/FLAGb5dd9c516 [2019-12-07 18:04:54,149 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:04:54,150 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c5a873d6-a9ae-4cd8-bd7c-404884b999c7/sv-benchmarks/c/loops/insertion_sort-1.c [2019-12-07 18:04:54,153 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c5a873d6-a9ae-4cd8-bd7c-404884b999c7/bin/uautomizer/data/6b2560d30/9744b6b498164974b7d19e842e158caa/FLAGb5dd9c516 [2019-12-07 18:04:54,162 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c5a873d6-a9ae-4cd8-bd7c-404884b999c7/bin/uautomizer/data/6b2560d30/9744b6b498164974b7d19e842e158caa [2019-12-07 18:04:54,164 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:04:54,165 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:04:54,166 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:04:54,166 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:04:54,168 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:04:54,168 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:04:54" (1/1) ... [2019-12-07 18:04:54,170 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13d86038 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:04:54, skipping insertion in model container [2019-12-07 18:04:54,170 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:04:54" (1/1) ... [2019-12-07 18:04:54,175 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:04:54,186 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:04:54,325 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:04:54,328 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:04:54,347 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:04:54,361 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:04:54,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:04:54 WrapperNode [2019-12-07 18:04:54,362 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:04:54,362 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:04:54,362 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:04:54,362 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:04:54,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:04:54" (1/1) ... [2019-12-07 18:04:54,373 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:04:54" (1/1) ... [2019-12-07 18:04:54,386 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:04:54,387 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:04:54,387 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:04:54,387 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:04:54,393 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:04:54" (1/1) ... [2019-12-07 18:04:54,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:04:54" (1/1) ... [2019-12-07 18:04:54,394 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:04:54" (1/1) ... [2019-12-07 18:04:54,394 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:04:54" (1/1) ... [2019-12-07 18:04:54,398 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:04:54" (1/1) ... [2019-12-07 18:04:54,400 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:04:54" (1/1) ... [2019-12-07 18:04:54,401 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:04:54" (1/1) ... [2019-12-07 18:04:54,402 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:04:54,403 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:04:54,403 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:04:54,403 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:04:54,404 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:04:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5a873d6-a9ae-4cd8-bd7c-404884b999c7/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-12-07 18:04:54,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 18:04:54,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:04:54,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:04:54,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 18:04:54,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:04:54,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:04:54,573 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:04:54,573 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-12-07 18:04:54,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:04:54 BoogieIcfgContainer [2019-12-07 18:04:54,574 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:04:54,575 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:04:54,575 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:04:54,577 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:04:54,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:04:54" (1/3) ... [2019-12-07 18:04:54,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df6599a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:04:54, skipping insertion in model container [2019-12-07 18:04:54,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:04:54" (2/3) ... [2019-12-07 18:04:54,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df6599a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:04:54, skipping insertion in model container [2019-12-07 18:04:54,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:04:54" (3/3) ... [2019-12-07 18:04:54,579 INFO L109 eAbstractionObserver]: Analyzing ICFG insertion_sort-1.c [2019-12-07 18:04:54,585 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:04:54,589 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 18:04:54,596 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 18:04:54,611 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:04:54,611 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:04:54,611 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:04:54,612 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:04:54,612 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:04:54,612 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:04:54,612 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:04:54,612 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:04:54,621 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-12-07 18:04:54,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 18:04:54,625 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:04:54,625 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:04:54,626 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:04:54,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:04:54,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1808788559, now seen corresponding path program 1 times [2019-12-07 18:04:54,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:04:54,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184925359] [2019-12-07 18:04:54,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:04:54,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:04:54,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:04:54,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184925359] [2019-12-07 18:04:54,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:04:54,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:04:54,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890974216] [2019-12-07 18:04:54,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:04:54,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:04:54,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:04:54,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:04:54,819 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2019-12-07 18:04:54,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:04:54,878 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2019-12-07 18:04:54,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:04:54,880 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-12-07 18:04:54,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:04:54,888 INFO L225 Difference]: With dead ends: 54 [2019-12-07 18:04:54,888 INFO L226 Difference]: Without dead ends: 25 [2019-12-07 18:04:54,891 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:04:54,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-12-07 18:04:54,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 18. [2019-12-07 18:04:54,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-12-07 18:04:54,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2019-12-07 18:04:54,915 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 7 [2019-12-07 18:04:54,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:04:54,916 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2019-12-07 18:04:54,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:04:54,916 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2019-12-07 18:04:54,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 18:04:54,917 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:04:54,917 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:04:54,917 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:04:54,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:04:54,917 INFO L82 PathProgramCache]: Analyzing trace with hash 616714882, now seen corresponding path program 1 times [2019-12-07 18:04:54,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:04:54,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759635720] [2019-12-07 18:04:54,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:04:54,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:04:55,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:04:55,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759635720] [2019-12-07 18:04:55,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641069112] [2019-12-07 18:04:55,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5a873d6-a9ae-4cd8-bd7c-404884b999c7/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-12-07 18:04:55,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:04:55,301 INFO L264 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 18:04:55,306 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:04:55,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:04:55,423 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:04:55,426 INFO L377 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-12-07 18:04:55,427 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:04:55,435 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:04:55,436 INFO L534 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-12-07 18:04:55,436 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2019-12-07 18:04:55,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:04:55,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:04:55,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:04:55,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2019-12-07 18:04:55,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513560201] [2019-12-07 18:04:55,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 18:04:55,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:04:55,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 18:04:55,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2019-12-07 18:04:55,477 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 17 states. [2019-12-07 18:04:55,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:04:55,845 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2019-12-07 18:04:55,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 18:04:55,845 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 13 [2019-12-07 18:04:55,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:04:55,846 INFO L225 Difference]: With dead ends: 80 [2019-12-07 18:04:55,847 INFO L226 Difference]: Without dead ends: 65 [2019-12-07 18:04:55,848 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=162, Invalid=594, Unknown=0, NotChecked=0, Total=756 [2019-12-07 18:04:55,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-12-07 18:04:55,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 30. [2019-12-07 18:04:55,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-07 18:04:55,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2019-12-07 18:04:55,853 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 13 [2019-12-07 18:04:55,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:04:55,854 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2019-12-07 18:04:55,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 18:04:55,854 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2019-12-07 18:04:55,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 18:04:55,854 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:04:55,854 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:04:56,055 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:04:56,056 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:04:56,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:04:56,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1296773252, now seen corresponding path program 1 times [2019-12-07 18:04:56,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:04:56,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309700312] [2019-12-07 18:04:56,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:04:56,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:04:56,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:04:56,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309700312] [2019-12-07 18:04:56,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:04:56,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:04:56,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625779518] [2019-12-07 18:04:56,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:04:56,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:04:56,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:04:56,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:04:56,150 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand 5 states. [2019-12-07 18:04:56,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:04:56,230 INFO L93 Difference]: Finished difference Result 83 states and 106 transitions. [2019-12-07 18:04:56,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:04:56,231 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-07 18:04:56,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:04:56,233 INFO L225 Difference]: With dead ends: 83 [2019-12-07 18:04:56,233 INFO L226 Difference]: Without dead ends: 56 [2019-12-07 18:04:56,233 INFO L630 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-12-07 18:04:56,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-12-07 18:04:56,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 34. [2019-12-07 18:04:56,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-07 18:04:56,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2019-12-07 18:04:56,239 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 13 [2019-12-07 18:04:56,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:04:56,240 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2019-12-07 18:04:56,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:04:56,240 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2019-12-07 18:04:56,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 18:04:56,240 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:04:56,241 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:04:56,241 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:04:56,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:04:56,241 INFO L82 PathProgramCache]: Analyzing trace with hash -2022971496, now seen corresponding path program 1 times [2019-12-07 18:04:56,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:04:56,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381334109] [2019-12-07 18:04:56,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:04:56,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:04:56,376 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:04:56,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381334109] [2019-12-07 18:04:56,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440006910] [2019-12-07 18:04:56,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5a873d6-a9ae-4cd8-bd7c-404884b999c7/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-12-07 18:04:56,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:04:56,408 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 18:04:56,409 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:04:56,457 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:04:56,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:04:56,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2019-12-07 18:04:56,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638205279] [2019-12-07 18:04:56,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 18:04:56,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:04:56,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 18:04:56,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:04:56,458 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand 10 states. [2019-12-07 18:04:56,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:04:56,580 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2019-12-07 18:04:56,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:04:56,580 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-12-07 18:04:56,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:04:56,581 INFO L225 Difference]: With dead ends: 60 [2019-12-07 18:04:56,581 INFO L226 Difference]: Without dead ends: 48 [2019-12-07 18:04:56,582 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:04:56,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-12-07 18:04:56,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 37. [2019-12-07 18:04:56,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-12-07 18:04:56,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2019-12-07 18:04:56,587 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 17 [2019-12-07 18:04:56,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:04:56,588 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2019-12-07 18:04:56,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 18:04:56,588 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2019-12-07 18:04:56,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 18:04:56,589 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:04:56,589 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:04:56,789 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:04:56,790 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:04:56,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:04:56,791 INFO L82 PathProgramCache]: Analyzing trace with hash 958971857, now seen corresponding path program 1 times [2019-12-07 18:04:56,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:04:56,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980268411] [2019-12-07 18:04:56,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:04:56,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:04:57,200 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:04:57,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980268411] [2019-12-07 18:04:57,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784829325] [2019-12-07 18:04:57,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5a873d6-a9ae-4cd8-bd7c-404884b999c7/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-12-07 18:04:57,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:04:57,223 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-07 18:04:57,224 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:04:57,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:04:57,311 INFO L343 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2019-12-07 18:04:57,311 INFO L377 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-12-07 18:04:57,312 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:04:57,317 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:04:57,317 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:04:57,317 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2019-12-07 18:04:57,484 INFO L343 Elim1Store]: treesize reduction 17, result has 85.8 percent of original size [2019-12-07 18:04:57,484 INFO L377 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-12-07 18:04:57,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:04:57,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:04:57,486 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:04:57,510 INFO L614 ElimStorePlain]: treesize reduction 132, result has 21.9 percent of original size [2019-12-07 18:04:57,511 INFO L534 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-12-07 18:04:57,511 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:64, output treesize:29 [2019-12-07 18:04:57,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:04:57,579 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:04:57,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:04:57,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2019-12-07 18:04:57,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926283973] [2019-12-07 18:04:57,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-07 18:04:57,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:04:57,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-07 18:04:57,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2019-12-07 18:04:57,581 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 26 states. [2019-12-07 18:04:58,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:04:58,032 INFO L93 Difference]: Finished difference Result 78 states and 97 transitions. [2019-12-07 18:04:58,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 18:04:58,032 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 18 [2019-12-07 18:04:58,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:04:58,033 INFO L225 Difference]: With dead ends: 78 [2019-12-07 18:04:58,033 INFO L226 Difference]: Without dead ends: 43 [2019-12-07 18:04:58,034 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=202, Invalid=1058, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 18:04:58,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-12-07 18:04:58,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2019-12-07 18:04:58,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-07 18:04:58,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-12-07 18:04:58,037 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 18 [2019-12-07 18:04:58,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:04:58,038 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-12-07 18:04:58,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-07 18:04:58,038 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2019-12-07 18:04:58,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 18:04:58,038 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:04:58,038 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:04:58,239 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:04:58,240 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:04:58,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:04:58,241 INFO L82 PathProgramCache]: Analyzing trace with hash 632161909, now seen corresponding path program 2 times [2019-12-07 18:04:58,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:04:58,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450448603] [2019-12-07 18:04:58,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:04:58,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:04:58,652 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:04:58,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450448603] [2019-12-07 18:04:58,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911649901] [2019-12-07 18:04:58,653 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5a873d6-a9ae-4cd8-bd7c-404884b999c7/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-12-07 18:04:58,676 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:04:58,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:04:58,677 INFO L264 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-07 18:04:58,679 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:04:58,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:04:58,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:04:58,789 INFO L377 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-12-07 18:04:58,789 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:04:58,797 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:04:58,798 INFO L534 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-12-07 18:04:58,798 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2019-12-07 18:04:58,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:04:58,848 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:04:58,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:04:58,850 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:04:58,850 INFO L377 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-12-07 18:04:58,851 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:04:58,858 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:04:58,859 INFO L534 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-12-07 18:04:58,859 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:25 [2019-12-07 18:04:58,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:04:58,899 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:04:58,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:04:58,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 21 [2019-12-07 18:04:58,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101371753] [2019-12-07 18:04:58,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 18:04:58,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:04:58,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 18:04:58,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2019-12-07 18:04:58,900 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 21 states. [2019-12-07 18:05:00,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:00,044 INFO L93 Difference]: Finished difference Result 112 states and 138 transitions. [2019-12-07 18:05:00,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 18:05:00,045 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 19 [2019-12-07 18:05:00,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:00,046 INFO L225 Difference]: With dead ends: 112 [2019-12-07 18:05:00,046 INFO L226 Difference]: Without dead ends: 95 [2019-12-07 18:05:00,047 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=187, Invalid=935, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 18:05:00,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-12-07 18:05:00,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 50. [2019-12-07 18:05:00,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-12-07 18:05:00,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2019-12-07 18:05:00,054 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 19 [2019-12-07 18:05:00,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:00,055 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2019-12-07 18:05:00,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 18:05:00,055 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2019-12-07 18:05:00,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 18:05:00,055 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:00,056 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:05:00,256 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:05:00,257 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:00,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:00,258 INFO L82 PathProgramCache]: Analyzing trace with hash 44460555, now seen corresponding path program 2 times [2019-12-07 18:05:00,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:00,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989908441] [2019-12-07 18:05:00,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:00,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:00,454 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:00,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989908441] [2019-12-07 18:05:00,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282303775] [2019-12-07 18:05:00,454 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5a873d6-a9ae-4cd8-bd7c-404884b999c7/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-12-07 18:05:00,484 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:05:00,484 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:05:00,485 INFO L264 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 29 conjunts are in the unsatisfiable core [2019-12-07 18:05:00,487 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:05:00,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:00,572 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:00,572 INFO L377 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-12-07 18:05:00,573 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:00,577 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:00,577 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:00,577 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-12-07 18:05:00,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:00,667 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:00,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:05:00,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2019-12-07 18:05:00,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862265701] [2019-12-07 18:05:00,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 18:05:00,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:00,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 18:05:00,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2019-12-07 18:05:00,669 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand 23 states. [2019-12-07 18:05:01,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:01,041 INFO L93 Difference]: Finished difference Result 118 states and 144 transitions. [2019-12-07 18:05:01,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 18:05:01,042 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-12-07 18:05:01,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:01,043 INFO L225 Difference]: With dead ends: 118 [2019-12-07 18:05:01,043 INFO L226 Difference]: Without dead ends: 101 [2019-12-07 18:05:01,044 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=202, Invalid=1058, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 18:05:01,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-12-07 18:05:01,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 64. [2019-12-07 18:05:01,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-07 18:05:01,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2019-12-07 18:05:01,050 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 23 [2019-12-07 18:05:01,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:01,050 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2019-12-07 18:05:01,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-07 18:05:01,050 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2019-12-07 18:05:01,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 18:05:01,051 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:01,051 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:05:01,251 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:05:01,252 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:01,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:01,253 INFO L82 PathProgramCache]: Analyzing trace with hash -55202372, now seen corresponding path program 1 times [2019-12-07 18:05:01,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:01,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453955470] [2019-12-07 18:05:01,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:01,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:01,446 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:01,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453955470] [2019-12-07 18:05:01,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502373983] [2019-12-07 18:05:01,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5a873d6-a9ae-4cd8-bd7c-404884b999c7/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-12-07 18:05:01,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:01,471 INFO L264 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-07 18:05:01,472 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:05:01,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:01,529 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:01,529 INFO L377 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-12-07 18:05:01,529 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:01,540 INFO L614 ElimStorePlain]: treesize reduction 5, result has 86.1 percent of original size [2019-12-07 18:05:01,541 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:01,541 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:28 [2019-12-07 18:05:01,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:01,572 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:01,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:05:01,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 15 [2019-12-07 18:05:01,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509163168] [2019-12-07 18:05:01,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 18:05:01,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:01,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 18:05:01,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-12-07 18:05:01,574 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand 15 states. [2019-12-07 18:05:02,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:02,043 INFO L93 Difference]: Finished difference Result 145 states and 177 transitions. [2019-12-07 18:05:02,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-07 18:05:02,044 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2019-12-07 18:05:02,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:02,044 INFO L225 Difference]: With dead ends: 145 [2019-12-07 18:05:02,045 INFO L226 Difference]: Without dead ends: 128 [2019-12-07 18:05:02,045 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 17 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=327, Invalid=1155, Unknown=0, NotChecked=0, Total=1482 [2019-12-07 18:05:02,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-12-07 18:05:02,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 79. [2019-12-07 18:05:02,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-12-07 18:05:02,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 98 transitions. [2019-12-07 18:05:02,053 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 98 transitions. Word has length 24 [2019-12-07 18:05:02,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:02,053 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 98 transitions. [2019-12-07 18:05:02,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 18:05:02,053 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2019-12-07 18:05:02,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 18:05:02,054 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:02,054 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:05:02,255 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:05:02,256 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:02,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:02,256 INFO L82 PathProgramCache]: Analyzing trace with hash 624855998, now seen corresponding path program 2 times [2019-12-07 18:05:02,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:02,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363668088] [2019-12-07 18:05:02,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:02,351 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:02,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363668088] [2019-12-07 18:05:02,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935694984] [2019-12-07 18:05:02,352 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5a873d6-a9ae-4cd8-bd7c-404884b999c7/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-12-07 18:05:02,389 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:05:02,389 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:05:02,390 INFO L264 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 18:05:02,391 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:05:02,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:02,394 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:02,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:05:02,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-07 18:05:02,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946969969] [2019-12-07 18:05:02,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:05:02,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:02,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:05:02,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:05:02,396 INFO L87 Difference]: Start difference. First operand 79 states and 98 transitions. Second operand 7 states. [2019-12-07 18:05:02,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:02,494 INFO L93 Difference]: Finished difference Result 161 states and 203 transitions. [2019-12-07 18:05:02,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 18:05:02,495 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-12-07 18:05:02,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:02,495 INFO L225 Difference]: With dead ends: 161 [2019-12-07 18:05:02,495 INFO L226 Difference]: Without dead ends: 125 [2019-12-07 18:05:02,496 INFO L630 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-12-07 18:05:02,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-12-07 18:05:02,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 90. [2019-12-07 18:05:02,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-12-07 18:05:02,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 112 transitions. [2019-12-07 18:05:02,504 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 112 transitions. Word has length 24 [2019-12-07 18:05:02,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:02,504 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 112 transitions. [2019-12-07 18:05:02,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:05:02,504 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 112 transitions. [2019-12-07 18:05:02,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 18:05:02,505 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:02,505 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:05:02,705 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:05:02,706 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:02,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:02,706 INFO L82 PathProgramCache]: Analyzing trace with hash 802880644, now seen corresponding path program 3 times [2019-12-07 18:05:02,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:02,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121254218] [2019-12-07 18:05:02,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:02,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:03,068 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:03,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121254218] [2019-12-07 18:05:03,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074830442] [2019-12-07 18:05:03,069 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5a873d6-a9ae-4cd8-bd7c-404884b999c7/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-12-07 18:05:03,096 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-07 18:05:03,096 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:05:03,097 INFO L264 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 29 conjunts are in the unsatisfiable core [2019-12-07 18:05:03,098 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:05:03,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:03,112 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:03,113 INFO L377 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-12-07 18:05:03,113 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:03,121 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:03,121 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:03,121 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2019-12-07 18:05:03,232 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:03,233 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:05:03,233 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:03,234 INFO L377 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-12-07 18:05:03,234 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:03,249 INFO L614 ElimStorePlain]: treesize reduction 12, result has 76.9 percent of original size [2019-12-07 18:05:03,249 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:03,249 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:65, output treesize:32 [2019-12-07 18:05:03,326 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:03,327 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:03,328 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:03,329 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:03,329 INFO L377 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-12-07 18:05:03,329 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:03,335 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:03,335 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:03,335 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2019-12-07 18:05:03,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:03,364 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:03,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:05:03,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 23 [2019-12-07 18:05:03,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5524219] [2019-12-07 18:05:03,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 18:05:03,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:03,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 18:05:03,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2019-12-07 18:05:03,366 INFO L87 Difference]: Start difference. First operand 90 states and 112 transitions. Second operand 23 states. [2019-12-07 18:05:03,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:03,877 INFO L93 Difference]: Finished difference Result 134 states and 162 transitions. [2019-12-07 18:05:03,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 18:05:03,878 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 24 [2019-12-07 18:05:03,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:03,879 INFO L225 Difference]: With dead ends: 134 [2019-12-07 18:05:03,879 INFO L226 Difference]: Without dead ends: 132 [2019-12-07 18:05:03,879 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 12 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=206, Invalid=984, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 18:05:03,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-12-07 18:05:03,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 93. [2019-12-07 18:05:03,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-12-07 18:05:03,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 116 transitions. [2019-12-07 18:05:03,887 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 116 transitions. Word has length 24 [2019-12-07 18:05:03,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:03,887 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 116 transitions. [2019-12-07 18:05:03,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-07 18:05:03,888 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 116 transitions. [2019-12-07 18:05:03,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 18:05:03,888 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:03,889 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 18:05:04,089 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:05:04,090 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:04,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:04,091 INFO L82 PathProgramCache]: Analyzing trace with hash 519508641, now seen corresponding path program 3 times [2019-12-07 18:05:04,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:04,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936744161] [2019-12-07 18:05:04,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:04,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:04,212 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:04,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936744161] [2019-12-07 18:05:04,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043528698] [2019-12-07 18:05:04,212 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5a873d6-a9ae-4cd8-bd7c-404884b999c7/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-12-07 18:05:04,242 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 18:05:04,242 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:05:04,242 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 18:05:04,244 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:05:04,296 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:04,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:05:04,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2019-12-07 18:05:04,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908691307] [2019-12-07 18:05:04,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 18:05:04,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:04,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 18:05:04,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:05:04,297 INFO L87 Difference]: Start difference. First operand 93 states and 116 transitions. Second operand 12 states. [2019-12-07 18:05:04,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:04,411 INFO L93 Difference]: Finished difference Result 172 states and 213 transitions. [2019-12-07 18:05:04,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:05:04,412 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2019-12-07 18:05:04,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:04,412 INFO L225 Difference]: With dead ends: 172 [2019-12-07 18:05:04,413 INFO L226 Difference]: Without dead ends: 156 [2019-12-07 18:05:04,413 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-12-07 18:05:04,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-12-07 18:05:04,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 113. [2019-12-07 18:05:04,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-12-07 18:05:04,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 140 transitions. [2019-12-07 18:05:04,420 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 140 transitions. Word has length 27 [2019-12-07 18:05:04,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:04,421 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 140 transitions. [2019-12-07 18:05:04,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 18:05:04,421 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 140 transitions. [2019-12-07 18:05:04,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 18:05:04,421 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:04,421 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:05:04,622 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:05:04,623 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:04,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:04,624 INFO L82 PathProgramCache]: Analyzing trace with hash 862655954, now seen corresponding path program 1 times [2019-12-07 18:05:04,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:04,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655626672] [2019-12-07 18:05:04,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:04,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:04,859 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:04,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655626672] [2019-12-07 18:05:04,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207807083] [2019-12-07 18:05:04,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5a873d6-a9ae-4cd8-bd7c-404884b999c7/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-12-07 18:05:04,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:04,883 INFO L264 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-07 18:05:04,885 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:05:04,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:04,967 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:04,968 INFO L377 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-12-07 18:05:04,968 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:04,973 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:04,973 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:04,973 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:41 [2019-12-07 18:05:05,074 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:05,074 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:05:05,075 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:05,075 INFO L377 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-12-07 18:05:05,076 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:05,088 INFO L614 ElimStorePlain]: treesize reduction 12, result has 71.4 percent of original size [2019-12-07 18:05:05,088 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:05,088 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:21 [2019-12-07 18:05:05,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:05,206 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:05,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:05:05,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2019-12-07 18:05:05,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094469723] [2019-12-07 18:05:05,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-07 18:05:05,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:05,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-07 18:05:05,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=775, Unknown=0, NotChecked=0, Total=870 [2019-12-07 18:05:05,207 INFO L87 Difference]: Start difference. First operand 113 states and 140 transitions. Second operand 30 states. [2019-12-07 18:05:05,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:05,679 INFO L93 Difference]: Finished difference Result 133 states and 164 transitions. [2019-12-07 18:05:05,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 18:05:05,680 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 28 [2019-12-07 18:05:05,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:05,680 INFO L225 Difference]: With dead ends: 133 [2019-12-07 18:05:05,680 INFO L226 Difference]: Without dead ends: 124 [2019-12-07 18:05:05,681 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=214, Invalid=1508, Unknown=0, NotChecked=0, Total=1722 [2019-12-07 18:05:05,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-12-07 18:05:05,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 110. [2019-12-07 18:05:05,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-12-07 18:05:05,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 136 transitions. [2019-12-07 18:05:05,688 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 136 transitions. Word has length 28 [2019-12-07 18:05:05,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:05,688 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 136 transitions. [2019-12-07 18:05:05,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-07 18:05:05,688 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 136 transitions. [2019-12-07 18:05:05,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 18:05:05,688 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:05,688 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:05:05,889 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:05:05,889 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:05,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:05,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1474562622, now seen corresponding path program 4 times [2019-12-07 18:05:05,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:05,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381614357] [2019-12-07 18:05:05,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:05,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:06,062 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:06,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381614357] [2019-12-07 18:05:06,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651332582] [2019-12-07 18:05:06,062 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5a873d6-a9ae-4cd8-bd7c-404884b999c7/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-12-07 18:05:06,088 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 18:05:06,088 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:05:06,089 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 35 conjunts are in the unsatisfiable core [2019-12-07 18:05:06,090 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:05:06,116 INFO L377 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-12-07 18:05:06,116 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:06,120 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:06,120 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:06,120 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2019-12-07 18:05:06,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:06,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:06,204 INFO L377 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-12-07 18:05:06,204 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:06,210 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:06,210 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:06,210 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2019-12-07 18:05:06,268 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:06,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:06,270 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:06,270 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:06,270 INFO L377 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-12-07 18:05:06,271 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:06,276 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:06,276 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:06,276 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2019-12-07 18:05:06,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:06,375 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:06,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:05:06,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 28 [2019-12-07 18:05:06,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802807330] [2019-12-07 18:05:06,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-07 18:05:06,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:06,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-07 18:05:06,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2019-12-07 18:05:06,377 INFO L87 Difference]: Start difference. First operand 110 states and 136 transitions. Second operand 28 states. [2019-12-07 18:05:06,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:06,770 INFO L93 Difference]: Finished difference Result 170 states and 209 transitions. [2019-12-07 18:05:06,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 18:05:06,770 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 29 [2019-12-07 18:05:06,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:06,771 INFO L225 Difference]: With dead ends: 170 [2019-12-07 18:05:06,771 INFO L226 Difference]: Without dead ends: 148 [2019-12-07 18:05:06,772 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=234, Invalid=1172, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 18:05:06,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-12-07 18:05:06,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 125. [2019-12-07 18:05:06,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-12-07 18:05:06,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 154 transitions. [2019-12-07 18:05:06,781 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 154 transitions. Word has length 29 [2019-12-07 18:05:06,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:06,782 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 154 transitions. [2019-12-07 18:05:06,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-07 18:05:06,782 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 154 transitions. [2019-12-07 18:05:06,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 18:05:06,782 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:06,782 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:05:06,983 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:05:06,984 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:06,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:06,984 INFO L82 PathProgramCache]: Analyzing trace with hash 219109591, now seen corresponding path program 4 times [2019-12-07 18:05:06,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:06,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845695697] [2019-12-07 18:05:06,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:07,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:07,246 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:07,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845695697] [2019-12-07 18:05:07,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336153728] [2019-12-07 18:05:07,247 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5a873d6-a9ae-4cd8-bd7c-404884b999c7/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-12-07 18:05:07,275 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 18:05:07,276 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:05:07,277 INFO L264 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-07 18:05:07,278 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:05:07,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:07,352 INFO L343 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2019-12-07 18:05:07,352 INFO L377 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-12-07 18:05:07,352 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:07,357 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:07,357 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:07,357 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2019-12-07 18:05:07,483 INFO L343 Elim1Store]: treesize reduction 17, result has 85.8 percent of original size [2019-12-07 18:05:07,483 INFO L377 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-12-07 18:05:07,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:07,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:07,485 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:07,506 INFO L614 ElimStorePlain]: treesize reduction 128, result has 22.4 percent of original size [2019-12-07 18:05:07,507 INFO L534 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-12-07 18:05:07,507 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:61, output treesize:29 [2019-12-07 18:05:07,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:07,573 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 18:05:07,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:05:07,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 26 [2019-12-07 18:05:07,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671407514] [2019-12-07 18:05:07,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-07 18:05:07,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:07,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-07 18:05:07,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=564, Unknown=0, NotChecked=0, Total=650 [2019-12-07 18:05:07,574 INFO L87 Difference]: Start difference. First operand 125 states and 154 transitions. Second operand 26 states. [2019-12-07 18:05:09,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:09,753 INFO L93 Difference]: Finished difference Result 274 states and 343 transitions. [2019-12-07 18:05:09,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-12-07 18:05:09,754 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 29 [2019-12-07 18:05:09,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:09,757 INFO L225 Difference]: With dead ends: 274 [2019-12-07 18:05:09,757 INFO L226 Difference]: Without dead ends: 209 [2019-12-07 18:05:09,762 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2095 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=735, Invalid=5585, Unknown=0, NotChecked=0, Total=6320 [2019-12-07 18:05:09,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-12-07 18:05:09,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 152. [2019-12-07 18:05:09,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-12-07 18:05:09,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 185 transitions. [2019-12-07 18:05:09,786 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 185 transitions. Word has length 29 [2019-12-07 18:05:09,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:09,787 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 185 transitions. [2019-12-07 18:05:09,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-07 18:05:09,787 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 185 transitions. [2019-12-07 18:05:09,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 18:05:09,788 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:09,788 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:05:09,988 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:05:09,989 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:09,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:09,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1586454183, now seen corresponding path program 1 times [2019-12-07 18:05:09,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:09,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133015172] [2019-12-07 18:05:09,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:10,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:10,429 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:10,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133015172] [2019-12-07 18:05:10,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750446800] [2019-12-07 18:05:10,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5a873d6-a9ae-4cd8-bd7c-404884b999c7/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-12-07 18:05:10,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:10,453 INFO L264 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 29 conjunts are in the unsatisfiable core [2019-12-07 18:05:10,454 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:05:10,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:10,504 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:10,505 INFO L377 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-12-07 18:05:10,505 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:10,518 INFO L614 ElimStorePlain]: treesize reduction 5, result has 88.1 percent of original size [2019-12-07 18:05:10,518 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:10,518 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:34 [2019-12-07 18:05:10,589 INFO L377 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 32 treesize of output 25 [2019-12-07 18:05:10,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:10,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:10,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:10,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:10,600 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:10,600 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:10,601 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:10,602 INFO L377 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-12-07 18:05:10,602 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:10,605 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:10,605 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:10,610 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:10,610 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:10,610 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:17 [2019-12-07 18:05:10,647 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:10,648 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:10,649 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:10,649 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:10,649 INFO L377 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-12-07 18:05:10,650 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:10,655 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:10,655 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:10,655 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:17 [2019-12-07 18:05:10,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:10,681 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:05:10,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:05:10,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 23 [2019-12-07 18:05:10,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918933053] [2019-12-07 18:05:10,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 18:05:10,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:10,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 18:05:10,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2019-12-07 18:05:10,682 INFO L87 Difference]: Start difference. First operand 152 states and 185 transitions. Second operand 23 states. [2019-12-07 18:05:11,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:11,359 INFO L93 Difference]: Finished difference Result 288 states and 350 transitions. [2019-12-07 18:05:11,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 18:05:11,359 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 30 [2019-12-07 18:05:11,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:11,360 INFO L225 Difference]: With dead ends: 288 [2019-12-07 18:05:11,360 INFO L226 Difference]: Without dead ends: 259 [2019-12-07 18:05:11,361 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 17 SyntacticMatches, 9 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=303, Invalid=1419, Unknown=0, NotChecked=0, Total=1722 [2019-12-07 18:05:11,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-12-07 18:05:11,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 175. [2019-12-07 18:05:11,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-12-07 18:05:11,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 216 transitions. [2019-12-07 18:05:11,373 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 216 transitions. Word has length 30 [2019-12-07 18:05:11,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:11,373 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 216 transitions. [2019-12-07 18:05:11,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-07 18:05:11,374 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 216 transitions. [2019-12-07 18:05:11,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 18:05:11,374 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:11,374 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:05:11,575 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:05:11,575 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:11,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:11,576 INFO L82 PathProgramCache]: Analyzing trace with hash -828731857, now seen corresponding path program 2 times [2019-12-07 18:05:11,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:11,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825576234] [2019-12-07 18:05:11,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:11,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:11,855 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:11,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825576234] [2019-12-07 18:05:11,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110411349] [2019-12-07 18:05:11,855 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5a873d6-a9ae-4cd8-bd7c-404884b999c7/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-12-07 18:05:11,881 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:05:11,881 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:05:11,882 INFO L264 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 29 conjunts are in the unsatisfiable core [2019-12-07 18:05:11,883 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:05:11,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:12,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:12,019 INFO L377 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 29 treesize of output 28 [2019-12-07 18:05:12,019 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:12,025 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:12,026 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:12,026 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2019-12-07 18:05:12,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:12,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:12,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:12,085 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:12,085 INFO L377 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-12-07 18:05:12,085 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:12,090 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:12,091 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:12,091 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:17 [2019-12-07 18:05:12,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:12,117 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:12,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:05:12,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 24 [2019-12-07 18:05:12,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585225560] [2019-12-07 18:05:12,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-07 18:05:12,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:12,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-07 18:05:12,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2019-12-07 18:05:12,118 INFO L87 Difference]: Start difference. First operand 175 states and 216 transitions. Second operand 24 states. [2019-12-07 18:05:13,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:13,078 INFO L93 Difference]: Finished difference Result 322 states and 399 transitions. [2019-12-07 18:05:13,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-07 18:05:13,078 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 30 [2019-12-07 18:05:13,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:13,079 INFO L225 Difference]: With dead ends: 322 [2019-12-07 18:05:13,079 INFO L226 Difference]: Without dead ends: 251 [2019-12-07 18:05:13,080 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=436, Invalid=2114, Unknown=0, NotChecked=0, Total=2550 [2019-12-07 18:05:13,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-12-07 18:05:13,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 172. [2019-12-07 18:05:13,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-12-07 18:05:13,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 212 transitions. [2019-12-07 18:05:13,091 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 212 transitions. Word has length 30 [2019-12-07 18:05:13,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:13,092 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 212 transitions. [2019-12-07 18:05:13,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-07 18:05:13,092 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 212 transitions. [2019-12-07 18:05:13,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 18:05:13,092 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:13,092 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:05:13,292 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:05:13,293 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:13,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:13,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1196943461, now seen corresponding path program 3 times [2019-12-07 18:05:13,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:13,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044198764] [2019-12-07 18:05:13,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:13,724 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:13,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044198764] [2019-12-07 18:05:13,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454551513] [2019-12-07 18:05:13,724 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5a873d6-a9ae-4cd8-bd7c-404884b999c7/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-12-07 18:05:13,762 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-12-07 18:05:13,762 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:05:13,763 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 36 conjunts are in the unsatisfiable core [2019-12-07 18:05:13,764 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:05:13,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:13,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:13,845 INFO L377 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-12-07 18:05:13,845 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:13,851 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:13,852 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:13,852 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2019-12-07 18:05:13,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:13,896 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:13,896 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:13,897 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:13,897 INFO L377 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-12-07 18:05:13,897 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:13,907 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:13,908 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:13,908 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:20 [2019-12-07 18:05:13,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:13,989 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:13,990 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:13,990 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:13,990 INFO L377 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-12-07 18:05:13,991 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:13,996 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:13,996 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:13,996 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:25 [2019-12-07 18:05:14,050 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:14,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:14,052 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:14,053 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:14,053 INFO L377 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-12-07 18:05:14,053 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:14,058 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:14,059 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:14,059 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:17 [2019-12-07 18:05:14,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:14,091 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:14,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:05:14,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 27 [2019-12-07 18:05:14,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106666265] [2019-12-07 18:05:14,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-07 18:05:14,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:14,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-07 18:05:14,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2019-12-07 18:05:14,093 INFO L87 Difference]: Start difference. First operand 172 states and 212 transitions. Second operand 27 states. [2019-12-07 18:05:15,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:15,538 INFO L93 Difference]: Finished difference Result 318 states and 392 transitions. [2019-12-07 18:05:15,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 18:05:15,539 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 31 [2019-12-07 18:05:15,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:15,543 INFO L225 Difference]: With dead ends: 318 [2019-12-07 18:05:15,544 INFO L226 Difference]: Without dead ends: 267 [2019-12-07 18:05:15,546 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 19 SyntacticMatches, 6 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=335, Invalid=1735, Unknown=0, NotChecked=0, Total=2070 [2019-12-07 18:05:15,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-12-07 18:05:15,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 192. [2019-12-07 18:05:15,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-12-07 18:05:15,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 237 transitions. [2019-12-07 18:05:15,571 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 237 transitions. Word has length 31 [2019-12-07 18:05:15,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:15,571 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 237 transitions. [2019-12-07 18:05:15,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-07 18:05:15,572 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 237 transitions. [2019-12-07 18:05:15,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 18:05:15,572 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:15,572 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 18:05:15,772 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:05:15,773 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:15,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:15,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1597202772, now seen corresponding path program 5 times [2019-12-07 18:05:15,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:15,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65095155] [2019-12-07 18:05:15,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:15,976 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:15,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65095155] [2019-12-07 18:05:15,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412486582] [2019-12-07 18:05:15,976 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5a873d6-a9ae-4cd8-bd7c-404884b999c7/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-12-07 18:05:16,013 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-12-07 18:05:16,014 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:05:16,014 INFO L264 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 36 conjunts are in the unsatisfiable core [2019-12-07 18:05:16,015 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:05:16,059 INFO L377 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-12-07 18:05:16,059 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:16,063 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:16,063 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:16,063 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2019-12-07 18:05:16,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:16,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:16,137 INFO L377 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-12-07 18:05:16,137 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:16,141 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:16,141 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:16,141 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-12-07 18:05:16,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:16,265 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:16,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:05:16,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2019-12-07 18:05:16,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424364730] [2019-12-07 18:05:16,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-07 18:05:16,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:16,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-07 18:05:16,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=669, Unknown=0, NotChecked=0, Total=756 [2019-12-07 18:05:16,267 INFO L87 Difference]: Start difference. First operand 192 states and 237 transitions. Second operand 28 states. [2019-12-07 18:05:18,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:18,185 INFO L93 Difference]: Finished difference Result 419 states and 518 transitions. [2019-12-07 18:05:18,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 18:05:18,185 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 33 [2019-12-07 18:05:18,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:18,186 INFO L225 Difference]: With dead ends: 419 [2019-12-07 18:05:18,186 INFO L226 Difference]: Without dead ends: 344 [2019-12-07 18:05:18,187 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=240, Invalid=1482, Unknown=0, NotChecked=0, Total=1722 [2019-12-07 18:05:18,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-12-07 18:05:18,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 229. [2019-12-07 18:05:18,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-12-07 18:05:18,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 283 transitions. [2019-12-07 18:05:18,205 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 283 transitions. Word has length 33 [2019-12-07 18:05:18,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:18,205 INFO L462 AbstractCegarLoop]: Abstraction has 229 states and 283 transitions. [2019-12-07 18:05:18,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-07 18:05:18,205 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 283 transitions. [2019-12-07 18:05:18,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 18:05:18,206 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:18,206 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:05:18,406 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:05:18,407 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:18,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:18,407 INFO L82 PathProgramCache]: Analyzing trace with hash -629949587, now seen corresponding path program 1 times [2019-12-07 18:05:18,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:18,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420773928] [2019-12-07 18:05:18,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:18,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:19,284 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:19,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420773928] [2019-12-07 18:05:19,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030687540] [2019-12-07 18:05:19,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5a873d6-a9ae-4cd8-bd7c-404884b999c7/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-12-07 18:05:19,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:19,326 INFO L264 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 42 conjunts are in the unsatisfiable core [2019-12-07 18:05:19,328 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:05:19,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:19,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:19,471 INFO L377 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-12-07 18:05:19,471 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:19,495 INFO L614 ElimStorePlain]: treesize reduction 5, result has 88.1 percent of original size [2019-12-07 18:05:19,495 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:19,496 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:34 [2019-12-07 18:05:19,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:19,541 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:19,542 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:19,543 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:19,543 INFO L377 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-12-07 18:05:19,543 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:19,550 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:19,550 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:19,550 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:46 [2019-12-07 18:05:19,728 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:19,729 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:05:19,730 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:19,730 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:19,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:19,732 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:19,733 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:05:19,734 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:19,734 INFO L377 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 61 treesize of output 63 [2019-12-07 18:05:19,734 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:19,753 INFO L614 ElimStorePlain]: treesize reduction 42, result has 57.1 percent of original size [2019-12-07 18:05:19,754 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:05:19,754 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:81, output treesize:56 [2019-12-07 18:05:19,987 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:19,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:19,989 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:05:19,990 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:19,990 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:19,990 INFO L377 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 58 treesize of output 54 [2019-12-07 18:05:19,991 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:20,011 INFO L614 ElimStorePlain]: treesize reduction 12, result has 82.1 percent of original size [2019-12-07 18:05:20,012 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:05:20,012 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:80, output treesize:39 [2019-12-07 18:05:20,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:20,163 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:20,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:05:20,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 37 [2019-12-07 18:05:20,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466626853] [2019-12-07 18:05:20,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-12-07 18:05:20,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:20,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-12-07 18:05:20,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1208, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 18:05:20,164 INFO L87 Difference]: Start difference. First operand 229 states and 283 transitions. Second operand 37 states. [2019-12-07 18:05:20,965 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 18 [2019-12-07 18:05:21,187 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-12-07 18:05:22,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:22,577 INFO L93 Difference]: Finished difference Result 269 states and 327 transitions. [2019-12-07 18:05:22,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-07 18:05:22,578 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 33 [2019-12-07 18:05:22,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:22,579 INFO L225 Difference]: With dead ends: 269 [2019-12-07 18:05:22,579 INFO L226 Difference]: Without dead ends: 260 [2019-12-07 18:05:22,580 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 939 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=360, Invalid=3062, Unknown=0, NotChecked=0, Total=3422 [2019-12-07 18:05:22,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-12-07 18:05:22,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 242. [2019-12-07 18:05:22,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-12-07 18:05:22,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 297 transitions. [2019-12-07 18:05:22,597 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 297 transitions. Word has length 33 [2019-12-07 18:05:22,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:22,597 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 297 transitions. [2019-12-07 18:05:22,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-12-07 18:05:22,598 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 297 transitions. [2019-12-07 18:05:22,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 18:05:22,598 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:22,598 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:05:22,798 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:05:22,799 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:22,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:22,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1109632707, now seen corresponding path program 1 times [2019-12-07 18:05:22,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:22,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963738368] [2019-12-07 18:05:22,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:22,963 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:22,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963738368] [2019-12-07 18:05:22,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115012653] [2019-12-07 18:05:22,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5a873d6-a9ae-4cd8-bd7c-404884b999c7/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-12-07 18:05:22,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:22,994 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-07 18:05:22,995 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:05:23,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:23,128 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:23,129 INFO L377 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-12-07 18:05:23,129 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:23,135 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:23,136 INFO L534 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-12-07 18:05:23,136 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2019-12-07 18:05:23,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:23,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:23,276 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:23,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:05:23,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2019-12-07 18:05:23,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048902442] [2019-12-07 18:05:23,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-07 18:05:23,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:23,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-07 18:05:23,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=653, Unknown=0, NotChecked=0, Total=756 [2019-12-07 18:05:23,277 INFO L87 Difference]: Start difference. First operand 242 states and 297 transitions. Second operand 28 states. [2019-12-07 18:05:24,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:24,574 INFO L93 Difference]: Finished difference Result 606 states and 752 transitions. [2019-12-07 18:05:24,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-07 18:05:24,574 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 34 [2019-12-07 18:05:24,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:24,576 INFO L225 Difference]: With dead ends: 606 [2019-12-07 18:05:24,576 INFO L226 Difference]: Without dead ends: 514 [2019-12-07 18:05:24,577 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=804, Invalid=4308, Unknown=0, NotChecked=0, Total=5112 [2019-12-07 18:05:24,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-12-07 18:05:24,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 270. [2019-12-07 18:05:24,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-12-07 18:05:24,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 332 transitions. [2019-12-07 18:05:24,599 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 332 transitions. Word has length 34 [2019-12-07 18:05:24,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:24,599 INFO L462 AbstractCegarLoop]: Abstraction has 270 states and 332 transitions. [2019-12-07 18:05:24,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-07 18:05:24,599 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 332 transitions. [2019-12-07 18:05:24,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 18:05:24,599 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:24,599 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:05:24,800 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:05:24,800 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:24,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:24,800 INFO L82 PathProgramCache]: Analyzing trace with hash -835418939, now seen corresponding path program 2 times [2019-12-07 18:05:24,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:24,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042512422] [2019-12-07 18:05:24,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:24,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:25,018 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:25,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042512422] [2019-12-07 18:05:25,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114854681] [2019-12-07 18:05:25,018 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5a873d6-a9ae-4cd8-bd7c-404884b999c7/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-12-07 18:05:25,045 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:05:25,045 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:05:25,046 INFO L264 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 38 conjunts are in the unsatisfiable core [2019-12-07 18:05:25,047 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:05:25,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:25,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:25,141 INFO L377 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-12-07 18:05:25,141 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:25,147 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:25,147 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:25,148 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:46 [2019-12-07 18:05:25,262 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:25,262 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:05:25,263 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:25,263 INFO L377 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-12-07 18:05:25,263 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:25,278 INFO L614 ElimStorePlain]: treesize reduction 12, result has 76.9 percent of original size [2019-12-07 18:05:25,279 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:25,279 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:32 [2019-12-07 18:05:25,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:25,355 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:25,356 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:25,356 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:25,356 INFO L377 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-12-07 18:05:25,357 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:25,361 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:25,361 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:25,361 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:21 [2019-12-07 18:05:25,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:25,493 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:25,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:05:25,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 33 [2019-12-07 18:05:25,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124966082] [2019-12-07 18:05:25,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-07 18:05:25,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:25,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-07 18:05:25,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=920, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 18:05:25,496 INFO L87 Difference]: Start difference. First operand 270 states and 332 transitions. Second operand 33 states. [2019-12-07 18:05:26,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:26,533 INFO L93 Difference]: Finished difference Result 320 states and 387 transitions. [2019-12-07 18:05:26,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 18:05:26,535 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 34 [2019-12-07 18:05:26,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:26,539 INFO L225 Difference]: With dead ends: 320 [2019-12-07 18:05:26,539 INFO L226 Difference]: Without dead ends: 318 [2019-12-07 18:05:26,542 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=379, Invalid=2377, Unknown=0, NotChecked=0, Total=2756 [2019-12-07 18:05:26,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-12-07 18:05:26,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 273. [2019-12-07 18:05:26,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-12-07 18:05:26,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 337 transitions. [2019-12-07 18:05:26,584 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 337 transitions. Word has length 34 [2019-12-07 18:05:26,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:26,584 INFO L462 AbstractCegarLoop]: Abstraction has 273 states and 337 transitions. [2019-12-07 18:05:26,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-07 18:05:26,584 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 337 transitions. [2019-12-07 18:05:26,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 18:05:26,584 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:26,584 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:05:26,785 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:05:26,785 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:26,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:26,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1472355126, now seen corresponding path program 1 times [2019-12-07 18:05:26,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:26,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535120051] [2019-12-07 18:05:26,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:26,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:27,031 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:27,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535120051] [2019-12-07 18:05:27,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702391554] [2019-12-07 18:05:27,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5a873d6-a9ae-4cd8-bd7c-404884b999c7/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-12-07 18:05:27,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:27,056 INFO L264 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-07 18:05:27,057 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:05:27,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:27,111 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:27,112 INFO L377 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-12-07 18:05:27,112 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:27,123 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:27,123 INFO L534 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-12-07 18:05:27,124 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:34 [2019-12-07 18:05:27,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:27,159 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:27,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:05:27,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 21 [2019-12-07 18:05:27,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664505820] [2019-12-07 18:05:27,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 18:05:27,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:27,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 18:05:27,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2019-12-07 18:05:27,160 INFO L87 Difference]: Start difference. First operand 273 states and 337 transitions. Second operand 21 states. [2019-12-07 18:05:28,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:28,512 INFO L93 Difference]: Finished difference Result 519 states and 633 transitions. [2019-12-07 18:05:28,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-12-07 18:05:28,513 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 35 [2019-12-07 18:05:28,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:28,514 INFO L225 Difference]: With dead ends: 519 [2019-12-07 18:05:28,515 INFO L226 Difference]: Without dead ends: 460 [2019-12-07 18:05:28,516 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 28 SyntacticMatches, 5 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2133 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=885, Invalid=5121, Unknown=0, NotChecked=0, Total=6006 [2019-12-07 18:05:28,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-12-07 18:05:28,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 297. [2019-12-07 18:05:28,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-12-07 18:05:28,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 370 transitions. [2019-12-07 18:05:28,542 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 370 transitions. Word has length 35 [2019-12-07 18:05:28,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:28,543 INFO L462 AbstractCegarLoop]: Abstraction has 297 states and 370 transitions. [2019-12-07 18:05:28,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 18:05:28,543 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 370 transitions. [2019-12-07 18:05:28,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 18:05:28,543 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:28,543 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:05:28,744 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:05:28,744 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:28,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:28,745 INFO L82 PathProgramCache]: Analyzing trace with hash -703579894, now seen corresponding path program 5 times [2019-12-07 18:05:28,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:28,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510838328] [2019-12-07 18:05:28,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:28,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:29,127 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:29,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510838328] [2019-12-07 18:05:29,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698325466] [2019-12-07 18:05:29,127 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5a873d6-a9ae-4cd8-bd7c-404884b999c7/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-12-07 18:05:29,160 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-12-07 18:05:29,160 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:05:29,161 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-07 18:05:29,161 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:05:29,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:29,276 INFO L343 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2019-12-07 18:05:29,276 INFO L377 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-12-07 18:05:29,277 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:29,283 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:29,283 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:29,283 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2019-12-07 18:05:29,345 INFO L343 Elim1Store]: treesize reduction 60, result has 16.7 percent of original size [2019-12-07 18:05:29,345 INFO L377 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 2 case distinctions, treesize of input 52 treesize of output 33 [2019-12-07 18:05:29,345 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:29,351 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:29,352 INFO L534 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-12-07 18:05:29,352 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:67, output treesize:39 [2019-12-07 18:05:29,466 INFO L343 Elim1Store]: treesize reduction 18, result has 85.6 percent of original size [2019-12-07 18:05:29,467 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 124 [2019-12-07 18:05:29,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:29,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:29,468 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:29,488 INFO L614 ElimStorePlain]: treesize reduction 81, result has 38.6 percent of original size [2019-12-07 18:05:29,488 INFO L534 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-12-07 18:05:29,488 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:34 [2019-12-07 18:05:29,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:29,564 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 29 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:05:29,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:05:29,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 31 [2019-12-07 18:05:29,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087168898] [2019-12-07 18:05:29,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-07 18:05:29,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:29,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-07 18:05:29,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=802, Unknown=0, NotChecked=0, Total=930 [2019-12-07 18:05:29,565 INFO L87 Difference]: Start difference. First operand 297 states and 370 transitions. Second operand 31 states. [2019-12-07 18:05:32,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:32,055 INFO L93 Difference]: Finished difference Result 631 states and 783 transitions. [2019-12-07 18:05:32,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-12-07 18:05:32,055 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 35 [2019-12-07 18:05:32,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:32,057 INFO L225 Difference]: With dead ends: 631 [2019-12-07 18:05:32,057 INFO L226 Difference]: Without dead ends: 511 [2019-12-07 18:05:32,059 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2165 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=951, Invalid=6189, Unknown=0, NotChecked=0, Total=7140 [2019-12-07 18:05:32,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-12-07 18:05:32,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 299. [2019-12-07 18:05:32,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2019-12-07 18:05:32,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 370 transitions. [2019-12-07 18:05:32,083 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 370 transitions. Word has length 35 [2019-12-07 18:05:32,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:32,083 INFO L462 AbstractCegarLoop]: Abstraction has 299 states and 370 transitions. [2019-12-07 18:05:32,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-07 18:05:32,083 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 370 transitions. [2019-12-07 18:05:32,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 18:05:32,084 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:32,084 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:05:32,284 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:05:32,285 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:32,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:32,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1456121544, now seen corresponding path program 1 times [2019-12-07 18:05:32,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:32,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729569914] [2019-12-07 18:05:32,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:32,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:32,734 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:32,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729569914] [2019-12-07 18:05:32,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711046780] [2019-12-07 18:05:32,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5a873d6-a9ae-4cd8-bd7c-404884b999c7/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-12-07 18:05:32,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:32,760 INFO L264 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-07 18:05:32,761 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:05:32,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:32,810 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:32,811 INFO L377 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-12-07 18:05:32,811 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:32,820 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:32,821 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:32,821 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:53 [2019-12-07 18:05:32,940 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:32,941 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:05:32,942 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:32,942 INFO L377 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-12-07 18:05:32,942 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:32,958 INFO L614 ElimStorePlain]: treesize reduction 12, result has 76.9 percent of original size [2019-12-07 18:05:32,958 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:32,958 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:32 [2019-12-07 18:05:33,047 INFO L377 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-12-07 18:05:33,049 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:33,049 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:33,050 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:33,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:33,052 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:33,052 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:33,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:33,053 INFO L377 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-12-07 18:05:33,054 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:33,057 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:33,057 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:33,062 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:33,062 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:33,062 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:19 [2019-12-07 18:05:33,109 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:33,110 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:33,110 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:33,111 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:33,111 INFO L377 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-12-07 18:05:33,111 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:33,118 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:33,118 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:33,118 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2019-12-07 18:05:33,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:33,157 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 39 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:05:33,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:05:33,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 30 [2019-12-07 18:05:33,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981691612] [2019-12-07 18:05:33,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-07 18:05:33,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:33,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-07 18:05:33,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=699, Unknown=0, NotChecked=0, Total=870 [2019-12-07 18:05:33,158 INFO L87 Difference]: Start difference. First operand 299 states and 370 transitions. Second operand 30 states. [2019-12-07 18:05:34,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:34,279 INFO L93 Difference]: Finished difference Result 400 states and 486 transitions. [2019-12-07 18:05:34,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-07 18:05:34,279 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 35 [2019-12-07 18:05:34,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:34,281 INFO L225 Difference]: With dead ends: 400 [2019-12-07 18:05:34,281 INFO L226 Difference]: Without dead ends: 398 [2019-12-07 18:05:34,282 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 18 SyntacticMatches, 10 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=406, Invalid=2246, Unknown=0, NotChecked=0, Total=2652 [2019-12-07 18:05:34,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2019-12-07 18:05:34,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 298. [2019-12-07 18:05:34,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-12-07 18:05:34,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 369 transitions. [2019-12-07 18:05:34,307 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 369 transitions. Word has length 35 [2019-12-07 18:05:34,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:34,307 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 369 transitions. [2019-12-07 18:05:34,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-07 18:05:34,308 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 369 transitions. [2019-12-07 18:05:34,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 18:05:34,308 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:34,308 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2019-12-07 18:05:34,508 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:05:34,509 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:34,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:34,509 INFO L82 PathProgramCache]: Analyzing trace with hash -231391894, now seen corresponding path program 6 times [2019-12-07 18:05:34,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:34,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013243764] [2019-12-07 18:05:34,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:34,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:34,635 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:34,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013243764] [2019-12-07 18:05:34,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068328973] [2019-12-07 18:05:34,635 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5a873d6-a9ae-4cd8-bd7c-404884b999c7/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-12-07 18:05:34,674 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-12-07 18:05:34,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:05:34,675 INFO L264 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 18:05:34,675 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:05:34,739 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:34,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:05:34,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2019-12-07 18:05:34,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133539727] [2019-12-07 18:05:34,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 18:05:34,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:34,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 18:05:34,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-12-07 18:05:34,740 INFO L87 Difference]: Start difference. First operand 298 states and 369 transitions. Second operand 15 states. [2019-12-07 18:05:34,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:34,946 INFO L93 Difference]: Finished difference Result 499 states and 611 transitions. [2019-12-07 18:05:34,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 18:05:34,946 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2019-12-07 18:05:34,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:34,948 INFO L225 Difference]: With dead ends: 499 [2019-12-07 18:05:34,948 INFO L226 Difference]: Without dead ends: 479 [2019-12-07 18:05:34,948 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2019-12-07 18:05:34,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-12-07 18:05:34,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 332. [2019-12-07 18:05:34,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-12-07 18:05:34,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 409 transitions. [2019-12-07 18:05:34,980 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 409 transitions. Word has length 37 [2019-12-07 18:05:34,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:34,980 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 409 transitions. [2019-12-07 18:05:34,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 18:05:34,980 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 409 transitions. [2019-12-07 18:05:34,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 18:05:34,981 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:34,981 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:05:35,181 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:05:35,182 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:35,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:35,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1650333907, now seen corresponding path program 2 times [2019-12-07 18:05:35,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:35,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351581064] [2019-12-07 18:05:35,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:35,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:35,336 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:35,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351581064] [2019-12-07 18:05:35,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208709031] [2019-12-07 18:05:35,336 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5a873d6-a9ae-4cd8-bd7c-404884b999c7/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-12-07 18:05:35,362 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:05:35,363 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:05:35,363 INFO L264 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 35 conjunts are in the unsatisfiable core [2019-12-07 18:05:35,364 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:05:35,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:35,451 INFO L377 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-12-07 18:05:35,451 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:35,458 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:35,458 INFO L534 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-12-07 18:05:35,458 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:28 [2019-12-07 18:05:35,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:35,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:35,631 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:35,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:05:35,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2019-12-07 18:05:35,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057923400] [2019-12-07 18:05:35,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-07 18:05:35,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:35,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-07 18:05:35,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2019-12-07 18:05:35,632 INFO L87 Difference]: Start difference. First operand 332 states and 409 transitions. Second operand 26 states. [2019-12-07 18:05:36,257 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 24 [2019-12-07 18:05:36,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:36,995 INFO L93 Difference]: Finished difference Result 400 states and 485 transitions. [2019-12-07 18:05:36,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 18:05:36,996 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 38 [2019-12-07 18:05:36,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:36,997 INFO L225 Difference]: With dead ends: 400 [2019-12-07 18:05:36,997 INFO L226 Difference]: Without dead ends: 387 [2019-12-07 18:05:36,998 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=230, Invalid=1492, Unknown=0, NotChecked=0, Total=1722 [2019-12-07 18:05:36,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-12-07 18:05:37,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 327. [2019-12-07 18:05:37,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-12-07 18:05:37,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 400 transitions. [2019-12-07 18:05:37,027 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 400 transitions. Word has length 38 [2019-12-07 18:05:37,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:37,027 INFO L462 AbstractCegarLoop]: Abstraction has 327 states and 400 transitions. [2019-12-07 18:05:37,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-07 18:05:37,027 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 400 transitions. [2019-12-07 18:05:37,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 18:05:37,028 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:37,028 INFO L410 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:05:37,228 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:05:37,229 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:37,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:37,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1013617860, now seen corresponding path program 2 times [2019-12-07 18:05:37,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:37,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549568473] [2019-12-07 18:05:37,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:37,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:37,723 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:37,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549568473] [2019-12-07 18:05:37,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797092316] [2019-12-07 18:05:37,723 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5a873d6-a9ae-4cd8-bd7c-404884b999c7/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-12-07 18:05:37,749 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:05:37,749 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:05:37,750 INFO L264 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 45 conjunts are in the unsatisfiable core [2019-12-07 18:05:37,751 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:05:37,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:37,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:37,891 INFO L377 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-12-07 18:05:37,891 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:37,899 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:37,899 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:37,899 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:48 [2019-12-07 18:05:38,104 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:05:38,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:38,105 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:38,106 INFO L377 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-12-07 18:05:38,106 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:38,126 INFO L614 ElimStorePlain]: treesize reduction 17, result has 71.7 percent of original size [2019-12-07 18:05:38,126 INFO L534 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-12-07 18:05:38,126 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:35 [2019-12-07 18:05:38,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:38,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:38,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:38,239 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:38,239 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:38,240 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:05:38,241 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:38,241 INFO L377 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 47 treesize of output 55 [2019-12-07 18:05:38,241 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:38,257 INFO L614 ElimStorePlain]: treesize reduction 21, result has 72.4 percent of original size [2019-12-07 18:05:38,258 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:05:38,258 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:55 [2019-12-07 18:05:38,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:38,494 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:38,495 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:38,496 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:05:38,496 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:05:38,497 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:05:38,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:38,500 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:38,500 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 79 [2019-12-07 18:05:38,501 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:38,526 INFO L614 ElimStorePlain]: treesize reduction 38, result has 64.2 percent of original size [2019-12-07 18:05:38,527 INFO L534 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-12-07 18:05:38,527 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:80, output treesize:62 [2019-12-07 18:05:38,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:38,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:38,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:38,700 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:38,701 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:38,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:38,720 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:38,720 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 69 treesize of output 147 [2019-12-07 18:05:38,720 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:38,748 INFO L614 ElimStorePlain]: treesize reduction 73, result has 51.7 percent of original size [2019-12-07 18:05:38,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:38,749 INFO L534 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-12-07 18:05:38,749 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:66 [2019-12-07 18:05:38,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:38,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:38,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:38,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:39,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:39,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:39,172 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:39,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:05:39,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26] total 48 [2019-12-07 18:05:39,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078008486] [2019-12-07 18:05:39,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-12-07 18:05:39,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:39,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-12-07 18:05:39,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=2047, Unknown=0, NotChecked=0, Total=2256 [2019-12-07 18:05:39,173 INFO L87 Difference]: Start difference. First operand 327 states and 400 transitions. Second operand 48 states. [2019-12-07 18:05:40,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:40,976 INFO L93 Difference]: Finished difference Result 362 states and 436 transitions. [2019-12-07 18:05:40,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-07 18:05:40,976 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 38 [2019-12-07 18:05:40,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:40,978 INFO L225 Difference]: With dead ends: 362 [2019-12-07 18:05:40,978 INFO L226 Difference]: Without dead ends: 353 [2019-12-07 18:05:40,978 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1738 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=471, Invalid=4499, Unknown=0, NotChecked=0, Total=4970 [2019-12-07 18:05:40,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-12-07 18:05:41,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 314. [2019-12-07 18:05:41,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-12-07 18:05:41,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 385 transitions. [2019-12-07 18:05:41,010 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 385 transitions. Word has length 38 [2019-12-07 18:05:41,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:41,010 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 385 transitions. [2019-12-07 18:05:41,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-12-07 18:05:41,011 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 385 transitions. [2019-12-07 18:05:41,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 18:05:41,011 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:41,011 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 18:05:41,212 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:05:41,212 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:41,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:41,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1518821945, now seen corresponding path program 7 times [2019-12-07 18:05:41,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:41,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552129044] [2019-12-07 18:05:41,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:41,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:41,453 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:41,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552129044] [2019-12-07 18:05:41,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541051988] [2019-12-07 18:05:41,453 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5a873d6-a9ae-4cd8-bd7c-404884b999c7/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-12-07 18:05:41,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:41,488 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 39 conjunts are in the unsatisfiable core [2019-12-07 18:05:41,489 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:05:41,551 INFO L377 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-12-07 18:05:41,551 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:41,555 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:41,555 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:41,555 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2019-12-07 18:05:41,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:41,654 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:41,654 INFO L377 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-12-07 18:05:41,655 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:41,660 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:41,660 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:41,660 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2019-12-07 18:05:41,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:41,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:41,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:41,727 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:41,727 INFO L377 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-12-07 18:05:41,727 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:41,732 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:41,732 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:41,733 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2019-12-07 18:05:41,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:41,868 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:41,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:05:41,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 33 [2019-12-07 18:05:41,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63838785] [2019-12-07 18:05:41,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-07 18:05:41,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:41,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-07 18:05:41,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=933, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 18:05:41,869 INFO L87 Difference]: Start difference. First operand 314 states and 385 transitions. Second operand 33 states. [2019-12-07 18:05:42,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:42,512 INFO L93 Difference]: Finished difference Result 383 states and 462 transitions. [2019-12-07 18:05:42,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-07 18:05:42,512 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 39 [2019-12-07 18:05:42,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:42,513 INFO L225 Difference]: With dead ends: 383 [2019-12-07 18:05:42,513 INFO L226 Difference]: Without dead ends: 381 [2019-12-07 18:05:42,514 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 685 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=369, Invalid=2181, Unknown=0, NotChecked=0, Total=2550 [2019-12-07 18:05:42,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-12-07 18:05:42,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 331. [2019-12-07 18:05:42,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-12-07 18:05:42,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 405 transitions. [2019-12-07 18:05:42,547 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 405 transitions. Word has length 39 [2019-12-07 18:05:42,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:42,548 INFO L462 AbstractCegarLoop]: Abstraction has 331 states and 405 transitions. [2019-12-07 18:05:42,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-07 18:05:42,548 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 405 transitions. [2019-12-07 18:05:42,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 18:05:42,548 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:42,548 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:05:42,749 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:05:42,749 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:42,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:42,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1558500832, now seen corresponding path program 1 times [2019-12-07 18:05:42,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:42,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275015324] [2019-12-07 18:05:42,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:42,917 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:42,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275015324] [2019-12-07 18:05:42,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921572628] [2019-12-07 18:05:42,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5a873d6-a9ae-4cd8-bd7c-404884b999c7/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-12-07 18:05:42,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:42,949 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 35 conjunts are in the unsatisfiable core [2019-12-07 18:05:42,950 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:05:43,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:43,074 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:43,075 INFO L377 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-12-07 18:05:43,075 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:43,080 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:43,080 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:43,080 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:41 [2019-12-07 18:05:43,195 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:43,196 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:43,196 INFO L377 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 52 treesize of output 33 [2019-12-07 18:05:43,197 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:43,202 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:43,203 INFO L534 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-12-07 18:05:43,203 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:61, output treesize:33 [2019-12-07 18:05:43,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:43,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:43,362 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:43,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:05:43,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 32 [2019-12-07 18:05:43,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079406164] [2019-12-07 18:05:43,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-07 18:05:43,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:43,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-07 18:05:43,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=886, Unknown=0, NotChecked=0, Total=992 [2019-12-07 18:05:43,363 INFO L87 Difference]: Start difference. First operand 331 states and 405 transitions. Second operand 32 states. [2019-12-07 18:05:44,233 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2019-12-07 18:05:45,590 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2019-12-07 18:05:46,444 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2019-12-07 18:05:46,633 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2019-12-07 18:05:46,876 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2019-12-07 18:05:47,092 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2019-12-07 18:05:47,429 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2019-12-07 18:05:49,614 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2019-12-07 18:05:50,683 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2019-12-07 18:05:50,978 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 36 [2019-12-07 18:05:51,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:51,083 INFO L93 Difference]: Finished difference Result 619 states and 746 transitions. [2019-12-07 18:05:51,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-12-07 18:05:51,084 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 39 [2019-12-07 18:05:51,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:51,087 INFO L225 Difference]: With dead ends: 619 [2019-12-07 18:05:51,087 INFO L226 Difference]: Without dead ends: 559 [2019-12-07 18:05:51,089 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5005 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=1286, Invalid=12520, Unknown=0, NotChecked=0, Total=13806 [2019-12-07 18:05:51,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-12-07 18:05:51,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 377. [2019-12-07 18:05:51,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-12-07 18:05:51,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 463 transitions. [2019-12-07 18:05:51,134 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 463 transitions. Word has length 39 [2019-12-07 18:05:51,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:51,135 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 463 transitions. [2019-12-07 18:05:51,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-07 18:05:51,135 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 463 transitions. [2019-12-07 18:05:51,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 18:05:51,135 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:51,135 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:05:51,336 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:05:51,336 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:51,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:51,337 INFO L82 PathProgramCache]: Analyzing trace with hash 2060667424, now seen corresponding path program 3 times [2019-12-07 18:05:51,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:51,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099773310] [2019-12-07 18:05:51,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:51,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:52,069 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 26 [2019-12-07 18:05:53,135 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:53,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099773310] [2019-12-07 18:05:53,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408429646] [2019-12-07 18:05:53,136 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5a873d6-a9ae-4cd8-bd7c-404884b999c7/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-12-07 18:05:53,206 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-12-07 18:05:53,207 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:05:53,208 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 43 conjunts are in the unsatisfiable core [2019-12-07 18:05:53,209 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:05:53,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:53,222 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:53,222 INFO L377 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-12-07 18:05:53,222 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:53,227 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:53,228 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:53,228 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2019-12-07 18:05:53,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:53,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:53,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:53,287 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:53,287 INFO L377 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 41 treesize of output 34 [2019-12-07 18:05:53,287 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:53,293 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:53,293 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:53,294 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2019-12-07 18:05:53,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:53,402 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:53,403 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:53,404 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:53,406 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:53,431 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:53,431 INFO L377 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-12-07 18:05:53,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:53,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:53,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:53,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:53,433 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:53,486 INFO L614 ElimStorePlain]: treesize reduction 338, result has 19.5 percent of original size [2019-12-07 18:05:53,486 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:53,486 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:73, output treesize:82 [2019-12-07 18:05:53,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:53,711 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:05:53,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:53,713 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:53,714 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:53,714 INFO L377 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-12-07 18:05:53,714 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:53,734 INFO L614 ElimStorePlain]: treesize reduction 12, result has 78.9 percent of original size [2019-12-07 18:05:53,735 INFO L534 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-12-07 18:05:53,735 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:70, output treesize:38 [2019-12-07 18:05:53,817 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:53,818 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:53,819 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:53,819 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:53,820 INFO L377 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-12-07 18:05:53,820 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:53,825 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:53,825 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:53,825 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2019-12-07 18:05:53,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:53,924 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:53,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:05:53,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 37 [2019-12-07 18:05:53,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288977292] [2019-12-07 18:05:53,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-12-07 18:05:53,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:53,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-12-07 18:05:53,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1174, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 18:05:53,925 INFO L87 Difference]: Start difference. First operand 377 states and 463 transitions. Second operand 37 states. [2019-12-07 18:05:56,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:56,724 INFO L93 Difference]: Finished difference Result 498 states and 601 transitions. [2019-12-07 18:05:56,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-07 18:05:56,724 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 39 [2019-12-07 18:05:56,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:56,726 INFO L225 Difference]: With dead ends: 498 [2019-12-07 18:05:56,726 INFO L226 Difference]: Without dead ends: 489 [2019-12-07 18:05:56,726 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1388 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=500, Invalid=3790, Unknown=0, NotChecked=0, Total=4290 [2019-12-07 18:05:56,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2019-12-07 18:05:56,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 402. [2019-12-07 18:05:56,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2019-12-07 18:05:56,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 492 transitions. [2019-12-07 18:05:56,768 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 492 transitions. Word has length 39 [2019-12-07 18:05:56,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:56,768 INFO L462 AbstractCegarLoop]: Abstraction has 402 states and 492 transitions. [2019-12-07 18:05:56,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-12-07 18:05:56,768 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 492 transitions. [2019-12-07 18:05:56,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 18:05:56,769 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:56,769 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:05:56,969 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:05:56,970 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:56,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:56,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1077848874, now seen corresponding path program 3 times [2019-12-07 18:05:56,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:56,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247429094] [2019-12-07 18:05:56,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:56,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:57,220 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:57,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247429094] [2019-12-07 18:05:57,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876155118] [2019-12-07 18:05:57,220 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5a873d6-a9ae-4cd8-bd7c-404884b999c7/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-12-07 18:05:57,281 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-12-07 18:05:57,281 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:05:57,283 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 42 conjunts are in the unsatisfiable core [2019-12-07 18:05:57,283 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:05:57,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:57,381 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:57,381 INFO L377 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-12-07 18:05:57,382 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:57,386 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:57,387 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:57,387 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2019-12-07 18:05:57,455 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:57,456 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:57,457 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:57,457 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:57,458 INFO L377 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 37 treesize of output 39 [2019-12-07 18:05:57,458 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:57,463 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:57,463 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:57,463 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:28 [2019-12-07 18:05:57,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:57,547 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:57,548 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:57,548 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:57,548 INFO L377 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-12-07 18:05:57,549 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:57,552 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:57,553 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:57,553 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2019-12-07 18:05:57,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:57,673 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:57,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:05:57,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 33 [2019-12-07 18:05:57,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198125839] [2019-12-07 18:05:57,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-07 18:05:57,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:57,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-07 18:05:57,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=924, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 18:05:57,674 INFO L87 Difference]: Start difference. First operand 402 states and 492 transitions. Second operand 33 states. [2019-12-07 18:05:58,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:58,311 INFO L93 Difference]: Finished difference Result 566 states and 689 transitions. [2019-12-07 18:05:58,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 18:05:58,311 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 40 [2019-12-07 18:05:58,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:58,313 INFO L225 Difference]: With dead ends: 566 [2019-12-07 18:05:58,313 INFO L226 Difference]: Without dead ends: 509 [2019-12-07 18:05:58,313 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=295, Invalid=2057, Unknown=0, NotChecked=0, Total=2352 [2019-12-07 18:05:58,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2019-12-07 18:05:58,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 421. [2019-12-07 18:05:58,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-12-07 18:05:58,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 516 transitions. [2019-12-07 18:05:58,357 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 516 transitions. Word has length 40 [2019-12-07 18:05:58,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:58,357 INFO L462 AbstractCegarLoop]: Abstraction has 421 states and 516 transitions. [2019-12-07 18:05:58,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-07 18:05:58,357 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 516 transitions. [2019-12-07 18:05:58,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 18:05:58,358 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:58,358 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:05:58,558 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:05:58,559 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:05:58,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:58,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1570917360, now seen corresponding path program 4 times [2019-12-07 18:05:58,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:58,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242572731] [2019-12-07 18:05:58,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:58,805 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:58,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242572731] [2019-12-07 18:05:58,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584941823] [2019-12-07 18:05:58,806 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5a873d6-a9ae-4cd8-bd7c-404884b999c7/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-12-07 18:05:58,832 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 18:05:58,832 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:05:58,833 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 42 conjunts are in the unsatisfiable core [2019-12-07 18:05:58,834 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:05:58,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:58,984 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:58,985 INFO L377 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-12-07 18:05:58,985 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:58,993 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:58,993 INFO L534 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-12-07 18:05:58,993 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2019-12-07 18:05:59,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:59,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:59,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:05:59,085 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:59,085 INFO L377 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-12-07 18:05:59,085 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:59,092 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:59,092 INFO L534 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-12-07 18:05:59,092 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:30 [2019-12-07 18:05:59,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:59,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:59,255 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 3 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:59,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:05:59,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2019-12-07 18:05:59,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396192205] [2019-12-07 18:05:59,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-07 18:05:59,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:59,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-07 18:05:59,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=983, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 18:05:59,256 INFO L87 Difference]: Start difference. First operand 421 states and 516 transitions. Second operand 34 states. [2019-12-07 18:06:02,417 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 34 [2019-12-07 18:06:02,721 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-12-07 18:06:02,975 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 31 [2019-12-07 18:06:03,484 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2019-12-07 18:06:04,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:06:04,371 INFO L93 Difference]: Finished difference Result 823 states and 1015 transitions. [2019-12-07 18:06:04,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-07 18:06:04,372 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 40 [2019-12-07 18:06:04,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:06:04,374 INFO L225 Difference]: With dead ends: 823 [2019-12-07 18:06:04,374 INFO L226 Difference]: Without dead ends: 714 [2019-12-07 18:06:04,375 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2242 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=861, Invalid=6111, Unknown=0, NotChecked=0, Total=6972 [2019-12-07 18:06:04,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-12-07 18:06:04,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 507. [2019-12-07 18:06:04,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2019-12-07 18:06:04,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 625 transitions. [2019-12-07 18:06:04,428 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 625 transitions. Word has length 40 [2019-12-07 18:06:04,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:06:04,428 INFO L462 AbstractCegarLoop]: Abstraction has 507 states and 625 transitions. [2019-12-07 18:06:04,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-07 18:06:04,428 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 625 transitions. [2019-12-07 18:06:04,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 18:06:04,429 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:06:04,429 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:06:04,630 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:06:04,630 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:06:04,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:06:04,631 INFO L82 PathProgramCache]: Analyzing trace with hash -2121737413, now seen corresponding path program 2 times [2019-12-07 18:06:04,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:06:04,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964004408] [2019-12-07 18:06:04,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:06:04,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:06:05,350 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 11 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:06:05,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964004408] [2019-12-07 18:06:05,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429087089] [2019-12-07 18:06:05,351 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5a873d6-a9ae-4cd8-bd7c-404884b999c7/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-12-07 18:06:05,407 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:06:05,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:06:05,408 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 32 conjunts are in the unsatisfiable core [2019-12-07 18:06:05,410 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:06:05,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:06:05,504 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:05,505 INFO L377 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-12-07 18:06:05,505 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:06:05,515 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:05,515 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:06:05,516 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2019-12-07 18:06:05,622 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:05,623 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:05,624 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:05,626 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:05,626 INFO L377 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-12-07 18:06:05,626 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:06:05,639 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:05,640 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:06:05,640 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:31 [2019-12-07 18:06:05,768 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:05,770 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:05,771 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:05,773 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:05,773 INFO L377 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-12-07 18:06:05,773 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:06:05,788 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:05,789 INFO L534 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-12-07 18:06:05,789 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:31 [2019-12-07 18:06:05,943 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:05,944 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:05,945 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:05,946 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:05,947 INFO L377 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-12-07 18:06:05,947 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:06:05,957 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:05,957 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:06:05,957 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:17 [2019-12-07 18:06:05,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:06:06,038 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 7 proven. 56 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 18:06:06,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:06:06,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 30 [2019-12-07 18:06:06,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623309265] [2019-12-07 18:06:06,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-07 18:06:06,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:06:06,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-07 18:06:06,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=697, Unknown=0, NotChecked=0, Total=870 [2019-12-07 18:06:06,040 INFO L87 Difference]: Start difference. First operand 507 states and 625 transitions. Second operand 30 states. [2019-12-07 18:06:10,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:06:10,372 INFO L93 Difference]: Finished difference Result 849 states and 1022 transitions. [2019-12-07 18:06:10,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-12-07 18:06:10,373 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 41 [2019-12-07 18:06:10,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:06:10,376 INFO L225 Difference]: With dead ends: 849 [2019-12-07 18:06:10,376 INFO L226 Difference]: Without dead ends: 792 [2019-12-07 18:06:10,376 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 28 SyntacticMatches, 7 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1870 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=810, Invalid=4592, Unknown=0, NotChecked=0, Total=5402 [2019-12-07 18:06:10,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2019-12-07 18:06:10,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 501. [2019-12-07 18:06:10,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-12-07 18:06:10,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 617 transitions. [2019-12-07 18:06:10,430 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 617 transitions. Word has length 41 [2019-12-07 18:06:10,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:06:10,430 INFO L462 AbstractCegarLoop]: Abstraction has 501 states and 617 transitions. [2019-12-07 18:06:10,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-07 18:06:10,430 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 617 transitions. [2019-12-07 18:06:10,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 18:06:10,431 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:06:10,431 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:06:10,631 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:06:10,632 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:06:10,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:06:10,633 INFO L82 PathProgramCache]: Analyzing trace with hash -2136702275, now seen corresponding path program 2 times [2019-12-07 18:06:10,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:06:10,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86469443] [2019-12-07 18:06:10,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:06:10,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:06:10,889 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 14 proven. 51 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 18:06:10,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86469443] [2019-12-07 18:06:10,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971574007] [2019-12-07 18:06:10,890 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5a873d6-a9ae-4cd8-bd7c-404884b999c7/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-12-07 18:06:10,917 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:06:10,917 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:06:10,918 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 30 conjunts are in the unsatisfiable core [2019-12-07 18:06:10,919 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:06:11,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:06:11,092 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:11,093 INFO L377 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-12-07 18:06:11,093 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:06:11,101 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:11,101 INFO L534 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-12-07 18:06:11,101 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2019-12-07 18:06:11,184 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:11,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:11,186 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:11,186 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:11,186 INFO L377 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-12-07 18:06:11,187 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:06:11,192 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:11,192 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:06:11,192 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:17 [2019-12-07 18:06:11,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:06:11,222 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 11 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:06:11,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:06:11,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 27 [2019-12-07 18:06:11,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109246122] [2019-12-07 18:06:11,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-07 18:06:11,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:06:11,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-07 18:06:11,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=571, Unknown=0, NotChecked=0, Total=702 [2019-12-07 18:06:11,223 INFO L87 Difference]: Start difference. First operand 501 states and 617 transitions. Second operand 27 states. [2019-12-07 18:06:13,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:06:13,257 INFO L93 Difference]: Finished difference Result 755 states and 928 transitions. [2019-12-07 18:06:13,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-07 18:06:13,257 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 41 [2019-12-07 18:06:13,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:06:13,260 INFO L225 Difference]: With dead ends: 755 [2019-12-07 18:06:13,260 INFO L226 Difference]: Without dead ends: 675 [2019-12-07 18:06:13,260 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 753 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=519, Invalid=2237, Unknown=0, NotChecked=0, Total=2756 [2019-12-07 18:06:13,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2019-12-07 18:06:13,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 530. [2019-12-07 18:06:13,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2019-12-07 18:06:13,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 653 transitions. [2019-12-07 18:06:13,315 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 653 transitions. Word has length 41 [2019-12-07 18:06:13,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:06:13,316 INFO L462 AbstractCegarLoop]: Abstraction has 530 states and 653 transitions. [2019-12-07 18:06:13,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-07 18:06:13,316 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 653 transitions. [2019-12-07 18:06:13,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 18:06:13,316 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:06:13,316 INFO L410 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:06:13,517 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:06:13,517 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:06:13,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:06:13,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1338226917, now seen corresponding path program 2 times [2019-12-07 18:06:13,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:06:13,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982546983] [2019-12-07 18:06:13,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:06:13,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:06:14,293 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 2 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:06:14,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982546983] [2019-12-07 18:06:14,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748357247] [2019-12-07 18:06:14,293 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5a873d6-a9ae-4cd8-bd7c-404884b999c7/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-12-07 18:06:14,321 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:06:14,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:06:14,322 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 42 conjunts are in the unsatisfiable core [2019-12-07 18:06:14,323 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:06:14,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:06:14,384 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:14,384 INFO L377 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-12-07 18:06:14,384 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:06:14,392 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:14,392 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:06:14,392 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2019-12-07 18:06:14,571 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:14,571 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:06:14,572 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:14,572 INFO L377 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-12-07 18:06:14,572 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:06:14,587 INFO L614 ElimStorePlain]: treesize reduction 12, result has 76.9 percent of original size [2019-12-07 18:06:14,587 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:06:14,587 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:65, output treesize:32 [2019-12-07 18:06:14,636 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:14,636 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:14,637 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:14,637 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:14,638 INFO L377 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-12-07 18:06:14,638 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:06:14,643 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:14,643 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:06:14,643 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:27 [2019-12-07 18:06:14,700 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:14,701 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:14,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:14,703 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:14,703 INFO L377 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-12-07 18:06:14,703 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:06:14,708 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:14,708 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:06:14,708 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:27 [2019-12-07 18:06:14,790 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:14,790 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:14,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:14,792 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:14,792 INFO L377 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-12-07 18:06:14,792 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:06:14,796 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:14,796 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:06:14,796 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2019-12-07 18:06:14,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:06:14,842 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:06:14,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:06:14,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 35 [2019-12-07 18:06:14,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909796637] [2019-12-07 18:06:14,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-07 18:06:14,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:06:14,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-07 18:06:14,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1042, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 18:06:14,843 INFO L87 Difference]: Start difference. First operand 530 states and 653 transitions. Second operand 35 states. [2019-12-07 18:06:17,227 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 34 [2019-12-07 18:06:18,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:06:18,416 INFO L93 Difference]: Finished difference Result 776 states and 944 transitions. [2019-12-07 18:06:18,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-12-07 18:06:18,417 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 41 [2019-12-07 18:06:18,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:06:18,420 INFO L225 Difference]: With dead ends: 776 [2019-12-07 18:06:18,420 INFO L226 Difference]: Without dead ends: 711 [2019-12-07 18:06:18,421 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1826 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=685, Invalid=4865, Unknown=0, NotChecked=0, Total=5550 [2019-12-07 18:06:18,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-12-07 18:06:18,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 542. [2019-12-07 18:06:18,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-12-07 18:06:18,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 668 transitions. [2019-12-07 18:06:18,481 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 668 transitions. Word has length 41 [2019-12-07 18:06:18,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:06:18,482 INFO L462 AbstractCegarLoop]: Abstraction has 542 states and 668 transitions. [2019-12-07 18:06:18,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-12-07 18:06:18,482 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 668 transitions. [2019-12-07 18:06:18,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 18:06:18,482 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:06:18,482 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2019-12-07 18:06:18,683 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:06:18,683 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:06:18,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:06:18,684 INFO L82 PathProgramCache]: Analyzing trace with hash -506394531, now seen corresponding path program 8 times [2019-12-07 18:06:18,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:06:18,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032776465] [2019-12-07 18:06:18,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:06:18,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:06:18,887 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:06:18,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032776465] [2019-12-07 18:06:18,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840421129] [2019-12-07 18:06:18,887 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5a873d6-a9ae-4cd8-bd7c-404884b999c7/bin/uautomizer/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:06:18,923 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:06:18,923 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:06:18,924 INFO L264 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 40 conjunts are in the unsatisfiable core [2019-12-07 18:06:18,925 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:06:18,984 INFO L377 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-12-07 18:06:18,985 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:06:18,989 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:18,989 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:06:18,989 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2019-12-07 18:06:19,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:06:19,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:19,083 INFO L377 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-12-07 18:06:19,083 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:06:19,087 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:19,088 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:06:19,088 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-12-07 18:06:19,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:06:19,781 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:06:19,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:06:19,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 31 [2019-12-07 18:06:19,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114029558] [2019-12-07 18:06:19,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-07 18:06:19,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:06:19,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-07 18:06:19,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=837, Unknown=0, NotChecked=0, Total=930 [2019-12-07 18:06:19,783 INFO L87 Difference]: Start difference. First operand 542 states and 668 transitions. Second operand 31 states. [2019-12-07 18:06:20,883 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 22 [2019-12-07 18:06:21,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:06:21,625 INFO L93 Difference]: Finished difference Result 873 states and 1066 transitions. [2019-12-07 18:06:21,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-07 18:06:21,626 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 43 [2019-12-07 18:06:21,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:06:21,629 INFO L225 Difference]: With dead ends: 873 [2019-12-07 18:06:21,629 INFO L226 Difference]: Without dead ends: 871 [2019-12-07 18:06:21,629 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=303, Invalid=2147, Unknown=0, NotChecked=0, Total=2450 [2019-12-07 18:06:21,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2019-12-07 18:06:21,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 626. [2019-12-07 18:06:21,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-12-07 18:06:21,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 774 transitions. [2019-12-07 18:06:21,706 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 774 transitions. Word has length 43 [2019-12-07 18:06:21,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:06:21,706 INFO L462 AbstractCegarLoop]: Abstraction has 626 states and 774 transitions. [2019-12-07 18:06:21,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-07 18:06:21,707 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 774 transitions. [2019-12-07 18:06:21,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 18:06:21,707 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:06:21,707 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:06:21,908 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:06:21,908 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:06:21,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:06:21,909 INFO L82 PathProgramCache]: Analyzing trace with hash 432114678, now seen corresponding path program 2 times [2019-12-07 18:06:21,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:06:21,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135396787] [2019-12-07 18:06:21,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:06:21,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:06:21,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:06:21,979 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:06:21,979 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:06:22,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:06:22 BoogieIcfgContainer [2019-12-07 18:06:22,005 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:06:22,006 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:06:22,006 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:06:22,006 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:06:22,006 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:04:54" (3/4) ... [2019-12-07 18:06:22,007 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 18:06:22,041 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c5a873d6-a9ae-4cd8-bd7c-404884b999c7/bin/uautomizer/witness.graphml [2019-12-07 18:06:22,041 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:06:22,042 INFO L168 Benchmark]: Toolchain (without parser) took 87877.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 173.0 MB). Free memory was 940.8 MB in the beginning and 1.2 GB in the end (delta: -222.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:06:22,042 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:06:22,043 INFO L168 Benchmark]: CACSL2BoogieTranslator took 196.50 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -165.8 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:06:22,043 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.37 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:06:22,043 INFO L168 Benchmark]: Boogie Preprocessor took 15.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:06:22,043 INFO L168 Benchmark]: RCFGBuilder took 171.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. [2019-12-07 18:06:22,044 INFO L168 Benchmark]: TraceAbstraction took 87430.72 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 61.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -81.4 MB). Peak memory consumption was 348.5 MB. Max. memory is 11.5 GB. [2019-12-07 18:06:22,044 INFO L168 Benchmark]: Witness Printer took 35.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:06:22,045 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 196.50 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -165.8 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.37 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 171.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 87430.72 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 61.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -81.4 MB). Peak memory consumption was 348.5 MB. Max. memory is 11.5 GB. * Witness Printer took 35.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 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