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/loops-crafted-1/nested3-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 20:07:55,558 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 20:07:55,560 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 20:07:55,571 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 20:07:55,571 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 20:07:55,572 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 20:07:55,574 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 20:07:55,575 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 20:07:55,583 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 20:07:55,584 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 20:07:55,586 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 20:07:55,587 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 20:07:55,587 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 20:07:55,588 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 20:07:55,589 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 20:07:55,590 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 20:07:55,591 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 20:07:55,591 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 20:07:55,593 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 20:07:55,595 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 20:07:55,596 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 20:07:55,597 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 20:07:55,598 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 20:07:55,599 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 20:07:55,601 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 20:07:55,601 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 20:07:55,601 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 20:07:55,602 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 20:07:55,603 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 20:07:55,603 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 20:07:55,604 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 20:07:55,604 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 20:07:55,605 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 20:07:55,606 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 20:07:55,607 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 20:07:55,607 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 20:07:55,608 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 20:07:55,608 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 20:07:55,608 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 20:07:55,609 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 20:07:55,609 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 20:07:55,610 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-03 20:07:55,624 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 20:07:55,624 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 20:07:55,626 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 20:07:55,627 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 20:07:55,627 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 20:07:55,627 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 20:07:55,627 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 20:07:55,627 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 20:07:55,628 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 20:07:55,628 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 20:07:55,628 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 20:07:55,629 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 20:07:55,629 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 20:07:55,629 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 20:07:55,630 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 20:07:55,630 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 20:07:55,631 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 20:07:55,631 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 20:07:55,631 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 20:07:55,631 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 20:07:55,631 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 20:07:55,632 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:07:55,632 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 20:07:55,632 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 20:07:55,632 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 20:07:55,632 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 20:07:55,633 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 20:07:55,633 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 20:07:55,633 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 20:07:55,675 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 20:07:55,691 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 20:07:55,696 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 20:07:55,697 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 20:07:55,697 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 20:07:55,698 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/nested3-1.c [2019-09-03 20:07:55,770 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72ff27158/b7d07846447e4f73a811a05ea18b5f21/FLAG51e54f22b [2019-09-03 20:07:56,238 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 20:07:56,240 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested3-1.c [2019-09-03 20:07:56,247 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72ff27158/b7d07846447e4f73a811a05ea18b5f21/FLAG51e54f22b [2019-09-03 20:07:56,581 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72ff27158/b7d07846447e4f73a811a05ea18b5f21 [2019-09-03 20:07:56,593 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 20:07:56,594 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 20:07:56,595 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 20:07:56,596 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 20:07:56,598 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 20:07:56,599 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:07:56" (1/1) ... [2019-09-03 20:07:56,602 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e6bd940 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:07:56, skipping insertion in model container [2019-09-03 20:07:56,602 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:07:56" (1/1) ... [2019-09-03 20:07:56,610 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 20:07:56,626 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 20:07:56,807 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:07:56,818 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 20:07:56,840 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:07:56,851 INFO L192 MainTranslator]: Completed translation [2019-09-03 20:07:56,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:07:56 WrapperNode [2019-09-03 20:07:56,851 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 20:07:56,852 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 20:07:56,852 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 20:07:56,852 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 20:07:56,862 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:07:56" (1/1) ... [2019-09-03 20:07:56,862 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:07:56" (1/1) ... [2019-09-03 20:07:56,960 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:07:56" (1/1) ... [2019-09-03 20:07:56,960 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:07:56" (1/1) ... [2019-09-03 20:07:56,964 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:07:56" (1/1) ... [2019-09-03 20:07:56,969 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:07:56" (1/1) ... [2019-09-03 20:07:56,970 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:07:56" (1/1) ... [2019-09-03 20:07:56,972 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 20:07:56,972 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 20:07:56,972 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 20:07:56,973 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 20:07:56,973 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:07:56" (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-03 20:07:57,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 20:07:57,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 20:07:57,030 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 20:07:57,030 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 20:07:57,030 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 20:07:57,030 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 20:07:57,030 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 20:07:57,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 20:07:57,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 20:07:57,237 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 20:07:57,238 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-03 20:07:57,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:07:57 BoogieIcfgContainer [2019-09-03 20:07:57,239 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 20:07:57,240 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 20:07:57,240 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 20:07:57,245 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 20:07:57,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 08:07:56" (1/3) ... [2019-09-03 20:07:57,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@761bb719 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:07:57, skipping insertion in model container [2019-09-03 20:07:57,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:07:56" (2/3) ... [2019-09-03 20:07:57,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@761bb719 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:07:57, skipping insertion in model container [2019-09-03 20:07:57,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:07:57" (3/3) ... [2019-09-03 20:07:57,260 INFO L109 eAbstractionObserver]: Analyzing ICFG nested3-1.c [2019-09-03 20:07:57,278 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 20:07:57,288 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 20:07:57,309 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 20:07:57,341 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 20:07:57,342 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 20:07:57,342 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 20:07:57,342 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 20:07:57,343 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 20:07:57,343 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 20:07:57,343 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 20:07:57,343 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 20:07:57,343 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 20:07:57,363 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-09-03 20:07:57,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 20:07:57,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:07:57,369 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:07:57,372 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:07:57,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:07:57,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1303616190, now seen corresponding path program 1 times [2019-09-03 20:07:57,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:07:57,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:07:57,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:07:57,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:07:57,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:07:57,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:07:57,483 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-03 20:07:57,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:07:57,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 20:07:57,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 20:07:57,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 20:07:57,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 20:07:57,507 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2019-09-03 20:07:57,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:07:57,530 INFO L93 Difference]: Finished difference Result 41 states and 60 transitions. [2019-09-03 20:07:57,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 20:07:57,531 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-03 20:07:57,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:07:57,539 INFO L225 Difference]: With dead ends: 41 [2019-09-03 20:07:57,539 INFO L226 Difference]: Without dead ends: 19 [2019-09-03 20:07:57,542 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 20:07:57,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-03 20:07:57,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-03 20:07:57,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-03 20:07:57,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2019-09-03 20:07:57,584 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 10 [2019-09-03 20:07:57,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:07:57,584 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-09-03 20:07:57,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 20:07:57,584 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2019-09-03 20:07:57,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 20:07:57,585 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:07:57,586 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:07:57,586 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:07:57,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:07:57,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1274063518, now seen corresponding path program 1 times [2019-09-03 20:07:57,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:07:57,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:07:57,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:07:57,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:07:57,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:07:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:07:57,755 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-03 20:07:57,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:07:57,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:07:57,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:07:57,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:07:57,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:07:57,758 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 3 states. [2019-09-03 20:07:57,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:07:57,784 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2019-09-03 20:07:57,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:07:57,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-03 20:07:57,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:07:57,786 INFO L225 Difference]: With dead ends: 33 [2019-09-03 20:07:57,786 INFO L226 Difference]: Without dead ends: 26 [2019-09-03 20:07:57,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:07:57,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-03 20:07:57,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2019-09-03 20:07:57,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-03 20:07:57,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-09-03 20:07:57,796 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 10 [2019-09-03 20:07:57,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:07:57,797 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-09-03 20:07:57,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:07:57,797 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-09-03 20:07:57,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-03 20:07:57,798 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:07:57,798 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:07:57,798 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:07:57,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:07:57,799 INFO L82 PathProgramCache]: Analyzing trace with hash 856543284, now seen corresponding path program 1 times [2019-09-03 20:07:57,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:07:57,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:07:57,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:07:57,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:07:57,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:07:57,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:07:57,884 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-03 20:07:57,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:07:57,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:07:57,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:07:57,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:07:57,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:07:57,886 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 3 states. [2019-09-03 20:07:57,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:07:57,906 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2019-09-03 20:07:57,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:07:57,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-09-03 20:07:57,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:07:57,908 INFO L225 Difference]: With dead ends: 38 [2019-09-03 20:07:57,908 INFO L226 Difference]: Without dead ends: 24 [2019-09-03 20:07:57,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:07:57,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-03 20:07:57,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2019-09-03 20:07:57,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-03 20:07:57,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-09-03 20:07:57,916 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 11 [2019-09-03 20:07:57,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:07:57,916 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-09-03 20:07:57,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:07:57,917 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-09-03 20:07:57,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 20:07:57,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:07:57,918 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:07:57,918 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:07:57,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:07:57,918 INFO L82 PathProgramCache]: Analyzing trace with hash 808417067, now seen corresponding path program 1 times [2019-09-03 20:07:57,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:07:57,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:07:57,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:07:57,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:07:57,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:07:57,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:07:57,982 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-03 20:07:57,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:07:57,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:07:57,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:07:57,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:07:57,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:07:57,984 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 3 states. [2019-09-03 20:07:57,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:07:57,997 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2019-09-03 20:07:57,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:07:57,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-09-03 20:07:57,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:07:57,999 INFO L225 Difference]: With dead ends: 38 [2019-09-03 20:07:57,999 INFO L226 Difference]: Without dead ends: 23 [2019-09-03 20:07:58,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:07:58,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-03 20:07:58,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-09-03 20:07:58,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-03 20:07:58,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-09-03 20:07:58,007 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 12 [2019-09-03 20:07:58,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:07:58,007 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-09-03 20:07:58,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:07:58,008 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-09-03 20:07:58,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-03 20:07:58,008 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:07:58,008 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:07:58,009 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:07:58,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:07:58,009 INFO L82 PathProgramCache]: Analyzing trace with hash -681648618, now seen corresponding path program 1 times [2019-09-03 20:07:58,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:07:58,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:07:58,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:07:58,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:07:58,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:07:58,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:07:58,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:07:58,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:07:58,090 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-03 20:07:58,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:07:58,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:07:58,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-03 20:07:58,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:07:58,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:07:58,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:07:58,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-03 20:07:58,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:07:58,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:07:58,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:07:58,185 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 5 states. [2019-09-03 20:07:58,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:07:58,219 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2019-09-03 20:07:58,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:07:58,221 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-09-03 20:07:58,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:07:58,222 INFO L225 Difference]: With dead ends: 40 [2019-09-03 20:07:58,222 INFO L226 Difference]: Without dead ends: 24 [2019-09-03 20:07:58,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:07:58,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-03 20:07:58,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-09-03 20:07:58,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-03 20:07:58,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-09-03 20:07:58,229 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 13 [2019-09-03 20:07:58,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:07:58,229 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-09-03 20:07:58,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:07:58,230 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2019-09-03 20:07:58,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 20:07:58,230 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:07:58,230 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:07:58,231 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:07:58,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:07:58,231 INFO L82 PathProgramCache]: Analyzing trace with hash 370955403, now seen corresponding path program 2 times [2019-09-03 20:07:58,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:07:58,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:07:58,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:07:58,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:07:58,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:07:58,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:07:58,320 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:07:58,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:07:58,321 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:07:58,338 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:07:58,355 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:07:58,355 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:07:58,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-03 20:07:58,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:07:58,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:07:58,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:07:58,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-03 20:07:58,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:07:58,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:07:58,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:07:58,385 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2019-09-03 20:07:58,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:07:58,415 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2019-09-03 20:07:58,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:07:58,416 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-09-03 20:07:58,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:07:58,426 INFO L225 Difference]: With dead ends: 42 [2019-09-03 20:07:58,426 INFO L226 Difference]: Without dead ends: 25 [2019-09-03 20:07:58,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:07:58,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-03 20:07:58,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-09-03 20:07:58,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-03 20:07:58,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2019-09-03 20:07:58,435 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 14 [2019-09-03 20:07:58,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:07:58,435 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-09-03 20:07:58,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:07:58,435 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2019-09-03 20:07:58,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-03 20:07:58,436 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:07:58,436 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:07:58,437 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:07:58,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:07:58,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1358058314, now seen corresponding path program 3 times [2019-09-03 20:07:58,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:07:58,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:07:58,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:07:58,442 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:07:58,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:07:58,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:07:58,566 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:07:58,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:07:58,567 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) [2019-09-03 20:07:58,589 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:07:58,612 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-03 20:07:58,612 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:07:58,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 20:07:58,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:07:58,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:07:58,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:07:58,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:07:58,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:07:58,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:08:05,246 WARN L188 SmtUtils]: Spent 2.61 s on a formula simplification. DAG size of input: 43 DAG size of output: 19 [2019-09-03 20:08:05,451 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-03 20:08:05,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:08:05,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2019-09-03 20:08:05,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 20:08:05,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 20:08:05,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=66, Unknown=1, NotChecked=0, Total=90 [2019-09-03 20:08:05,456 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 10 states. [2019-09-03 20:08:07,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:08:07,414 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2019-09-03 20:08:07,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 20:08:07,415 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-09-03 20:08:07,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:08:07,416 INFO L225 Difference]: With dead ends: 48 [2019-09-03 20:08:07,416 INFO L226 Difference]: Without dead ends: 30 [2019-09-03 20:08:07,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=33, Invalid=98, Unknown=1, NotChecked=0, Total=132 [2019-09-03 20:08:07,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-03 20:08:07,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-09-03 20:08:07,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-03 20:08:07,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-09-03 20:08:07,423 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 15 [2019-09-03 20:08:07,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:08:07,424 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-09-03 20:08:07,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 20:08:07,424 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-09-03 20:08:07,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-03 20:08:07,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:08:07,425 INFO L399 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:08:07,425 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:08:07,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:08:07,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1842253067, now seen corresponding path program 1 times [2019-09-03 20:08:07,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:08:07,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:08:07,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:07,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:08:07,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:07,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:08:07,539 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:08:07,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:08:07,539 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:08:07,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:08:07,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:08:07,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 20:08:07,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:08:07,630 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-03 20:08:07,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:08:07,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2019-09-03 20:08:07,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 20:08:07,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 20:08:07,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:08:07,637 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 11 states. [2019-09-03 20:08:07,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:08:07,859 INFO L93 Difference]: Finished difference Result 71 states and 85 transitions. [2019-09-03 20:08:07,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 20:08:07,860 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-09-03 20:08:07,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:08:07,861 INFO L225 Difference]: With dead ends: 71 [2019-09-03 20:08:07,861 INFO L226 Difference]: Without dead ends: 48 [2019-09-03 20:08:07,862 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-09-03 20:08:07,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-03 20:08:07,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 39. [2019-09-03 20:08:07,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-03 20:08:07,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2019-09-03 20:08:07,878 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 23 [2019-09-03 20:08:07,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:08:07,878 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2019-09-03 20:08:07,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 20:08:07,878 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2019-09-03 20:08:07,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-03 20:08:07,879 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:08:07,880 INFO L399 BasicCegarLoop]: trace histogram [10, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:08:07,880 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:08:07,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:08:07,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1414909940, now seen corresponding path program 2 times [2019-09-03 20:08:07,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:08:07,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:08:07,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:07,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:08:07,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:07,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:08:08,026 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 42 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-03 20:08:08,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:08:08,027 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:08:08,046 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:08:08,071 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:08:08,071 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:08:08,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 20:08:08,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:08:08,174 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 4 proven. 53 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-03 20:08:08,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:08:08,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-09-03 20:08:08,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 20:08:08,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 20:08:08,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-09-03 20:08:08,179 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 14 states. [2019-09-03 20:08:08,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:08:08,604 INFO L93 Difference]: Finished difference Result 94 states and 113 transitions. [2019-09-03 20:08:08,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 20:08:08,605 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2019-09-03 20:08:08,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:08:08,606 INFO L225 Difference]: With dead ends: 94 [2019-09-03 20:08:08,606 INFO L226 Difference]: Without dead ends: 61 [2019-09-03 20:08:08,609 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=686, Unknown=0, NotChecked=0, Total=812 [2019-09-03 20:08:08,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-03 20:08:08,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 51. [2019-09-03 20:08:08,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-03 20:08:08,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2019-09-03 20:08:08,618 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 37 [2019-09-03 20:08:08,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:08:08,619 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2019-09-03 20:08:08,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 20:08:08,619 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2019-09-03 20:08:08,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-03 20:08:08,621 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:08:08,621 INFO L399 BasicCegarLoop]: trace histogram [18, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:08:08,621 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:08:08,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:08:08,621 INFO L82 PathProgramCache]: Analyzing trace with hash 62743319, now seen corresponding path program 3 times [2019-09-03 20:08:08,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:08:08,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:08:08,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:08,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:08:08,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:08,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:08:08,794 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 107 proven. 21 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:08:08,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:08:08,794 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:08:08,814 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:08:49,498 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-03 20:08:49,499 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:08:50,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 20:08:50,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:08:50,368 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 101 proven. 21 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-09-03 20:08:50,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:08:50,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-03 20:08:50,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 20:08:50,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 20:08:50,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:08:50,375 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 10 states. [2019-09-03 20:08:50,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:08:50,424 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2019-09-03 20:08:50,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 20:08:50,425 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2019-09-03 20:08:50,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:08:50,426 INFO L225 Difference]: With dead ends: 100 [2019-09-03 20:08:50,426 INFO L226 Difference]: Without dead ends: 55 [2019-09-03 20:08:50,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:08:50,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-03 20:08:50,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2019-09-03 20:08:50,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-03 20:08:50,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2019-09-03 20:08:50,436 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 53 [2019-09-03 20:08:50,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:08:50,437 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2019-09-03 20:08:50,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 20:08:50,437 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2019-09-03 20:08:50,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-03 20:08:50,438 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:08:50,439 INFO L399 BasicCegarLoop]: trace histogram [21, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:08:50,439 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:08:50,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:08:50,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1860941642, now seen corresponding path program 4 times [2019-09-03 20:08:50,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:08:50,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:08:50,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:50,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:08:50,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:50,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:08:50,578 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 137 proven. 28 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2019-09-03 20:08:50,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:08:50,578 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:08:50,596 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:08:50,623 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:08:50,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:08:50,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 20:08:50,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:08:50,750 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 6 proven. 226 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-09-03 20:08:50,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:08:50,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-09-03 20:08:50,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 20:08:50,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 20:08:50,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2019-09-03 20:08:50,757 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand 18 states. [2019-09-03 20:08:51,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:08:51,521 INFO L93 Difference]: Finished difference Result 129 states and 153 transitions. [2019-09-03 20:08:51,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-03 20:08:51,521 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2019-09-03 20:08:51,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:08:51,522 INFO L225 Difference]: With dead ends: 129 [2019-09-03 20:08:51,522 INFO L226 Difference]: Without dead ends: 81 [2019-09-03 20:08:51,524 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=216, Invalid=1854, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 20:08:51,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-09-03 20:08:51,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 69. [2019-09-03 20:08:51,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-03 20:08:51,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2019-09-03 20:08:51,541 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 56 [2019-09-03 20:08:51,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:08:51,541 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2019-09-03 20:08:51,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 20:08:51,541 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2019-09-03 20:08:51,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-03 20:08:51,543 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:08:51,543 INFO L399 BasicCegarLoop]: trace histogram [32, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:08:51,543 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:08:51,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:08:51,543 INFO L82 PathProgramCache]: Analyzing trace with hash -330095560, now seen corresponding path program 5 times [2019-09-03 20:08:51,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:08:51,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:08:51,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:51,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:08:51,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:51,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:08:51,741 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 255 proven. 36 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2019-09-03 20:08:51,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:08:51,741 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:08:51,761 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:09:25,808 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-09-03 20:09:25,808 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:09:26,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-03 20:09:26,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:09:26,067 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 431 proven. 36 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2019-09-03 20:09:26,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:09:26,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-09-03 20:09:26,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 20:09:26,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 20:09:26,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-03 20:09:26,077 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand 12 states. [2019-09-03 20:09:26,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:09:26,151 INFO L93 Difference]: Finished difference Result 137 states and 159 transitions. [2019-09-03 20:09:26,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 20:09:26,152 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 75 [2019-09-03 20:09:26,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:09:26,152 INFO L225 Difference]: With dead ends: 137 [2019-09-03 20:09:26,152 INFO L226 Difference]: Without dead ends: 74 [2019-09-03 20:09:26,153 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-03 20:09:26,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-03 20:09:26,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-09-03 20:09:26,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-03 20:09:26,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2019-09-03 20:09:26,168 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 75 [2019-09-03 20:09:26,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:09:26,169 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2019-09-03 20:09:26,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 20:09:26,169 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2019-09-03 20:09:26,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-03 20:09:26,173 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:09:26,173 INFO L399 BasicCegarLoop]: trace histogram [36, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:09:26,173 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:09:26,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:09:26,173 INFO L82 PathProgramCache]: Analyzing trace with hash -936778316, now seen corresponding path program 6 times [2019-09-03 20:09:26,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:09:26,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:09:26,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:09:26,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:09:26,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:09:26,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:09:26,371 INFO L134 CoverageAnalysis]: Checked inductivity of 834 backedges. 312 proven. 45 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2019-09-03 20:09:26,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:09:26,371 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:09:26,393 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:10:03,406 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2019-09-03 20:10:03,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:10:03,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-03 20:10:03,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:10:03,798 INFO L134 CoverageAnalysis]: Checked inductivity of 834 backedges. 526 proven. 45 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2019-09-03 20:10:03,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:10:03,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-03 20:10:03,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 20:10:03,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 20:10:03,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-03 20:10:03,806 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand 13 states. [2019-09-03 20:10:03,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:10:03,902 INFO L93 Difference]: Finished difference Result 145 states and 167 transitions. [2019-09-03 20:10:03,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 20:10:03,904 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 79 [2019-09-03 20:10:03,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:10:03,905 INFO L225 Difference]: With dead ends: 145 [2019-09-03 20:10:03,905 INFO L226 Difference]: Without dead ends: 78 [2019-09-03 20:10:03,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-03 20:10:03,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-03 20:10:03,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-09-03 20:10:03,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-03 20:10:03,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2019-09-03 20:10:03,916 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 79 [2019-09-03 20:10:03,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:10:03,916 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2019-09-03 20:10:03,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 20:10:03,917 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2019-09-03 20:10:03,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-03 20:10:03,918 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:10:03,918 INFO L399 BasicCegarLoop]: trace histogram [40, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:10:03,918 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:10:03,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:10:03,919 INFO L82 PathProgramCache]: Analyzing trace with hash 464708920, now seen corresponding path program 7 times [2019-09-03 20:10:03,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:10:03,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:10:03,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:10:03,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:10:03,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:10:03,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:10:04,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1000 backedges. 375 proven. 55 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2019-09-03 20:10:04,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:10:04,091 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:10:04,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:10:04,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:10:04,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 20:10:04,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:10:04,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1000 backedges. 8 proven. 788 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2019-09-03 20:10:04,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:10:04,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2019-09-03 20:10:04,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 20:10:04,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 20:10:04,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2019-09-03 20:10:04,399 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 23 states. [2019-09-03 20:10:05,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:10:05,941 INFO L93 Difference]: Finished difference Result 182 states and 211 transitions. [2019-09-03 20:10:05,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-03 20:10:05,946 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 83 [2019-09-03 20:10:05,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:10:05,948 INFO L225 Difference]: With dead ends: 182 [2019-09-03 20:10:05,948 INFO L226 Difference]: Without dead ends: 111 [2019-09-03 20:10:05,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1520 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=363, Invalid=4893, Unknown=0, NotChecked=0, Total=5256 [2019-09-03 20:10:05,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-09-03 20:10:05,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 96. [2019-09-03 20:10:05,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-03 20:10:05,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2019-09-03 20:10:05,976 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 83 [2019-09-03 20:10:05,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:10:05,977 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2019-09-03 20:10:05,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 20:10:05,977 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2019-09-03 20:10:05,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-03 20:10:05,978 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:10:05,978 INFO L399 BasicCegarLoop]: trace histogram [55, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:10:05,979 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:10:05,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:10:05,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1946074422, now seen corresponding path program 8 times [2019-09-03 20:10:05,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:10:05,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:10:05,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:10:05,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:10:05,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:10:06,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:10:06,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 591 proven. 66 refuted. 0 times theorem prover too weak. 1198 trivial. 0 not checked. [2019-09-03 20:10:06,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:10:06,193 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:10:06,216 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:10:06,264 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:10:06,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:10:06,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 20:10:06,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:10:06,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 10 proven. 1526 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:10:06,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:10:06,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2019-09-03 20:10:06,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-03 20:10:06,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-03 20:10:06,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2019-09-03 20:10:06,491 INFO L87 Difference]: Start difference. First operand 96 states and 107 transitions. Second operand 26 states. [2019-09-03 20:10:08,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:10:08,496 INFO L93 Difference]: Finished difference Result 223 states and 257 transitions. [2019-09-03 20:10:08,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-09-03 20:10:08,496 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 106 [2019-09-03 20:10:08,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:10:08,498 INFO L225 Difference]: With dead ends: 223 [2019-09-03 20:10:08,498 INFO L226 Difference]: Without dead ends: 133 [2019-09-03 20:10:08,501 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2604 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=468, Invalid=7904, Unknown=0, NotChecked=0, Total=8372 [2019-09-03 20:10:08,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-09-03 20:10:08,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 117. [2019-09-03 20:10:08,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-09-03 20:10:08,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 130 transitions. [2019-09-03 20:10:08,516 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 130 transitions. Word has length 106 [2019-09-03 20:10:08,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:10:08,516 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 130 transitions. [2019-09-03 20:10:08,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-03 20:10:08,516 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 130 transitions. [2019-09-03 20:10:08,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-03 20:10:08,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:10:08,518 INFO L399 BasicCegarLoop]: trace histogram [72, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:10:08,518 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:10:08,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:10:08,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1245127226, now seen corresponding path program 9 times [2019-09-03 20:10:08,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:10:08,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:10:08,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:10:08,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:10:08,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:10:08,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:10:08,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3126 backedges. 863 proven. 78 refuted. 0 times theorem prover too weak. 2185 trivial. 0 not checked. [2019-09-03 20:10:08,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:10:08,723 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:10:08,734 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:11:26,738 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-03 20:11:26,738 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:11:27,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-03 20:11:27,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:11:27,308 INFO L134 CoverageAnalysis]: Checked inductivity of 3126 backedges. 748 proven. 859 refuted. 0 times theorem prover too weak. 1519 trivial. 0 not checked. [2019-09-03 20:11:27,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:11:27,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-03 20:11:27,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 20:11:27,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 20:11:27,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-09-03 20:11:27,317 INFO L87 Difference]: Start difference. First operand 117 states and 130 transitions. Second operand 16 states. [2019-09-03 20:11:27,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:11:27,483 INFO L93 Difference]: Finished difference Result 235 states and 267 transitions. [2019-09-03 20:11:27,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 20:11:27,492 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 131 [2019-09-03 20:11:27,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:11:27,494 INFO L225 Difference]: With dead ends: 235 [2019-09-03 20:11:27,494 INFO L226 Difference]: Without dead ends: 124 [2019-09-03 20:11:27,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 129 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-09-03 20:11:27,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-09-03 20:11:27,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2019-09-03 20:11:27,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-09-03 20:11:27,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 136 transitions. [2019-09-03 20:11:27,506 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 136 transitions. Word has length 131 [2019-09-03 20:11:27,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:11:27,507 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 136 transitions. [2019-09-03 20:11:27,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 20:11:27,507 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 136 transitions. [2019-09-03 20:11:27,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-03 20:11:27,508 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:11:27,508 INFO L399 BasicCegarLoop]: trace histogram [78, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:11:27,509 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:11:27,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:11:27,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1556197004, now seen corresponding path program 10 times [2019-09-03 20:11:27,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:11:27,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:11:27,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:11:27,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:11:27,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:11:27,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:11:27,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3609 backedges. 998 proven. 91 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2019-09-03 20:11:27,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:11:27,754 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:11:27,768 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:11:27,828 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:11:27,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:11:27,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 20:11:27,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:11:28,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3609 backedges. 12 proven. 3061 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2019-09-03 20:11:28,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:11:28,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2019-09-03 20:11:28,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-03 20:11:28,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-03 20:11:28,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=779, Unknown=0, NotChecked=0, Total=870 [2019-09-03 20:11:28,140 INFO L87 Difference]: Start difference. First operand 123 states and 136 transitions. Second operand 30 states. [2019-09-03 20:11:31,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:11:31,263 INFO L93 Difference]: Finished difference Result 282 states and 321 transitions. [2019-09-03 20:11:31,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-09-03 20:11:31,264 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 137 [2019-09-03 20:11:31,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:11:31,265 INFO L225 Difference]: With dead ends: 282 [2019-09-03 20:11:31,268 INFO L226 Difference]: Without dead ends: 165 [2019-09-03 20:11:31,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 124 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4816 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=630, Invalid=13890, Unknown=0, NotChecked=0, Total=14520 [2019-09-03 20:11:31,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-09-03 20:11:31,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 147. [2019-09-03 20:11:31,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-09-03 20:11:31,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 162 transitions. [2019-09-03 20:11:31,286 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 162 transitions. Word has length 137 [2019-09-03 20:11:31,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:11:31,287 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 162 transitions. [2019-09-03 20:11:31,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-03 20:11:31,287 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 162 transitions. [2019-09-03 20:11:31,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-03 20:11:31,289 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:11:31,289 INFO L399 BasicCegarLoop]: trace histogram [98, 8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:11:31,289 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:11:31,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:11:31,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1842558363, now seen corresponding path program 11 times [2019-09-03 20:11:31,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:11:31,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:11:31,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:11:31,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:11:31,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:11:31,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:11:31,558 INFO L134 CoverageAnalysis]: Checked inductivity of 5628 backedges. 1371 proven. 105 refuted. 0 times theorem prover too weak. 4152 trivial. 0 not checked. [2019-09-03 20:11:31,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:11:31,558 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:11:31,569 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:12:20,280 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-09-03 20:12:20,280 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:12:20,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-03 20:12:20,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:12:20,588 INFO L134 CoverageAnalysis]: Checked inductivity of 5628 backedges. 2525 proven. 105 refuted. 0 times theorem prover too weak. 2998 trivial. 0 not checked. [2019-09-03 20:12:20,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:12:20,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-09-03 20:12:20,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 20:12:20,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 20:12:20,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-09-03 20:12:20,597 INFO L87 Difference]: Start difference. First operand 147 states and 162 transitions. Second operand 18 states. [2019-09-03 20:12:20,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:12:20,792 INFO L93 Difference]: Finished difference Result 296 states and 333 transitions. [2019-09-03 20:12:20,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 20:12:20,792 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 165 [2019-09-03 20:12:20,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:12:20,794 INFO L225 Difference]: With dead ends: 296 [2019-09-03 20:12:20,794 INFO L226 Difference]: Without dead ends: 155 [2019-09-03 20:12:20,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 164 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-09-03 20:12:20,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-09-03 20:12:20,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2019-09-03 20:12:20,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-09-03 20:12:20,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 169 transitions. [2019-09-03 20:12:20,808 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 169 transitions. Word has length 165 [2019-09-03 20:12:20,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:12:20,808 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 169 transitions. [2019-09-03 20:12:20,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 20:12:20,809 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 169 transitions. [2019-09-03 20:12:20,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-03 20:12:20,810 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:12:20,811 INFO L399 BasicCegarLoop]: trace histogram [105, 8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:12:20,811 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:12:20,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:12:20,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1955584074, now seen corresponding path program 12 times [2019-09-03 20:12:20,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:12:20,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:12:20,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:12:20,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:12:20,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:12:20,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:12:21,097 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 1557 proven. 120 refuted. 0 times theorem prover too weak. 4707 trivial. 0 not checked. [2019-09-03 20:12:21,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:12:21,098 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:12:21,108 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 20:15:42,136 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2019-09-03 20:15:42,137 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:15:45,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-03 20:15:45,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:15:45,243 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 2866 proven. 120 refuted. 0 times theorem prover too weak. 3398 trivial. 0 not checked. [2019-09-03 20:15:45,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:15:45,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-09-03 20:15:45,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 20:15:45,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 20:15:45,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-09-03 20:15:45,251 INFO L87 Difference]: Start difference. First operand 154 states and 169 transitions. Second operand 19 states. [2019-09-03 20:15:45,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:15:45,486 INFO L93 Difference]: Finished difference Result 310 states and 347 transitions. [2019-09-03 20:15:45,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-03 20:15:45,487 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 172 [2019-09-03 20:15:45,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:15:45,488 INFO L225 Difference]: With dead ends: 310 [2019-09-03 20:15:45,488 INFO L226 Difference]: Without dead ends: 162 [2019-09-03 20:15:45,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 171 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-09-03 20:15:45,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-03 20:15:45,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2019-09-03 20:15:45,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-09-03 20:15:45,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 176 transitions. [2019-09-03 20:15:45,503 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 176 transitions. Word has length 172 [2019-09-03 20:15:45,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:15:45,503 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 176 transitions. [2019-09-03 20:15:45,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 20:15:45,504 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 176 transitions. [2019-09-03 20:15:45,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-03 20:15:45,505 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:15:45,505 INFO L399 BasicCegarLoop]: trace histogram [112, 8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:15:45,505 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:15:45,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:15:45,506 INFO L82 PathProgramCache]: Analyzing trace with hash -688995653, now seen corresponding path program 13 times [2019-09-03 20:15:45,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:15:45,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:15:45,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:45,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:15:45,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:45,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:15:45,848 INFO L134 CoverageAnalysis]: Checked inductivity of 7189 backedges. 1755 proven. 136 refuted. 0 times theorem prover too weak. 5298 trivial. 0 not checked. [2019-09-03 20:15:45,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:15:45,849 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:15:45,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:15:45,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:15:45,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 20:15:45,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:15:46,491 INFO L134 CoverageAnalysis]: Checked inductivity of 7189 backedges. 14 proven. 6239 refuted. 0 times theorem prover too weak. 936 trivial. 0 not checked. [2019-09-03 20:15:46,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:15:46,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 35 [2019-09-03 20:15:46,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-03 20:15:46,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-03 20:15:46,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1083, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 20:15:46,499 INFO L87 Difference]: Start difference. First operand 161 states and 176 transitions. Second operand 35 states. [2019-09-03 20:15:51,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:15:51,085 INFO L93 Difference]: Finished difference Result 365 states and 409 transitions. [2019-09-03 20:15:51,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2019-09-03 20:15:51,086 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 179 [2019-09-03 20:15:51,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:15:51,087 INFO L225 Difference]: With dead ends: 365 [2019-09-03 20:15:51,087 INFO L226 Difference]: Without dead ends: 210 [2019-09-03 20:15:51,096 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 164 SyntacticMatches, 1 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9260 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=867, Invalid=25539, Unknown=0, NotChecked=0, Total=26406 [2019-09-03 20:15:51,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-09-03 20:15:51,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 189. [2019-09-03 20:15:51,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-03 20:15:51,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 206 transitions. [2019-09-03 20:15:51,111 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 206 transitions. Word has length 179 [2019-09-03 20:15:51,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:15:51,111 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 206 transitions. [2019-09-03 20:15:51,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-03 20:15:51,111 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 206 transitions. [2019-09-03 20:15:51,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-03 20:15:51,113 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:15:51,113 INFO L399 BasicCegarLoop]: trace histogram [136, 9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:15:51,113 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:15:51,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:15:51,114 INFO L82 PathProgramCache]: Analyzing trace with hash 901993268, now seen corresponding path program 14 times [2019-09-03 20:15:51,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:15:51,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:15:51,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:51,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:15:51,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:51,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:15:51,519 INFO L134 CoverageAnalysis]: Checked inductivity of 10516 backedges. 2292 proven. 153 refuted. 0 times theorem prover too weak. 8071 trivial. 0 not checked. [2019-09-03 20:15:51,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:15:51,520 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:15:51,529 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:15:51,632 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:15:51,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:15:51,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 20:15:51,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:15:52,085 INFO L134 CoverageAnalysis]: Checked inductivity of 10516 backedges. 16 proven. 9281 refuted. 0 times theorem prover too weak. 1219 trivial. 0 not checked. [2019-09-03 20:15:52,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:15:52,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2019-09-03 20:15:52,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-03 20:15:52,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-03 20:15:52,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1289, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 20:15:52,090 INFO L87 Difference]: Start difference. First operand 189 states and 206 transitions. Second operand 38 states. [2019-09-03 20:15:58,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:15:58,539 INFO L93 Difference]: Finished difference Result 424 states and 473 transitions. [2019-09-03 20:15:58,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2019-09-03 20:15:58,539 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 211 [2019-09-03 20:15:58,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:15:58,541 INFO L225 Difference]: With dead ends: 424 [2019-09-03 20:15:58,541 INFO L226 Difference]: Without dead ends: 241 [2019-09-03 20:15:58,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 194 SyntacticMatches, 1 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13140 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1026, Invalid=35264, Unknown=0, NotChecked=0, Total=36290 [2019-09-03 20:15:58,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-09-03 20:15:58,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 219. [2019-09-03 20:15:58,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-09-03 20:15:58,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 238 transitions. [2019-09-03 20:15:58,562 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 238 transitions. Word has length 211 [2019-09-03 20:15:58,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:15:58,562 INFO L475 AbstractCegarLoop]: Abstraction has 219 states and 238 transitions. [2019-09-03 20:15:58,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-03 20:15:58,563 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 238 transitions. [2019-09-03 20:15:58,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-03 20:15:58,564 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:15:58,564 INFO L399 BasicCegarLoop]: trace histogram [162, 10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:15:58,564 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:15:58,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:15:58,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1792762531, now seen corresponding path program 15 times [2019-09-03 20:15:58,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:15:58,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:15:58,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:58,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:15:58,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:58,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:15:59,074 INFO L134 CoverageAnalysis]: Checked inductivity of 14814 backedges. 2915 proven. 171 refuted. 0 times theorem prover too weak. 11728 trivial. 0 not checked. [2019-09-03 20:15:59,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:15:59,084 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:15:59,106 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2