java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-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/Problem13_label19_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-26 19:12:53,852 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 19:12:53,854 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 19:12:53,869 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 19:12:53,870 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 19:12:53,871 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 19:12:53,872 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 19:12:53,877 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 19:12:53,879 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 19:12:53,880 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 19:12:53,881 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 19:12:53,881 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 19:12:53,882 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 19:12:53,883 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 19:12:53,884 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 19:12:53,885 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 19:12:53,886 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 19:12:53,888 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 19:12:53,890 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 19:12:53,892 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 19:12:53,893 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 19:12:53,895 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 19:12:53,898 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 19:12:53,898 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 19:12:53,898 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 19:12:53,899 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 19:12:53,900 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 19:12:53,901 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 19:12:53,902 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 19:12:53,903 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 19:12:53,904 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 19:12:53,904 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 19:12:53,905 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 19:12:53,905 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 19:12:53,906 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 19:12:53,907 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 19:12:53,907 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-26 19:12:53,935 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 19:12:53,935 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 19:12:53,936 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 19:12:53,936 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 19:12:53,940 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 19:12:53,940 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 19:12:53,940 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 19:12:53,943 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 19:12:53,943 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 19:12:53,943 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 19:12:53,943 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 19:12:53,944 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 19:12:53,944 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 19:12:53,944 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 19:12:53,944 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 19:12:53,945 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 19:12:53,945 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 19:12:53,945 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 19:12:53,945 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 19:12:53,945 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 19:12:53,946 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 19:12:53,947 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 19:12:53,947 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 19:12:53,948 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 19:12:53,948 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 19:12:53,948 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 19:12:53,948 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 19:12:53,948 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-26 19:12:54,023 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 19:12:54,040 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 19:12:54,045 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 19:12:54,046 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 19:12:54,047 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 19:12:54,048 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label19_false-unreach-call.c [2018-10-26 19:12:54,116 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b6d9b44f2/11f798d535c34ff9a792ebe8667debf5/FLAGb74f2d110 [2018-10-26 19:12:54,964 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 19:12:54,965 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label19_false-unreach-call.c [2018-10-26 19:12:55,004 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b6d9b44f2/11f798d535c34ff9a792ebe8667debf5/FLAGb74f2d110 [2018-10-26 19:12:55,021 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b6d9b44f2/11f798d535c34ff9a792ebe8667debf5 [2018-10-26 19:12:55,033 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 19:12:55,034 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 19:12:55,036 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 19:12:55,036 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 19:12:55,040 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 19:12:55,041 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:12:55" (1/1) ... [2018-10-26 19:12:55,044 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8de4687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:12:55, skipping insertion in model container [2018-10-26 19:12:55,045 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:12:55" (1/1) ... [2018-10-26 19:12:55,056 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 19:12:55,224 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 19:12:56,677 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:12:56,682 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 19:12:57,399 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:12:57,441 INFO L193 MainTranslator]: Completed translation [2018-10-26 19:12:57,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:12:57 WrapperNode [2018-10-26 19:12:57,442 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 19:12:57,443 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 19:12:57,443 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 19:12:57,444 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 19:12:57,455 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:12:57" (1/1) ... [2018-10-26 19:12:57,543 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:12:57" (1/1) ... [2018-10-26 19:12:58,233 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 19:12:58,234 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 19:12:58,234 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 19:12:58,234 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 19:12:58,246 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:12:57" (1/1) ... [2018-10-26 19:12:58,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:12:57" (1/1) ... [2018-10-26 19:12:58,327 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:12:57" (1/1) ... [2018-10-26 19:12:58,328 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:12:57" (1/1) ... [2018-10-26 19:12:58,582 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:12:57" (1/1) ... [2018-10-26 19:12:58,624 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:12:57" (1/1) ... [2018-10-26 19:12:58,756 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:12:57" (1/1) ... [2018-10-26 19:12:58,887 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 19:12:58,888 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 19:12:58,888 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 19:12:58,888 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 19:12:58,889 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:12:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 19:12:58,955 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 19:12:58,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 19:12:58,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 19:13:14,677 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 19:13:14,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:13:14 BoogieIcfgContainer [2018-10-26 19:13:14,678 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 19:13:14,679 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 19:13:14,679 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 19:13:14,682 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 19:13:14,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 07:12:55" (1/3) ... [2018-10-26 19:13:14,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c3634d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:13:14, skipping insertion in model container [2018-10-26 19:13:14,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:12:57" (2/3) ... [2018-10-26 19:13:14,684 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c3634d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:13:14, skipping insertion in model container [2018-10-26 19:13:14,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:13:14" (3/3) ... [2018-10-26 19:13:14,686 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label19_false-unreach-call.c [2018-10-26 19:13:14,697 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 19:13:14,706 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 19:13:14,724 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 19:13:14,783 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 19:13:14,784 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 19:13:14,784 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 19:13:14,784 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 19:13:14,784 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 19:13:14,784 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 19:13:14,784 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 19:13:14,784 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 19:13:14,785 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 19:13:14,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states. [2018-10-26 19:13:14,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-26 19:13:14,836 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:13:14,837 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:13:14,840 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:13:14,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:13:14,847 INFO L82 PathProgramCache]: Analyzing trace with hash 670581594, now seen corresponding path program 1 times [2018-10-26 19:13:14,849 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:13:14,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:13:14,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:13:14,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:13:14,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:13:14,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:13:15,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:13:15,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:13:15,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:13:15,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:13:15,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:13:15,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:13:15,224 INFO L87 Difference]: Start difference. First operand 1099 states. Second operand 4 states. [2018-10-26 19:13:37,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:13:37,463 INFO L93 Difference]: Finished difference Result 3993 states and 7498 transitions. [2018-10-26 19:13:37,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:13:37,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-10-26 19:13:37,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:13:37,509 INFO L225 Difference]: With dead ends: 3993 [2018-10-26 19:13:37,509 INFO L226 Difference]: Without dead ends: 2887 [2018-10-26 19:13:37,519 INFO L605 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-10-26 19:13:37,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2887 states. [2018-10-26 19:13:37,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2887 to 1936. [2018-10-26 19:13:37,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1936 states. [2018-10-26 19:13:37,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1936 states and 3550 transitions. [2018-10-26 19:13:37,674 INFO L78 Accepts]: Start accepts. Automaton has 1936 states and 3550 transitions. Word has length 18 [2018-10-26 19:13:37,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:13:37,675 INFO L481 AbstractCegarLoop]: Abstraction has 1936 states and 3550 transitions. [2018-10-26 19:13:37,675 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:13:37,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1936 states and 3550 transitions. [2018-10-26 19:13:37,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-26 19:13:37,679 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:13:37,679 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-26 19:13:37,680 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:13:37,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:13:37,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1916991881, now seen corresponding path program 1 times [2018-10-26 19:13:37,680 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:13:37,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:13:37,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:13:37,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:13:37,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:13:37,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:13:37,973 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:13:37,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:13:37,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:13:37,975 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:13:37,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:13:37,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:13:37,977 INFO L87 Difference]: Start difference. First operand 1936 states and 3550 transitions. Second operand 4 states. [2018-10-26 19:13:53,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:13:53,974 INFO L93 Difference]: Finished difference Result 7120 states and 13344 transitions. [2018-10-26 19:13:53,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:13:53,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2018-10-26 19:13:53,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:13:54,003 INFO L225 Difference]: With dead ends: 7120 [2018-10-26 19:13:54,003 INFO L226 Difference]: Without dead ends: 5186 [2018-10-26 19:13:54,008 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:13:54,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5186 states. [2018-10-26 19:13:54,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5186 to 3555. [2018-10-26 19:13:54,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3555 states. [2018-10-26 19:13:54,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3555 states to 3555 states and 6249 transitions. [2018-10-26 19:13:54,096 INFO L78 Accepts]: Start accepts. Automaton has 3555 states and 6249 transitions. Word has length 87 [2018-10-26 19:13:54,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:13:54,096 INFO L481 AbstractCegarLoop]: Abstraction has 3555 states and 6249 transitions. [2018-10-26 19:13:54,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:13:54,097 INFO L276 IsEmpty]: Start isEmpty. Operand 3555 states and 6249 transitions. [2018-10-26 19:13:54,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-26 19:13:54,101 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:13:54,101 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-26 19:13:54,102 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:13:54,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:13:54,102 INFO L82 PathProgramCache]: Analyzing trace with hash 2105908058, now seen corresponding path program 1 times [2018-10-26 19:13:54,102 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:13:54,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:13:54,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:13:54,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:13:54,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:13:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:13:54,247 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:13:54,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:13:54,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:13:54,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:13:54,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:13:54,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:13:54,248 INFO L87 Difference]: Start difference. First operand 3555 states and 6249 transitions. Second operand 4 states. [2018-10-26 19:14:06,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:14:06,422 INFO L93 Difference]: Finished difference Result 12676 states and 22440 transitions. [2018-10-26 19:14:06,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:14:06,430 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-10-26 19:14:06,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:14:06,475 INFO L225 Difference]: With dead ends: 12676 [2018-10-26 19:14:06,476 INFO L226 Difference]: Without dead ends: 9123 [2018-10-26 19:14:06,483 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:14:06,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9123 states. [2018-10-26 19:14:06,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9123 to 9116. [2018-10-26 19:14:06,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9116 states. [2018-10-26 19:14:06,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9116 states to 9116 states and 14200 transitions. [2018-10-26 19:14:06,655 INFO L78 Accepts]: Start accepts. Automaton has 9116 states and 14200 transitions. Word has length 100 [2018-10-26 19:14:06,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:14:06,657 INFO L481 AbstractCegarLoop]: Abstraction has 9116 states and 14200 transitions. [2018-10-26 19:14:06,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:14:06,657 INFO L276 IsEmpty]: Start isEmpty. Operand 9116 states and 14200 transitions. [2018-10-26 19:14:06,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 19:14:06,663 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:14:06,667 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-26 19:14:06,667 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:14:06,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:14:06,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1681546925, now seen corresponding path program 1 times [2018-10-26 19:14:06,668 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:14:06,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:14:06,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:14:06,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:14:06,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:14:06,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:07,122 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-26 19:14:07,498 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:14:07,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:14:07,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:14:07,501 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 19:14:07,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 19:14:07,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:14:07,502 INFO L87 Difference]: Start difference. First operand 9116 states and 14200 transitions. Second operand 5 states. [2018-10-26 19:14:24,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:14:24,491 INFO L93 Difference]: Finished difference Result 29265 states and 45080 transitions. [2018-10-26 19:14:24,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 19:14:24,492 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2018-10-26 19:14:24,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:14:24,572 INFO L225 Difference]: With dead ends: 29265 [2018-10-26 19:14:24,572 INFO L226 Difference]: Without dead ends: 20151 [2018-10-26 19:14:24,588 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-26 19:14:24,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20151 states. [2018-10-26 19:14:25,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20151 to 20149. [2018-10-26 19:14:25,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20149 states. [2018-10-26 19:14:25,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20149 states to 20149 states and 28284 transitions. [2018-10-26 19:14:25,095 INFO L78 Accepts]: Start accepts. Automaton has 20149 states and 28284 transitions. Word has length 121 [2018-10-26 19:14:25,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:14:25,096 INFO L481 AbstractCegarLoop]: Abstraction has 20149 states and 28284 transitions. [2018-10-26 19:14:25,096 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 19:14:25,096 INFO L276 IsEmpty]: Start isEmpty. Operand 20149 states and 28284 transitions. [2018-10-26 19:14:25,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-26 19:14:25,102 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:14:25,102 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-26 19:14:25,102 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:14:25,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:14:25,103 INFO L82 PathProgramCache]: Analyzing trace with hash 964067941, now seen corresponding path program 1 times [2018-10-26 19:14:25,103 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:14:25,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:14:25,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:14:25,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:14:25,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:14:25,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:25,271 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:14:25,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:14:25,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:14:25,272 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:14:25,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:14:25,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:14:25,273 INFO L87 Difference]: Start difference. First operand 20149 states and 28284 transitions. Second operand 3 states. [2018-10-26 19:14:32,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:14:32,590 INFO L93 Difference]: Finished difference Result 41070 states and 57647 transitions. [2018-10-26 19:14:32,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:14:32,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2018-10-26 19:14:32,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:14:32,633 INFO L225 Difference]: With dead ends: 41070 [2018-10-26 19:14:32,633 INFO L226 Difference]: Without dead ends: 21711 [2018-10-26 19:14:32,656 INFO L605 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-10-26 19:14:32,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21711 states. [2018-10-26 19:14:32,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21711 to 21708. [2018-10-26 19:14:32,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21708 states. [2018-10-26 19:14:32,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21708 states to 21708 states and 27055 transitions. [2018-10-26 19:14:32,951 INFO L78 Accepts]: Start accepts. Automaton has 21708 states and 27055 transitions. Word has length 144 [2018-10-26 19:14:32,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:14:32,951 INFO L481 AbstractCegarLoop]: Abstraction has 21708 states and 27055 transitions. [2018-10-26 19:14:32,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:14:32,951 INFO L276 IsEmpty]: Start isEmpty. Operand 21708 states and 27055 transitions. [2018-10-26 19:14:32,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-10-26 19:14:32,956 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:14:32,957 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-10-26 19:14:32,957 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:14:32,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:14:32,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1570115156, now seen corresponding path program 1 times [2018-10-26 19:14:32,957 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:14:32,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:14:32,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:14:32,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:14:32,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:14:33,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:33,433 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-26 19:14:33,531 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:14:33,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:14:33,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:14:33,532 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:14:33,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:14:33,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:14:33,533 INFO L87 Difference]: Start difference. First operand 21708 states and 27055 transitions. Second operand 4 states. [2018-10-26 19:14:43,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:14:43,926 INFO L93 Difference]: Finished difference Result 64687 states and 81783 transitions. [2018-10-26 19:14:43,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:14:43,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 261 [2018-10-26 19:14:43,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:14:43,990 INFO L225 Difference]: With dead ends: 64687 [2018-10-26 19:14:43,990 INFO L226 Difference]: Without dead ends: 38998 [2018-10-26 19:14:44,024 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:14:44,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38998 states. [2018-10-26 19:14:44,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38998 to 35054. [2018-10-26 19:14:44,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35054 states. [2018-10-26 19:14:44,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35054 states to 35054 states and 41125 transitions. [2018-10-26 19:14:44,482 INFO L78 Accepts]: Start accepts. Automaton has 35054 states and 41125 transitions. Word has length 261 [2018-10-26 19:14:44,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:14:44,482 INFO L481 AbstractCegarLoop]: Abstraction has 35054 states and 41125 transitions. [2018-10-26 19:14:44,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:14:44,483 INFO L276 IsEmpty]: Start isEmpty. Operand 35054 states and 41125 transitions. [2018-10-26 19:14:44,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-10-26 19:14:44,489 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:14:44,489 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-10-26 19:14:44,490 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:14:44,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:14:44,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1991819509, now seen corresponding path program 1 times [2018-10-26 19:14:44,490 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:14:44,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:14:44,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:14:44,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:14:44,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:14:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:14:44,959 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-26 19:14:44,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:14:44,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:14:44,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 19:14:44,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 19:14:44,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:14:44,961 INFO L87 Difference]: Start difference. First operand 35054 states and 41125 transitions. Second operand 5 states. [2018-10-26 19:15:02,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:15:02,994 INFO L93 Difference]: Finished difference Result 115299 states and 135038 transitions. [2018-10-26 19:15:02,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 19:15:02,995 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 284 [2018-10-26 19:15:02,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:15:03,103 INFO L225 Difference]: With dead ends: 115299 [2018-10-26 19:15:03,104 INFO L226 Difference]: Without dead ends: 81035 [2018-10-26 19:15:03,152 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:15:03,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81035 states. [2018-10-26 19:15:04,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81035 to 76921. [2018-10-26 19:15:04,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76921 states. [2018-10-26 19:15:04,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76921 states to 76921 states and 88858 transitions. [2018-10-26 19:15:04,357 INFO L78 Accepts]: Start accepts. Automaton has 76921 states and 88858 transitions. Word has length 284 [2018-10-26 19:15:04,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:15:04,357 INFO L481 AbstractCegarLoop]: Abstraction has 76921 states and 88858 transitions. [2018-10-26 19:15:04,357 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 19:15:04,357 INFO L276 IsEmpty]: Start isEmpty. Operand 76921 states and 88858 transitions. [2018-10-26 19:15:04,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-10-26 19:15:04,363 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:15:04,364 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-10-26 19:15:04,364 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:15:04,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:15:04,364 INFO L82 PathProgramCache]: Analyzing trace with hash 464366551, now seen corresponding path program 1 times [2018-10-26 19:15:04,364 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:15:04,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:15:04,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:15:04,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:15:04,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:15:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:15:04,679 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-10-26 19:15:04,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:15:04,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:15:04,680 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:15:04,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:15:04,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:15:04,681 INFO L87 Difference]: Start difference. First operand 76921 states and 88858 transitions. Second operand 4 states. [2018-10-26 19:15:16,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:15:16,076 INFO L93 Difference]: Finished difference Result 160920 states and 187144 transitions. [2018-10-26 19:15:16,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:15:16,076 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 306 [2018-10-26 19:15:16,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:15:16,189 INFO L225 Difference]: With dead ends: 160920 [2018-10-26 19:15:16,190 INFO L226 Difference]: Without dead ends: 84789 [2018-10-26 19:15:16,242 INFO L605 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-10-26 19:15:16,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84789 states. [2018-10-26 19:15:17,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84789 to 83999. [2018-10-26 19:15:17,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83999 states. [2018-10-26 19:15:18,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83999 states to 83999 states and 93796 transitions. [2018-10-26 19:15:18,015 INFO L78 Accepts]: Start accepts. Automaton has 83999 states and 93796 transitions. Word has length 306 [2018-10-26 19:15:18,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:15:18,015 INFO L481 AbstractCegarLoop]: Abstraction has 83999 states and 93796 transitions. [2018-10-26 19:15:18,015 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:15:18,016 INFO L276 IsEmpty]: Start isEmpty. Operand 83999 states and 93796 transitions. [2018-10-26 19:15:18,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2018-10-26 19:15:18,042 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:15:18,042 INFO L375 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:15:18,043 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:15:18,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:15:18,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1544791703, now seen corresponding path program 1 times [2018-10-26 19:15:18,043 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:15:18,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:15:18,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:15:18,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:15:18,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:15:18,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:15:18,463 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-26 19:15:18,622 INFO L134 CoverageAnalysis]: Checked inductivity of 873 backedges. 684 proven. 0 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2018-10-26 19:15:18,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:15:18,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:15:18,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:15:18,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:15:18,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:15:18,626 INFO L87 Difference]: Start difference. First operand 83999 states and 93796 transitions. Second operand 4 states. [2018-10-26 19:15:30,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:15:30,166 INFO L93 Difference]: Finished difference Result 256261 states and 285685 transitions. [2018-10-26 19:15:30,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:15:30,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 472 [2018-10-26 19:15:30,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:15:30,354 INFO L225 Difference]: With dead ends: 256261 [2018-10-26 19:15:30,354 INFO L226 Difference]: Without dead ends: 171472 [2018-10-26 19:15:30,414 INFO L605 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-10-26 19:15:30,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171472 states. [2018-10-26 19:15:31,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171472 to 166718. [2018-10-26 19:15:31,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166718 states. [2018-10-26 19:15:32,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166718 states to 166718 states and 180254 transitions. [2018-10-26 19:15:32,018 INFO L78 Accepts]: Start accepts. Automaton has 166718 states and 180254 transitions. Word has length 472 [2018-10-26 19:15:32,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:15:32,019 INFO L481 AbstractCegarLoop]: Abstraction has 166718 states and 180254 transitions. [2018-10-26 19:15:32,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:15:32,019 INFO L276 IsEmpty]: Start isEmpty. Operand 166718 states and 180254 transitions. [2018-10-26 19:15:32,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2018-10-26 19:15:32,062 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:15:32,063 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:15:32,063 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:15:32,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:15:32,064 INFO L82 PathProgramCache]: Analyzing trace with hash -126964752, now seen corresponding path program 1 times [2018-10-26 19:15:32,064 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:15:32,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:15:32,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:15:32,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:15:32,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:15:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:15:34,036 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 433 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-26 19:15:34,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:15:34,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:15:34,038 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:15:34,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:15:34,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:15:34,039 INFO L87 Difference]: Start difference. First operand 166718 states and 180254 transitions. Second operand 4 states. [2018-10-26 19:15:45,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:15:45,068 INFO L93 Difference]: Finished difference Result 387809 states and 419868 transitions. [2018-10-26 19:15:45,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:15:45,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 579 [2018-10-26 19:15:45,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:15:45,307 INFO L225 Difference]: With dead ends: 387809 [2018-10-26 19:15:45,307 INFO L226 Difference]: Without dead ends: 221090 [2018-10-26 19:15:45,400 INFO L605 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-10-26 19:15:45,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221090 states. [2018-10-26 19:15:48,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221090 to 215537. [2018-10-26 19:15:48,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215537 states. [2018-10-26 19:15:48,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215537 states to 215537 states and 229563 transitions. [2018-10-26 19:15:48,564 INFO L78 Accepts]: Start accepts. Automaton has 215537 states and 229563 transitions. Word has length 579 [2018-10-26 19:15:48,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:15:48,565 INFO L481 AbstractCegarLoop]: Abstraction has 215537 states and 229563 transitions. [2018-10-26 19:15:48,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:15:48,565 INFO L276 IsEmpty]: Start isEmpty. Operand 215537 states and 229563 transitions. [2018-10-26 19:15:48,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 665 [2018-10-26 19:15:48,617 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:15:48,617 INFO L375 BasicCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-26 19:15:48,618 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:15:48,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:15:48,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1266617253, now seen corresponding path program 1 times [2018-10-26 19:15:48,618 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:15:48,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:15:48,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:15:48,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:15:48,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:15:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:15:50,515 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 670 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2018-10-26 19:15:50,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:15:50,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:15:50,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:15:50,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:15:50,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:15:50,517 INFO L87 Difference]: Start difference. First operand 215537 states and 229563 transitions. Second operand 4 states. [2018-10-26 19:16:05,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:16:05,508 INFO L93 Difference]: Finished difference Result 509972 states and 543295 transitions. [2018-10-26 19:16:05,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:16:05,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 664 [2018-10-26 19:16:05,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:16:05,889 INFO L225 Difference]: With dead ends: 509972 [2018-10-26 19:16:05,890 INFO L226 Difference]: Without dead ends: 295225 [2018-10-26 19:16:06,004 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:16:06,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295225 states. [2018-10-26 19:16:09,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295225 to 288043. [2018-10-26 19:16:09,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288043 states. [2018-10-26 19:16:11,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288043 states to 288043 states and 305882 transitions. [2018-10-26 19:16:11,572 INFO L78 Accepts]: Start accepts. Automaton has 288043 states and 305882 transitions. Word has length 664 [2018-10-26 19:16:11,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:16:11,573 INFO L481 AbstractCegarLoop]: Abstraction has 288043 states and 305882 transitions. [2018-10-26 19:16:11,573 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:16:11,573 INFO L276 IsEmpty]: Start isEmpty. Operand 288043 states and 305882 transitions. [2018-10-26 19:16:11,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 695 [2018-10-26 19:16:11,595 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:16:11,596 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-26 19:16:11,596 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:16:11,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:16:11,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1250965412, now seen corresponding path program 1 times [2018-10-26 19:16:11,597 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:16:11,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:16:11,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:16:11,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:16:11,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:16:11,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:16:12,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1048 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2018-10-26 19:16:12,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:16:12,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:16:12,364 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:16:12,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:16:12,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:16:12,365 INFO L87 Difference]: Start difference. First operand 288043 states and 305882 transitions. Second operand 4 states. [2018-10-26 19:16:25,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:16:25,561 INFO L93 Difference]: Finished difference Result 571361 states and 606847 transitions. [2018-10-26 19:16:25,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:16:25,561 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 694 [2018-10-26 19:16:25,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:16:25,963 INFO L225 Difference]: With dead ends: 571361 [2018-10-26 19:16:25,964 INFO L226 Difference]: Without dead ends: 284108 [2018-10-26 19:16:26,110 INFO L605 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-10-26 19:16:26,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284108 states. [2018-10-26 19:16:29,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284108 to 279373. [2018-10-26 19:16:29,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279373 states. [2018-10-26 19:16:29,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279373 states to 279373 states and 293581 transitions. [2018-10-26 19:16:29,927 INFO L78 Accepts]: Start accepts. Automaton has 279373 states and 293581 transitions. Word has length 694 [2018-10-26 19:16:29,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:16:29,928 INFO L481 AbstractCegarLoop]: Abstraction has 279373 states and 293581 transitions. [2018-10-26 19:16:29,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:16:29,928 INFO L276 IsEmpty]: Start isEmpty. Operand 279373 states and 293581 transitions. [2018-10-26 19:16:29,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 788 [2018-10-26 19:16:29,963 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:16:29,964 INFO L375 BasicCegarLoop]: trace histogram [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, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-26 19:16:29,964 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:16:29,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:16:29,964 INFO L82 PathProgramCache]: Analyzing trace with hash -2142948040, now seen corresponding path program 1 times [2018-10-26 19:16:29,965 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:16:29,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:16:29,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:16:29,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:16:29,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:16:30,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:16:31,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1566 backedges. 1168 proven. 0 refuted. 0 times theorem prover too weak. 398 trivial. 0 not checked. [2018-10-26 19:16:31,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:16:31,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:16:31,368 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:16:31,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:16:31,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:16:31,369 INFO L87 Difference]: Start difference. First operand 279373 states and 293581 transitions. Second operand 4 states. [2018-10-26 19:16:41,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:16:41,320 INFO L93 Difference]: Finished difference Result 553244 states and 581574 transitions. [2018-10-26 19:16:41,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:16:41,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 787 [2018-10-26 19:16:41,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:16:41,689 INFO L225 Difference]: With dead ends: 553244 [2018-10-26 19:16:41,689 INFO L226 Difference]: Without dead ends: 274661 [2018-10-26 19:16:41,769 INFO L605 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-10-26 19:16:41,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274661 states. [2018-10-26 19:16:44,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274661 to 271479. [2018-10-26 19:16:44,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271479 states. [2018-10-26 19:16:44,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271479 states to 271479 states and 280978 transitions. [2018-10-26 19:16:44,954 INFO L78 Accepts]: Start accepts. Automaton has 271479 states and 280978 transitions. Word has length 787 [2018-10-26 19:16:44,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:16:44,955 INFO L481 AbstractCegarLoop]: Abstraction has 271479 states and 280978 transitions. [2018-10-26 19:16:44,955 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:16:44,955 INFO L276 IsEmpty]: Start isEmpty. Operand 271479 states and 280978 transitions. [2018-10-26 19:16:45,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 911 [2018-10-26 19:16:45,010 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:16:45,010 INFO L375 BasicCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 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-10-26 19:16:45,011 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:16:45,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:16:45,011 INFO L82 PathProgramCache]: Analyzing trace with hash -54212809, now seen corresponding path program 1 times [2018-10-26 19:16:45,011 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:16:45,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:16:45,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:16:45,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:16:45,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:16:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-10-26 19:16:46,369 WARN L187 SmtUtils]: Removed 3 from assertion stack [2018-10-26 19:16:46,370 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-26 19:16:46,375 WARN L205 ceAbstractionStarter]: Timeout [2018-10-26 19:16:46,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 07:16:46 BoogieIcfgContainer [2018-10-26 19:16:46,375 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 19:16:46,376 INFO L168 Benchmark]: Toolchain (without parser) took 231342.76 ms. Allocated memory was 1.5 GB in the beginning and 4.3 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -801.0 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2018-10-26 19:16:46,377 INFO L168 Benchmark]: CDTParser took 0.27 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-10-26 19:16:46,378 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2407.24 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. [2018-10-26 19:16:46,379 INFO L168 Benchmark]: Boogie Procedure Inliner took 790.21 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 825.2 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 83.7 MB. Max. memory is 7.1 GB. [2018-10-26 19:16:46,380 INFO L168 Benchmark]: Boogie Preprocessor took 653.82 ms. Allocated memory is still 2.4 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 69.3 MB). Peak memory consumption was 69.3 MB. Max. memory is 7.1 GB. [2018-10-26 19:16:46,380 INFO L168 Benchmark]: RCFGBuilder took 15790.06 ms. Allocated memory was 2.4 GB in the beginning and 2.6 GB in the end (delta: 220.7 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 42.4 MB). Peak memory consumption was 593.1 MB. Max. memory is 7.1 GB. [2018-10-26 19:16:46,381 INFO L168 Benchmark]: TraceAbstraction took 211696.40 ms. Allocated memory was 2.6 GB in the beginning and 4.3 GB in the end (delta: 1.7 GB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -141.3 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-10-26 19:16:46,387 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.27 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 2407.24 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 790.21 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 825.2 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 83.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 653.82 ms. Allocated memory is still 2.4 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 69.3 MB). Peak memory consumption was 69.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 15790.06 ms. Allocated memory was 2.4 GB in the beginning and 2.6 GB in the end (delta: 220.7 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 42.4 MB). Peak memory consumption was 593.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 211696.40 ms. Allocated memory was 2.6 GB in the beginning and 4.3 GB in the end (delta: 1.7 GB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -141.3 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 63]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 63). Cancelled while BasicCegarLoop was analyzing trace of length 911 with TraceHistMax 7,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1099 locations, 1 error locations. TIMEOUT Result, 211.6s OverallTime, 14 OverallIterations, 7 TraceHistogramMax, 178.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10681 SDtfs, 28642 SDslu, 3166 SDs, 0 SdLazy, 57739 SolverSat, 16809 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 145.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=288043occurred in iteration=11, 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: 21.9s AutomataMinimizationTime, 13 MinimizatonAttempts, 36848 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 4517 NumberOfCodeBlocks, 4517 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 4504 ConstructedInterpolants, 0 QuantifiedInterpolants, 3859871 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 5517/5517 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown