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/Problem18_label20_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 14:37:52,065 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 14:37:52,067 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 14:37:52,079 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 14:37:52,079 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 14:37:52,080 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 14:37:52,081 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 14:37:52,083 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 14:37:52,085 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 14:37:52,086 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 14:37:52,087 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 14:37:52,087 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 14:37:52,088 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 14:37:52,089 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 14:37:52,090 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 14:37:52,091 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 14:37:52,092 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 14:37:52,094 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 14:37:52,096 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 14:37:52,098 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 14:37:52,100 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 14:37:52,102 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 14:37:52,107 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 14:37:52,107 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 14:37:52,108 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 14:37:52,110 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 14:37:52,111 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 14:37:52,112 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 14:37:52,116 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 14:37:52,117 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 14:37:52,117 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 14:37:52,120 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 14:37:52,120 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 14:37:52,120 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 14:37:52,123 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 14:37:52,124 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 14:37:52,124 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 14:37:52,153 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 14:37:52,154 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 14:37:52,155 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 14:37:52,155 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 14:37:52,158 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 14:37:52,159 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 14:37:52,159 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 14:37:52,160 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 14:37:52,160 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 14:37:52,160 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 14:37:52,160 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 14:37:52,160 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 14:37:52,161 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 14:37:52,161 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 14:37:52,161 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 14:37:52,162 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 14:37:52,162 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 14:37:52,162 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 14:37:52,162 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 14:37:52,162 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:37:52,163 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 14:37:52,164 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 14:37:52,164 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 14:37:52,164 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 14:37:52,164 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 14:37:52,165 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 14:37:52,165 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 14:37:52,165 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 14:37:52,233 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 14:37:52,250 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 14:37:52,254 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 14:37:52,256 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 14:37:52,257 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 14:37:52,257 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem18_label20_false-unreach-call.c [2018-10-24 14:37:52,324 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/41001331f/d08625aa9ca649eaaf40744eca406aff/FLAG88970704d [2018-10-24 14:37:53,054 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 14:37:53,055 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem18_label20_false-unreach-call.c [2018-10-24 14:37:53,083 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/41001331f/d08625aa9ca649eaaf40744eca406aff/FLAG88970704d [2018-10-24 14:37:53,108 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/41001331f/d08625aa9ca649eaaf40744eca406aff [2018-10-24 14:37:53,121 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 14:37:53,123 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 14:37:53,124 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 14:37:53,125 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 14:37:53,130 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 14:37:53,131 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:37:53" (1/1) ... [2018-10-24 14:37:53,134 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61584996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:37:53, skipping insertion in model container [2018-10-24 14:37:53,135 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:37:53" (1/1) ... [2018-10-24 14:37:53,146 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 14:37:53,302 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 14:37:54,350 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:37:54,356 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 14:37:54,821 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:37:54,854 INFO L193 MainTranslator]: Completed translation [2018-10-24 14:37:54,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:37:54 WrapperNode [2018-10-24 14:37:54,855 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 14:37:54,856 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 14:37:54,856 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 14:37:54,856 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 14:37:54,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:37:54" (1/1) ... [2018-10-24 14:37:54,930 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:37:54" (1/1) ... [2018-10-24 14:37:55,342 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 14:37:55,343 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 14:37:55,343 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 14:37:55,343 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 14:37:55,354 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:37:54" (1/1) ... [2018-10-24 14:37:55,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:37:54" (1/1) ... [2018-10-24 14:37:55,379 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:37:54" (1/1) ... [2018-10-24 14:37:55,379 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:37:54" (1/1) ... [2018-10-24 14:37:55,471 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:37:54" (1/1) ... [2018-10-24 14:37:55,501 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:37:54" (1/1) ... [2018-10-24 14:37:55,527 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:37:54" (1/1) ... [2018-10-24 14:37:55,569 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 14:37:55,570 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 14:37:55,570 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 14:37:55,570 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 14:37:55,571 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:37:54" (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 14:37:55,641 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 14:37:55,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 14:37:55,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 14:38:02,916 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 14:38:02,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:38:02 BoogieIcfgContainer [2018-10-24 14:38:02,917 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 14:38:02,918 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 14:38:02,919 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 14:38:02,922 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 14:38:02,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:37:53" (1/3) ... [2018-10-24 14:38:02,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b8f3bae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:38:02, skipping insertion in model container [2018-10-24 14:38:02,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:37:54" (2/3) ... [2018-10-24 14:38:02,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b8f3bae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:38:02, skipping insertion in model container [2018-10-24 14:38:02,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:38:02" (3/3) ... [2018-10-24 14:38:02,927 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem18_label20_false-unreach-call.c [2018-10-24 14:38:02,939 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 14:38:02,961 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 14:38:02,982 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 14:38:03,049 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 14:38:03,050 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 14:38:03,050 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 14:38:03,050 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 14:38:03,050 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 14:38:03,050 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 14:38:03,051 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 14:38:03,051 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 14:38:03,051 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 14:38:03,096 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states. [2018-10-24 14:38:03,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-24 14:38:03,105 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:38:03,106 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:38:03,108 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:38:03,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:38:03,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1805984234, now seen corresponding path program 1 times [2018-10-24 14:38:03,118 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:38:03,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:38:03,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:38:03,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:38:03,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:38:03,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:38:03,320 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 14:38:03,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:38:03,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:38:03,328 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:38:03,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:38:03,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:38:03,348 INFO L87 Difference]: Start difference. First operand 758 states. Second operand 3 states. [2018-10-24 14:38:09,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:38:09,368 INFO L93 Difference]: Finished difference Result 2208 states and 4269 transitions. [2018-10-24 14:38:09,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:38:09,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-10-24 14:38:09,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:38:09,402 INFO L225 Difference]: With dead ends: 2208 [2018-10-24 14:38:09,402 INFO L226 Difference]: Without dead ends: 1446 [2018-10-24 14:38:09,410 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 14:38:09,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2018-10-24 14:38:09,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 1446. [2018-10-24 14:38:09,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1446 states. [2018-10-24 14:38:09,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1446 states and 2407 transitions. [2018-10-24 14:38:09,560 INFO L78 Accepts]: Start accepts. Automaton has 1446 states and 2407 transitions. Word has length 7 [2018-10-24 14:38:09,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:38:09,561 INFO L481 AbstractCegarLoop]: Abstraction has 1446 states and 2407 transitions. [2018-10-24 14:38:09,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:38:09,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1446 states and 2407 transitions. [2018-10-24 14:38:09,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-24 14:38:09,566 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:38:09,566 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:38:09,567 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:38:09,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:38:09,567 INFO L82 PathProgramCache]: Analyzing trace with hash 505888033, now seen corresponding path program 1 times [2018-10-24 14:38:09,567 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:38:09,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:38:09,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:38:09,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:38:09,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:38:09,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:38:09,827 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:38:09,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:38:09,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:38:09,830 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:38:09,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:38:09,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:38:09,831 INFO L87 Difference]: Start difference. First operand 1446 states and 2407 transitions. Second operand 4 states. [2018-10-24 14:38:18,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:38:18,249 INFO L93 Difference]: Finished difference Result 4272 states and 7156 transitions. [2018-10-24 14:38:18,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:38:18,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2018-10-24 14:38:18,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:38:18,265 INFO L225 Difference]: With dead ends: 4272 [2018-10-24 14:38:18,266 INFO L226 Difference]: Without dead ends: 2828 [2018-10-24 14:38:18,268 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 14:38:18,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2828 states. [2018-10-24 14:38:18,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2828 to 2828. [2018-10-24 14:38:18,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2828 states. [2018-10-24 14:38:18,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 4067 transitions. [2018-10-24 14:38:18,332 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 4067 transitions. Word has length 74 [2018-10-24 14:38:18,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:38:18,332 INFO L481 AbstractCegarLoop]: Abstraction has 2828 states and 4067 transitions. [2018-10-24 14:38:18,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:38:18,333 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 4067 transitions. [2018-10-24 14:38:18,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-24 14:38:18,335 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:38:18,335 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 14:38:18,336 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:38:18,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:38:18,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1577686302, now seen corresponding path program 1 times [2018-10-24 14:38:18,336 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:38:18,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:38:18,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:38:18,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:38:18,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:38:18,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:38:18,524 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:38:18,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:38:18,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:38:18,526 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:38:18,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:38:18,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:38:18,526 INFO L87 Difference]: Start difference. First operand 2828 states and 4067 transitions. Second operand 4 states. [2018-10-24 14:38:27,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:38:27,195 INFO L93 Difference]: Finished difference Result 11199 states and 16156 transitions. [2018-10-24 14:38:27,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:38:27,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2018-10-24 14:38:27,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:38:27,234 INFO L225 Difference]: With dead ends: 11199 [2018-10-24 14:38:27,235 INFO L226 Difference]: Without dead ends: 8373 [2018-10-24 14:38:27,240 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 14:38:27,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8373 states. [2018-10-24 14:38:27,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8373 to 5592. [2018-10-24 14:38:27,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5592 states. [2018-10-24 14:38:27,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5592 states to 5592 states and 7213 transitions. [2018-10-24 14:38:27,367 INFO L78 Accepts]: Start accepts. Automaton has 5592 states and 7213 transitions. Word has length 75 [2018-10-24 14:38:27,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:38:27,368 INFO L481 AbstractCegarLoop]: Abstraction has 5592 states and 7213 transitions. [2018-10-24 14:38:27,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:38:27,368 INFO L276 IsEmpty]: Start isEmpty. Operand 5592 states and 7213 transitions. [2018-10-24 14:38:27,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-10-24 14:38:27,371 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:38:27,372 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 14:38:27,372 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:38:27,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:38:27,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1673457249, now seen corresponding path program 1 times [2018-10-24 14:38:27,373 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:38:27,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:38:27,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:38:27,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:38:27,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:38:27,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:38:27,562 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:38:27,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:38:27,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:38:27,564 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:38:27,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:38:27,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:38:27,566 INFO L87 Difference]: Start difference. First operand 5592 states and 7213 transitions. Second operand 3 states. [2018-10-24 14:38:31,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:38:31,780 INFO L93 Difference]: Finished difference Result 13946 states and 18308 transitions. [2018-10-24 14:38:31,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:38:31,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2018-10-24 14:38:31,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:38:31,809 INFO L225 Difference]: With dead ends: 13946 [2018-10-24 14:38:31,809 INFO L226 Difference]: Without dead ends: 6954 [2018-10-24 14:38:31,819 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 14:38:31,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6954 states. [2018-10-24 14:38:31,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6954 to 6954. [2018-10-24 14:38:31,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6954 states. [2018-10-24 14:38:31,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6954 states to 6954 states and 7786 transitions. [2018-10-24 14:38:31,925 INFO L78 Accepts]: Start accepts. Automaton has 6954 states and 7786 transitions. Word has length 101 [2018-10-24 14:38:31,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:38:31,926 INFO L481 AbstractCegarLoop]: Abstraction has 6954 states and 7786 transitions. [2018-10-24 14:38:31,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:38:31,926 INFO L276 IsEmpty]: Start isEmpty. Operand 6954 states and 7786 transitions. [2018-10-24 14:38:31,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-10-24 14:38:31,942 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:38:31,942 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:38:31,942 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:38:31,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:38:31,943 INFO L82 PathProgramCache]: Analyzing trace with hash 919243734, now seen corresponding path program 1 times [2018-10-24 14:38:31,943 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:38:31,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:38:31,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:38:31,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:38:31,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:38:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:38:32,526 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2018-10-24 14:38:32,913 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-10-24 14:38:32,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:38:32,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:38:32,914 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:38:32,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:38:32,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:38:32,915 INFO L87 Difference]: Start difference. First operand 6954 states and 7786 transitions. Second operand 5 states. [2018-10-24 14:38:38,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:38:38,141 INFO L93 Difference]: Finished difference Result 18052 states and 19938 transitions. [2018-10-24 14:38:38,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:38:38,142 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 297 [2018-10-24 14:38:38,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:38:38,178 INFO L225 Difference]: With dead ends: 18052 [2018-10-24 14:38:38,179 INFO L226 Difference]: Without dead ends: 11100 [2018-10-24 14:38:38,187 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-24 14:38:38,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11100 states. [2018-10-24 14:38:38,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11100 to 10409. [2018-10-24 14:38:38,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10409 states. [2018-10-24 14:38:38,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10409 states to 10409 states and 11327 transitions. [2018-10-24 14:38:38,318 INFO L78 Accepts]: Start accepts. Automaton has 10409 states and 11327 transitions. Word has length 297 [2018-10-24 14:38:38,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:38:38,319 INFO L481 AbstractCegarLoop]: Abstraction has 10409 states and 11327 transitions. [2018-10-24 14:38:38,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:38:38,319 INFO L276 IsEmpty]: Start isEmpty. Operand 10409 states and 11327 transitions. [2018-10-24 14:38:38,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2018-10-24 14:38:38,327 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:38:38,327 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:38:38,328 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:38:38,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:38:38,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1159475061, now seen corresponding path program 1 times [2018-10-24 14:38:38,328 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:38:38,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:38:38,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:38:38,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:38:38,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:38:38,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:38:39,077 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-10-24 14:38:39,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:38:39,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:38:39,079 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:38:39,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:38:39,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:38:39,081 INFO L87 Difference]: Start difference. First operand 10409 states and 11327 transitions. Second operand 4 states. [2018-10-24 14:38:44,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:38:44,759 INFO L93 Difference]: Finished difference Result 29118 states and 32296 transitions. [2018-10-24 14:38:44,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:38:44,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 448 [2018-10-24 14:38:44,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:38:44,800 INFO L225 Difference]: With dead ends: 29118 [2018-10-24 14:38:44,800 INFO L226 Difference]: Without dead ends: 18711 [2018-10-24 14:38:44,814 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-24 14:38:44,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18711 states. [2018-10-24 14:38:45,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18711 to 18711. [2018-10-24 14:38:45,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18711 states. [2018-10-24 14:38:45,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18711 states to 18711 states and 20180 transitions. [2018-10-24 14:38:45,025 INFO L78 Accepts]: Start accepts. Automaton has 18711 states and 20180 transitions. Word has length 448 [2018-10-24 14:38:45,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:38:45,026 INFO L481 AbstractCegarLoop]: Abstraction has 18711 states and 20180 transitions. [2018-10-24 14:38:45,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:38:45,026 INFO L276 IsEmpty]: Start isEmpty. Operand 18711 states and 20180 transitions. [2018-10-24 14:38:45,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2018-10-24 14:38:45,034 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:38:45,035 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:38:45,035 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:38:45,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:38:45,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1413876210, now seen corresponding path program 1 times [2018-10-24 14:38:45,036 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:38:45,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:38:45,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:38:45,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:38:45,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:38:45,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:38:45,633 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2018-10-24 14:38:45,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:38:45,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:38:45,634 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:38:45,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:38:45,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:38:45,635 INFO L87 Difference]: Start difference. First operand 18711 states and 20180 transitions. Second operand 3 states. [2018-10-24 14:38:48,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:38:48,849 INFO L93 Difference]: Finished difference Result 37420 states and 40358 transitions. [2018-10-24 14:38:48,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:38:48,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 462 [2018-10-24 14:38:48,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:38:48,882 INFO L225 Difference]: With dead ends: 37420 [2018-10-24 14:38:48,882 INFO L226 Difference]: Without dead ends: 18711 [2018-10-24 14:38:48,899 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 14:38:48,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18711 states. [2018-10-24 14:38:49,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18711 to 18711. [2018-10-24 14:38:49,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18711 states. [2018-10-24 14:38:49,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18711 states to 18711 states and 19905 transitions. [2018-10-24 14:38:49,112 INFO L78 Accepts]: Start accepts. Automaton has 18711 states and 19905 transitions. Word has length 462 [2018-10-24 14:38:49,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:38:49,113 INFO L481 AbstractCegarLoop]: Abstraction has 18711 states and 19905 transitions. [2018-10-24 14:38:49,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:38:49,114 INFO L276 IsEmpty]: Start isEmpty. Operand 18711 states and 19905 transitions. [2018-10-24 14:38:49,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2018-10-24 14:38:49,129 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:38:49,129 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:38:49,130 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:38:49,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:38:49,130 INFO L82 PathProgramCache]: Analyzing trace with hash 23742777, now seen corresponding path program 1 times [2018-10-24 14:38:49,130 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:38:49,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:38:49,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:38:49,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:38:49,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:38:49,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:38:49,762 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2018-10-24 14:38:49,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:38:49,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:38:49,764 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:38:49,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:38:49,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:38:49,765 INFO L87 Difference]: Start difference. First operand 18711 states and 19905 transitions. Second operand 4 states. [2018-10-24 14:38:55,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:38:55,612 INFO L93 Difference]: Finished difference Result 42948 states and 46045 transitions. [2018-10-24 14:38:55,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:38:55,613 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 553 [2018-10-24 14:38:55,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:38:55,643 INFO L225 Difference]: With dead ends: 42948 [2018-10-24 14:38:55,643 INFO L226 Difference]: Without dead ends: 22842 [2018-10-24 14:38:55,658 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 2 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 14:38:55,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22842 states. [2018-10-24 14:38:55,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22842 to 22842. [2018-10-24 14:38:55,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22842 states. [2018-10-24 14:38:55,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22842 states to 22842 states and 24149 transitions. [2018-10-24 14:38:55,896 INFO L78 Accepts]: Start accepts. Automaton has 22842 states and 24149 transitions. Word has length 553 [2018-10-24 14:38:55,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:38:55,897 INFO L481 AbstractCegarLoop]: Abstraction has 22842 states and 24149 transitions. [2018-10-24 14:38:55,897 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:38:55,897 INFO L276 IsEmpty]: Start isEmpty. Operand 22842 states and 24149 transitions. [2018-10-24 14:38:55,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2018-10-24 14:38:55,928 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:38:55,928 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:38:55,929 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:38:55,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:38:55,929 INFO L82 PathProgramCache]: Analyzing trace with hash 274201586, now seen corresponding path program 1 times [2018-10-24 14:38:55,929 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:38:55,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:38:55,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:38:55,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:38:55,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:38:56,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:38:56,805 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 645 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2018-10-24 14:38:56,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:38:56,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:38:56,807 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:38:56,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:38:56,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:38:56,807 INFO L87 Difference]: Start difference. First operand 22842 states and 24149 transitions. Second operand 4 states. [2018-10-24 14:39:02,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:39:02,196 INFO L93 Difference]: Finished difference Result 79536 states and 84371 transitions. [2018-10-24 14:39:02,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:39:02,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 687 [2018-10-24 14:39:02,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:39:02,258 INFO L225 Difference]: With dead ends: 79536 [2018-10-24 14:39:02,258 INFO L226 Difference]: Without dead ends: 56696 [2018-10-24 14:39:02,278 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 14:39:02,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56696 states. [2018-10-24 14:39:02,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56696 to 51859. [2018-10-24 14:39:02,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51859 states. [2018-10-24 14:39:02,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51859 states to 51859 states and 54507 transitions. [2018-10-24 14:39:02,866 INFO L78 Accepts]: Start accepts. Automaton has 51859 states and 54507 transitions. Word has length 687 [2018-10-24 14:39:02,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:39:02,867 INFO L481 AbstractCegarLoop]: Abstraction has 51859 states and 54507 transitions. [2018-10-24 14:39:02,867 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:39:02,867 INFO L276 IsEmpty]: Start isEmpty. Operand 51859 states and 54507 transitions. [2018-10-24 14:39:02,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1205 [2018-10-24 14:39:02,891 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:39:02,892 INFO L375 BasicCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:39:02,893 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:39:02,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:39:02,893 INFO L82 PathProgramCache]: Analyzing trace with hash 365350073, now seen corresponding path program 1 times [2018-10-24 14:39:02,894 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:39:02,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:39:02,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:39:02,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:39:02,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:39:03,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:39:04,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 985 proven. 0 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2018-10-24 14:39:04,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:39:04,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:39:04,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:39:04,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:39:04,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:39:04,274 INFO L87 Difference]: Start difference. First operand 51859 states and 54507 transitions. Second operand 4 states. [2018-10-24 14:39:09,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:39:09,937 INFO L93 Difference]: Finished difference Result 136186 states and 143459 transitions. [2018-10-24 14:39:09,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:39:09,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1204 [2018-10-24 14:39:09,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:39:10,094 INFO L225 Difference]: With dead ends: 136186 [2018-10-24 14:39:10,094 INFO L226 Difference]: Without dead ends: 80868 [2018-10-24 14:39:10,161 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-24 14:39:10,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80868 states. [2018-10-24 14:39:11,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80868 to 76722. [2018-10-24 14:39:11,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76722 states. [2018-10-24 14:39:11,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76722 states to 76722 states and 80334 transitions. [2018-10-24 14:39:11,392 INFO L78 Accepts]: Start accepts. Automaton has 76722 states and 80334 transitions. Word has length 1204 [2018-10-24 14:39:11,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:39:11,393 INFO L481 AbstractCegarLoop]: Abstraction has 76722 states and 80334 transitions. [2018-10-24 14:39:11,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:39:11,393 INFO L276 IsEmpty]: Start isEmpty. Operand 76722 states and 80334 transitions. [2018-10-24 14:39:11,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1458 [2018-10-24 14:39:11,454 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:39:11,455 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:39:11,456 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:39:11,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:39:11,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1239221228, now seen corresponding path program 1 times [2018-10-24 14:39:11,456 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:39:11,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:39:11,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:39:11,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:39:11,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:39:11,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:39:14,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1914 backedges. 962 proven. 0 refuted. 0 times theorem prover too weak. 952 trivial. 0 not checked. [2018-10-24 14:39:14,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:39:14,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:39:14,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:39:14,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:39:14,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:39:14,278 INFO L87 Difference]: Start difference. First operand 76722 states and 80334 transitions. Second operand 4 states. [2018-10-24 14:39:19,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:39:19,161 INFO L93 Difference]: Finished difference Result 160351 states and 167750 transitions. [2018-10-24 14:39:19,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:39:19,162 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1457 [2018-10-24 14:39:19,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:39:19,280 INFO L225 Difference]: With dead ends: 160351 [2018-10-24 14:39:19,281 INFO L226 Difference]: Without dead ends: 84322 [2018-10-24 14:39:19,343 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 14:39:19,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84322 states. [2018-10-24 14:39:20,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84322 to 80867. [2018-10-24 14:39:20,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80867 states. [2018-10-24 14:39:20,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80867 states to 80867 states and 83942 transitions. [2018-10-24 14:39:20,116 INFO L78 Accepts]: Start accepts. Automaton has 80867 states and 83942 transitions. Word has length 1457 [2018-10-24 14:39:20,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:39:20,117 INFO L481 AbstractCegarLoop]: Abstraction has 80867 states and 83942 transitions. [2018-10-24 14:39:20,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:39:20,117 INFO L276 IsEmpty]: Start isEmpty. Operand 80867 states and 83942 transitions. [2018-10-24 14:39:20,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1747 [2018-10-24 14:39:20,176 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:39:20,177 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2018-10-24 14:39:20,178 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:39:20,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:39:20,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1958475503, now seen corresponding path program 1 times [2018-10-24 14:39:20,178 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:39:20,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:39:20,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:39:20,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:39:20,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:39:20,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:39:22,251 WARN L179 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 10 [2018-10-24 14:39:27,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2884 backedges. 1526 proven. 1265 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-10-24 14:39:27,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:39:27,418 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 14:39:27,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:39:27,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:39:27,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:39:29,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2884 backedges. 2082 proven. 0 refuted. 0 times theorem prover too weak. 802 trivial. 0 not checked. [2018-10-24 14:39:29,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:39:29,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2018-10-24 14:39:29,392 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-24 14:39:29,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-24 14:39:29,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-10-24 14:39:29,393 INFO L87 Difference]: Start difference. First operand 80867 states and 83942 transitions. Second operand 12 states. [2018-10-24 14:39:51,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:39:51,655 INFO L93 Difference]: Finished difference Result 223855 states and 232890 transitions. [2018-10-24 14:39:51,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-24 14:39:51,656 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 1746 [2018-10-24 14:39:51,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:39:51,986 INFO L225 Difference]: With dead ends: 223855 [2018-10-24 14:39:51,986 INFO L226 Difference]: Without dead ends: 143681 [2018-10-24 14:39:52,044 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1789 GetRequests, 1759 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=241, Invalid=629, Unknown=0, NotChecked=0, Total=870 [2018-10-24 14:39:52,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143681 states. [2018-10-24 14:39:53,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143681 to 102288. [2018-10-24 14:39:53,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102288 states. [2018-10-24 14:39:53,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102288 states to 102288 states and 105922 transitions. [2018-10-24 14:39:53,735 INFO L78 Accepts]: Start accepts. Automaton has 102288 states and 105922 transitions. Word has length 1746 [2018-10-24 14:39:53,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:39:53,736 INFO L481 AbstractCegarLoop]: Abstraction has 102288 states and 105922 transitions. [2018-10-24 14:39:53,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-24 14:39:53,737 INFO L276 IsEmpty]: Start isEmpty. Operand 102288 states and 105922 transitions. [2018-10-24 14:39:53,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1766 [2018-10-24 14:39:53,855 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:39:53,856 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:39:53,856 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:39:53,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:39:53,857 INFO L82 PathProgramCache]: Analyzing trace with hash 414234111, now seen corresponding path program 1 times [2018-10-24 14:39:53,857 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:39:53,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:39:53,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:39:53,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:39:53,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:39:54,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:39:55,234 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-24 14:39:55,513 WARN L179 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 10 [2018-10-24 14:40:00,096 INFO L134 CoverageAnalysis]: Checked inductivity of 3083 backedges. 572 proven. 2041 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2018-10-24 14:40:00,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:40:00,096 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 14:40:00,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:40:00,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:40:00,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:40:02,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3083 backedges. 1800 proven. 0 refuted. 0 times theorem prover too weak. 1283 trivial. 0 not checked. [2018-10-24 14:40:02,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:40:02,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2018-10-24 14:40:02,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-24 14:40:02,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-24 14:40:02,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-10-24 14:40:02,880 INFO L87 Difference]: Start difference. First operand 102288 states and 105922 transitions. Second operand 12 states. [2018-10-24 14:40:20,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:40:20,163 INFO L93 Difference]: Finished difference Result 240429 states and 248876 transitions. [2018-10-24 14:40:20,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-24 14:40:20,163 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 1765 [2018-10-24 14:40:20,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:40:20,325 INFO L225 Difference]: With dead ends: 240429 [2018-10-24 14:40:20,325 INFO L226 Difference]: Without dead ends: 138834 [2018-10-24 14:40:20,391 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1808 GetRequests, 1778 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=224, Invalid=646, Unknown=0, NotChecked=0, Total=870 [2018-10-24 14:40:20,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138834 states. [2018-10-24 14:40:21,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138834 to 96758. [2018-10-24 14:40:21,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96758 states. [2018-10-24 14:40:21,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96758 states to 96758 states and 99129 transitions. [2018-10-24 14:40:21,388 INFO L78 Accepts]: Start accepts. Automaton has 96758 states and 99129 transitions. Word has length 1765 [2018-10-24 14:40:21,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:40:21,389 INFO L481 AbstractCegarLoop]: Abstraction has 96758 states and 99129 transitions. [2018-10-24 14:40:21,389 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-24 14:40:21,389 INFO L276 IsEmpty]: Start isEmpty. Operand 96758 states and 99129 transitions. [2018-10-24 14:40:21,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1923 [2018-10-24 14:40:21,458 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:40:21,459 INFO L375 BasicCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:40:21,459 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:40:21,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:40:21,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1825768677, now seen corresponding path program 1 times [2018-10-24 14:40:21,460 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:40:21,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:40:21,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:40:21,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:40:21,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:40:21,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:40:24,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2600 backedges. 1869 proven. 0 refuted. 0 times theorem prover too weak. 731 trivial. 0 not checked. [2018-10-24 14:40:24,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:40:24,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:40:24,068 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:40:24,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:40:24,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:40:24,068 INFO L87 Difference]: Start difference. First operand 96758 states and 99129 transitions. Second operand 4 states. [2018-10-24 14:40:28,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:40:28,428 INFO L93 Difference]: Finished difference Result 196278 states and 201140 transitions. [2018-10-24 14:40:28,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:40:28,429 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1922 [2018-10-24 14:40:28,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:40:28,547 INFO L225 Difference]: With dead ends: 196278 [2018-10-24 14:40:28,547 INFO L226 Difference]: Without dead ends: 100213 [2018-10-24 14:40:28,601 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-24 14:40:28,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100213 states. [2018-10-24 14:40:29,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100213 to 98831. [2018-10-24 14:40:29,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98831 states. [2018-10-24 14:40:29,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98831 states to 98831 states and 100964 transitions. [2018-10-24 14:40:29,626 INFO L78 Accepts]: Start accepts. Automaton has 98831 states and 100964 transitions. Word has length 1922 [2018-10-24 14:40:29,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:40:29,627 INFO L481 AbstractCegarLoop]: Abstraction has 98831 states and 100964 transitions. [2018-10-24 14:40:29,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:40:29,627 INFO L276 IsEmpty]: Start isEmpty. Operand 98831 states and 100964 transitions. [2018-10-24 14:40:29,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1959 [2018-10-24 14:40:29,709 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:40:29,710 INFO L375 BasicCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:40:29,711 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:40:29,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:40:29,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1581206069, now seen corresponding path program 1 times [2018-10-24 14:40:29,712 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:40:29,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:40:29,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:40:29,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:40:29,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:40:29,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:40:32,759 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 2022 proven. 0 refuted. 0 times theorem prover too weak. 478 trivial. 0 not checked. [2018-10-24 14:40:32,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:40:32,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:40:32,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:40:32,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:40:32,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:40:32,762 INFO L87 Difference]: Start difference. First operand 98831 states and 100964 transitions. Second operand 4 states. [2018-10-24 14:40:37,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:40:37,925 INFO L93 Difference]: Finished difference Result 225300 states and 230447 transitions. [2018-10-24 14:40:37,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:40:37,925 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1958 [2018-10-24 14:40:37,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:40:38,080 INFO L225 Difference]: With dead ends: 225300 [2018-10-24 14:40:38,080 INFO L226 Difference]: Without dead ends: 127162 [2018-10-24 14:40:38,144 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-24 14:40:38,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127162 states. [2018-10-24 14:40:39,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127162 to 123015. [2018-10-24 14:40:39,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123015 states. [2018-10-24 14:40:39,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123015 states to 123015 states and 125490 transitions. [2018-10-24 14:40:39,480 INFO L78 Accepts]: Start accepts. Automaton has 123015 states and 125490 transitions. Word has length 1958 [2018-10-24 14:40:39,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:40:39,481 INFO L481 AbstractCegarLoop]: Abstraction has 123015 states and 125490 transitions. [2018-10-24 14:40:39,481 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:40:39,481 INFO L276 IsEmpty]: Start isEmpty. Operand 123015 states and 125490 transitions. [2018-10-24 14:40:39,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2100 [2018-10-24 14:40:39,568 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:40:39,569 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:40:39,569 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:40:39,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:40:39,570 INFO L82 PathProgramCache]: Analyzing trace with hash -503014631, now seen corresponding path program 1 times [2018-10-24 14:40:39,570 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:40:39,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:40:39,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:40:39,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:40:39,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:40:39,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:40:42,951 INFO L134 CoverageAnalysis]: Checked inductivity of 3111 backedges. 2249 proven. 0 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2018-10-24 14:40:42,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:40:42,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:40:42,953 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:40:42,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:40:42,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:40:42,954 INFO L87 Difference]: Start difference. First operand 123015 states and 125490 transitions. Second operand 3 states. [2018-10-24 14:40:46,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:40:46,071 INFO L93 Difference]: Finished difference Result 246719 states and 251679 transitions. [2018-10-24 14:40:46,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:40:46,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2099 [2018-10-24 14:40:46,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:40:46,184 INFO L225 Difference]: With dead ends: 246719 [2018-10-24 14:40:46,184 INFO L226 Difference]: Without dead ends: 124397 [2018-10-24 14:40:46,241 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 14:40:46,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124397 states. [2018-10-24 14:40:47,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124397 to 124397. [2018-10-24 14:40:47,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124397 states. [2018-10-24 14:40:47,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124397 states to 124397 states and 126877 transitions. [2018-10-24 14:40:47,832 INFO L78 Accepts]: Start accepts. Automaton has 124397 states and 126877 transitions. Word has length 2099 [2018-10-24 14:40:47,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:40:47,833 INFO L481 AbstractCegarLoop]: Abstraction has 124397 states and 126877 transitions. [2018-10-24 14:40:47,833 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:40:47,833 INFO L276 IsEmpty]: Start isEmpty. Operand 124397 states and 126877 transitions. [2018-10-24 14:40:47,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2120 [2018-10-24 14:40:47,918 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:40:47,919 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:40:47,919 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:40:47,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:40:47,920 INFO L82 PathProgramCache]: Analyzing trace with hash -2069281888, now seen corresponding path program 1 times [2018-10-24 14:40:47,920 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:40:47,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:40:47,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:40:47,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:40:47,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:40:48,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:40:52,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 2462 proven. 216 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2018-10-24 14:40:52,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:40:52,535 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 14:40:52,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:40:52,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:40:53,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:40:53,351 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 21 [2018-10-24 14:40:58,436 WARN L179 SmtUtils]: Spent 4.46 s on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2018-10-24 14:41:27,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 2462 proven. 216 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2018-10-24 14:41:27,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 14:41:27,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2018-10-24 14:41:27,931 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-24 14:41:27,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-24 14:41:27,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-10-24 14:41:27,932 INFO L87 Difference]: Start difference. First operand 124397 states and 126877 transitions. Second operand 9 states. [2018-10-24 14:41:38,975 WARN L179 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 61 DAG size of output: 59 Received shutdown request... [2018-10-24 14:41:40,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-24 14:41:40,619 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 14:41:40,625 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 14:41:40,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:41:40 BoogieIcfgContainer [2018-10-24 14:41:40,626 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 14:41:40,627 INFO L168 Benchmark]: Toolchain (without parser) took 227504.61 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 249.9 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2018-10-24 14:41:40,628 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 14:41:40,629 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1731.08 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 148.0 MB). Peak memory consumption was 148.0 MB. Max. memory is 7.1 GB. [2018-10-24 14:41:40,629 INFO L168 Benchmark]: Boogie Procedure Inliner took 486.60 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 776.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -938.1 MB). Peak memory consumption was 45.0 MB. Max. memory is 7.1 GB. [2018-10-24 14:41:40,630 INFO L168 Benchmark]: Boogie Preprocessor took 226.48 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 7.1 GB. [2018-10-24 14:41:40,631 INFO L168 Benchmark]: RCFGBuilder took 7347.42 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 541.6 MB). Peak memory consumption was 541.6 MB. Max. memory is 7.1 GB. [2018-10-24 14:41:40,632 INFO L168 Benchmark]: TraceAbstraction took 217707.54 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.7 GB). Free memory was 1.6 GB in the beginning and 1.2 GB in the end (delta: 469.8 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-10-24 14:41:40,636 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 1731.08 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 148.0 MB). Peak memory consumption was 148.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 486.60 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 776.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -938.1 MB). Peak memory consumption was 45.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 226.48 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 7347.42 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 541.6 MB). Peak memory consumption was 541.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 217707.54 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.7 GB). Free memory was 1.6 GB in the beginning and 1.2 GB in the end (delta: 469.8 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 27]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 27). Cancelled while BasicCegarLoop was constructing difference of abstraction (124397states) and FLOYD_HOARE automaton (currently 10 states, 9 states before enhancement),while ReachableStatesComputation was computing reachable states (15976 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 758 locations, 1 error locations. TIMEOUT Result, 217.5s OverallTime, 17 OverallIterations, 8 TraceHistogramMax, 130.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8773 SDtfs, 36753 SDslu, 1546 SDs, 0 SdLazy, 85321 SolverSat, 10337 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 98.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5789 GetRequests, 5683 SyntacticMatches, 14 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 13.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124397occurred in iteration=16, 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: 10.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 104908 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 50.9s InterpolantComputationTime, 22604 NumberOfCodeBlocks, 22604 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 22584 ConstructedInterpolants, 1046 QuantifiedInterpolants, 229021704 SizeOfPredicates, 1 NumberOfNonLiveVariables, 6315 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 20 InterpolantComputations, 16 PerfectInterpolantSequences, 28468/32206 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown