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/loop-invgen/heapsort.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 11:59:26,566 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 11:59:26,568 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 11:59:26,579 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 11:59:26,580 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 11:59:26,580 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 11:59:26,582 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 11:59:26,584 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 11:59:26,586 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 11:59:26,587 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 11:59:26,588 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 11:59:26,589 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 11:59:26,589 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 11:59:26,590 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 11:59:26,591 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 11:59:26,592 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 11:59:26,593 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 11:59:26,594 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 11:59:26,595 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 11:59:26,597 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 11:59:26,599 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 11:59:26,600 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 11:59:26,601 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 11:59:26,601 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 11:59:26,603 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 11:59:26,604 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 11:59:26,604 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 11:59:26,605 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 11:59:26,605 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 11:59:26,606 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 11:59:26,606 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 11:59:26,607 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 11:59:26,608 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 11:59:26,609 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 11:59:26,610 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 11:59:26,610 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 11:59:26,611 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 11:59:26,611 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 11:59:26,611 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 11:59:26,612 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 11:59:26,613 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 11:59:26,613 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-09-05 11:59:26,627 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 11:59:26,627 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 11:59:26,628 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-05 11:59:26,629 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-05 11:59:26,629 INFO L138 SettingsManager]: * Use SBE=true [2019-09-05 11:59:26,629 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 11:59:26,629 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 11:59:26,629 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-05 11:59:26,630 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 11:59:26,630 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 11:59:26,630 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 11:59:26,630 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 11:59:26,630 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 11:59:26,631 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 11:59:26,631 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 11:59:26,631 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-05 11:59:26,631 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 11:59:26,631 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 11:59:26,632 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 11:59:26,632 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-05 11:59:26,632 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-05 11:59:26,632 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 11:59:26,632 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 11:59:26,633 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 11:59:26,633 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-05 11:59:26,633 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-05 11:59:26,633 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 11:59:26,633 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 11:59:26,634 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-05 11:59:26,666 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 11:59:26,679 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 11:59:26,684 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 11:59:26,685 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 11:59:26,685 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 11:59:26,686 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/heapsort.i [2019-09-05 11:59:26,753 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/914fed0d4/0b8886e169f04ea483d057c8422fb156/FLAGe5ff7d8f5 [2019-09-05 11:59:27,203 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 11:59:27,206 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/heapsort.i [2019-09-05 11:59:27,214 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/914fed0d4/0b8886e169f04ea483d057c8422fb156/FLAGe5ff7d8f5 [2019-09-05 11:59:27,559 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/914fed0d4/0b8886e169f04ea483d057c8422fb156 [2019-09-05 11:59:27,571 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 11:59:27,572 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 11:59:27,573 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 11:59:27,573 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 11:59:27,577 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 11:59:27,577 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:59:27" (1/1) ... [2019-09-05 11:59:27,580 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ac79c48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:59:27, skipping insertion in model container [2019-09-05 11:59:27,580 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:59:27" (1/1) ... [2019-09-05 11:59:27,587 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 11:59:27,606 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 11:59:27,788 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:59:27,793 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 11:59:27,829 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:59:27,840 INFO L192 MainTranslator]: Completed translation [2019-09-05 11:59:27,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:59:27 WrapperNode [2019-09-05 11:59:27,840 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 11:59:27,841 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 11:59:27,841 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 11:59:27,841 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 11:59:27,942 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:59:27" (1/1) ... [2019-09-05 11:59:27,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:59:27" (1/1) ... [2019-09-05 11:59:27,949 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:59:27" (1/1) ... [2019-09-05 11:59:27,949 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:59:27" (1/1) ... [2019-09-05 11:59:27,958 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:59:27" (1/1) ... [2019-09-05 11:59:27,964 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:59:27" (1/1) ... [2019-09-05 11:59:27,965 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:59:27" (1/1) ... [2019-09-05 11:59:27,972 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 11:59:27,972 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 11:59:27,972 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 11:59:27,973 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 11:59:27,973 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:59:27" (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-09-05 11:59:28,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 11:59:28,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 11:59:28,022 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-05 11:59:28,023 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 11:59:28,023 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 11:59:28,023 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-05 11:59:28,024 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 11:59:28,024 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-05 11:59:28,024 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 11:59:28,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 11:59:28,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 11:59:28,260 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 11:59:28,260 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-05 11:59:28,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:59:28 BoogieIcfgContainer [2019-09-05 11:59:28,262 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 11:59:28,263 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 11:59:28,263 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 11:59:28,266 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 11:59:28,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 11:59:27" (1/3) ... [2019-09-05 11:59:28,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c03809d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:59:28, skipping insertion in model container [2019-09-05 11:59:28,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:59:27" (2/3) ... [2019-09-05 11:59:28,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c03809d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:59:28, skipping insertion in model container [2019-09-05 11:59:28,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:59:28" (3/3) ... [2019-09-05 11:59:28,269 INFO L109 eAbstractionObserver]: Analyzing ICFG heapsort.i [2019-09-05 11:59:28,280 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 11:59:28,299 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 11:59:28,348 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 11:59:28,388 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-05 11:59:28,389 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 11:59:28,389 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-05 11:59:28,389 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 11:59:28,390 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 11:59:28,390 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 11:59:28,390 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 11:59:28,393 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 11:59:28,393 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 11:59:28,415 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2019-09-05 11:59:28,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-05 11:59:28,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:28,426 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:28,428 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:28,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:28,433 INFO L82 PathProgramCache]: Analyzing trace with hash 648615897, now seen corresponding path program 1 times [2019-09-05 11:59:28,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:28,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:28,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:28,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:28,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:28,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:28,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:59:28,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:28,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 11:59:28,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:59:28,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:59:28,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:59:28,641 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 5 states. [2019-09-05 11:59:28,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:28,793 INFO L93 Difference]: Finished difference Result 83 states and 141 transitions. [2019-09-05 11:59:28,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 11:59:28,795 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-09-05 11:59:28,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:28,805 INFO L225 Difference]: With dead ends: 83 [2019-09-05 11:59:28,805 INFO L226 Difference]: Without dead ends: 42 [2019-09-05 11:59:28,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:59:28,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-05 11:59:28,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-09-05 11:59:28,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-05 11:59:28,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2019-09-05 11:59:28,858 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 60 transitions. Word has length 14 [2019-09-05 11:59:28,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:28,858 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 60 transitions. [2019-09-05 11:59:28,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:59:28,859 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 60 transitions. [2019-09-05 11:59:28,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-05 11:59:28,860 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:28,860 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:28,861 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:28,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:28,862 INFO L82 PathProgramCache]: Analyzing trace with hash 653352666, now seen corresponding path program 1 times [2019-09-05 11:59:28,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:28,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:28,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:28,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:28,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:28,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:28,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:59:28,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:28,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 11:59:28,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:59:28,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:59:28,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:59:28,930 INFO L87 Difference]: Start difference. First operand 42 states and 60 transitions. Second operand 5 states. [2019-09-05 11:59:29,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:29,061 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2019-09-05 11:59:29,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 11:59:29,061 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-09-05 11:59:29,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:29,063 INFO L225 Difference]: With dead ends: 49 [2019-09-05 11:59:29,063 INFO L226 Difference]: Without dead ends: 47 [2019-09-05 11:59:29,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:59:29,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-05 11:59:29,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-09-05 11:59:29,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-05 11:59:29,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2019-09-05 11:59:29,078 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 14 [2019-09-05 11:59:29,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:29,078 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2019-09-05 11:59:29,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:59:29,079 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2019-09-05 11:59:29,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-05 11:59:29,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:29,080 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:29,081 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:29,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:29,081 INFO L82 PathProgramCache]: Analyzing trace with hash 674802186, now seen corresponding path program 1 times [2019-09-05 11:59:29,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:29,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:29,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:29,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:29,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:29,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:29,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:59:29,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:29,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-05 11:59:29,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 11:59:29,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 11:59:29,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:59:29,160 INFO L87 Difference]: Start difference. First operand 46 states and 63 transitions. Second operand 6 states. [2019-09-05 11:59:29,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:29,382 INFO L93 Difference]: Finished difference Result 79 states and 114 transitions. [2019-09-05 11:59:29,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 11:59:29,383 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-09-05 11:59:29,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:29,385 INFO L225 Difference]: With dead ends: 79 [2019-09-05 11:59:29,385 INFO L226 Difference]: Without dead ends: 77 [2019-09-05 11:59:29,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:59:29,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-09-05 11:59:29,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2019-09-05 11:59:29,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-05 11:59:29,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 105 transitions. [2019-09-05 11:59:29,410 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 105 transitions. Word has length 14 [2019-09-05 11:59:29,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:29,411 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 105 transitions. [2019-09-05 11:59:29,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 11:59:29,411 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 105 transitions. [2019-09-05 11:59:29,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-05 11:59:29,412 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:29,412 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:29,413 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:29,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:29,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1685485370, now seen corresponding path program 1 times [2019-09-05 11:59:29,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:29,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:29,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:29,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:29,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:29,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:29,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:59:29,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:29,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-05 11:59:29,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-05 11:59:29,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-05 11:59:29,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:59:29,532 INFO L87 Difference]: Start difference. First operand 72 states and 105 transitions. Second operand 7 states. [2019-09-05 11:59:29,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:29,789 INFO L93 Difference]: Finished difference Result 105 states and 156 transitions. [2019-09-05 11:59:29,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 11:59:29,790 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-09-05 11:59:29,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:29,792 INFO L225 Difference]: With dead ends: 105 [2019-09-05 11:59:29,792 INFO L226 Difference]: Without dead ends: 103 [2019-09-05 11:59:29,793 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-05 11:59:29,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-09-05 11:59:29,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2019-09-05 11:59:29,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-05 11:59:29,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 151 transitions. [2019-09-05 11:59:29,814 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 151 transitions. Word has length 19 [2019-09-05 11:59:29,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:29,814 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 151 transitions. [2019-09-05 11:59:29,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-05 11:59:29,814 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 151 transitions. [2019-09-05 11:59:29,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-05 11:59:29,816 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:29,816 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:29,816 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:29,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:29,817 INFO L82 PathProgramCache]: Analyzing trace with hash 2066847833, now seen corresponding path program 1 times [2019-09-05 11:59:29,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:29,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:29,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:29,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:29,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:29,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:29,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:59:29,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:29,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 11:59:29,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:59:29,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:59:29,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:59:29,872 INFO L87 Difference]: Start difference. First operand 100 states and 151 transitions. Second operand 5 states. [2019-09-05 11:59:29,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:29,948 INFO L93 Difference]: Finished difference Result 106 states and 156 transitions. [2019-09-05 11:59:29,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 11:59:29,948 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-09-05 11:59:29,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:29,952 INFO L225 Difference]: With dead ends: 106 [2019-09-05 11:59:29,952 INFO L226 Difference]: Without dead ends: 104 [2019-09-05 11:59:29,953 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:59:29,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-05 11:59:29,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-09-05 11:59:29,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-05 11:59:29,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 154 transitions. [2019-09-05 11:59:29,972 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 154 transitions. Word has length 19 [2019-09-05 11:59:29,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:29,973 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 154 transitions. [2019-09-05 11:59:29,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:59:29,973 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 154 transitions. [2019-09-05 11:59:29,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-05 11:59:29,974 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:29,975 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:29,975 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:29,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:29,975 INFO L82 PathProgramCache]: Analyzing trace with hash 2051845673, now seen corresponding path program 1 times [2019-09-05 11:59:29,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:29,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:29,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:29,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:29,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:29,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:30,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:59:30,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:30,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-05 11:59:30,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 11:59:30,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 11:59:30,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:59:30,044 INFO L87 Difference]: Start difference. First operand 104 states and 154 transitions. Second operand 6 states. [2019-09-05 11:59:30,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:30,257 INFO L93 Difference]: Finished difference Result 157 states and 240 transitions. [2019-09-05 11:59:30,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 11:59:30,257 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-09-05 11:59:30,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:30,260 INFO L225 Difference]: With dead ends: 157 [2019-09-05 11:59:30,260 INFO L226 Difference]: Without dead ends: 155 [2019-09-05 11:59:30,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:59:30,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-09-05 11:59:30,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 132. [2019-09-05 11:59:30,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-09-05 11:59:30,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 202 transitions. [2019-09-05 11:59:30,310 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 202 transitions. Word has length 19 [2019-09-05 11:59:30,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:30,311 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 202 transitions. [2019-09-05 11:59:30,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 11:59:30,312 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 202 transitions. [2019-09-05 11:59:30,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-05 11:59:30,317 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:30,318 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:30,318 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:30,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:30,318 INFO L82 PathProgramCache]: Analyzing trace with hash -2069937212, now seen corresponding path program 1 times [2019-09-05 11:59:30,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:30,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:30,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:30,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:30,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:30,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:30,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:59:30,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:30,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-05 11:59:30,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 11:59:30,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 11:59:30,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:59:30,398 INFO L87 Difference]: Start difference. First operand 132 states and 202 transitions. Second operand 6 states. [2019-09-05 11:59:30,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:30,607 INFO L93 Difference]: Finished difference Result 189 states and 291 transitions. [2019-09-05 11:59:30,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 11:59:30,607 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-09-05 11:59:30,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:30,610 INFO L225 Difference]: With dead ends: 189 [2019-09-05 11:59:30,610 INFO L226 Difference]: Without dead ends: 187 [2019-09-05 11:59:30,611 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:59:30,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-09-05 11:59:30,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 164. [2019-09-05 11:59:30,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-09-05 11:59:30,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 253 transitions. [2019-09-05 11:59:30,640 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 253 transitions. Word has length 19 [2019-09-05 11:59:30,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:30,641 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 253 transitions. [2019-09-05 11:59:30,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 11:59:30,641 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 253 transitions. [2019-09-05 11:59:30,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-05 11:59:30,642 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:30,642 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:30,642 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:30,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:30,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1098679356, now seen corresponding path program 1 times [2019-09-05 11:59:30,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:30,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:30,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:30,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:30,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:30,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:30,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:59:30,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:30,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 11:59:30,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 11:59:30,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 11:59:30,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 11:59:30,690 INFO L87 Difference]: Start difference. First operand 164 states and 253 transitions. Second operand 3 states. [2019-09-05 11:59:30,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:30,724 INFO L93 Difference]: Finished difference Result 309 states and 481 transitions. [2019-09-05 11:59:30,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 11:59:30,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-05 11:59:30,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:30,728 INFO L225 Difference]: With dead ends: 309 [2019-09-05 11:59:30,728 INFO L226 Difference]: Without dead ends: 232 [2019-09-05 11:59:30,734 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 11:59:30,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-09-05 11:59:30,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 194. [2019-09-05 11:59:30,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-05 11:59:30,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 306 transitions. [2019-09-05 11:59:30,771 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 306 transitions. Word has length 19 [2019-09-05 11:59:30,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:30,773 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 306 transitions. [2019-09-05 11:59:30,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 11:59:30,773 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 306 transitions. [2019-09-05 11:59:30,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-05 11:59:30,775 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:30,775 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:30,775 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:30,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:30,775 INFO L82 PathProgramCache]: Analyzing trace with hash -372123308, now seen corresponding path program 1 times [2019-09-05 11:59:30,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:30,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:30,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:30,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:30,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:30,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:30,833 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 11:59:30,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:30,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-05 11:59:30,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 11:59:30,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 11:59:30,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:59:30,835 INFO L87 Difference]: Start difference. First operand 194 states and 306 transitions. Second operand 6 states. [2019-09-05 11:59:31,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:31,011 INFO L93 Difference]: Finished difference Result 334 states and 545 transitions. [2019-09-05 11:59:31,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 11:59:31,012 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-09-05 11:59:31,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:31,016 INFO L225 Difference]: With dead ends: 334 [2019-09-05 11:59:31,016 INFO L226 Difference]: Without dead ends: 332 [2019-09-05 11:59:31,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:59:31,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-09-05 11:59:31,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 226. [2019-09-05 11:59:31,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-09-05 11:59:31,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 361 transitions. [2019-09-05 11:59:31,055 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 361 transitions. Word has length 26 [2019-09-05 11:59:31,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:31,056 INFO L475 AbstractCegarLoop]: Abstraction has 226 states and 361 transitions. [2019-09-05 11:59:31,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 11:59:31,057 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 361 transitions. [2019-09-05 11:59:31,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-05 11:59:31,057 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:31,058 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:31,058 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:31,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:31,058 INFO L82 PathProgramCache]: Analyzing trace with hash 348902212, now seen corresponding path program 1 times [2019-09-05 11:59:31,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:31,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:31,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:31,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:31,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:31,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:31,119 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 11:59:31,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:31,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 11:59:31,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:59:31,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:59:31,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:59:31,120 INFO L87 Difference]: Start difference. First operand 226 states and 361 transitions. Second operand 5 states. [2019-09-05 11:59:31,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:31,382 INFO L93 Difference]: Finished difference Result 534 states and 861 transitions. [2019-09-05 11:59:31,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 11:59:31,383 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-09-05 11:59:31,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:31,386 INFO L225 Difference]: With dead ends: 534 [2019-09-05 11:59:31,387 INFO L226 Difference]: Without dead ends: 356 [2019-09-05 11:59:31,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:59:31,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-09-05 11:59:31,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 226. [2019-09-05 11:59:31,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-09-05 11:59:31,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 359 transitions. [2019-09-05 11:59:31,427 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 359 transitions. Word has length 28 [2019-09-05 11:59:31,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:31,428 INFO L475 AbstractCegarLoop]: Abstraction has 226 states and 359 transitions. [2019-09-05 11:59:31,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:59:31,428 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 359 transitions. [2019-09-05 11:59:31,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-05 11:59:31,429 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:31,429 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:31,430 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:31,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:31,430 INFO L82 PathProgramCache]: Analyzing trace with hash -2096231521, now seen corresponding path program 1 times [2019-09-05 11:59:31,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:31,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:31,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:31,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:31,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:31,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:31,495 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-05 11:59:31,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:31,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-05 11:59:31,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-05 11:59:31,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-05 11:59:31,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:59:31,498 INFO L87 Difference]: Start difference. First operand 226 states and 359 transitions. Second operand 7 states. [2019-09-05 11:59:31,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:31,772 INFO L93 Difference]: Finished difference Result 362 states and 594 transitions. [2019-09-05 11:59:31,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 11:59:31,773 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-09-05 11:59:31,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:31,776 INFO L225 Difference]: With dead ends: 362 [2019-09-05 11:59:31,777 INFO L226 Difference]: Without dead ends: 360 [2019-09-05 11:59:31,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-05 11:59:31,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-09-05 11:59:31,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 306. [2019-09-05 11:59:31,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-09-05 11:59:31,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 502 transitions. [2019-09-05 11:59:31,825 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 502 transitions. Word has length 31 [2019-09-05 11:59:31,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:31,825 INFO L475 AbstractCegarLoop]: Abstraction has 306 states and 502 transitions. [2019-09-05 11:59:31,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-05 11:59:31,825 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 502 transitions. [2019-09-05 11:59:31,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-05 11:59:31,826 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:31,827 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:31,827 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:31,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:31,827 INFO L82 PathProgramCache]: Analyzing trace with hash 454341926, now seen corresponding path program 1 times [2019-09-05 11:59:31,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:31,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:31,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:31,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:31,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:31,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:31,891 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-05 11:59:31,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:31,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-05 11:59:31,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-05 11:59:31,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-05 11:59:31,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:59:31,892 INFO L87 Difference]: Start difference. First operand 306 states and 502 transitions. Second operand 7 states. [2019-09-05 11:59:32,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:32,131 INFO L93 Difference]: Finished difference Result 348 states and 559 transitions. [2019-09-05 11:59:32,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 11:59:32,132 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-09-05 11:59:32,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:32,136 INFO L225 Difference]: With dead ends: 348 [2019-09-05 11:59:32,136 INFO L226 Difference]: Without dead ends: 346 [2019-09-05 11:59:32,137 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-05 11:59:32,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-09-05 11:59:32,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 310. [2019-09-05 11:59:32,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-09-05 11:59:32,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 505 transitions. [2019-09-05 11:59:32,179 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 505 transitions. Word has length 41 [2019-09-05 11:59:32,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:32,181 INFO L475 AbstractCegarLoop]: Abstraction has 310 states and 505 transitions. [2019-09-05 11:59:32,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-05 11:59:32,181 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 505 transitions. [2019-09-05 11:59:32,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-05 11:59:32,182 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:32,182 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 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, 1] [2019-09-05 11:59:32,183 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:32,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:32,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1384233346, now seen corresponding path program 1 times [2019-09-05 11:59:32,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:32,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:32,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:32,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:32,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:32,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:32,256 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-05 11:59:32,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:32,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-05 11:59:32,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-05 11:59:32,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-05 11:59:32,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:59:32,258 INFO L87 Difference]: Start difference. First operand 310 states and 505 transitions. Second operand 7 states. [2019-09-05 11:59:32,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:32,429 INFO L93 Difference]: Finished difference Result 317 states and 511 transitions. [2019-09-05 11:59:32,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 11:59:32,429 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-09-05 11:59:32,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:32,432 INFO L225 Difference]: With dead ends: 317 [2019-09-05 11:59:32,433 INFO L226 Difference]: Without dead ends: 315 [2019-09-05 11:59:32,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-05 11:59:32,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-09-05 11:59:32,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 185. [2019-09-05 11:59:32,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-09-05 11:59:32,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 278 transitions. [2019-09-05 11:59:32,461 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 278 transitions. Word has length 41 [2019-09-05 11:59:32,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:32,462 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 278 transitions. [2019-09-05 11:59:32,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-05 11:59:32,462 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 278 transitions. [2019-09-05 11:59:32,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-05 11:59:32,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:32,463 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:32,463 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:32,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:32,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1052669362, now seen corresponding path program 1 times [2019-09-05 11:59:32,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:32,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:32,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:32,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:32,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:32,508 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-05 11:59:32,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:32,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-05 11:59:32,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 11:59:32,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 11:59:32,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:59:32,509 INFO L87 Difference]: Start difference. First operand 185 states and 278 transitions. Second operand 6 states. [2019-09-05 11:59:32,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:32,665 INFO L93 Difference]: Finished difference Result 344 states and 554 transitions. [2019-09-05 11:59:32,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 11:59:32,665 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2019-09-05 11:59:32,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:32,668 INFO L225 Difference]: With dead ends: 344 [2019-09-05 11:59:32,668 INFO L226 Difference]: Without dead ends: 342 [2019-09-05 11:59:32,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:59:32,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-09-05 11:59:32,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 318. [2019-09-05 11:59:32,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-09-05 11:59:32,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 511 transitions. [2019-09-05 11:59:32,714 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 511 transitions. Word has length 48 [2019-09-05 11:59:32,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:32,715 INFO L475 AbstractCegarLoop]: Abstraction has 318 states and 511 transitions. [2019-09-05 11:59:32,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 11:59:32,715 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 511 transitions. [2019-09-05 11:59:32,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-05 11:59:32,717 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:32,717 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 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-09-05 11:59:32,717 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:32,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:32,718 INFO L82 PathProgramCache]: Analyzing trace with hash 867583944, now seen corresponding path program 1 times [2019-09-05 11:59:32,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:32,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:32,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:32,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:32,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:32,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:32,766 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-05 11:59:32,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:32,766 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:32,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:32,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:32,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-05 11:59:32,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:32,891 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-09-05 11:59:32,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-05 11:59:32,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2019-09-05 11:59:32,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-05 11:59:32,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-05 11:59:32,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-05 11:59:32,897 INFO L87 Difference]: Start difference. First operand 318 states and 511 transitions. Second operand 9 states. [2019-09-05 11:59:33,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:33,523 INFO L93 Difference]: Finished difference Result 675 states and 1074 transitions. [2019-09-05 11:59:33,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-05 11:59:33,523 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2019-09-05 11:59:33,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:33,527 INFO L225 Difference]: With dead ends: 675 [2019-09-05 11:59:33,528 INFO L226 Difference]: Without dead ends: 391 [2019-09-05 11:59:33,531 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-09-05 11:59:33,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2019-09-05 11:59:33,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 330. [2019-09-05 11:59:33,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-09-05 11:59:33,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 521 transitions. [2019-09-05 11:59:33,597 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 521 transitions. Word has length 61 [2019-09-05 11:59:33,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:33,598 INFO L475 AbstractCegarLoop]: Abstraction has 330 states and 521 transitions. [2019-09-05 11:59:33,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-05 11:59:33,598 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 521 transitions. [2019-09-05 11:59:33,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-05 11:59:33,602 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:33,602 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:33,602 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:33,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:33,603 INFO L82 PathProgramCache]: Analyzing trace with hash 2141038378, now seen corresponding path program 1 times [2019-09-05 11:59:33,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:33,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:33,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:33,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:33,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:33,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:33,678 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-05 11:59:33,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:33,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-05 11:59:33,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-05 11:59:33,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-05 11:59:33,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:59:33,680 INFO L87 Difference]: Start difference. First operand 330 states and 521 transitions. Second operand 7 states. [2019-09-05 11:59:33,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:33,944 INFO L93 Difference]: Finished difference Result 382 states and 604 transitions. [2019-09-05 11:59:33,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-05 11:59:33,945 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2019-09-05 11:59:33,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:33,949 INFO L225 Difference]: With dead ends: 382 [2019-09-05 11:59:33,949 INFO L226 Difference]: Without dead ends: 380 [2019-09-05 11:59:33,950 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-05 11:59:33,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-09-05 11:59:34,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 334. [2019-09-05 11:59:34,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-09-05 11:59:34,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 524 transitions. [2019-09-05 11:59:34,020 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 524 transitions. Word has length 75 [2019-09-05 11:59:34,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:34,022 INFO L475 AbstractCegarLoop]: Abstraction has 334 states and 524 transitions. [2019-09-05 11:59:34,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-05 11:59:34,022 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 524 transitions. [2019-09-05 11:59:34,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-05 11:59:34,025 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:34,025 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 13, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:34,026 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:34,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:34,026 INFO L82 PathProgramCache]: Analyzing trace with hash 2023812105, now seen corresponding path program 1 times [2019-09-05 11:59:34,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:34,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:34,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:34,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:34,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:34,161 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 26 proven. 8 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-05 11:59:34,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:34,161 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:59:34,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:34,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:34,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-05 11:59:34,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:34,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:34,480 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-05 11:59:34,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:34,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2019-09-05 11:59:34,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-05 11:59:34,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-05 11:59:34,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-09-05 11:59:34,493 INFO L87 Difference]: Start difference. First operand 334 states and 524 transitions. Second operand 15 states. [2019-09-05 11:59:36,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:36,126 INFO L93 Difference]: Finished difference Result 482 states and 764 transitions. [2019-09-05 11:59:36,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-05 11:59:36,127 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 88 [2019-09-05 11:59:36,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:36,130 INFO L225 Difference]: With dead ends: 482 [2019-09-05 11:59:36,130 INFO L226 Difference]: Without dead ends: 347 [2019-09-05 11:59:36,132 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=221, Invalid=709, Unknown=0, NotChecked=0, Total=930 [2019-09-05 11:59:36,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2019-09-05 11:59:36,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 259. [2019-09-05 11:59:36,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-09-05 11:59:36,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 386 transitions. [2019-09-05 11:59:36,178 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 386 transitions. Word has length 88 [2019-09-05 11:59:36,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:36,178 INFO L475 AbstractCegarLoop]: Abstraction has 259 states and 386 transitions. [2019-09-05 11:59:36,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-05 11:59:36,179 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 386 transitions. [2019-09-05 11:59:36,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-05 11:59:36,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:36,181 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2019-09-05 11:59:36,181 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:36,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:36,181 INFO L82 PathProgramCache]: Analyzing trace with hash -389727920, now seen corresponding path program 1 times [2019-09-05 11:59:36,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:36,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:36,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:36,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:36,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:36,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:36,236 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 25 proven. 17 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2019-09-05 11:59:36,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:36,237 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:36,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:36,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:36,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-05 11:59:36,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:36,352 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 149 proven. 2 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:59:36,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:36,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2019-09-05 11:59:36,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-05 11:59:36,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-05 11:59:36,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-05 11:59:36,360 INFO L87 Difference]: Start difference. First operand 259 states and 386 transitions. Second operand 11 states. [2019-09-05 11:59:37,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:37,745 INFO L93 Difference]: Finished difference Result 596 states and 909 transitions. [2019-09-05 11:59:37,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-05 11:59:37,745 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 88 [2019-09-05 11:59:37,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:37,748 INFO L225 Difference]: With dead ends: 596 [2019-09-05 11:59:37,749 INFO L226 Difference]: Without dead ends: 420 [2019-09-05 11:59:37,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=197, Invalid=615, Unknown=0, NotChecked=0, Total=812 [2019-09-05 11:59:37,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2019-09-05 11:59:37,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 326. [2019-09-05 11:59:37,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-09-05 11:59:37,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 495 transitions. [2019-09-05 11:59:37,807 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 495 transitions. Word has length 88 [2019-09-05 11:59:37,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:37,807 INFO L475 AbstractCegarLoop]: Abstraction has 326 states and 495 transitions. [2019-09-05 11:59:37,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-05 11:59:37,807 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 495 transitions. [2019-09-05 11:59:37,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-05 11:59:37,809 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:37,809 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:37,809 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:37,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:37,809 INFO L82 PathProgramCache]: Analyzing trace with hash -16221646, now seen corresponding path program 1 times [2019-09-05 11:59:37,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:37,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:37,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:37,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:37,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:37,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:37,888 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 44 proven. 8 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-05 11:59:37,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:37,889 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:59:37,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:37,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:37,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-05 11:59:37,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:38,117 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 153 proven. 7 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2019-09-05 11:59:38,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:38,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-09-05 11:59:38,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-05 11:59:38,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-05 11:59:38,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-09-05 11:59:38,128 INFO L87 Difference]: Start difference. First operand 326 states and 495 transitions. Second operand 14 states. [2019-09-05 11:59:39,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:39,596 INFO L93 Difference]: Finished difference Result 894 states and 1414 transitions. [2019-09-05 11:59:39,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-05 11:59:39,597 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 110 [2019-09-05 11:59:39,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:39,601 INFO L225 Difference]: With dead ends: 894 [2019-09-05 11:59:39,601 INFO L226 Difference]: Without dead ends: 502 [2019-09-05 11:59:39,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=194, Invalid=508, Unknown=0, NotChecked=0, Total=702 [2019-09-05 11:59:39,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2019-09-05 11:59:39,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 448. [2019-09-05 11:59:39,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-09-05 11:59:39,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 711 transitions. [2019-09-05 11:59:39,680 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 711 transitions. Word has length 110 [2019-09-05 11:59:39,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:39,681 INFO L475 AbstractCegarLoop]: Abstraction has 448 states and 711 transitions. [2019-09-05 11:59:39,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-05 11:59:39,681 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 711 transitions. [2019-09-05 11:59:39,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-05 11:59:39,684 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:39,684 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:39,684 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:39,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:39,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1522118384, now seen corresponding path program 1 times [2019-09-05 11:59:39,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:39,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:39,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:39,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:39,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:39,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:39,786 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 33 proven. 19 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-05 11:59:39,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:39,786 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:59:39,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:39,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-05 11:59:39,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:39,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:40,011 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 45 proven. 7 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:59:40,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:40,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2019-09-05 11:59:40,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-05 11:59:40,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-05 11:59:40,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-09-05 11:59:40,027 INFO L87 Difference]: Start difference. First operand 448 states and 711 transitions. Second operand 14 states. [2019-09-05 11:59:41,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:41,245 INFO L93 Difference]: Finished difference Result 549 states and 871 transitions. [2019-09-05 11:59:41,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-05 11:59:41,246 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 110 [2019-09-05 11:59:41,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:41,247 INFO L225 Difference]: With dead ends: 549 [2019-09-05 11:59:41,247 INFO L226 Difference]: Without dead ends: 0 [2019-09-05 11:59:41,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=188, Invalid=568, Unknown=0, NotChecked=0, Total=756 [2019-09-05 11:59:41,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-05 11:59:41,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-05 11:59:41,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-05 11:59:41,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-05 11:59:41,253 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 110 [2019-09-05 11:59:41,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:41,254 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-05 11:59:41,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-05 11:59:41,254 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-05 11:59:41,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-05 11:59:41,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-05 11:59:41,414 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 129 [2019-09-05 11:59:41,761 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 146 [2019-09-05 11:59:42,022 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 144 [2019-09-05 11:59:42,266 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 146 [2019-09-05 11:59:42,626 WARN L188 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 144 [2019-09-05 11:59:42,769 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 112 [2019-09-05 11:59:42,920 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 112 [2019-09-05 11:59:43,357 WARN L188 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 268 DAG size of output: 202 [2019-09-05 11:59:43,647 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 146 [2019-09-05 11:59:44,067 WARN L188 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 187 [2019-09-05 11:59:44,554 WARN L188 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 326 DAG size of output: 239 [2019-09-05 11:59:44,905 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 187 [2019-09-05 11:59:45,197 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 326 DAG size of output: 239 [2019-09-05 11:59:46,021 WARN L188 SmtUtils]: Spent 678.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 46 [2019-09-05 11:59:46,394 WARN L188 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 22 [2019-09-05 11:59:47,089 WARN L188 SmtUtils]: Spent 692.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 20 [2019-09-05 11:59:47,461 WARN L188 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 22 [2019-09-05 11:59:48,098 WARN L188 SmtUtils]: Spent 635.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 20 [2019-09-05 11:59:48,537 WARN L188 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 33 [2019-09-05 11:59:48,976 WARN L188 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 33 [2019-09-05 11:59:49,917 WARN L188 SmtUtils]: Spent 937.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 33 [2019-09-05 11:59:50,343 WARN L188 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 33 [2019-09-05 11:59:50,718 WARN L188 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 22 [2019-09-05 11:59:51,719 WARN L188 SmtUtils]: Spent 998.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 21 [2019-09-05 11:59:52,203 WARN L188 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 33 [2019-09-05 11:59:53,516 WARN L188 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 219 DAG size of output: 22 [2019-09-05 11:59:54,496 WARN L188 SmtUtils]: Spent 977.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 21 [2019-09-05 11:59:55,765 WARN L188 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 219 DAG size of output: 22 [2019-09-05 11:59:55,793 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-05 11:59:55,794 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-05 11:59:55,794 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-05 11:59:55,794 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-05 11:59:55,794 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-05 11:59:55,794 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-05 11:59:55,794 INFO L439 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (let ((.cse3 (* 2 main_~l~0))) (let ((.cse4 (<= 1 main_~i~0)) (.cse7 (<= 1 main_~l~0)) (.cse6 (<= main_~j~0 main_~r~0)) (.cse0 (<= (+ (* 2 main_~i~0) main_~r~0 2) (+ main_~j~0 (* 2 main_~n~0)))) (.cse1 (<= (+ main_~j~0 1) main_~n~0)) (.cse2 (<= .cse3 main_~j~0)) (.cse5 (<= main_~r~0 main_~n~0))) (or (and .cse0 .cse1 .cse2 (<= 1 (div main_~j~0 2)) (<= .cse3 main_~r~0) .cse4 .cse5 (<= main_~j~0 .cse3)) (and .cse4 .cse1 .cse0 .cse5 (and .cse6 (and (<= 2 main_~j~0) .cse7 (<= main_~l~0 1)))) (and (<= 2 main_~i~0) .cse7 .cse6 .cse0 .cse1 .cse2 .cse5)))) [2019-09-05 11:59:55,794 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 56) no Hoare annotation was computed. [2019-09-05 11:59:55,795 INFO L439 ceAbstractionStarter]: At program point L40(line 40) the Hoare annotation is: (let ((.cse0 (* 2 main_~l~0))) (and (<= (+ main_~i~0 1) main_~n~0) (<= .cse0 main_~r~0) (<= 1 main_~l~0) (<= (+ (* 2 main_~i~0) main_~r~0 2) (+ main_~j~0 (* 2 main_~n~0))) (<= main_~r~0 main_~n~0) (<= main_~j~0 main_~n~0) (<= .cse0 main_~j~0))) [2019-09-05 11:59:55,795 INFO L439 ceAbstractionStarter]: At program point L28(line 28) the Hoare annotation is: (let ((.cse3 (* 2 main_~l~0))) (let ((.cse4 (<= 1 main_~i~0)) (.cse7 (<= 1 main_~l~0)) (.cse6 (<= main_~j~0 main_~r~0)) (.cse0 (<= (+ (* 2 main_~i~0) main_~r~0 2) (+ main_~j~0 (* 2 main_~n~0)))) (.cse1 (<= (+ main_~j~0 1) main_~n~0)) (.cse2 (<= .cse3 main_~j~0)) (.cse5 (<= main_~r~0 main_~n~0))) (or (and .cse0 .cse1 .cse2 (<= 1 (div main_~j~0 2)) (<= .cse3 main_~r~0) .cse4 .cse5 (<= main_~j~0 .cse3)) (and .cse4 .cse1 .cse0 .cse5 (and .cse6 (and (<= 2 main_~j~0) .cse7 (<= main_~l~0 1)))) (and (<= 2 main_~i~0) .cse7 .cse6 .cse0 .cse1 .cse2 .cse5)))) [2019-09-05 11:59:55,795 INFO L439 ceAbstractionStarter]: At program point L24-2(lines 24 44) the Hoare annotation is: (let ((.cse2 (<= 1 main_~l~0)) (.cse4 (<= main_~r~0 main_~n~0)) (.cse11 (* 2 main_~i~0)) (.cse10 (* 2 main_~l~0))) (let ((.cse0 (<= 2 main_~i~0)) (.cse5 (<= .cse10 main_~j~0)) (.cse8 (div main_~j~0 2)) (.cse1 (<= .cse10 main_~r~0)) (.cse9 (<= 1 main_~i~0)) (.cse3 (<= (+ .cse11 main_~r~0 2) (+ main_~j~0 (* 2 main_~n~0)))) (.cse6 (+ .cse11 main_~r~0)) (.cse7 (and (<= 2 main_~j~0) .cse2 (<= main_~l~0 1) .cse4 (<= 2 main_~r~0)))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4) (<= (div (- main_~r~0) (- 2)) (+ main_~l~0 1)) .cse5) (and .cse0 .cse2 .cse3 .cse5 .cse1 .cse4 (<= (+ main_~j~0 4) .cse6)) (and .cse0 .cse7 (<= main_~i~0 .cse8)) (and .cse3 .cse5 (<= 1 .cse8) .cse1 .cse9 .cse4 (<= main_~j~0 .cse10)) (and .cse9 .cse3 (and (<= (+ main_~j~0 2) .cse6) .cse7))))) [2019-09-05 11:59:55,795 INFO L443 ceAbstractionStarter]: For program point L24-3(lines 21 54) no Hoare annotation was computed. [2019-09-05 11:59:55,795 INFO L443 ceAbstractionStarter]: For program point L16(lines 16 20) no Hoare annotation was computed. [2019-09-05 11:59:55,795 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 10 56) no Hoare annotation was computed. [2019-09-05 11:59:55,796 INFO L443 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2019-09-05 11:59:55,796 INFO L439 ceAbstractionStarter]: At program point L33(line 33) the Hoare annotation is: (let ((.cse0 (* 2 main_~l~0))) (and (<= (+ main_~i~0 1) main_~n~0) (<= .cse0 main_~r~0) (<= 1 main_~l~0) (<= 1 main_~i~0) (<= (+ (* 2 main_~i~0) main_~r~0 2) (+ main_~j~0 (* 2 main_~n~0))) (<= main_~r~0 main_~n~0) (<= main_~j~0 main_~n~0) (<= .cse0 main_~j~0))) [2019-09-05 11:59:55,796 INFO L443 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2019-09-05 11:59:55,796 INFO L443 ceAbstractionStarter]: For program point L25(lines 25 32) no Hoare annotation was computed. [2019-09-05 11:59:55,796 INFO L439 ceAbstractionStarter]: At program point L25-1(lines 25 32) the Hoare annotation is: (let ((.cse0 (* 2 main_~l~0))) (and (<= (+ main_~i~0 1) main_~n~0) (<= .cse0 main_~r~0) (<= 1 main_~l~0) (<= 1 main_~i~0) (<= (+ (* 2 main_~i~0) main_~r~0 2) (+ main_~j~0 (* 2 main_~n~0))) (<= main_~r~0 main_~n~0) (<= main_~j~0 main_~n~0) (<= .cse0 main_~j~0))) [2019-09-05 11:59:55,796 INFO L443 ceAbstractionStarter]: For program point L21-1(lines 21 54) no Hoare annotation was computed. [2019-09-05 11:59:55,796 INFO L439 ceAbstractionStarter]: At program point L50(line 50) the Hoare annotation is: (and (<= 2 main_~j~0) (<= 1 main_~l~0) (<= main_~l~0 1) (<= (+ (* 2 main_~i~0) main_~r~0 2) (+ main_~j~0 (* 2 main_~n~0))) (<= main_~r~0 main_~n~0) (<= 2 main_~r~0)) [2019-09-05 11:59:55,797 INFO L439 ceAbstractionStarter]: At program point L50-1(line 50) the Hoare annotation is: (and (<= 2 main_~j~0) (<= 1 main_~l~0) (<= main_~l~0 1) (<= (+ (* 2 main_~i~0) main_~r~0 2) (+ main_~j~0 (* 2 main_~n~0))) (<= main_~r~0 main_~n~0) (<= 2 main_~r~0)) [2019-09-05 11:59:55,797 INFO L439 ceAbstractionStarter]: At program point L46(line 46) the Hoare annotation is: (let ((.cse0 (* 2 main_~l~0))) (and (<= .cse0 main_~r~0) (<= (+ (* 2 main_~i~0) main_~r~0 2) (+ main_~j~0 (* 2 main_~n~0))) (<= main_~r~0 main_~n~0) (<= 2 main_~l~0) (<= .cse0 main_~j~0))) [2019-09-05 11:59:55,797 INFO L443 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2019-09-05 11:59:55,797 INFO L439 ceAbstractionStarter]: At program point L46-1(line 46) the Hoare annotation is: (let ((.cse0 (* 2 main_~l~0))) (and (<= .cse0 main_~r~0) (<= (+ (* 2 main_~i~0) main_~r~0 2) (+ main_~j~0 (* 2 main_~n~0))) (<= main_~r~0 main_~n~0) (<= 2 main_~l~0) (<= .cse0 main_~j~0))) [2019-09-05 11:59:55,797 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 56) no Hoare annotation was computed. [2019-09-05 11:59:55,797 INFO L439 ceAbstractionStarter]: At program point L38(line 38) the Hoare annotation is: (let ((.cse0 (* 2 main_~l~0))) (and (<= (+ main_~i~0 1) main_~n~0) (<= .cse0 main_~r~0) (<= 1 main_~l~0) (<= 1 main_~i~0) (<= (+ (* 2 main_~i~0) main_~r~0 2) (+ main_~j~0 (* 2 main_~n~0))) (<= main_~r~0 main_~n~0) (<= main_~j~0 main_~n~0) (<= .cse0 main_~j~0))) [2019-09-05 11:59:55,798 INFO L439 ceAbstractionStarter]: At program point L38-1(line 38) the Hoare annotation is: (let ((.cse6 (* 2 main_~l~0))) (let ((.cse4 (<= .cse6 main_~j~0)) (.cse0 (<= (+ main_~i~0 1) main_~n~0)) (.cse1 (<= 1 main_~l~0)) (.cse2 (<= (+ (* 2 main_~i~0) main_~r~0 2) (+ main_~j~0 (* 2 main_~n~0)))) (.cse5 (<= main_~r~0 main_~n~0)) (.cse3 (<= main_~j~0 main_~n~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ main_~l~0 1) (div main_~r~0 2)) .cse5) (and (and .cse0 (<= .cse6 main_~r~0) .cse1 (<= 1 main_~i~0) .cse2 .cse5 .cse3) .cse4) (and (and (<= 2 main_~j~0) (<= main_~l~0 1) (<= 2 main_~r~0)) .cse0 .cse1 .cse2 .cse5 .cse3)))) [2019-09-05 11:59:55,798 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-09-05 11:59:55,798 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 31) no Hoare annotation was computed. [2019-09-05 11:59:55,798 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 56) the Hoare annotation is: true [2019-09-05 11:59:55,798 INFO L439 ceAbstractionStarter]: At program point L26(line 26) the Hoare annotation is: (let ((.cse3 (* 2 main_~l~0))) (let ((.cse4 (<= 1 main_~i~0)) (.cse7 (<= 1 main_~l~0)) (.cse6 (<= main_~j~0 main_~r~0)) (.cse0 (<= (+ (* 2 main_~i~0) main_~r~0 2) (+ main_~j~0 (* 2 main_~n~0)))) (.cse1 (<= (+ main_~j~0 1) main_~n~0)) (.cse2 (<= .cse3 main_~j~0)) (.cse5 (<= main_~r~0 main_~n~0))) (or (and .cse0 .cse1 .cse2 (<= 1 (div main_~j~0 2)) (<= .cse3 main_~r~0) .cse4 .cse5 (<= main_~j~0 .cse3)) (and .cse4 .cse1 .cse0 .cse5 (and .cse6 (and (<= 2 main_~j~0) .cse7 (<= main_~l~0 1)))) (and (<= 2 main_~i~0) .cse7 .cse6 .cse0 .cse1 .cse2 .cse5)))) [2019-09-05 11:59:55,799 INFO L439 ceAbstractionStarter]: At program point L26-1(line 26) the Hoare annotation is: (let ((.cse3 (* 2 main_~l~0))) (let ((.cse4 (<= 1 main_~i~0)) (.cse7 (<= 1 main_~l~0)) (.cse6 (<= main_~j~0 main_~r~0)) (.cse0 (<= (+ (* 2 main_~i~0) main_~r~0 2) (+ main_~j~0 (* 2 main_~n~0)))) (.cse1 (<= (+ main_~j~0 1) main_~n~0)) (.cse2 (<= .cse3 main_~j~0)) (.cse5 (<= main_~r~0 main_~n~0))) (or (and .cse0 .cse1 .cse2 (<= 1 (div main_~j~0 2)) (<= .cse3 main_~r~0) .cse4 .cse5 (<= main_~j~0 .cse3)) (and .cse4 .cse1 .cse0 .cse5 (and .cse6 (and (<= 2 main_~j~0) .cse7 (<= main_~l~0 1)))) (and (<= 2 main_~i~0) .cse7 .cse6 .cse0 .cse1 .cse2 .cse5)))) [2019-09-05 11:59:55,799 INFO L443 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-09-05 11:59:55,799 INFO L443 ceAbstractionStarter]: For program point L47(line 47) no Hoare annotation was computed. [2019-09-05 11:59:55,799 INFO L439 ceAbstractionStarter]: At program point L39(line 39) the Hoare annotation is: (let ((.cse0 (* 2 main_~l~0))) (and (<= (+ main_~i~0 1) main_~n~0) (<= .cse0 main_~r~0) (<= 1 main_~l~0) (<= (+ (* 2 main_~i~0) main_~r~0 2) (+ main_~j~0 (* 2 main_~n~0))) (<= main_~r~0 main_~n~0) (<= main_~j~0 main_~n~0) (<= .cse0 main_~j~0))) [2019-09-05 11:59:55,799 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 37) no Hoare annotation was computed. [2019-09-05 11:59:55,799 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-09-05 11:59:55,799 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-09-05 11:59:55,800 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-09-05 11:59:55,800 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-09-05 11:59:55,800 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-09-05 11:59:55,800 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-09-05 11:59:55,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.09 11:59:55 BoogieIcfgContainer [2019-09-05 11:59:55,817 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-05 11:59:55,818 INFO L168 Benchmark]: Toolchain (without parser) took 28246.34 ms. Allocated memory was 139.5 MB in the beginning and 511.2 MB in the end (delta: 371.7 MB). Free memory was 87.5 MB in the beginning and 458.2 MB in the end (delta: -370.8 MB). Peak memory consumption was 387.7 MB. Max. memory is 7.1 GB. [2019-09-05 11:59:55,819 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 139.5 MB. Free memory was 105.4 MB in the beginning and 105.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-05 11:59:55,820 INFO L168 Benchmark]: CACSL2BoogieTranslator took 267.46 ms. Allocated memory is still 139.5 MB. Free memory was 87.2 MB in the beginning and 77.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-09-05 11:59:55,820 INFO L168 Benchmark]: Boogie Preprocessor took 131.01 ms. Allocated memory was 139.5 MB in the beginning and 198.2 MB in the end (delta: 58.7 MB). Free memory was 77.2 MB in the beginning and 175.8 MB in the end (delta: -98.6 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. [2019-09-05 11:59:55,821 INFO L168 Benchmark]: RCFGBuilder took 289.77 ms. Allocated memory is still 198.2 MB. Free memory was 175.8 MB in the beginning and 159.8 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. [2019-09-05 11:59:55,822 INFO L168 Benchmark]: TraceAbstraction took 27554.03 ms. Allocated memory was 198.2 MB in the beginning and 511.2 MB in the end (delta: 313.0 MB). Free memory was 159.8 MB in the beginning and 458.2 MB in the end (delta: -298.5 MB). Peak memory consumption was 401.3 MB. Max. memory is 7.1 GB. [2019-09-05 11:59:55,825 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.39 ms. Allocated memory is still 139.5 MB. Free memory was 105.4 MB in the beginning and 105.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 267.46 ms. Allocated memory is still 139.5 MB. Free memory was 87.2 MB in the beginning and 77.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 131.01 ms. Allocated memory was 139.5 MB in the beginning and 198.2 MB in the end (delta: 58.7 MB). Free memory was 77.2 MB in the beginning and 175.8 MB in the end (delta: -98.6 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 289.77 ms. Allocated memory is still 198.2 MB. Free memory was 175.8 MB in the beginning and 159.8 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 27554.03 ms. Allocated memory was 198.2 MB in the beginning and 511.2 MB in the end (delta: 313.0 MB). Free memory was 159.8 MB in the beginning and 458.2 MB in the end (delta: -298.5 MB). Peak memory consumption was 401.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: (((((((((2 <= i && 2 * l <= r) && 1 <= l) && 2 * i + r + 2 <= j + 2 * n) && r <= n) && -r / -2 <= l + 1) && 2 * l <= j) || ((((((2 <= i && 1 <= l) && 2 * i + r + 2 <= j + 2 * n) && 2 * l <= j) && 2 * l <= r) && r <= n) && j + 4 <= 2 * i + r)) || ((2 <= i && (((2 <= j && 1 <= l) && l <= 1) && r <= n) && 2 <= r) && i <= j / 2)) || ((((((2 * i + r + 2 <= j + 2 * n && 2 * l <= j) && 1 <= j / 2) && 2 * l <= r) && 1 <= i) && r <= n) && j <= 2 * l)) || ((1 <= i && 2 * i + r + 2 <= j + 2 * n) && j + 2 <= 2 * i + r && (((2 <= j && 1 <= l) && l <= 1) && r <= n) && 2 <= r) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 43 locations, 1 error locations. SAFE Result, 27.4s OverallTime, 20 OverallIterations, 17 TraceHistogramMax, 9.3s AutomataDifference, 0.0s DeadEndRemovalTime, 14.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 1701 SDtfs, 1032 SDslu, 6079 SDs, 0 SdLazy, 4305 SolverSat, 2192 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 689 GetRequests, 477 SyntacticMatches, 2 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=448occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 20 MinimizatonAttempts, 916 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 894 PreInvPairs, 1315 NumberOfFragments, 1106 HoareAnnotationTreeSize, 894 FomulaSimplifications, 377784613 FormulaSimplificationTreeSizeReduction, 4.0s HoareSimplificationTime, 20 FomulaSimplificationsInter, 135087265 FormulaSimplificationTreeSizeReductionInter, 10.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1341 NumberOfCodeBlocks, 1341 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1316 ConstructedInterpolants, 27 QuantifiedInterpolants, 256064 SizeOfPredicates, 19 NumberOfNonLiveVariables, 958 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 25 InterpolantComputations, 16 PerfectInterpolantSequences, 4034/4116 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...