/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-tiling/skipped.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 18:54:20,615 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 18:54:20,618 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 18:54:20,636 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 18:54:20,637 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 18:54:20,639 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 18:54:20,641 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 18:54:20,650 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 18:54:20,654 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 18:54:20,657 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 18:54:20,659 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 18:54:20,660 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 18:54:20,661 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 18:54:20,662 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 18:54:20,664 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 18:54:20,666 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 18:54:20,667 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 18:54:20,668 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 18:54:20,669 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 18:54:20,674 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 18:54:20,679 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 18:54:20,682 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 18:54:20,684 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 18:54:20,685 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 18:54:20,686 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 18:54:20,687 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 18:54:20,687 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 18:54:20,687 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 18:54:20,688 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 18:54:20,689 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 18:54:20,689 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 18:54:20,689 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 18:54:20,690 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 18:54:20,691 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 18:54:20,692 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 18:54:20,692 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 18:54:20,692 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 18:54:20,693 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 18:54:20,693 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 18:54:20,694 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 18:54:20,694 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 18:54:20,695 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-06 18:54:20,708 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 18:54:20,709 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 18:54:20,710 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 18:54:20,710 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 18:54:20,710 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 18:54:20,710 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 18:54:20,710 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 18:54:20,711 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 18:54:20,711 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 18:54:20,711 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 18:54:20,711 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 18:54:20,711 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 18:54:20,712 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 18:54:20,712 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 18:54:20,712 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 18:54:20,712 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 18:54:20,712 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 18:54:20,712 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 18:54:20,713 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 18:54:20,713 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 18:54:20,713 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 18:54:20,713 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 18:54:20,713 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 18:54:20,714 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 18:54:20,714 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 18:54:20,714 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 18:54:20,714 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 18:54:20,714 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 18:54:20,715 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 18:54:20,983 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 18:54:20,996 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 18:54:20,999 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 18:54:21,001 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 18:54:21,001 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 18:54:21,002 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/skipped.c [2019-11-06 18:54:21,069 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41fd59120/2cb760e66b8140e8b8fdd0699fcaa9ef/FLAG31740cf4a [2019-11-06 18:54:21,582 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 18:54:21,583 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/skipped.c [2019-11-06 18:54:21,589 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41fd59120/2cb760e66b8140e8b8fdd0699fcaa9ef/FLAG31740cf4a [2019-11-06 18:54:21,977 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41fd59120/2cb760e66b8140e8b8fdd0699fcaa9ef [2019-11-06 18:54:21,988 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 18:54:21,990 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 18:54:21,993 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 18:54:21,993 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 18:54:21,997 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 18:54:21,998 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:54:21" (1/1) ... [2019-11-06 18:54:22,001 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77aa27c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:54:21, skipping insertion in model container [2019-11-06 18:54:22,002 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:54:21" (1/1) ... [2019-11-06 18:54:22,010 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 18:54:22,028 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 18:54:22,227 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 18:54:22,238 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 18:54:22,256 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 18:54:22,272 INFO L192 MainTranslator]: Completed translation [2019-11-06 18:54:22,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:54:22 WrapperNode [2019-11-06 18:54:22,273 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 18:54:22,274 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 18:54:22,274 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 18:54:22,274 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 18:54:22,385 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:54:22" (1/1) ... [2019-11-06 18:54:22,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:54:22" (1/1) ... [2019-11-06 18:54:22,404 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:54:22" (1/1) ... [2019-11-06 18:54:22,405 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:54:22" (1/1) ... [2019-11-06 18:54:22,412 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:54:22" (1/1) ... [2019-11-06 18:54:22,421 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:54:22" (1/1) ... [2019-11-06 18:54:22,423 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:54:22" (1/1) ... [2019-11-06 18:54:22,425 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 18:54:22,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 18:54:22,426 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 18:54:22,426 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 18:54:22,427 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:54:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 18:54:22,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 18:54:22,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 18:54:22,488 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-06 18:54:22,489 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 18:54:22,489 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 18:54:22,489 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-06 18:54:22,489 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-06 18:54:22,489 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 18:54:22,489 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-06 18:54:22,489 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 18:54:22,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-06 18:54:22,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-06 18:54:22,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-06 18:54:22,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 18:54:22,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 18:54:22,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 18:54:22,791 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 18:54:22,792 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-06 18:54:22,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:54:22 BoogieIcfgContainer [2019-11-06 18:54:22,793 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 18:54:22,794 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 18:54:22,795 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 18:54:22,798 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 18:54:22,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 06:54:21" (1/3) ... [2019-11-06 18:54:22,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a8ce94d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:54:22, skipping insertion in model container [2019-11-06 18:54:22,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:54:22" (2/3) ... [2019-11-06 18:54:22,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a8ce94d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:54:22, skipping insertion in model container [2019-11-06 18:54:22,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:54:22" (3/3) ... [2019-11-06 18:54:22,802 INFO L109 eAbstractionObserver]: Analyzing ICFG skipped.c [2019-11-06 18:54:22,812 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 18:54:22,831 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 18:54:22,841 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 18:54:22,862 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 18:54:22,862 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 18:54:22,862 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 18:54:22,862 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 18:54:22,862 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 18:54:22,863 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 18:54:22,863 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 18:54:22,863 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 18:54:22,878 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-11-06 18:54:22,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-06 18:54:22,884 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:54:22,885 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:54:22,886 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:54:22,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:54:22,891 INFO L82 PathProgramCache]: Analyzing trace with hash -446282704, now seen corresponding path program 1 times [2019-11-06 18:54:22,897 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:54:22,898 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179701176] [2019-11-06 18:54:22,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:54:22,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:23,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:23,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:54:23,085 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179701176] [2019-11-06 18:54:23,086 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 18:54:23,087 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 18:54:23,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354148014] [2019-11-06 18:54:23,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 18:54:23,093 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:54:23,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 18:54:23,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 18:54:23,110 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 3 states. [2019-11-06 18:54:23,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:54:23,287 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2019-11-06 18:54:23,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 18:54:23,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-06 18:54:23,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:54:23,304 INFO L225 Difference]: With dead ends: 53 [2019-11-06 18:54:23,305 INFO L226 Difference]: Without dead ends: 26 [2019-11-06 18:54:23,312 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 18:54:23,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-06 18:54:23,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-06 18:54:23,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-06 18:54:23,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-11-06 18:54:23,371 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 16 [2019-11-06 18:54:23,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:54:23,372 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-11-06 18:54:23,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 18:54:23,372 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-11-06 18:54:23,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-06 18:54:23,375 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:54:23,375 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:54:23,376 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:54:23,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:54:23,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1281654888, now seen corresponding path program 1 times [2019-11-06 18:54:23,377 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:54:23,377 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770496849] [2019-11-06 18:54:23,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:54:23,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:23,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:23,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:54:23,573 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770496849] [2019-11-06 18:54:23,574 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 18:54:23,574 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 18:54:23,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350256906] [2019-11-06 18:54:23,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 18:54:23,579 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:54:23,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 18:54:23,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 18:54:23,579 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 4 states. [2019-11-06 18:54:23,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:54:23,682 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2019-11-06 18:54:23,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 18:54:23,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-06 18:54:23,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:54:23,684 INFO L225 Difference]: With dead ends: 45 [2019-11-06 18:54:23,684 INFO L226 Difference]: Without dead ends: 28 [2019-11-06 18:54:23,685 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 18:54:23,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-06 18:54:23,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-11-06 18:54:23,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-06 18:54:23,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-11-06 18:54:23,693 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 16 [2019-11-06 18:54:23,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:54:23,693 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-11-06 18:54:23,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 18:54:23,694 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-11-06 18:54:23,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-06 18:54:23,695 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:54:23,695 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:54:23,695 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:54:23,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:54:23,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1237885334, now seen corresponding path program 1 times [2019-11-06 18:54:23,696 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:54:23,696 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350115868] [2019-11-06 18:54:23,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:54:23,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:23,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:23,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 18:54:23,795 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350115868] [2019-11-06 18:54:23,795 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 18:54:23,795 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 18:54:23,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952407971] [2019-11-06 18:54:23,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 18:54:23,796 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:54:23,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 18:54:23,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-06 18:54:23,798 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 5 states. [2019-11-06 18:54:23,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:54:23,946 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2019-11-06 18:54:23,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 18:54:23,948 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-06 18:54:23,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:54:23,949 INFO L225 Difference]: With dead ends: 43 [2019-11-06 18:54:23,949 INFO L226 Difference]: Without dead ends: 32 [2019-11-06 18:54:23,950 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-06 18:54:23,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-06 18:54:23,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2019-11-06 18:54:23,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-06 18:54:23,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-11-06 18:54:23,958 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 18 [2019-11-06 18:54:23,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:54:23,958 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-11-06 18:54:23,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 18:54:23,959 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-11-06 18:54:23,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-06 18:54:23,959 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:54:23,960 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:54:23,960 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:54:23,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:54:23,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1565802059, now seen corresponding path program 1 times [2019-11-06 18:54:23,961 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:54:23,961 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882707570] [2019-11-06 18:54:23,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:54:23,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:24,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:24,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 18:54:24,066 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882707570] [2019-11-06 18:54:24,066 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936669988] [2019-11-06 18:54:24,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:54:24,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:24,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-06 18:54:24,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:54:24,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 18:54:24,199 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:54:24,199 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-11-06 18:54:24,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84524238] [2019-11-06 18:54:24,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 18:54:24,200 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:54:24,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 18:54:24,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-06 18:54:24,201 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 7 states. [2019-11-06 18:54:24,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:54:24,304 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2019-11-06 18:54:24,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 18:54:24,305 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-11-06 18:54:24,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:54:24,306 INFO L225 Difference]: With dead ends: 49 [2019-11-06 18:54:24,306 INFO L226 Difference]: Without dead ends: 31 [2019-11-06 18:54:24,306 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-06 18:54:24,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-06 18:54:24,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-11-06 18:54:24,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-06 18:54:24,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-11-06 18:54:24,313 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 23 [2019-11-06 18:54:24,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:54:24,313 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-11-06 18:54:24,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 18:54:24,313 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-11-06 18:54:24,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-06 18:54:24,314 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:54:24,314 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:54:24,518 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:54:24,518 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:54:24,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:54:24,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1209140727, now seen corresponding path program 2 times [2019-11-06 18:54:24,520 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:54:24,520 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385574188] [2019-11-06 18:54:24,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:54:24,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:25,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:25,369 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:54:25,370 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385574188] [2019-11-06 18:54:25,371 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138535938] [2019-11-06 18:54:25,371 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:54:25,462 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 18:54:25,463 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:54:25,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-06 18:54:25,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:54:25,533 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2019-11-06 18:54:25,533 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:54:25,541 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:25,541 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:54:25,542 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2019-11-06 18:54:25,562 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-06 18:54:25,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:25,568 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:25,572 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:25,574 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 20 [2019-11-06 18:54:25,575 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 18:54:25,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:25,580 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:54:25,591 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:25,591 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:54:25,592 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:20 [2019-11-06 18:54:25,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:25,658 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 18:54:25,661 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:25,661 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 13 [2019-11-06 18:54:25,662 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:54:25,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:25,667 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:54:25,668 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:7 [2019-11-06 18:54:25,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:54:25,738 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 18:54:25,739 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:54:25,739 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 22 [2019-11-06 18:54:25,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728198411] [2019-11-06 18:54:25,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-06 18:54:25,740 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:54:25,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-06 18:54:25,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2019-11-06 18:54:25,743 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 22 states. [2019-11-06 18:54:27,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:54:27,500 INFO L93 Difference]: Finished difference Result 167 states and 217 transitions. [2019-11-06 18:54:27,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-11-06 18:54:27,501 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 25 [2019-11-06 18:54:27,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:54:27,505 INFO L225 Difference]: With dead ends: 167 [2019-11-06 18:54:27,512 INFO L226 Difference]: Without dead ends: 165 [2019-11-06 18:54:27,514 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=379, Invalid=1783, Unknown=0, NotChecked=0, Total=2162 [2019-11-06 18:54:27,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-06 18:54:27,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 43. [2019-11-06 18:54:27,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-06 18:54:27,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2019-11-06 18:54:27,534 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 25 [2019-11-06 18:54:27,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:54:27,535 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2019-11-06 18:54:27,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-06 18:54:27,535 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2019-11-06 18:54:27,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-06 18:54:27,536 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:54:27,536 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:54:27,739 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:54:27,740 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:54:27,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:54:27,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1910205305, now seen corresponding path program 1 times [2019-11-06 18:54:27,740 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:54:27,740 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326923918] [2019-11-06 18:54:27,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:54:27,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:28,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:28,189 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:54:28,189 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326923918] [2019-11-06 18:54:28,189 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117405995] [2019-11-06 18:54:28,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:54:28,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:28,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-06 18:54:28,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:54:28,321 INFO L341 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2019-11-06 18:54:28,322 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2019-11-06 18:54:28,323 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:54:28,327 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:28,328 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:54:28,328 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-11-06 18:54:28,399 INFO L341 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2019-11-06 18:54:28,400 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 36 [2019-11-06 18:54:28,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:54:28,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:54:28,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:54:28,404 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-06 18:54:28,425 INFO L567 ElimStorePlain]: treesize reduction 35, result has 16.7 percent of original size [2019-11-06 18:54:28,426 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:54:28,426 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:7 [2019-11-06 18:54:28,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:54:28,467 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 18:54:28,468 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:54:28,468 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 22 [2019-11-06 18:54:28,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222671193] [2019-11-06 18:54:28,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-06 18:54:28,469 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:54:28,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-06 18:54:28,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2019-11-06 18:54:28,469 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand 22 states. [2019-11-06 18:54:29,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:54:29,715 INFO L93 Difference]: Finished difference Result 153 states and 195 transitions. [2019-11-06 18:54:29,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-06 18:54:29,715 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 25 [2019-11-06 18:54:29,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:54:29,720 INFO L225 Difference]: With dead ends: 153 [2019-11-06 18:54:29,720 INFO L226 Difference]: Without dead ends: 151 [2019-11-06 18:54:29,721 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=242, Invalid=1398, Unknown=0, NotChecked=0, Total=1640 [2019-11-06 18:54:29,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-11-06 18:54:29,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 49. [2019-11-06 18:54:29,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-06 18:54:29,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2019-11-06 18:54:29,745 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 25 [2019-11-06 18:54:29,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:54:29,745 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2019-11-06 18:54:29,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-06 18:54:29,745 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2019-11-06 18:54:29,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-06 18:54:29,746 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:54:29,746 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:54:29,951 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:54:29,952 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:54:29,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:54:29,952 INFO L82 PathProgramCache]: Analyzing trace with hash 2135590205, now seen corresponding path program 1 times [2019-11-06 18:54:29,952 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:54:29,952 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592786474] [2019-11-06 18:54:29,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:54:29,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:30,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:30,257 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:54:30,257 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592786474] [2019-11-06 18:54:30,257 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023792219] [2019-11-06 18:54:30,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:54:30,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:30,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-06 18:54:30,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:54:30,425 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:54:30,425 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:54:30,425 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-11-06 18:54:30,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709240193] [2019-11-06 18:54:30,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-06 18:54:30,426 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:54:30,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-06 18:54:30,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-11-06 18:54:30,427 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand 15 states. [2019-11-06 18:54:31,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:54:31,047 INFO L93 Difference]: Finished difference Result 114 states and 136 transitions. [2019-11-06 18:54:31,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-06 18:54:31,049 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-11-06 18:54:31,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:54:31,051 INFO L225 Difference]: With dead ends: 114 [2019-11-06 18:54:31,051 INFO L226 Difference]: Without dead ends: 96 [2019-11-06 18:54:31,052 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2019-11-06 18:54:31,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-06 18:54:31,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 54. [2019-11-06 18:54:31,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-06 18:54:31,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2019-11-06 18:54:31,062 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 27 [2019-11-06 18:54:31,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:54:31,063 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2019-11-06 18:54:31,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-06 18:54:31,063 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2019-11-06 18:54:31,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-06 18:54:31,064 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:54:31,064 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:54:31,267 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:54:31,268 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:54:31,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:54:31,269 INFO L82 PathProgramCache]: Analyzing trace with hash 785976942, now seen corresponding path program 1 times [2019-11-06 18:54:31,269 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:54:31,270 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048204393] [2019-11-06 18:54:31,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:54:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:31,461 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:54:31,462 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048204393] [2019-11-06 18:54:31,462 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629460749] [2019-11-06 18:54:31,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:54:31,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:31,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-06 18:54:31,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:54:31,648 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:54:31,649 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:54:31,649 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 14 [2019-11-06 18:54:31,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798090449] [2019-11-06 18:54:31,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-06 18:54:31,650 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:54:31,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-06 18:54:31,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2019-11-06 18:54:31,651 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand 14 states. [2019-11-06 18:54:32,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:54:32,061 INFO L93 Difference]: Finished difference Result 126 states and 151 transitions. [2019-11-06 18:54:32,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-06 18:54:32,062 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2019-11-06 18:54:32,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:54:32,063 INFO L225 Difference]: With dead ends: 126 [2019-11-06 18:54:32,063 INFO L226 Difference]: Without dead ends: 87 [2019-11-06 18:54:32,064 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2019-11-06 18:54:32,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-06 18:54:32,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 62. [2019-11-06 18:54:32,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-06 18:54:32,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2019-11-06 18:54:32,082 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 32 [2019-11-06 18:54:32,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:54:32,082 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2019-11-06 18:54:32,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-06 18:54:32,082 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2019-11-06 18:54:32,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-06 18:54:32,086 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:54:32,087 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:54:32,292 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:54:32,292 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:54:32,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:54:32,292 INFO L82 PathProgramCache]: Analyzing trace with hash -466196341, now seen corresponding path program 1 times [2019-11-06 18:54:32,293 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:54:32,293 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448808062] [2019-11-06 18:54:32,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:54:32,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:32,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:32,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:32,515 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:54:32,516 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448808062] [2019-11-06 18:54:32,516 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613556228] [2019-11-06 18:54:32,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:54:32,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:32,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-06 18:54:32,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:54:32,615 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2019-11-06 18:54:32,615 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:54:32,622 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:32,623 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 18:54:32,623 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2019-11-06 18:54:34,748 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:34,749 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 24 [2019-11-06 18:54:34,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:54:34,750 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-06 18:54:34,758 INFO L567 ElimStorePlain]: treesize reduction 14, result has 33.3 percent of original size [2019-11-06 18:54:34,759 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:54:34,759 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:7 [2019-11-06 18:54:34,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:54:34,804 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 18:54:34,804 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:54:34,804 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 16 [2019-11-06 18:54:34,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527225721] [2019-11-06 18:54:34,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-06 18:54:34,805 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:54:34,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-06 18:54:34,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=199, Unknown=1, NotChecked=0, Total=240 [2019-11-06 18:54:34,806 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand 16 states. [2019-11-06 18:54:35,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:54:35,269 INFO L93 Difference]: Finished difference Result 108 states and 126 transitions. [2019-11-06 18:54:35,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-06 18:54:35,273 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2019-11-06 18:54:35,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:54:35,275 INFO L225 Difference]: With dead ends: 108 [2019-11-06 18:54:35,275 INFO L226 Difference]: Without dead ends: 106 [2019-11-06 18:54:35,275 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=83, Invalid=378, Unknown=1, NotChecked=0, Total=462 [2019-11-06 18:54:35,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-06 18:54:35,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 80. [2019-11-06 18:54:35,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-06 18:54:35,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 96 transitions. [2019-11-06 18:54:35,291 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 96 transitions. Word has length 33 [2019-11-06 18:54:35,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:54:35,291 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 96 transitions. [2019-11-06 18:54:35,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-06 18:54:35,292 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 96 transitions. [2019-11-06 18:54:35,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-06 18:54:35,293 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:54:35,293 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:54:35,497 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:54:35,497 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:54:35,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:54:35,498 INFO L82 PathProgramCache]: Analyzing trace with hash -2054544243, now seen corresponding path program 1 times [2019-11-06 18:54:35,498 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:54:35,499 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937044328] [2019-11-06 18:54:35,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:54:35,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:35,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:35,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:35,767 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:54:35,767 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937044328] [2019-11-06 18:54:35,768 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788918192] [2019-11-06 18:54:35,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:54:35,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:35,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-06 18:54:35,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:54:36,095 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:36,096 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 24 [2019-11-06 18:54:36,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:54:36,098 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-06 18:54:36,109 INFO L567 ElimStorePlain]: treesize reduction 14, result has 33.3 percent of original size [2019-11-06 18:54:36,110 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:54:36,110 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:7 [2019-11-06 18:54:36,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:54:36,180 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 18:54:36,180 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:54:36,181 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 22 [2019-11-06 18:54:36,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044087830] [2019-11-06 18:54:36,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-06 18:54:36,181 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:54:36,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-06 18:54:36,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-11-06 18:54:36,182 INFO L87 Difference]: Start difference. First operand 80 states and 96 transitions. Second operand 22 states. [2019-11-06 18:54:39,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:54:39,368 INFO L93 Difference]: Finished difference Result 159 states and 184 transitions. [2019-11-06 18:54:39,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-06 18:54:39,369 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 33 [2019-11-06 18:54:39,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:54:39,371 INFO L225 Difference]: With dead ends: 159 [2019-11-06 18:54:39,371 INFO L226 Difference]: Without dead ends: 157 [2019-11-06 18:54:39,372 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=251, Invalid=1471, Unknown=0, NotChecked=0, Total=1722 [2019-11-06 18:54:39,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-06 18:54:39,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 95. [2019-11-06 18:54:39,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-11-06 18:54:39,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions. [2019-11-06 18:54:39,390 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 110 transitions. Word has length 33 [2019-11-06 18:54:39,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:54:39,391 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 110 transitions. [2019-11-06 18:54:39,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-06 18:54:39,391 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2019-11-06 18:54:39,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-06 18:54:39,393 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:54:39,393 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:54:39,602 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:54:39,602 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:54:39,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:54:39,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1188137876, now seen corresponding path program 2 times [2019-11-06 18:54:39,603 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:54:39,603 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713694694] [2019-11-06 18:54:39,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:54:39,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:40,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:40,223 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:54:40,224 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713694694] [2019-11-06 18:54:40,224 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452544587] [2019-11-06 18:54:40,224 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:54:40,270 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 18:54:40,270 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:54:40,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-06 18:54:40,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:54:40,436 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:40,436 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-11-06 18:54:40,437 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:54:40,444 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:40,445 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:54:40,445 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2019-11-06 18:54:40,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:40,491 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:40,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:40,494 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:40,494 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 46 [2019-11-06 18:54:40,495 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:54:40,512 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:40,513 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 18:54:40,513 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:46 [2019-11-06 18:54:40,625 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:40,626 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 18:54:40,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:40,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:40,631 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:40,632 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 47 treesize of output 24 [2019-11-06 18:54:40,633 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:54:40,637 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:40,637 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:54:40,637 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:7 [2019-11-06 18:54:40,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:54:40,684 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-06 18:54:40,684 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:54:40,684 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13] total 29 [2019-11-06 18:54:40,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145216803] [2019-11-06 18:54:40,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-06 18:54:40,685 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:54:40,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-06 18:54:40,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812 [2019-11-06 18:54:40,686 INFO L87 Difference]: Start difference. First operand 95 states and 110 transitions. Second operand 29 states. [2019-11-06 18:54:44,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:54:44,756 INFO L93 Difference]: Finished difference Result 362 states and 469 transitions. [2019-11-06 18:54:44,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-11-06 18:54:44,757 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 34 [2019-11-06 18:54:44,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:54:44,762 INFO L225 Difference]: With dead ends: 362 [2019-11-06 18:54:44,762 INFO L226 Difference]: Without dead ends: 360 [2019-11-06 18:54:44,764 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1807 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=860, Invalid=5620, Unknown=0, NotChecked=0, Total=6480 [2019-11-06 18:54:44,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-11-06 18:54:44,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 60. [2019-11-06 18:54:44,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-06 18:54:44,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2019-11-06 18:54:44,783 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 34 [2019-11-06 18:54:44,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:54:44,783 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2019-11-06 18:54:44,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-06 18:54:44,784 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2019-11-06 18:54:44,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-06 18:54:44,785 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:54:44,785 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:54:44,989 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:54:44,990 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:54:44,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:54:44,990 INFO L82 PathProgramCache]: Analyzing trace with hash 107542303, now seen corresponding path program 2 times [2019-11-06 18:54:44,991 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:54:44,991 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545492977] [2019-11-06 18:54:44,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:54:45,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:45,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:45,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:45,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:45,104 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-06 18:54:45,106 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545492977] [2019-11-06 18:54:45,107 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29780876] [2019-11-06 18:54:45,107 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:54:45,162 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 18:54:45,162 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:54:45,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-06 18:54:45,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:54:45,209 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-06 18:54:45,210 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:54:45,210 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2019-11-06 18:54:45,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611213422] [2019-11-06 18:54:45,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-06 18:54:45,211 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:54:45,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-06 18:54:45,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-11-06 18:54:45,211 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand 14 states. [2019-11-06 18:54:45,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:54:45,528 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2019-11-06 18:54:45,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-06 18:54:45,529 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 41 [2019-11-06 18:54:45,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:54:45,530 INFO L225 Difference]: With dead ends: 98 [2019-11-06 18:54:45,530 INFO L226 Difference]: Without dead ends: 63 [2019-11-06 18:54:45,531 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2019-11-06 18:54:45,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-06 18:54:45,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 53. [2019-11-06 18:54:45,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-06 18:54:45,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2019-11-06 18:54:45,542 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 41 [2019-11-06 18:54:45,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:54:45,542 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2019-11-06 18:54:45,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-06 18:54:45,542 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2019-11-06 18:54:45,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-06 18:54:45,543 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:54:45,543 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:54:45,747 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:54:45,748 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:54:45,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:54:45,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1999502184, now seen corresponding path program 3 times [2019-11-06 18:54:45,748 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:54:45,749 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349932880] [2019-11-06 18:54:45,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:54:45,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:45,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:45,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:45,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:45,940 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-06 18:54:45,940 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349932880] [2019-11-06 18:54:45,940 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485881219] [2019-11-06 18:54:45,941 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:54:45,996 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-06 18:54:45,996 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:54:45,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-06 18:54:46,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:54:46,064 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2019-11-06 18:54:46,064 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:54:46,070 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:46,071 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:54:46,071 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2019-11-06 18:54:46,123 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:46,124 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-11-06 18:54:46,124 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:54:46,132 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:46,133 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:54:46,133 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:22 [2019-11-06 18:54:46,357 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 18:54:46,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:46,359 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:46,359 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 13 [2019-11-06 18:54:46,360 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:54:46,363 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:46,363 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:54:46,364 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:7 [2019-11-06 18:54:46,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:54:46,419 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-06 18:54:46,419 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:54:46,419 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2019-11-06 18:54:46,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121576177] [2019-11-06 18:54:46,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-06 18:54:46,420 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:54:46,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-06 18:54:46,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2019-11-06 18:54:46,420 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 26 states. [2019-11-06 18:54:47,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:54:47,671 INFO L93 Difference]: Finished difference Result 153 states and 180 transitions. [2019-11-06 18:54:47,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-06 18:54:47,673 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2019-11-06 18:54:47,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:54:47,674 INFO L225 Difference]: With dead ends: 153 [2019-11-06 18:54:47,675 INFO L226 Difference]: Without dead ends: 151 [2019-11-06 18:54:47,676 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 45 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=263, Invalid=1717, Unknown=0, NotChecked=0, Total=1980 [2019-11-06 18:54:47,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-11-06 18:54:47,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 108. [2019-11-06 18:54:47,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-06 18:54:47,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 125 transitions. [2019-11-06 18:54:47,695 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 125 transitions. Word has length 50 [2019-11-06 18:54:47,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:54:47,695 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 125 transitions. [2019-11-06 18:54:47,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-06 18:54:47,695 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 125 transitions. [2019-11-06 18:54:47,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-06 18:54:47,696 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:54:47,696 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:54:47,901 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:54:47,902 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:54:47,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:54:47,903 INFO L82 PathProgramCache]: Analyzing trace with hash -76274150, now seen corresponding path program 1 times [2019-11-06 18:54:47,903 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:54:47,904 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478982399] [2019-11-06 18:54:47,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:54:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:48,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:48,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:48,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:48,143 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 31 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 18:54:48,143 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478982399] [2019-11-06 18:54:48,143 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448960080] [2019-11-06 18:54:48,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:54:48,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:48,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-06 18:54:48,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:54:48,273 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-06 18:54:48,274 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-06 18:54:48,274 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:54:48,279 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:48,279 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:54:48,279 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-06 18:54:48,508 INFO L341 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2019-11-06 18:54:48,509 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2019-11-06 18:54:48,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:54:48,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:54:48,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:54:48,512 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-06 18:54:48,526 INFO L567 ElimStorePlain]: treesize reduction 37, result has 15.9 percent of original size [2019-11-06 18:54:48,527 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:54:48,527 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:7 [2019-11-06 18:54:48,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:54:48,585 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-06 18:54:48,586 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:54:48,586 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 24 [2019-11-06 18:54:48,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123693222] [2019-11-06 18:54:48,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-06 18:54:48,587 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:54:48,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-06 18:54:48,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2019-11-06 18:54:48,587 INFO L87 Difference]: Start difference. First operand 108 states and 125 transitions. Second operand 24 states. [2019-11-06 18:54:49,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:54:49,716 INFO L93 Difference]: Finished difference Result 200 states and 236 transitions. [2019-11-06 18:54:49,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-06 18:54:49,716 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2019-11-06 18:54:49,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:54:49,719 INFO L225 Difference]: With dead ends: 200 [2019-11-06 18:54:49,720 INFO L226 Difference]: Without dead ends: 198 [2019-11-06 18:54:49,721 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 47 SyntacticMatches, 10 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=189, Invalid=1217, Unknown=0, NotChecked=0, Total=1406 [2019-11-06 18:54:49,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-11-06 18:54:49,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 96. [2019-11-06 18:54:49,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-06 18:54:49,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2019-11-06 18:54:49,738 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 50 [2019-11-06 18:54:49,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:54:49,739 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2019-11-06 18:54:49,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-06 18:54:49,739 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2019-11-06 18:54:49,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-06 18:54:49,740 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:54:49,740 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:54:49,940 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:54:49,941 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:54:49,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:54:49,942 INFO L82 PathProgramCache]: Analyzing trace with hash 382840366, now seen corresponding path program 1 times [2019-11-06 18:54:49,942 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:54:49,942 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553819846] [2019-11-06 18:54:49,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:54:49,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:50,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:50,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:50,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:50,491 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 6 proven. 41 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-06 18:54:50,491 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553819846] [2019-11-06 18:54:50,492 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648768968] [2019-11-06 18:54:50,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:54:50,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:50,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-06 18:54:50,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:54:58,826 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:58,827 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2019-11-06 18:54:58,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:54:58,828 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-06 18:54:58,836 INFO L567 ElimStorePlain]: treesize reduction 11, result has 38.9 percent of original size [2019-11-06 18:54:58,837 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:54:58,837 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:7 [2019-11-06 18:54:58,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:54:58,915 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-06 18:54:58,915 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:54:58,915 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 15] total 31 [2019-11-06 18:54:58,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328660246] [2019-11-06 18:54:58,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-06 18:54:58,916 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:54:58,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-06 18:54:58,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=836, Unknown=2, NotChecked=0, Total=930 [2019-11-06 18:54:58,917 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand 31 states.