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_label59_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 16:27:13,945 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 16:27:13,948 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 16:27:13,966 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 16:27:13,967 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 16:27:13,968 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 16:27:13,970 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 16:27:13,972 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 16:27:13,976 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 16:27:13,977 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 16:27:13,979 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 16:27:13,979 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 16:27:13,981 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 16:27:13,984 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 16:27:13,986 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 16:27:13,986 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 16:27:13,987 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 16:27:13,989 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 16:27:13,991 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 16:27:13,992 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 16:27:13,993 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 16:27:13,994 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 16:27:13,997 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 16:27:13,997 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 16:27:13,997 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 16:27:13,998 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 16:27:13,999 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 16:27:14,000 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 16:27:14,001 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 16:27:14,002 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 16:27:14,002 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 16:27:14,002 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 16:27:14,003 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 16:27:14,003 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 16:27:14,004 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 16:27:14,004 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 16:27:14,005 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-24 16:27:14,019 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 16:27:14,020 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 16:27:14,020 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 16:27:14,021 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 16:27:14,021 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 16:27:14,021 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 16:27:14,022 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 16:27:14,022 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 16:27:14,022 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 16:27:14,022 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 16:27:14,022 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 16:27:14,023 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 16:27:14,023 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 16:27:14,023 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 16:27:14,023 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 16:27:14,023 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 16:27:14,024 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 16:27:14,024 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 16:27:14,024 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 16:27:14,024 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 16:27:14,025 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 16:27:14,025 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 16:27:14,025 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 16:27:14,025 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 16:27:14,025 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 16:27:14,025 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 16:27:14,026 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 16:27:14,026 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 16:27:14,076 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 16:27:14,093 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 16:27:14,096 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 16:27:14,098 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 16:27:14,098 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 16:27:14,099 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label59_true-unreach-call.c [2018-10-24 16:27:14,158 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/8cebf0c43/a657c1a349854ad6bb12a4b5935b9e1e/FLAG2346618f7 [2018-10-24 16:27:14,951 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 16:27:14,952 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label59_true-unreach-call.c [2018-10-24 16:27:14,983 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/8cebf0c43/a657c1a349854ad6bb12a4b5935b9e1e/FLAG2346618f7 [2018-10-24 16:27:15,000 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/8cebf0c43/a657c1a349854ad6bb12a4b5935b9e1e [2018-10-24 16:27:15,012 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 16:27:15,014 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 16:27:15,015 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 16:27:15,015 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 16:27:15,020 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 16:27:15,021 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:27:15" (1/1) ... [2018-10-24 16:27:15,024 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39c2806f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:27:15, skipping insertion in model container [2018-10-24 16:27:15,024 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:27:15" (1/1) ... [2018-10-24 16:27:15,036 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 16:27:15,218 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 16:27:16,715 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 16:27:16,719 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 16:27:17,534 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 16:27:17,573 INFO L193 MainTranslator]: Completed translation [2018-10-24 16:27:17,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:27:17 WrapperNode [2018-10-24 16:27:17,574 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 16:27:17,576 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 16:27:17,576 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 16:27:17,577 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 16:27:17,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:27:17" (1/1) ... [2018-10-24 16:27:17,656 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:27:17" (1/1) ... [2018-10-24 16:27:18,436 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 16:27:18,437 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 16:27:18,437 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 16:27:18,437 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 16:27:18,449 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:27:17" (1/1) ... [2018-10-24 16:27:18,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:27:17" (1/1) ... [2018-10-24 16:27:18,542 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:27:17" (1/1) ... [2018-10-24 16:27:18,543 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:27:17" (1/1) ... [2018-10-24 16:27:18,818 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:27:17" (1/1) ... [2018-10-24 16:27:18,859 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:27:17" (1/1) ... [2018-10-24 16:27:18,962 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:27:17" (1/1) ... [2018-10-24 16:27:19,037 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 16:27:19,038 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 16:27:19,038 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 16:27:19,038 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 16:27:19,039 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:27:17" (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-24 16:27:19,109 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 16:27:19,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 16:27:19,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 16:27:35,070 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 16:27:35,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:27:35 BoogieIcfgContainer [2018-10-24 16:27:35,071 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 16:27:35,072 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 16:27:35,072 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 16:27:35,076 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 16:27:35,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:27:15" (1/3) ... [2018-10-24 16:27:35,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@774c9bce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:27:35, skipping insertion in model container [2018-10-24 16:27:35,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:27:17" (2/3) ... [2018-10-24 16:27:35,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@774c9bce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:27:35, skipping insertion in model container [2018-10-24 16:27:35,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:27:35" (3/3) ... [2018-10-24 16:27:35,081 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label59_true-unreach-call.c [2018-10-24 16:27:35,091 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 16:27:35,101 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 16:27:35,119 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 16:27:35,165 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 16:27:35,165 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 16:27:35,166 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 16:27:35,166 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 16:27:35,166 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 16:27:35,166 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 16:27:35,166 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 16:27:35,166 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 16:27:35,167 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 16:27:35,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states. [2018-10-24 16:27:35,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-24 16:27:35,213 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:27:35,214 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, 1, 1, 1, 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-24 16:27:35,220 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:27:35,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:27:35,228 INFO L82 PathProgramCache]: Analyzing trace with hash 84973194, now seen corresponding path program 1 times [2018-10-24 16:27:35,230 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:27:35,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:27:35,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:27:35,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:27:35,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:27:35,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:27:35,774 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-24 16:27:35,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:27:35,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:27:35,785 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:27:35,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:27:35,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:27:35,806 INFO L87 Difference]: Start difference. First operand 1099 states. Second operand 4 states. [2018-10-24 16:27:52,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:27:52,002 INFO L93 Difference]: Finished difference Result 3993 states and 7498 transitions. [2018-10-24 16:27:52,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:27:52,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-10-24 16:27:52,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:27:52,053 INFO L225 Difference]: With dead ends: 3993 [2018-10-24 16:27:52,053 INFO L226 Difference]: Without dead ends: 2887 [2018-10-24 16:27:52,063 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-24 16:27:52,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2887 states. [2018-10-24 16:27:52,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2887 to 1936. [2018-10-24 16:27:52,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1936 states. [2018-10-24 16:27:52,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1936 states and 3550 transitions. [2018-10-24 16:27:52,231 INFO L78 Accepts]: Start accepts. Automaton has 1936 states and 3550 transitions. Word has length 47 [2018-10-24 16:27:52,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:27:52,232 INFO L481 AbstractCegarLoop]: Abstraction has 1936 states and 3550 transitions. [2018-10-24 16:27:52,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:27:52,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1936 states and 3550 transitions. [2018-10-24 16:27:52,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-24 16:27:52,243 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:27:52,244 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-24 16:27:52,244 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:27:52,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:27:52,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1478720018, now seen corresponding path program 1 times [2018-10-24 16:27:52,246 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:27:52,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:27:52,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:27:52,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:27:52,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:27:52,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:27:52,496 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:27:52,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:27:52,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:27:52,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:27:52,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:27:52,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:27:52,499 INFO L87 Difference]: Start difference. First operand 1936 states and 3550 transitions. Second operand 4 states. [2018-10-24 16:28:08,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:28:08,584 INFO L93 Difference]: Finished difference Result 7121 states and 13344 transitions. [2018-10-24 16:28:08,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:28:08,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2018-10-24 16:28:08,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:28:08,613 INFO L225 Difference]: With dead ends: 7121 [2018-10-24 16:28:08,614 INFO L226 Difference]: Without dead ends: 5187 [2018-10-24 16:28:08,619 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-24 16:28:08,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5187 states. [2018-10-24 16:28:08,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5187 to 3554. [2018-10-24 16:28:08,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3554 states. [2018-10-24 16:28:08,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3554 states to 3554 states and 6248 transitions. [2018-10-24 16:28:08,715 INFO L78 Accepts]: Start accepts. Automaton has 3554 states and 6248 transitions. Word has length 116 [2018-10-24 16:28:08,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:28:08,715 INFO L481 AbstractCegarLoop]: Abstraction has 3554 states and 6248 transitions. [2018-10-24 16:28:08,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:28:08,716 INFO L276 IsEmpty]: Start isEmpty. Operand 3554 states and 6248 transitions. [2018-10-24 16:28:08,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-24 16:28:08,723 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:28:08,723 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 16:28:08,723 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:28:08,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:28:08,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1173691703, now seen corresponding path program 1 times [2018-10-24 16:28:08,724 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:28:08,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:28:08,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:28:08,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:28:08,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:28:08,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:28:08,934 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:28:08,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:28:08,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:28:08,935 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:28:08,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:28:08,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:28:08,936 INFO L87 Difference]: Start difference. First operand 3554 states and 6248 transitions. Second operand 4 states. [2018-10-24 16:28:20,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:28:20,168 INFO L93 Difference]: Finished difference Result 12675 states and 22438 transitions. [2018-10-24 16:28:20,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:28:20,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2018-10-24 16:28:20,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:28:20,215 INFO L225 Difference]: With dead ends: 12675 [2018-10-24 16:28:20,215 INFO L226 Difference]: Without dead ends: 9123 [2018-10-24 16:28:20,223 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-24 16:28:20,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9123 states. [2018-10-24 16:28:20,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9123 to 9114. [2018-10-24 16:28:20,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9114 states. [2018-10-24 16:28:20,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9114 states to 9114 states and 14198 transitions. [2018-10-24 16:28:20,393 INFO L78 Accepts]: Start accepts. Automaton has 9114 states and 14198 transitions. Word has length 129 [2018-10-24 16:28:20,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:28:20,393 INFO L481 AbstractCegarLoop]: Abstraction has 9114 states and 14198 transitions. [2018-10-24 16:28:20,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:28:20,394 INFO L276 IsEmpty]: Start isEmpty. Operand 9114 states and 14198 transitions. [2018-10-24 16:28:20,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-24 16:28:20,396 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:28:20,396 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 16:28:20,397 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:28:20,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:28:20,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1646340827, now seen corresponding path program 1 times [2018-10-24 16:28:20,397 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:28:20,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:28:20,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:28:20,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:28:20,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:28:20,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:28:20,730 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:28:20,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:28:20,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:28:20,731 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:28:20,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:28:20,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:28:20,732 INFO L87 Difference]: Start difference. First operand 9114 states and 14198 transitions. Second operand 4 states. [2018-10-24 16:28:29,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:28:29,858 INFO L93 Difference]: Finished difference Result 34810 states and 54374 transitions. [2018-10-24 16:28:29,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:28:29,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2018-10-24 16:28:29,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:28:29,977 INFO L225 Difference]: With dead ends: 34810 [2018-10-24 16:28:29,977 INFO L226 Difference]: Without dead ends: 25698 [2018-10-24 16:28:29,997 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-24 16:28:30,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25698 states. [2018-10-24 16:28:30,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25698 to 25672. [2018-10-24 16:28:30,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25672 states. [2018-10-24 16:28:30,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25672 states to 25672 states and 35622 transitions. [2018-10-24 16:28:30,390 INFO L78 Accepts]: Start accepts. Automaton has 25672 states and 35622 transitions. Word has length 149 [2018-10-24 16:28:30,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:28:30,391 INFO L481 AbstractCegarLoop]: Abstraction has 25672 states and 35622 transitions. [2018-10-24 16:28:30,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:28:30,391 INFO L276 IsEmpty]: Start isEmpty. Operand 25672 states and 35622 transitions. [2018-10-24 16:28:30,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-24 16:28:30,397 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:28:30,398 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 16:28:30,398 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:28:30,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:28:30,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1360927528, now seen corresponding path program 1 times [2018-10-24 16:28:30,399 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:28:30,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:28:30,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:28:30,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:28:30,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:28:30,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:28:30,725 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:28:30,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:28:30,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:28:30,726 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 16:28:30,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 16:28:30,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:28:30,727 INFO L87 Difference]: Start difference. First operand 25672 states and 35622 transitions. Second operand 5 states. [2018-10-24 16:28:49,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:28:49,534 INFO L93 Difference]: Finished difference Result 70396 states and 95032 transitions. [2018-10-24 16:28:49,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 16:28:49,535 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 164 [2018-10-24 16:28:49,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:28:49,634 INFO L225 Difference]: With dead ends: 70396 [2018-10-24 16:28:49,634 INFO L226 Difference]: Without dead ends: 44726 [2018-10-24 16:28:49,670 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:28:49,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44726 states. [2018-10-24 16:28:50,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44726 to 35970. [2018-10-24 16:28:50,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35970 states. [2018-10-24 16:28:50,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35970 states to 35970 states and 48841 transitions. [2018-10-24 16:28:50,721 INFO L78 Accepts]: Start accepts. Automaton has 35970 states and 48841 transitions. Word has length 164 [2018-10-24 16:28:50,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:28:50,722 INFO L481 AbstractCegarLoop]: Abstraction has 35970 states and 48841 transitions. [2018-10-24 16:28:50,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 16:28:50,722 INFO L276 IsEmpty]: Start isEmpty. Operand 35970 states and 48841 transitions. [2018-10-24 16:28:50,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-10-24 16:28:50,726 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:28:50,726 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 16:28:50,726 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:28:50,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:28:50,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1467180770, now seen corresponding path program 1 times [2018-10-24 16:28:50,727 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:28:50,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:28:50,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:28:50,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:28:50,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:28:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:28:50,916 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:28:50,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:28:50,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:28:50,917 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 16:28:50,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 16:28:50,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:28:50,918 INFO L87 Difference]: Start difference. First operand 35970 states and 48841 transitions. Second operand 3 states. [2018-10-24 16:28:57,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:28:57,441 INFO L93 Difference]: Finished difference Result 99513 states and 135532 transitions. [2018-10-24 16:28:57,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 16:28:57,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2018-10-24 16:28:57,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:28:57,562 INFO L225 Difference]: With dead ends: 99513 [2018-10-24 16:28:57,563 INFO L226 Difference]: Without dead ends: 63545 [2018-10-24 16:28:57,610 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-24 16:28:57,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63545 states. [2018-10-24 16:28:58,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63545 to 63540. [2018-10-24 16:28:58,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63540 states. [2018-10-24 16:28:58,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63540 states to 63540 states and 81292 transitions. [2018-10-24 16:28:58,400 INFO L78 Accepts]: Start accepts. Automaton has 63540 states and 81292 transitions. Word has length 173 [2018-10-24 16:28:58,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:28:58,400 INFO L481 AbstractCegarLoop]: Abstraction has 63540 states and 81292 transitions. [2018-10-24 16:28:58,400 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 16:28:58,400 INFO L276 IsEmpty]: Start isEmpty. Operand 63540 states and 81292 transitions. [2018-10-24 16:28:58,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-10-24 16:28:58,409 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:28:58,410 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 16:28:58,410 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:28:58,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:28:58,410 INFO L82 PathProgramCache]: Analyzing trace with hash -861895457, now seen corresponding path program 1 times [2018-10-24 16:28:58,411 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:28:58,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:28:58,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:28:58,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:28:58,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:28:58,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:28:58,750 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-24 16:28:59,339 WARN L179 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 27 [2018-10-24 16:28:59,430 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-10-24 16:28:59,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:28:59,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:28:59,432 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 16:28:59,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 16:28:59,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:28:59,433 INFO L87 Difference]: Start difference. First operand 63540 states and 81292 transitions. Second operand 5 states. [2018-10-24 16:29:12,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:29:12,620 INFO L93 Difference]: Finished difference Result 131007 states and 166688 transitions. [2018-10-24 16:29:12,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 16:29:12,624 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 238 [2018-10-24 16:29:12,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:29:12,705 INFO L225 Difference]: With dead ends: 131007 [2018-10-24 16:29:12,705 INFO L226 Difference]: Without dead ends: 67469 [2018-10-24 16:29:12,752 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-24 16:29:12,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67469 states. [2018-10-24 16:29:14,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67469 to 67466. [2018-10-24 16:29:14,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67466 states. [2018-10-24 16:29:14,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67466 states to 67466 states and 79874 transitions. [2018-10-24 16:29:14,229 INFO L78 Accepts]: Start accepts. Automaton has 67466 states and 79874 transitions. Word has length 238 [2018-10-24 16:29:14,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:29:14,229 INFO L481 AbstractCegarLoop]: Abstraction has 67466 states and 79874 transitions. [2018-10-24 16:29:14,230 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 16:29:14,230 INFO L276 IsEmpty]: Start isEmpty. Operand 67466 states and 79874 transitions. [2018-10-24 16:29:14,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-10-24 16:29:14,238 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:29:14,239 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:29:14,239 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:29:14,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:29:14,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1508609838, now seen corresponding path program 1 times [2018-10-24 16:29:14,240 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:29:14,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:29:14,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:29:14,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:29:14,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:29:14,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:29:14,703 WARN L179 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-24 16:29:14,800 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:29:14,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:29:14,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:29:14,801 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:29:14,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:29:14,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:29:14,802 INFO L87 Difference]: Start difference. First operand 67466 states and 79874 transitions. Second operand 4 states. [2018-10-24 16:29:25,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:29:25,784 INFO L93 Difference]: Finished difference Result 182988 states and 217386 transitions. [2018-10-24 16:29:25,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:29:25,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 290 [2018-10-24 16:29:25,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:29:25,919 INFO L225 Difference]: With dead ends: 182988 [2018-10-24 16:29:25,919 INFO L226 Difference]: Without dead ends: 102868 [2018-10-24 16:29:25,979 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-24 16:29:26,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102868 states. [2018-10-24 16:29:27,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102868 to 93405. [2018-10-24 16:29:27,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93405 states. [2018-10-24 16:29:27,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93405 states to 93405 states and 105622 transitions. [2018-10-24 16:29:27,613 INFO L78 Accepts]: Start accepts. Automaton has 93405 states and 105622 transitions. Word has length 290 [2018-10-24 16:29:27,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:29:27,613 INFO L481 AbstractCegarLoop]: Abstraction has 93405 states and 105622 transitions. [2018-10-24 16:29:27,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:29:27,613 INFO L276 IsEmpty]: Start isEmpty. Operand 93405 states and 105622 transitions. [2018-10-24 16:29:27,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-10-24 16:29:27,620 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:29:27,620 INFO L375 BasicCegarLoop]: trace histogram [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, 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-24 16:29:27,621 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:29:27,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:29:27,621 INFO L82 PathProgramCache]: Analyzing trace with hash 940705466, now seen corresponding path program 1 times [2018-10-24 16:29:27,621 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:29:27,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:29:27,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:29:27,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:29:27,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:29:27,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:29:27,919 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 330 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-10-24 16:29:27,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:29:27,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:29:27,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 16:29:27,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 16:29:27,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:29:27,921 INFO L87 Difference]: Start difference. First operand 93405 states and 105622 transitions. Second operand 5 states. [2018-10-24 16:29:52,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:29:52,221 INFO L93 Difference]: Finished difference Result 278531 states and 314362 transitions. [2018-10-24 16:29:52,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 16:29:52,221 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 313 [2018-10-24 16:29:52,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:29:52,443 INFO L225 Difference]: With dead ends: 278531 [2018-10-24 16:29:52,443 INFO L226 Difference]: Without dead ends: 185916 [2018-10-24 16:29:52,503 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:29:52,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185916 states. [2018-10-24 16:29:53,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185916 to 177837. [2018-10-24 16:29:53,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177837 states. [2018-10-24 16:29:54,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177837 states to 177837 states and 197873 transitions. [2018-10-24 16:29:54,198 INFO L78 Accepts]: Start accepts. Automaton has 177837 states and 197873 transitions. Word has length 313 [2018-10-24 16:29:54,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:29:54,199 INFO L481 AbstractCegarLoop]: Abstraction has 177837 states and 197873 transitions. [2018-10-24 16:29:54,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 16:29:54,199 INFO L276 IsEmpty]: Start isEmpty. Operand 177837 states and 197873 transitions. [2018-10-24 16:29:54,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2018-10-24 16:29:54,209 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:29:54,209 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-10-24 16:29:54,210 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:29:54,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:29:54,210 INFO L82 PathProgramCache]: Analyzing trace with hash -696697732, now seen corresponding path program 1 times [2018-10-24 16:29:54,210 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:29:54,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:29:54,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:29:54,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:29:54,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:29:54,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:29:54,718 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-10-24 16:29:54,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:29:54,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:29:54,719 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:29:54,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:29:54,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:29:54,720 INFO L87 Difference]: Start difference. First operand 177837 states and 197873 transitions. Second operand 4 states. [2018-10-24 16:30:07,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:30:07,893 INFO L93 Difference]: Finished difference Result 401425 states and 447828 transitions. [2018-10-24 16:30:07,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:30:07,894 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 371 [2018-10-24 16:30:07,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:30:08,143 INFO L225 Difference]: With dead ends: 401425 [2018-10-24 16:30:08,143 INFO L226 Difference]: Without dead ends: 223589 [2018-10-24 16:30:08,246 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-24 16:30:08,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223589 states. [2018-10-24 16:30:11,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223589 to 219591. [2018-10-24 16:30:11,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219591 states. [2018-10-24 16:30:11,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219591 states to 219591 states and 238491 transitions. [2018-10-24 16:30:11,254 INFO L78 Accepts]: Start accepts. Automaton has 219591 states and 238491 transitions. Word has length 371 [2018-10-24 16:30:11,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:30:11,254 INFO L481 AbstractCegarLoop]: Abstraction has 219591 states and 238491 transitions. [2018-10-24 16:30:11,254 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:30:11,254 INFO L276 IsEmpty]: Start isEmpty. Operand 219591 states and 238491 transitions. [2018-10-24 16:30:11,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2018-10-24 16:30:11,259 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:30:11,259 INFO L375 BasicCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:30:11,260 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:30:11,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:30:11,260 INFO L82 PathProgramCache]: Analyzing trace with hash -128696857, now seen corresponding path program 1 times [2018-10-24 16:30:11,260 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:30:11,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:30:11,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:30:11,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:30:11,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:30:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:30:11,781 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2018-10-24 16:30:11,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:30:11,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:30:11,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:30:11,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:30:11,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:30:11,784 INFO L87 Difference]: Start difference. First operand 219591 states and 238491 transitions. Second operand 4 states. [2018-10-24 16:30:25,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:30:25,211 INFO L93 Difference]: Finished difference Result 477050 states and 518937 transitions. [2018-10-24 16:30:25,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:30:25,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 403 [2018-10-24 16:30:25,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:30:25,517 INFO L225 Difference]: With dead ends: 477050 [2018-10-24 16:30:25,517 INFO L226 Difference]: Without dead ends: 258249 [2018-10-24 16:30:25,595 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-24 16:30:25,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258249 states. [2018-10-24 16:30:34,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258249 to 255039. [2018-10-24 16:30:34,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255039 states. [2018-10-24 16:30:34,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255039 states to 255039 states and 272575 transitions. [2018-10-24 16:30:34,270 INFO L78 Accepts]: Start accepts. Automaton has 255039 states and 272575 transitions. Word has length 403 [2018-10-24 16:30:34,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:30:34,271 INFO L481 AbstractCegarLoop]: Abstraction has 255039 states and 272575 transitions. [2018-10-24 16:30:34,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:30:34,271 INFO L276 IsEmpty]: Start isEmpty. Operand 255039 states and 272575 transitions. [2018-10-24 16:30:34,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2018-10-24 16:30:34,277 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:30:34,277 INFO L375 BasicCegarLoop]: trace histogram [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, 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-24 16:30:34,277 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:30:34,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:30:34,278 INFO L82 PathProgramCache]: Analyzing trace with hash 333666565, now seen corresponding path program 1 times [2018-10-24 16:30:34,278 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:30:34,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:30:34,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:30:34,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:30:34,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:30:34,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:30:34,814 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 568 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2018-10-24 16:30:34,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:30:34,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:30:34,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:30:34,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:30:34,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:30:34,816 INFO L87 Difference]: Start difference. First operand 255039 states and 272575 transitions. Second operand 4 states. [2018-10-24 16:30:49,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:30:49,578 INFO L93 Difference]: Finished difference Result 503789 states and 538509 transitions. [2018-10-24 16:30:49,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:30:49,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 434 [2018-10-24 16:30:49,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:30:49,843 INFO L225 Difference]: With dead ends: 503789 [2018-10-24 16:30:49,843 INFO L226 Difference]: Without dead ends: 247959 [2018-10-24 16:30:49,936 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-24 16:30:50,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247959 states. [2018-10-24 16:30:52,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247959 to 236884. [2018-10-24 16:30:52,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236884 states. [2018-10-24 16:30:52,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236884 states to 236884 states and 247983 transitions. [2018-10-24 16:30:52,815 INFO L78 Accepts]: Start accepts. Automaton has 236884 states and 247983 transitions. Word has length 434 [2018-10-24 16:30:52,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:30:52,816 INFO L481 AbstractCegarLoop]: Abstraction has 236884 states and 247983 transitions. [2018-10-24 16:30:52,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:30:52,816 INFO L276 IsEmpty]: Start isEmpty. Operand 236884 states and 247983 transitions. [2018-10-24 16:30:52,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2018-10-24 16:30:52,821 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:30:52,822 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 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-10-24 16:30:52,822 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:30:52,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:30:52,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1677922735, now seen corresponding path program 1 times [2018-10-24 16:30:52,822 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:30:52,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:30:52,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:30:52,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:30:52,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:30:52,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:30:54,151 INFO L134 CoverageAnalysis]: Checked inductivity of 755 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2018-10-24 16:30:54,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:30:54,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:30:54,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 16:30:54,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 16:30:54,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:30:54,154 INFO L87 Difference]: Start difference. First operand 236884 states and 247983 transitions. Second operand 3 states. [2018-10-24 16:31:03,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:31:03,101 INFO L93 Difference]: Finished difference Result 467454 states and 489576 transitions. [2018-10-24 16:31:03,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 16:31:03,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 483 [2018-10-24 16:31:03,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:31:03,406 INFO L225 Difference]: With dead ends: 467454 [2018-10-24 16:31:03,407 INFO L226 Difference]: Without dead ends: 231360 [2018-10-24 16:31:03,503 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:31:03,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231360 states. [2018-10-24 16:31:06,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231360 to 225050. [2018-10-24 16:31:06,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225050 states. [2018-10-24 16:31:06,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225050 states to 225050 states and 233143 transitions. [2018-10-24 16:31:06,214 INFO L78 Accepts]: Start accepts. Automaton has 225050 states and 233143 transitions. Word has length 483 [2018-10-24 16:31:06,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:31:06,215 INFO L481 AbstractCegarLoop]: Abstraction has 225050 states and 233143 transitions. [2018-10-24 16:31:06,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 16:31:06,215 INFO L276 IsEmpty]: Start isEmpty. Operand 225050 states and 233143 transitions. [2018-10-24 16:31:06,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 649 [2018-10-24 16:31:06,233 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:31:06,233 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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] [2018-10-24 16:31:06,233 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:31:06,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:31:06,234 INFO L82 PathProgramCache]: Analyzing trace with hash -748852460, now seen corresponding path program 1 times [2018-10-24 16:31:06,234 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:31:06,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:31:06,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:31:06,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:31:06,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:31:06,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:31:06,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1237 backedges. 844 proven. 105 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-10-24 16:31:06,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:31:06,922 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 16:31:06,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:31:07,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:31:07,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2018-10-24 16:31:08,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1237 backedges. 844 proven. 0 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2018-10-24 16:31:08,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 16:31:08,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-24 16:31:08,215 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 16:31:08,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 16:31:08,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:31:08,215 INFO L87 Difference]: Start difference. First operand 225050 states and 233143 transitions. Second operand 5 states. [2018-10-24 16:31:08,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-24 16:31:08,217 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 16:31:08,223 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 16:31:08,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 04:31:08 BoogieIcfgContainer [2018-10-24 16:31:08,224 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 16:31:08,225 INFO L168 Benchmark]: Toolchain (without parser) took 233211.54 ms. Allocated memory was 1.5 GB in the beginning and 4.8 GB in the end (delta: 3.3 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -518.8 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2018-10-24 16:31:08,226 INFO L168 Benchmark]: CDTParser took 0.23 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-24 16:31:08,226 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2560.30 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-24 16:31:08,227 INFO L168 Benchmark]: Boogie Procedure Inliner took 860.29 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 833.6 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-24 16:31:08,228 INFO L168 Benchmark]: Boogie Preprocessor took 600.92 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: 82.5 MB). Peak memory consumption was 82.5 MB. Max. memory is 7.1 GB. [2018-10-24 16:31:08,229 INFO L168 Benchmark]: RCFGBuilder took 16033.30 ms. Allocated memory was 2.4 GB in the beginning and 2.6 GB in the end (delta: 233.3 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 21.7 MB). Peak memory consumption was 582.6 MB. Max. memory is 7.1 GB. [2018-10-24 16:31:08,230 INFO L168 Benchmark]: TraceAbstraction took 213151.54 ms. Allocated memory was 2.6 GB in the beginning and 4.8 GB in the end (delta: 2.2 GB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 154.3 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-10-24 16:31:08,235 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.23 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 2560.30 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 860.29 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 833.6 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 600.92 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: 82.5 MB). Peak memory consumption was 82.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 16033.30 ms. Allocated memory was 2.4 GB in the beginning and 2.6 GB in the end (delta: 233.3 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 21.7 MB). Peak memory consumption was 582.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 213151.54 ms. Allocated memory was 2.6 GB in the beginning and 4.8 GB in the end (delta: 2.2 GB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 154.3 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 150]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 150). Cancelled while BasicCegarLoop was constructing difference of abstraction (225050states) and FLOYD_HOARE automaton (currently 2 states, 5 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1099 locations, 1 error locations. TIMEOUT Result, 213.0s OverallTime, 14 OverallIterations, 6 TraceHistogramMax, 179.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10802 SDtfs, 28611 SDslu, 3113 SDs, 0 SdLazy, 60262 SolverSat, 16812 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 146.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 714 GetRequests, 670 SyntacticMatches, 13 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=255039occurred 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: 24.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 53518 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 4606 NumberOfCodeBlocks, 4606 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 4591 ConstructedInterpolants, 0 QuantifiedInterpolants, 3882253 SizeOfPredicates, 0 NumberOfNonLiveVariables, 832 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 5877/5982 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown