java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem16_label05_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 19:22:55,420 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 19:22:55,422 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 19:22:55,434 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 19:22:55,434 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 19:22:55,435 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 19:22:55,436 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 19:22:55,438 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 19:22:55,440 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 19:22:55,441 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 19:22:55,442 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 19:22:55,442 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 19:22:55,443 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 19:22:55,444 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 19:22:55,445 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 19:22:55,446 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 19:22:55,447 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 19:22:55,449 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 19:22:55,450 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 19:22:55,452 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 19:22:55,453 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 19:22:55,454 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 19:22:55,457 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 19:22:55,457 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 19:22:55,457 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 19:22:55,458 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 19:22:55,459 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 19:22:55,460 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 19:22:55,461 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 19:22:55,462 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 19:22:55,462 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 19:22:55,463 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 19:22:55,463 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 19:22:55,463 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 19:22:55,464 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 19:22:55,465 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 19:22:55,465 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 19:22:55,492 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 19:22:55,492 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 19:22:55,496 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 19:22:55,496 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 19:22:55,497 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 19:22:55,497 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 19:22:55,497 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 19:22:55,497 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 19:22:55,499 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 19:22:55,499 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 19:22:55,499 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 19:22:55,499 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 19:22:55,499 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 19:22:55,499 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 19:22:55,500 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 19:22:55,500 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 19:22:55,500 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 19:22:55,500 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 19:22:55,500 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 19:22:55,501 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:22:55,501 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 19:22:55,501 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 19:22:55,501 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 19:22:55,501 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 19:22:55,502 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 19:22:55,502 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 19:22:55,502 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 19:22:55,502 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 19:22:55,546 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 19:22:55,560 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 19:22:55,566 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 19:22:55,567 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 19:22:55,568 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 19:22:55,568 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label05_false-unreach-call.c [2018-11-06 19:22:55,635 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd516166e/b1f24b272deb450a9eab137e238bd4a8/FLAGf801b8ddc [2018-11-06 19:22:56,347 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 19:22:56,350 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label05_false-unreach-call.c [2018-11-06 19:22:56,370 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd516166e/b1f24b272deb450a9eab137e238bd4a8/FLAGf801b8ddc [2018-11-06 19:22:56,386 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd516166e/b1f24b272deb450a9eab137e238bd4a8 [2018-11-06 19:22:56,395 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 19:22:56,396 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 19:22:56,397 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 19:22:56,398 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 19:22:56,401 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 19:22:56,402 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:22:56" (1/1) ... [2018-11-06 19:22:56,405 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9260898 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:22:56, skipping insertion in model container [2018-11-06 19:22:56,406 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:22:56" (1/1) ... [2018-11-06 19:22:56,416 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 19:22:56,502 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 19:22:57,320 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:22:57,325 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 19:22:57,578 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:22:57,600 INFO L193 MainTranslator]: Completed translation [2018-11-06 19:22:57,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:22:57 WrapperNode [2018-11-06 19:22:57,601 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 19:22:57,603 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 19:22:57,603 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 19:22:57,603 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 19:22:57,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:22:57" (1/1) ... [2018-11-06 19:22:57,790 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:22:57" (1/1) ... [2018-11-06 19:22:57,927 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 19:22:57,927 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 19:22:57,927 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 19:22:57,928 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 19:22:57,939 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:22:57" (1/1) ... [2018-11-06 19:22:57,939 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:22:57" (1/1) ... [2018-11-06 19:22:57,959 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:22:57" (1/1) ... [2018-11-06 19:22:57,960 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:22:57" (1/1) ... [2018-11-06 19:22:58,024 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:22:57" (1/1) ... [2018-11-06 19:22:58,040 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:22:57" (1/1) ... [2018-11-06 19:22:58,071 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:22:57" (1/1) ... [2018-11-06 19:22:58,099 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 19:22:58,100 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 19:22:58,100 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 19:22:58,100 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 19:22:58,101 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:22:57" (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 [2018-11-06 19:22:58,170 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 19:22:58,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 19:22:58,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 19:23:04,026 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 19:23:04,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:23:04 BoogieIcfgContainer [2018-11-06 19:23:04,027 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 19:23:04,028 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 19:23:04,028 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 19:23:04,031 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 19:23:04,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:22:56" (1/3) ... [2018-11-06 19:23:04,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ccc1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:23:04, skipping insertion in model container [2018-11-06 19:23:04,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:22:57" (2/3) ... [2018-11-06 19:23:04,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ccc1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:23:04, skipping insertion in model container [2018-11-06 19:23:04,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:23:04" (3/3) ... [2018-11-06 19:23:04,035 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label05_false-unreach-call.c [2018-11-06 19:23:04,048 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 19:23:04,058 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 19:23:04,079 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 19:23:04,120 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 19:23:04,121 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 19:23:04,121 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 19:23:04,122 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 19:23:04,122 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 19:23:04,122 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 19:23:04,122 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 19:23:04,122 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 19:23:04,123 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 19:23:04,155 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states. [2018-11-06 19:23:04,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-06 19:23:04,163 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:23:04,164 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:23:04,167 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:23:04,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:23:04,173 INFO L82 PathProgramCache]: Analyzing trace with hash 183950178, now seen corresponding path program 1 times [2018-11-06 19:23:04,175 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:23:04,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:23:04,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:23:04,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:23:04,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:23:04,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:23:04,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:23:04,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:23:04,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:23:04,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:23:04,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:23:04,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:23:04,593 INFO L87 Difference]: Start difference. First operand 397 states. Second operand 4 states. [2018-11-06 19:23:10,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:23:10,666 INFO L93 Difference]: Finished difference Result 1473 states and 2781 transitions. [2018-11-06 19:23:10,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:23:10,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-06 19:23:10,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:23:10,697 INFO L225 Difference]: With dead ends: 1473 [2018-11-06 19:23:10,697 INFO L226 Difference]: Without dead ends: 1069 [2018-11-06 19:23:10,703 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:23:10,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2018-11-06 19:23:10,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 724. [2018-11-06 19:23:10,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-11-06 19:23:10,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1277 transitions. [2018-11-06 19:23:10,800 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1277 transitions. Word has length 20 [2018-11-06 19:23:10,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:23:10,800 INFO L480 AbstractCegarLoop]: Abstraction has 724 states and 1277 transitions. [2018-11-06 19:23:10,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:23:10,801 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1277 transitions. [2018-11-06 19:23:10,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-06 19:23:10,804 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:23:10,805 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:23:10,805 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:23:10,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:23:10,805 INFO L82 PathProgramCache]: Analyzing trace with hash 832241570, now seen corresponding path program 1 times [2018-11-06 19:23:10,806 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:23:10,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:23:10,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:23:10,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:23:10,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:23:10,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:23:11,078 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:23:11,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:23:11,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:23:11,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:23:11,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:23:11,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:23:11,082 INFO L87 Difference]: Start difference. First operand 724 states and 1277 transitions. Second operand 4 states. [2018-11-06 19:23:16,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:23:16,158 INFO L93 Difference]: Finished difference Result 2766 states and 4980 transitions. [2018-11-06 19:23:16,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:23:16,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2018-11-06 19:23:16,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:23:16,172 INFO L225 Difference]: With dead ends: 2766 [2018-11-06 19:23:16,172 INFO L226 Difference]: Without dead ends: 2044 [2018-11-06 19:23:16,178 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:23:16,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2044 states. [2018-11-06 19:23:16,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2044 to 2044. [2018-11-06 19:23:16,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2044 states. [2018-11-06 19:23:16,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 3249 transitions. [2018-11-06 19:23:16,235 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 3249 transitions. Word has length 87 [2018-11-06 19:23:16,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:23:16,236 INFO L480 AbstractCegarLoop]: Abstraction has 2044 states and 3249 transitions. [2018-11-06 19:23:16,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:23:16,236 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 3249 transitions. [2018-11-06 19:23:16,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-06 19:23:16,240 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:23:16,240 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:23:16,241 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:23:16,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:23:16,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1850634171, now seen corresponding path program 1 times [2018-11-06 19:23:16,241 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:23:16,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:23:16,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:23:16,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:23:16,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:23:16,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:23:16,769 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 21 [2018-11-06 19:23:16,807 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:23:16,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:23:16,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 19:23:16,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 19:23:16,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 19:23:16,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:23:16,811 INFO L87 Difference]: Start difference. First operand 2044 states and 3249 transitions. Second operand 6 states. [2018-11-06 19:23:23,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:23:23,611 INFO L93 Difference]: Finished difference Result 6728 states and 10478 transitions. [2018-11-06 19:23:23,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:23:23,612 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-11-06 19:23:23,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:23:23,637 INFO L225 Difference]: With dead ends: 6728 [2018-11-06 19:23:23,637 INFO L226 Difference]: Without dead ends: 4686 [2018-11-06 19:23:23,641 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-06 19:23:23,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4686 states. [2018-11-06 19:23:23,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4686 to 4686. [2018-11-06 19:23:23,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4686 states. [2018-11-06 19:23:23,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4686 states to 4686 states and 6895 transitions. [2018-11-06 19:23:23,728 INFO L78 Accepts]: Start accepts. Automaton has 4686 states and 6895 transitions. Word has length 100 [2018-11-06 19:23:23,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:23:23,728 INFO L480 AbstractCegarLoop]: Abstraction has 4686 states and 6895 transitions. [2018-11-06 19:23:23,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 19:23:23,729 INFO L276 IsEmpty]: Start isEmpty. Operand 4686 states and 6895 transitions. [2018-11-06 19:23:23,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-11-06 19:23:23,734 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:23:23,734 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:23:23,735 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:23:23,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:23:23,735 INFO L82 PathProgramCache]: Analyzing trace with hash -852110444, now seen corresponding path program 1 times [2018-11-06 19:23:23,735 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:23:23,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:23:23,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:23:23,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:23:23,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:23:23,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:23:24,035 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-11-06 19:23:24,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:23:24,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:23:24,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:23:24,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:23:24,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:23:24,037 INFO L87 Difference]: Start difference. First operand 4686 states and 6895 transitions. Second operand 3 states. [2018-11-06 19:23:26,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:23:26,456 INFO L93 Difference]: Finished difference Result 12998 states and 19544 transitions. [2018-11-06 19:23:26,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:23:26,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2018-11-06 19:23:26,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:23:26,497 INFO L225 Difference]: With dead ends: 12998 [2018-11-06 19:23:26,498 INFO L226 Difference]: Without dead ends: 8646 [2018-11-06 19:23:26,505 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:23:26,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8646 states. [2018-11-06 19:23:26,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8646 to 8646. [2018-11-06 19:23:26,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8646 states. [2018-11-06 19:23:26,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8646 states to 8646 states and 12001 transitions. [2018-11-06 19:23:26,665 INFO L78 Accepts]: Start accepts. Automaton has 8646 states and 12001 transitions. Word has length 188 [2018-11-06 19:23:26,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:23:26,666 INFO L480 AbstractCegarLoop]: Abstraction has 8646 states and 12001 transitions. [2018-11-06 19:23:26,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:23:26,666 INFO L276 IsEmpty]: Start isEmpty. Operand 8646 states and 12001 transitions. [2018-11-06 19:23:26,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-11-06 19:23:26,674 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:23:26,674 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:23:26,675 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:23:26,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:23:26,675 INFO L82 PathProgramCache]: Analyzing trace with hash -382813575, now seen corresponding path program 1 times [2018-11-06 19:23:26,675 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:23:26,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:23:26,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:23:26,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:23:26,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:23:26,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:23:27,105 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-06 19:23:27,671 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-06 19:23:27,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:23:27,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 19:23:27,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 19:23:27,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 19:23:27,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-06 19:23:27,673 INFO L87 Difference]: Start difference. First operand 8646 states and 12001 transitions. Second operand 7 states. [2018-11-06 19:23:33,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:23:33,280 INFO L93 Difference]: Finished difference Result 17367 states and 24077 transitions. [2018-11-06 19:23:33,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:23:33,283 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 344 [2018-11-06 19:23:33,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:23:33,312 INFO L225 Difference]: With dead ends: 17367 [2018-11-06 19:23:33,313 INFO L226 Difference]: Without dead ends: 8723 [2018-11-06 19:23:33,324 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-11-06 19:23:33,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8723 states. [2018-11-06 19:23:33,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8723 to 8644. [2018-11-06 19:23:33,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8644 states. [2018-11-06 19:23:33,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8644 states to 8644 states and 11991 transitions. [2018-11-06 19:23:33,481 INFO L78 Accepts]: Start accepts. Automaton has 8644 states and 11991 transitions. Word has length 344 [2018-11-06 19:23:33,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:23:33,482 INFO L480 AbstractCegarLoop]: Abstraction has 8644 states and 11991 transitions. [2018-11-06 19:23:33,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 19:23:33,482 INFO L276 IsEmpty]: Start isEmpty. Operand 8644 states and 11991 transitions. [2018-11-06 19:23:33,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2018-11-06 19:23:33,495 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:23:33,495 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:23:33,496 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:23:33,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:23:33,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1499308984, now seen corresponding path program 1 times [2018-11-06 19:23:33,496 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:23:33,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:23:33,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:23:33,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:23:33,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:23:33,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:23:33,817 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 480 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-06 19:23:33,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:23:33,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:23:33,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:23:33,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:23:33,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:23:33,819 INFO L87 Difference]: Start difference. First operand 8644 states and 11991 transitions. Second operand 3 states. [2018-11-06 19:23:35,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:23:35,852 INFO L93 Difference]: Finished difference Result 17286 states and 23997 transitions. [2018-11-06 19:23:35,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:23:35,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 432 [2018-11-06 19:23:35,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:23:35,870 INFO L225 Difference]: With dead ends: 17286 [2018-11-06 19:23:35,870 INFO L226 Difference]: Without dead ends: 6982 [2018-11-06 19:23:35,881 INFO L604 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 [2018-11-06 19:23:35,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6982 states. [2018-11-06 19:23:35,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6982 to 6652. [2018-11-06 19:23:35,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6652 states. [2018-11-06 19:23:35,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6652 states to 6652 states and 7477 transitions. [2018-11-06 19:23:35,977 INFO L78 Accepts]: Start accepts. Automaton has 6652 states and 7477 transitions. Word has length 432 [2018-11-06 19:23:35,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:23:35,978 INFO L480 AbstractCegarLoop]: Abstraction has 6652 states and 7477 transitions. [2018-11-06 19:23:35,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:23:35,978 INFO L276 IsEmpty]: Start isEmpty. Operand 6652 states and 7477 transitions. [2018-11-06 19:23:35,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2018-11-06 19:23:35,987 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:23:35,988 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:23:35,988 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:23:35,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:23:35,989 INFO L82 PathProgramCache]: Analyzing trace with hash -613698571, now seen corresponding path program 1 times [2018-11-06 19:23:35,989 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:23:35,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:23:35,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:23:35,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:23:35,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:23:36,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:23:36,503 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-06 19:23:36,885 WARN L179 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-11-06 19:23:37,263 WARN L179 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 15 [2018-11-06 19:23:37,474 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 20 [2018-11-06 19:23:38,203 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 240 proven. 65 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-06 19:23:38,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:23:38,204 INFO L225 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 [2018-11-06 19:23:38,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:23:38,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:23:38,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:23:38,825 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-11-06 19:23:38,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:23:38,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2018-11-06 19:23:38,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 19:23:38,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 19:23:38,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-06 19:23:38,849 INFO L87 Difference]: Start difference. First operand 6652 states and 7477 transitions. Second operand 9 states. [2018-11-06 19:23:46,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:23:46,217 INFO L93 Difference]: Finished difference Result 16292 states and 18243 transitions. [2018-11-06 19:23:46,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-06 19:23:46,217 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 448 [2018-11-06 19:23:46,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:23:46,244 INFO L225 Difference]: With dead ends: 16292 [2018-11-06 19:23:46,244 INFO L226 Difference]: Without dead ends: 9972 [2018-11-06 19:23:46,252 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 447 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-11-06 19:23:46,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9972 states. [2018-11-06 19:23:46,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9972 to 9292. [2018-11-06 19:23:46,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9292 states. [2018-11-06 19:23:46,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9292 states to 9292 states and 10240 transitions. [2018-11-06 19:23:46,407 INFO L78 Accepts]: Start accepts. Automaton has 9292 states and 10240 transitions. Word has length 448 [2018-11-06 19:23:46,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:23:46,408 INFO L480 AbstractCegarLoop]: Abstraction has 9292 states and 10240 transitions. [2018-11-06 19:23:46,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 19:23:46,408 INFO L276 IsEmpty]: Start isEmpty. Operand 9292 states and 10240 transitions. [2018-11-06 19:23:46,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2018-11-06 19:23:46,427 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:23:46,428 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:23:46,429 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:23:46,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:23:46,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1823474811, now seen corresponding path program 1 times [2018-11-06 19:23:46,429 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:23:46,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:23:46,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:23:46,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:23:46,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:23:46,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:23:47,152 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 515 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2018-11-06 19:23:47,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:23:47,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:23:47,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:23:47,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:23:47,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:23:47,155 INFO L87 Difference]: Start difference. First operand 9292 states and 10240 transitions. Second operand 4 states. [2018-11-06 19:23:50,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:23:50,380 INFO L93 Difference]: Finished difference Result 20892 states and 23071 transitions. [2018-11-06 19:23:50,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:23:50,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 574 [2018-11-06 19:23:50,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:23:50,405 INFO L225 Difference]: With dead ends: 20892 [2018-11-06 19:23:50,405 INFO L226 Difference]: Without dead ends: 11600 [2018-11-06 19:23:50,415 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:23:50,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11600 states. [2018-11-06 19:23:50,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11600 to 11270. [2018-11-06 19:23:50,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11270 states. [2018-11-06 19:23:50,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11270 states to 11270 states and 12074 transitions. [2018-11-06 19:23:50,556 INFO L78 Accepts]: Start accepts. Automaton has 11270 states and 12074 transitions. Word has length 574 [2018-11-06 19:23:50,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:23:50,557 INFO L480 AbstractCegarLoop]: Abstraction has 11270 states and 12074 transitions. [2018-11-06 19:23:50,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:23:50,557 INFO L276 IsEmpty]: Start isEmpty. Operand 11270 states and 12074 transitions. [2018-11-06 19:23:50,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2018-11-06 19:23:50,585 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:23:50,586 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:23:50,586 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:23:50,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:23:50,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1992105334, now seen corresponding path program 1 times [2018-11-06 19:23:50,586 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:23:50,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:23:50,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:23:50,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:23:50,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:23:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:23:51,313 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 589 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-06 19:23:51,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:23:51,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:23:51,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:23:51,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:23:51,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:23:51,316 INFO L87 Difference]: Start difference. First operand 11270 states and 12074 transitions. Second operand 4 states. [2018-11-06 19:23:54,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:23:54,272 INFO L93 Difference]: Finished difference Result 25178 states and 27080 transitions. [2018-11-06 19:23:54,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:23:54,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 675 [2018-11-06 19:23:54,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:23:54,296 INFO L225 Difference]: With dead ends: 25178 [2018-11-06 19:23:54,296 INFO L226 Difference]: Without dead ends: 14240 [2018-11-06 19:23:54,309 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:23:54,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14240 states. [2018-11-06 19:23:54,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14240 to 13910. [2018-11-06 19:23:54,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13910 states. [2018-11-06 19:23:54,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13910 states to 13910 states and 14764 transitions. [2018-11-06 19:23:54,466 INFO L78 Accepts]: Start accepts. Automaton has 13910 states and 14764 transitions. Word has length 675 [2018-11-06 19:23:54,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:23:54,467 INFO L480 AbstractCegarLoop]: Abstraction has 13910 states and 14764 transitions. [2018-11-06 19:23:54,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:23:54,467 INFO L276 IsEmpty]: Start isEmpty. Operand 13910 states and 14764 transitions. [2018-11-06 19:23:54,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 836 [2018-11-06 19:23:54,513 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:23:54,514 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:23:54,514 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:23:54,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:23:54,515 INFO L82 PathProgramCache]: Analyzing trace with hash 813981583, now seen corresponding path program 1 times [2018-11-06 19:23:54,515 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:23:54,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:23:54,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:23:54,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:23:54,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:23:54,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:23:55,417 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 20 [2018-11-06 19:23:55,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1000 backedges. 54 proven. 220 refuted. 0 times theorem prover too weak. 726 trivial. 0 not checked. [2018-11-06 19:23:55,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:23:55,977 INFO L225 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 [2018-11-06 19:23:55,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:23:56,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:23:56,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:23:56,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1000 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 929 trivial. 0 not checked. [2018-11-06 19:23:56,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:23:56,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2018-11-06 19:23:56,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-06 19:23:56,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-06 19:23:56,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-06 19:23:56,574 INFO L87 Difference]: Start difference. First operand 13910 states and 14764 transitions. Second operand 8 states. [2018-11-06 19:24:00,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:24:00,497 INFO L93 Difference]: Finished difference Result 27632 states and 29338 transitions. [2018-11-06 19:24:00,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 19:24:00,498 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 835 [2018-11-06 19:24:00,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:24:00,521 INFO L225 Difference]: With dead ends: 27632 [2018-11-06 19:24:00,522 INFO L226 Difference]: Without dead ends: 14054 [2018-11-06 19:24:00,537 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 845 GetRequests, 836 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-11-06 19:24:00,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14054 states. [2018-11-06 19:24:00,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14054 to 13250. [2018-11-06 19:24:00,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13250 states. [2018-11-06 19:24:00,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13250 states to 13250 states and 13941 transitions. [2018-11-06 19:24:00,720 INFO L78 Accepts]: Start accepts. Automaton has 13250 states and 13941 transitions. Word has length 835 [2018-11-06 19:24:00,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:24:00,722 INFO L480 AbstractCegarLoop]: Abstraction has 13250 states and 13941 transitions. [2018-11-06 19:24:00,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-06 19:24:00,722 INFO L276 IsEmpty]: Start isEmpty. Operand 13250 states and 13941 transitions. [2018-11-06 19:24:00,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1228 [2018-11-06 19:24:00,762 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:24:00,763 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:24:00,764 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:24:00,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:24:00,764 INFO L82 PathProgramCache]: Analyzing trace with hash -621107017, now seen corresponding path program 1 times [2018-11-06 19:24:00,764 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:24:00,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:24:00,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:24:00,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:24:00,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:24:01,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:24:01,898 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-06 19:24:02,190 WARN L179 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-06 19:24:02,511 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-06 19:24:04,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2541 backedges. 1770 proven. 0 refuted. 0 times theorem prover too weak. 771 trivial. 0 not checked. [2018-11-06 19:24:04,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:24:04,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 19:24:04,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 19:24:04,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 19:24:04,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:24:04,247 INFO L87 Difference]: Start difference. First operand 13250 states and 13941 transitions. Second operand 6 states. [2018-11-06 19:24:06,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:24:06,994 INFO L93 Difference]: Finished difference Result 27972 states and 29380 transitions. [2018-11-06 19:24:06,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 19:24:06,994 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1227 [2018-11-06 19:24:06,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:24:07,019 INFO L225 Difference]: With dead ends: 27972 [2018-11-06 19:24:07,019 INFO L226 Difference]: Without dead ends: 15054 [2018-11-06 19:24:07,028 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-11-06 19:24:07,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15054 states. [2018-11-06 19:24:07,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15054 to 14570. [2018-11-06 19:24:07,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14570 states. [2018-11-06 19:24:07,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14570 states to 14570 states and 15272 transitions. [2018-11-06 19:24:07,190 INFO L78 Accepts]: Start accepts. Automaton has 14570 states and 15272 transitions. Word has length 1227 [2018-11-06 19:24:07,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:24:07,192 INFO L480 AbstractCegarLoop]: Abstraction has 14570 states and 15272 transitions. [2018-11-06 19:24:07,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 19:24:07,192 INFO L276 IsEmpty]: Start isEmpty. Operand 14570 states and 15272 transitions. [2018-11-06 19:24:07,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1239 [2018-11-06 19:24:07,222 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:24:07,223 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:24:07,223 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:24:07,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:24:07,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1167487614, now seen corresponding path program 1 times [2018-11-06 19:24:07,224 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:24:07,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:24:07,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:24:07,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:24:07,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:24:07,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:24:08,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2823 backedges. 995 proven. 0 refuted. 0 times theorem prover too weak. 1828 trivial. 0 not checked. [2018-11-06 19:24:08,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:24:08,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:24:08,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:24:08,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:24:08,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:24:08,769 INFO L87 Difference]: Start difference. First operand 14570 states and 15272 transitions. Second operand 4 states. [2018-11-06 19:24:11,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:24:11,048 INFO L93 Difference]: Finished difference Result 35070 states and 36795 transitions. [2018-11-06 19:24:11,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:24:11,049 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1238 [2018-11-06 19:24:11,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:24:11,070 INFO L225 Difference]: With dead ends: 35070 [2018-11-06 19:24:11,070 INFO L226 Difference]: Without dead ends: 17182 [2018-11-06 19:24:11,086 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:24:11,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17182 states. [2018-11-06 19:24:11,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17182 to 16852. [2018-11-06 19:24:11,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16852 states. [2018-11-06 19:24:11,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16852 states to 16852 states and 17364 transitions. [2018-11-06 19:24:11,283 INFO L78 Accepts]: Start accepts. Automaton has 16852 states and 17364 transitions. Word has length 1238 [2018-11-06 19:24:11,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:24:11,284 INFO L480 AbstractCegarLoop]: Abstraction has 16852 states and 17364 transitions. [2018-11-06 19:24:11,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:24:11,285 INFO L276 IsEmpty]: Start isEmpty. Operand 16852 states and 17364 transitions. [2018-11-06 19:24:11,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1402 [2018-11-06 19:24:11,318 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:24:11,319 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:24:11,319 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:24:11,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:24:11,320 INFO L82 PathProgramCache]: Analyzing trace with hash -170585411, now seen corresponding path program 1 times [2018-11-06 19:24:11,320 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:24:11,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:24:11,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:24:11,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:24:11,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:24:11,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:24:13,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3761 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 3618 trivial. 0 not checked. [2018-11-06 19:24:13,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:24:13,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:24:13,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:24:13,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:24:13,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:24:13,136 INFO L87 Difference]: Start difference. First operand 16852 states and 17364 transitions. Second operand 4 states. [2018-11-06 19:24:15,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:24:15,092 INFO L93 Difference]: Finished difference Result 33702 states and 34735 transitions. [2018-11-06 19:24:15,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:24:15,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1401 [2018-11-06 19:24:15,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:24:15,112 INFO L225 Difference]: With dead ends: 33702 [2018-11-06 19:24:15,112 INFO L226 Difference]: Without dead ends: 15858 [2018-11-06 19:24:15,123 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:24:15,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15858 states. [2018-11-06 19:24:15,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15858 to 15528. [2018-11-06 19:24:15,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15528 states. [2018-11-06 19:24:15,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15528 states to 15528 states and 15903 transitions. [2018-11-06 19:24:15,286 INFO L78 Accepts]: Start accepts. Automaton has 15528 states and 15903 transitions. Word has length 1401 [2018-11-06 19:24:15,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:24:15,288 INFO L480 AbstractCegarLoop]: Abstraction has 15528 states and 15903 transitions. [2018-11-06 19:24:15,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:24:15,288 INFO L276 IsEmpty]: Start isEmpty. Operand 15528 states and 15903 transitions. [2018-11-06 19:24:15,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1841 [2018-11-06 19:24:15,326 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:24:15,327 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:24:15,327 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:24:15,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:24:15,328 INFO L82 PathProgramCache]: Analyzing trace with hash -357593829, now seen corresponding path program 1 times [2018-11-06 19:24:15,328 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:24:15,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:24:15,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:24:15,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:24:15,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:24:15,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:24:16,791 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-06 19:24:17,184 WARN L179 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-11-06 19:24:17,961 WARN L179 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 22 [2018-11-06 19:24:21,824 INFO L134 CoverageAnalysis]: Checked inductivity of 5634 backedges. 2494 proven. 243 refuted. 0 times theorem prover too weak. 2897 trivial. 0 not checked. [2018-11-06 19:24:21,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:24:21,824 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:24:21,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:24:22,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:24:22,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:24:25,198 INFO L134 CoverageAnalysis]: Checked inductivity of 5634 backedges. 2494 proven. 0 refuted. 0 times theorem prover too weak. 3140 trivial. 0 not checked. [2018-11-06 19:24:25,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:24:25,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2018-11-06 19:24:25,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-06 19:24:25,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-06 19:24:25,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-06 19:24:25,224 INFO L87 Difference]: Start difference. First operand 15528 states and 15903 transitions. Second operand 10 states. [2018-11-06 19:24:32,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:24:32,646 INFO L93 Difference]: Finished difference Result 33040 states and 33839 transitions. [2018-11-06 19:24:32,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-06 19:24:32,647 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 1840 [2018-11-06 19:24:32,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:24:32,662 INFO L225 Difference]: With dead ends: 33040 [2018-11-06 19:24:32,662 INFO L226 Difference]: Without dead ends: 17844 [2018-11-06 19:24:32,670 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1856 GetRequests, 1839 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2018-11-06 19:24:32,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17844 states. [2018-11-06 19:24:32,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17844 to 15858. [2018-11-06 19:24:32,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15858 states. [2018-11-06 19:24:32,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15858 states to 15858 states and 16235 transitions. [2018-11-06 19:24:32,816 INFO L78 Accepts]: Start accepts. Automaton has 15858 states and 16235 transitions. Word has length 1840 [2018-11-06 19:24:32,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:24:32,817 INFO L480 AbstractCegarLoop]: Abstraction has 15858 states and 16235 transitions. [2018-11-06 19:24:32,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-06 19:24:32,817 INFO L276 IsEmpty]: Start isEmpty. Operand 15858 states and 16235 transitions. [2018-11-06 19:24:32,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1872 [2018-11-06 19:24:32,847 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:24:32,848 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:24:32,848 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:24:32,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:24:32,849 INFO L82 PathProgramCache]: Analyzing trace with hash 2065057755, now seen corresponding path program 1 times [2018-11-06 19:24:32,849 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:24:32,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:24:32,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:24:32,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:24:32,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:24:32,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:24:33,681 WARN L179 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-11-06 19:24:33,973 WARN L179 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 8 [2018-11-06 19:24:34,317 WARN L179 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-11-06 19:24:37,343 INFO L134 CoverageAnalysis]: Checked inductivity of 6270 backedges. 2407 proven. 158 refuted. 0 times theorem prover too weak. 3705 trivial. 0 not checked. [2018-11-06 19:24:37,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:24:37,344 INFO L225 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 [2018-11-06 19:24:37,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:24:37,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:24:37,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:24:40,017 INFO L134 CoverageAnalysis]: Checked inductivity of 6270 backedges. 2565 proven. 0 refuted. 0 times theorem prover too weak. 3705 trivial. 0 not checked. [2018-11-06 19:24:40,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:24:40,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2018-11-06 19:24:40,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-06 19:24:40,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-06 19:24:40,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-06 19:24:40,041 INFO L87 Difference]: Start difference. First operand 15858 states and 16235 transitions. Second operand 10 states. [2018-11-06 19:24:47,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:24:47,128 INFO L93 Difference]: Finished difference Result 43040 states and 44142 transitions. [2018-11-06 19:24:47,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-06 19:24:47,132 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 1871 [2018-11-06 19:24:47,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:24:47,154 INFO L225 Difference]: With dead ends: 43040 [2018-11-06 19:24:47,154 INFO L226 Difference]: Without dead ends: 27514 [2018-11-06 19:24:47,165 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1901 GetRequests, 1881 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2018-11-06 19:24:47,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27514 states. [2018-11-06 19:24:47,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27514 to 22184. [2018-11-06 19:24:47,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22184 states. [2018-11-06 19:24:47,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22184 states to 22184 states and 22683 transitions. [2018-11-06 19:24:47,356 INFO L78 Accepts]: Start accepts. Automaton has 22184 states and 22683 transitions. Word has length 1871 [2018-11-06 19:24:47,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:24:47,357 INFO L480 AbstractCegarLoop]: Abstraction has 22184 states and 22683 transitions. [2018-11-06 19:24:47,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-06 19:24:47,357 INFO L276 IsEmpty]: Start isEmpty. Operand 22184 states and 22683 transitions. [2018-11-06 19:24:47,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2281 [2018-11-06 19:24:47,397 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:24:47,398 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:24:47,398 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:24:47,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:24:47,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1235059713, now seen corresponding path program 1 times [2018-11-06 19:24:47,399 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:24:47,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:24:47,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:24:47,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:24:47,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:24:47,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:24:51,017 INFO L134 CoverageAnalysis]: Checked inductivity of 9625 backedges. 2180 proven. 0 refuted. 0 times theorem prover too weak. 7445 trivial. 0 not checked. [2018-11-06 19:24:51,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:24:51,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:24:51,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:24:51,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:24:51,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:24:51,020 INFO L87 Difference]: Start difference. First operand 22184 states and 22683 transitions. Second operand 3 states. [2018-11-06 19:24:52,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:24:52,391 INFO L93 Difference]: Finished difference Result 45686 states and 46709 transitions. [2018-11-06 19:24:52,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:24:52,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2280 [2018-11-06 19:24:52,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:24:52,418 INFO L225 Difference]: With dead ends: 45686 [2018-11-06 19:24:52,418 INFO L226 Difference]: Without dead ends: 23172 [2018-11-06 19:24:52,432 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:24:52,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23172 states. [2018-11-06 19:24:52,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23172 to 22182. [2018-11-06 19:24:52,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22182 states. [2018-11-06 19:24:52,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22182 states to 22182 states and 22638 transitions. [2018-11-06 19:24:52,635 INFO L78 Accepts]: Start accepts. Automaton has 22182 states and 22638 transitions. Word has length 2280 [2018-11-06 19:24:52,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:24:52,636 INFO L480 AbstractCegarLoop]: Abstraction has 22182 states and 22638 transitions. [2018-11-06 19:24:52,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:24:52,637 INFO L276 IsEmpty]: Start isEmpty. Operand 22182 states and 22638 transitions. [2018-11-06 19:24:52,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2316 [2018-11-06 19:24:52,685 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:24:52,686 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:24:52,686 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:24:52,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:24:52,687 INFO L82 PathProgramCache]: Analyzing trace with hash -2139992758, now seen corresponding path program 1 times [2018-11-06 19:24:52,687 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:24:52,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:24:52,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:24:52,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:24:52,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:24:52,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:24:54,141 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-06 19:24:54,289 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-06 19:24:59,839 INFO L134 CoverageAnalysis]: Checked inductivity of 9534 backedges. 4084 proven. 251 refuted. 0 times theorem prover too weak. 5199 trivial. 0 not checked. [2018-11-06 19:24:59,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:24:59,839 INFO L225 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 [2018-11-06 19:24:59,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:25:00,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:25:00,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:25:02,518 INFO L134 CoverageAnalysis]: Checked inductivity of 9534 backedges. 5492 proven. 0 refuted. 0 times theorem prover too weak. 4042 trivial. 0 not checked. [2018-11-06 19:25:02,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:25:02,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2018-11-06 19:25:02,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 19:25:02,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 19:25:02,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-06 19:25:02,543 INFO L87 Difference]: Start difference. First operand 22182 states and 22638 transitions. Second operand 9 states. [2018-11-06 19:25:10,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:25:10,497 INFO L93 Difference]: Finished difference Result 47070 states and 48022 transitions. [2018-11-06 19:25:10,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-06 19:25:10,497 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 2315 [2018-11-06 19:25:10,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:25:10,523 INFO L225 Difference]: With dead ends: 47070 [2018-11-06 19:25:10,523 INFO L226 Difference]: Without dead ends: 25220 [2018-11-06 19:25:10,541 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2334 GetRequests, 2318 SyntacticMatches, 7 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-06 19:25:10,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25220 states. [2018-11-06 19:25:10,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25220 to 21065. [2018-11-06 19:25:10,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21065 states. [2018-11-06 19:25:10,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21065 states to 21065 states and 21412 transitions. [2018-11-06 19:25:10,744 INFO L78 Accepts]: Start accepts. Automaton has 21065 states and 21412 transitions. Word has length 2315 [2018-11-06 19:25:10,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:25:10,745 INFO L480 AbstractCegarLoop]: Abstraction has 21065 states and 21412 transitions. [2018-11-06 19:25:10,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 19:25:10,745 INFO L276 IsEmpty]: Start isEmpty. Operand 21065 states and 21412 transitions. [2018-11-06 19:25:10,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2669 [2018-11-06 19:25:10,807 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:25:10,808 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:25:10,809 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:25:10,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:25:10,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1700302108, now seen corresponding path program 1 times [2018-11-06 19:25:10,810 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:25:10,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:25:10,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:25:10,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:25:10,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:25:11,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:25:12,885 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-06 19:25:20,536 INFO L134 CoverageAnalysis]: Checked inductivity of 11795 backedges. 8386 proven. 1504 refuted. 0 times theorem prover too weak. 1905 trivial. 0 not checked. [2018-11-06 19:25:20,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:25:20,537 INFO L225 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) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:25:20,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:25:21,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:25:21,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:25:24,947 INFO L134 CoverageAnalysis]: Checked inductivity of 11795 backedges. 7341 proven. 0 refuted. 0 times theorem prover too weak. 4454 trivial. 0 not checked. [2018-11-06 19:25:24,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:25:24,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2018-11-06 19:25:24,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-06 19:25:24,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-06 19:25:24,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-11-06 19:25:24,983 INFO L87 Difference]: Start difference. First operand 21065 states and 21412 transitions. Second operand 11 states. [2018-11-06 19:25:32,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:25:32,512 INFO L93 Difference]: Finished difference Result 42490 states and 43193 transitions. [2018-11-06 19:25:32,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-06 19:25:32,513 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 2668 [2018-11-06 19:25:32,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:25:32,535 INFO L225 Difference]: With dead ends: 42490 [2018-11-06 19:25:32,535 INFO L226 Difference]: Without dead ends: 21757 [2018-11-06 19:25:32,548 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2689 GetRequests, 2671 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2018-11-06 19:25:32,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21757 states. [2018-11-06 19:25:32,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21757 to 21725. [2018-11-06 19:25:32,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21725 states. [2018-11-06 19:25:32,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21725 states to 21725 states and 22071 transitions. [2018-11-06 19:25:32,743 INFO L78 Accepts]: Start accepts. Automaton has 21725 states and 22071 transitions. Word has length 2668 [2018-11-06 19:25:32,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:25:32,745 INFO L480 AbstractCegarLoop]: Abstraction has 21725 states and 22071 transitions. [2018-11-06 19:25:32,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-06 19:25:32,745 INFO L276 IsEmpty]: Start isEmpty. Operand 21725 states and 22071 transitions. [2018-11-06 19:25:32,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2696 [2018-11-06 19:25:32,795 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:25:32,796 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:25:32,796 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:25:32,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:25:32,797 INFO L82 PathProgramCache]: Analyzing trace with hash 999630116, now seen corresponding path program 1 times [2018-11-06 19:25:32,797 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:25:32,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:25:32,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:25:32,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:25:32,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:25:32,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:25:34,631 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-11-06 19:25:37,263 INFO L134 CoverageAnalysis]: Checked inductivity of 12565 backedges. 2207 proven. 18 refuted. 0 times theorem prover too weak. 10340 trivial. 0 not checked. [2018-11-06 19:25:37,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:25:37,264 INFO L225 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 [2018-11-06 19:25:37,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:25:37,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:25:37,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:25:40,878 INFO L134 CoverageAnalysis]: Checked inductivity of 12565 backedges. 2207 proven. 18 refuted. 0 times theorem prover too weak. 10340 trivial. 0 not checked. [2018-11-06 19:25:40,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 19:25:40,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2018-11-06 19:25:40,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:25:40,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:25:40,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:25:40,904 INFO L87 Difference]: Start difference. First operand 21725 states and 22071 transitions. Second operand 5 states. [2018-11-06 19:25:43,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:25:43,440 INFO L93 Difference]: Finished difference Result 45027 states and 45770 transitions. [2018-11-06 19:25:43,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:25:43,441 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 2695 [2018-11-06 19:25:43,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:25:43,466 INFO L225 Difference]: With dead ends: 45027 [2018-11-06 19:25:43,467 INFO L226 Difference]: Without dead ends: 23303 [2018-11-06 19:25:43,482 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2699 GetRequests, 2694 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:25:43,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23303 states. [2018-11-06 19:25:43,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23303 to 22054. [2018-11-06 19:25:43,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22054 states. [2018-11-06 19:25:43,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22054 states to 22054 states and 22381 transitions. [2018-11-06 19:25:43,683 INFO L78 Accepts]: Start accepts. Automaton has 22054 states and 22381 transitions. Word has length 2695 [2018-11-06 19:25:43,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:25:43,685 INFO L480 AbstractCegarLoop]: Abstraction has 22054 states and 22381 transitions. [2018-11-06 19:25:43,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:25:43,685 INFO L276 IsEmpty]: Start isEmpty. Operand 22054 states and 22381 transitions. [2018-11-06 19:25:43,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2708 [2018-11-06 19:25:43,739 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:25:43,740 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:25:43,740 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:25:43,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:25:43,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1848506455, now seen corresponding path program 1 times [2018-11-06 19:25:43,741 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:25:43,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:25:43,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:25:43,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:25:43,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:25:43,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:25:46,321 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-06 19:25:55,174 INFO L134 CoverageAnalysis]: Checked inductivity of 13070 backedges. 10344 proven. 482 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2018-11-06 19:25:55,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:25:55,175 INFO L225 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 [2018-11-06 19:25:55,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:25:55,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:25:55,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:26:03,181 INFO L134 CoverageAnalysis]: Checked inductivity of 13070 backedges. 9779 proven. 816 refuted. 0 times theorem prover too weak. 2475 trivial. 0 not checked. [2018-11-06 19:26:03,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 19:26:03,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2018-11-06 19:26:03,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-06 19:26:03,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-06 19:26:03,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-11-06 19:26:03,211 INFO L87 Difference]: Start difference. First operand 22054 states and 22381 transitions. Second operand 13 states. [2018-11-06 19:26:13,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:26:13,844 INFO L93 Difference]: Finished difference Result 46583 states and 47269 transitions. [2018-11-06 19:26:13,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-06 19:26:13,845 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 2707 [2018-11-06 19:26:13,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:26:13,870 INFO L225 Difference]: With dead ends: 46583 [2018-11-06 19:26:13,870 INFO L226 Difference]: Without dead ends: 24861 [2018-11-06 19:26:13,883 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2731 GetRequests, 2710 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2018-11-06 19:26:13,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24861 states. [2018-11-06 19:26:14,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24861 to 22384. [2018-11-06 19:26:14,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22384 states. [2018-11-06 19:26:14,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22384 states to 22384 states and 22708 transitions. [2018-11-06 19:26:14,101 INFO L78 Accepts]: Start accepts. Automaton has 22384 states and 22708 transitions. Word has length 2707 [2018-11-06 19:26:14,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:26:14,102 INFO L480 AbstractCegarLoop]: Abstraction has 22384 states and 22708 transitions. [2018-11-06 19:26:14,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-06 19:26:14,102 INFO L276 IsEmpty]: Start isEmpty. Operand 22384 states and 22708 transitions. [2018-11-06 19:26:14,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2776 [2018-11-06 19:26:14,156 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:26:14,157 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:26:14,157 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:26:14,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:26:14,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1332012024, now seen corresponding path program 1 times [2018-11-06 19:26:14,158 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:26:14,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:26:14,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:26:14,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:26:14,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:26:14,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:26:16,414 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-06 19:26:16,703 WARN L179 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2018-11-06 19:26:25,654 INFO L134 CoverageAnalysis]: Checked inductivity of 13903 backedges. 7433 proven. 2468 refuted. 0 times theorem prover too weak. 4002 trivial. 0 not checked. [2018-11-06 19:26:25,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:26:25,654 INFO L225 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) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:26:25,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:26:26,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:26:26,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:26:26,847 WARN L179 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 28 [2018-11-06 19:26:34,089 INFO L134 CoverageAnalysis]: Checked inductivity of 13903 backedges. 8359 proven. 0 refuted. 0 times theorem prover too weak. 5544 trivial. 0 not checked. [2018-11-06 19:26:34,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:26:34,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [18] total 20 [2018-11-06 19:26:34,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-06 19:26:34,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-06 19:26:34,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2018-11-06 19:26:34,114 INFO L87 Difference]: Start difference. First operand 22384 states and 22708 transitions. Second operand 20 states. Received shutdown request... [2018-11-06 19:26:40,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-06 19:26:40,482 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-06 19:26:40,488 WARN L205 ceAbstractionStarter]: Timeout [2018-11-06 19:26:40,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:26:40 BoogieIcfgContainer [2018-11-06 19:26:40,488 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 19:26:40,489 INFO L168 Benchmark]: Toolchain (without parser) took 224093.15 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -479.4 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-11-06 19:26:40,490 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 19:26:40,490 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1203.94 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2018-11-06 19:26:40,491 INFO L168 Benchmark]: Boogie Procedure Inliner took 324.21 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.2 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -862.3 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. [2018-11-06 19:26:40,492 INFO L168 Benchmark]: Boogie Preprocessor took 172.52 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2018-11-06 19:26:40,492 INFO L168 Benchmark]: RCFGBuilder took 5926.68 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 279.8 MB). Peak memory consumption was 279.8 MB. Max. memory is 7.1 GB. [2018-11-06 19:26:40,493 INFO L168 Benchmark]: TraceAbstraction took 216460.54 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 15.5 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2018-11-06 19:26:40,497 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1203.94 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 324.21 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.2 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -862.3 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 172.52 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5926.68 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 279.8 MB). Peak memory consumption was 279.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 216460.54 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 15.5 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 64]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 64). Cancelled while BasicCegarLoop was constructing difference of abstraction (22384states) and FLOYD_HOARE automaton (currently 12 states, 20 states before enhancement),while ReachableStatesComputation was computing reachable states (1810 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 397 locations, 1 error locations. TIMEOUT Result, 216.3s OverallTime, 21 OverallIterations, 14 TraceHistogramMax, 104.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4784 SDtfs, 34601 SDslu, 2303 SDs, 0 SdLazy, 76398 SolverSat, 5203 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 83.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18389 GetRequests, 18199 SyntacticMatches, 37 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 13.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22384occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 20261 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.3s SsaConstructionTime, 5.3s SatisfiabilityAnalysisTime, 54.2s InterpolantComputationTime, 44874 NumberOfCodeBlocks, 44874 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 44844 ConstructedInterpolants, 498 QuantifiedInterpolants, 319557256 SizeOfPredicates, 6 NumberOfNonLiveVariables, 20674 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 30 InterpolantComputations, 19 PerfectInterpolantSequences, 163027/169270 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown