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/Problem12_label25_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-0fd1304 [2018-10-23 17:57:44,051 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-23 17:57:44,053 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-23 17:57:44,065 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-23 17:57:44,065 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-23 17:57:44,066 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-23 17:57:44,068 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-23 17:57:44,072 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-23 17:57:44,074 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-23 17:57:44,074 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-23 17:57:44,075 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-23 17:57:44,076 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-23 17:57:44,077 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-23 17:57:44,078 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-23 17:57:44,079 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-23 17:57:44,080 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-23 17:57:44,081 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-23 17:57:44,083 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-23 17:57:44,088 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-23 17:57:44,093 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-23 17:57:44,094 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-23 17:57:44,095 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-23 17:57:44,097 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-23 17:57:44,098 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-23 17:57:44,098 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-23 17:57:44,099 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-23 17:57:44,101 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-23 17:57:44,102 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-23 17:57:44,103 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-23 17:57:44,106 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-23 17:57:44,106 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-23 17:57:44,107 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-23 17:57:44,107 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-23 17:57:44,107 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-23 17:57:44,108 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-23 17:57:44,111 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-23 17:57:44,112 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-23 17:57:44,141 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-23 17:57:44,141 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-23 17:57:44,142 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-23 17:57:44,142 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-23 17:57:44,143 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-23 17:57:44,144 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-23 17:57:44,144 INFO L133 SettingsManager]: * Use SBE=true [2018-10-23 17:57:44,144 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-23 17:57:44,144 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-23 17:57:44,144 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-23 17:57:44,145 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-23 17:57:44,145 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-23 17:57:44,145 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-23 17:57:44,145 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-23 17:57:44,145 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-23 17:57:44,146 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-23 17:57:44,147 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-23 17:57:44,147 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-23 17:57:44,147 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-23 17:57:44,148 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 17:57:44,148 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-23 17:57:44,148 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-23 17:57:44,148 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-23 17:57:44,148 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-23 17:57:44,149 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-23 17:57:44,149 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-23 17:57:44,149 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-23 17:57:44,149 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-23 17:57:44,223 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-23 17:57:44,241 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-23 17:57:44,246 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-23 17:57:44,248 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-23 17:57:44,248 INFO L276 PluginConnector]: CDTParser initialized [2018-10-23 17:57:44,249 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label25_false-unreach-call.c [2018-10-23 17:57:44,313 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1319f0c35/6d69e3a625344ab99b5ac91dbd391ad2/FLAG158d23e5d [2018-10-23 17:57:45,096 INFO L298 CDTParser]: Found 1 translation units. [2018-10-23 17:57:45,097 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label25_false-unreach-call.c [2018-10-23 17:57:45,134 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1319f0c35/6d69e3a625344ab99b5ac91dbd391ad2/FLAG158d23e5d [2018-10-23 17:57:45,152 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1319f0c35/6d69e3a625344ab99b5ac91dbd391ad2 [2018-10-23 17:57:45,164 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-23 17:57:45,166 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-23 17:57:45,167 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-23 17:57:45,167 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-23 17:57:45,171 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-23 17:57:45,172 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 05:57:45" (1/1) ... [2018-10-23 17:57:45,176 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7897d110 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:57:45, skipping insertion in model container [2018-10-23 17:57:45,176 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 05:57:45" (1/1) ... [2018-10-23 17:57:45,187 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-23 17:57:45,334 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-23 17:57:46,599 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 17:57:46,603 INFO L189 MainTranslator]: Completed pre-run [2018-10-23 17:57:47,187 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 17:57:47,224 INFO L193 MainTranslator]: Completed translation [2018-10-23 17:57:47,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:57:47 WrapperNode [2018-10-23 17:57:47,225 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-23 17:57:47,227 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-23 17:57:47,227 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-23 17:57:47,227 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-23 17:57:47,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:57:47" (1/1) ... [2018-10-23 17:57:47,308 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:57:47" (1/1) ... [2018-10-23 17:57:47,851 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-23 17:57:47,852 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-23 17:57:47,852 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-23 17:57:47,852 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-23 17:57:47,863 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:57:47" (1/1) ... [2018-10-23 17:57:47,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:57:47" (1/1) ... [2018-10-23 17:57:47,897 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:57:47" (1/1) ... [2018-10-23 17:57:47,898 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:57:47" (1/1) ... [2018-10-23 17:57:47,999 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:57:47" (1/1) ... [2018-10-23 17:57:48,026 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:57:47" (1/1) ... [2018-10-23 17:57:48,069 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:57:47" (1/1) ... [2018-10-23 17:57:48,113 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-23 17:57:48,114 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-23 17:57:48,114 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-23 17:57:48,114 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-23 17:57:48,115 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:57:47" (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-23 17:57:48,184 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-23 17:57:48,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-23 17:57:48,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-23 17:57:56,802 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-23 17:57:56,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 05:57:56 BoogieIcfgContainer [2018-10-23 17:57:56,805 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-23 17:57:56,806 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-23 17:57:56,806 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-23 17:57:56,810 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-23 17:57:56,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 05:57:45" (1/3) ... [2018-10-23 17:57:56,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2acfc8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 05:57:56, skipping insertion in model container [2018-10-23 17:57:56,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:57:47" (2/3) ... [2018-10-23 17:57:56,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2acfc8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 05:57:56, skipping insertion in model container [2018-10-23 17:57:56,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 05:57:56" (3/3) ... [2018-10-23 17:57:56,815 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label25_false-unreach-call.c [2018-10-23 17:57:56,826 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-23 17:57:56,836 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-23 17:57:56,853 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-23 17:57:56,898 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-23 17:57:56,898 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-23 17:57:56,899 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-23 17:57:56,899 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-23 17:57:56,899 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-23 17:57:56,899 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-23 17:57:56,899 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-23 17:57:56,899 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-23 17:57:56,900 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-23 17:57:56,945 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states. [2018-10-23 17:57:56,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-23 17:57:56,960 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 17:57:56,965 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 17:57:56,967 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 17:57:56,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 17:57:56,976 INFO L82 PathProgramCache]: Analyzing trace with hash 670581594, now seen corresponding path program 1 times [2018-10-23 17:57:56,978 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 17:57:56,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 17:57:57,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:57:57,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 17:57:57,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:57:57,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 17:57:57,319 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-23 17:57:57,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 17:57:57,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 17:57:57,327 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 17:57:57,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 17:57:57,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 17:57:57,347 INFO L87 Difference]: Start difference. First operand 819 states. Second operand 4 states. [2018-10-23 17:58:11,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 17:58:11,751 INFO L93 Difference]: Finished difference Result 3146 states and 6134 transitions. [2018-10-23 17:58:11,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 17:58:11,753 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-10-23 17:58:11,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 17:58:11,797 INFO L225 Difference]: With dead ends: 3146 [2018-10-23 17:58:11,798 INFO L226 Difference]: Without dead ends: 2320 [2018-10-23 17:58:11,805 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 17:58:11,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2320 states. [2018-10-23 17:58:11,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2320 to 2320. [2018-10-23 17:58:11,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2320 states. [2018-10-23 17:58:11,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2320 states to 2320 states and 4229 transitions. [2018-10-23 17:58:11,969 INFO L78 Accepts]: Start accepts. Automaton has 2320 states and 4229 transitions. Word has length 18 [2018-10-23 17:58:11,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 17:58:11,970 INFO L481 AbstractCegarLoop]: Abstraction has 2320 states and 4229 transitions. [2018-10-23 17:58:11,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 17:58:11,970 INFO L276 IsEmpty]: Start isEmpty. Operand 2320 states and 4229 transitions. [2018-10-23 17:58:11,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-23 17:58:11,977 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 17:58:11,977 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 17:58:11,977 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 17:58:11,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 17:58:11,978 INFO L82 PathProgramCache]: Analyzing trace with hash 446746015, now seen corresponding path program 1 times [2018-10-23 17:58:11,978 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 17:58:11,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 17:58:11,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:58:11,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 17:58:11,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:58:12,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 17:58:12,296 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 17:58:12,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 17:58:12,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 17:58:12,299 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 17:58:12,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 17:58:12,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 17:58:12,299 INFO L87 Difference]: Start difference. First operand 2320 states and 4229 transitions. Second operand 4 states. [2018-10-23 17:58:23,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 17:58:23,351 INFO L93 Difference]: Finished difference Result 9150 states and 16788 transitions. [2018-10-23 17:58:23,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 17:58:23,351 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-10-23 17:58:23,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 17:58:23,388 INFO L225 Difference]: With dead ends: 9150 [2018-10-23 17:58:23,388 INFO L226 Difference]: Without dead ends: 6832 [2018-10-23 17:58:23,393 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 17:58:23,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6832 states. [2018-10-23 17:58:23,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6832 to 6832. [2018-10-23 17:58:23,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6832 states. [2018-10-23 17:58:23,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6832 states to 6832 states and 10629 transitions. [2018-10-23 17:58:23,530 INFO L78 Accepts]: Start accepts. Automaton has 6832 states and 10629 transitions. Word has length 94 [2018-10-23 17:58:23,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 17:58:23,530 INFO L481 AbstractCegarLoop]: Abstraction has 6832 states and 10629 transitions. [2018-10-23 17:58:23,530 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 17:58:23,531 INFO L276 IsEmpty]: Start isEmpty. Operand 6832 states and 10629 transitions. [2018-10-23 17:58:23,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-23 17:58:23,535 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 17:58:23,535 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 17:58:23,536 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 17:58:23,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 17:58:23,536 INFO L82 PathProgramCache]: Analyzing trace with hash 343230256, now seen corresponding path program 1 times [2018-10-23 17:58:23,536 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 17:58:23,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 17:58:23,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:58:23,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 17:58:23,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:58:23,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 17:58:23,890 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 17:58:23,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 17:58:23,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 17:58:23,891 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 17:58:23,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 17:58:23,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 17:58:23,892 INFO L87 Difference]: Start difference. First operand 6832 states and 10629 transitions. Second operand 4 states. [2018-10-23 17:58:32,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 17:58:32,596 INFO L93 Difference]: Finished difference Result 27260 states and 42449 transitions. [2018-10-23 17:58:32,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 17:58:32,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-10-23 17:58:32,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 17:58:32,689 INFO L225 Difference]: With dead ends: 27260 [2018-10-23 17:58:32,689 INFO L226 Difference]: Without dead ends: 20430 [2018-10-23 17:58:32,701 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-23 17:58:32,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20430 states. [2018-10-23 17:58:32,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20430 to 13600. [2018-10-23 17:58:32,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13600 states. [2018-10-23 17:58:33,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13600 states to 13600 states and 19341 transitions. [2018-10-23 17:58:33,010 INFO L78 Accepts]: Start accepts. Automaton has 13600 states and 19341 transitions. Word has length 100 [2018-10-23 17:58:33,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 17:58:33,011 INFO L481 AbstractCegarLoop]: Abstraction has 13600 states and 19341 transitions. [2018-10-23 17:58:33,011 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 17:58:33,011 INFO L276 IsEmpty]: Start isEmpty. Operand 13600 states and 19341 transitions. [2018-10-23 17:58:33,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-23 17:58:33,015 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 17:58:33,015 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 17:58:33,016 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 17:58:33,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 17:58:33,016 INFO L82 PathProgramCache]: Analyzing trace with hash -544105501, now seen corresponding path program 1 times [2018-10-23 17:58:33,016 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 17:58:33,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 17:58:33,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:58:33,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 17:58:33,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:58:33,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 17:58:33,366 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 17:58:33,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 17:58:33,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 17:58:33,367 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 17:58:33,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 17:58:33,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 17:58:33,368 INFO L87 Difference]: Start difference. First operand 13600 states and 19341 transitions. Second operand 4 states. [2018-10-23 17:58:42,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 17:58:42,295 INFO L93 Difference]: Finished difference Result 52783 states and 74748 transitions. [2018-10-23 17:58:42,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 17:58:42,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2018-10-23 17:58:42,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 17:58:42,374 INFO L225 Difference]: With dead ends: 52783 [2018-10-23 17:58:42,374 INFO L226 Difference]: Without dead ends: 39185 [2018-10-23 17:58:42,397 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 17:58:42,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39185 states. [2018-10-23 17:58:42,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39185 to 26384. [2018-10-23 17:58:42,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26384 states. [2018-10-23 17:58:42,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26384 states to 26384 states and 33902 transitions. [2018-10-23 17:58:42,874 INFO L78 Accepts]: Start accepts. Automaton has 26384 states and 33902 transitions. Word has length 118 [2018-10-23 17:58:42,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 17:58:42,875 INFO L481 AbstractCegarLoop]: Abstraction has 26384 states and 33902 transitions. [2018-10-23 17:58:42,875 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 17:58:42,875 INFO L276 IsEmpty]: Start isEmpty. Operand 26384 states and 33902 transitions. [2018-10-23 17:58:42,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-10-23 17:58:42,880 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 17:58:42,881 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 17:58:42,881 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 17:58:42,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 17:58:42,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1050401920, now seen corresponding path program 1 times [2018-10-23 17:58:42,882 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 17:58:42,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 17:58:42,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:58:42,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 17:58:42,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:58:42,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 17:58:43,351 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 17:58:43,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 17:58:43,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 17:58:43,353 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 17:58:43,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 17:58:43,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 17:58:43,354 INFO L87 Difference]: Start difference. First operand 26384 states and 33902 transitions. Second operand 4 states. [2018-10-23 17:58:54,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 17:58:54,047 INFO L93 Difference]: Finished difference Result 52766 states and 67802 transitions. [2018-10-23 17:58:54,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 17:58:54,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 247 [2018-10-23 17:58:54,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 17:58:54,094 INFO L225 Difference]: With dead ends: 52766 [2018-10-23 17:58:54,094 INFO L226 Difference]: Without dead ends: 26384 [2018-10-23 17:58:54,122 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-23 17:58:54,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26384 states. [2018-10-23 17:58:54,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26384 to 26384. [2018-10-23 17:58:54,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26384 states. [2018-10-23 17:58:54,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26384 states to 26384 states and 32888 transitions. [2018-10-23 17:58:54,449 INFO L78 Accepts]: Start accepts. Automaton has 26384 states and 32888 transitions. Word has length 247 [2018-10-23 17:58:54,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 17:58:54,450 INFO L481 AbstractCegarLoop]: Abstraction has 26384 states and 32888 transitions. [2018-10-23 17:58:54,450 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 17:58:54,451 INFO L276 IsEmpty]: Start isEmpty. Operand 26384 states and 32888 transitions. [2018-10-23 17:58:54,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-10-23 17:58:54,456 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 17:58:54,456 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 17:58:54,457 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 17:58:54,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 17:58:54,457 INFO L82 PathProgramCache]: Analyzing trace with hash -827461878, now seen corresponding path program 1 times [2018-10-23 17:58:54,457 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 17:58:54,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 17:58:54,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:58:54,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 17:58:54,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:58:54,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 17:58:54,860 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-10-23 17:58:54,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 17:58:54,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-23 17:58:54,861 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 17:58:54,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 17:58:54,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 17:58:54,861 INFO L87 Difference]: Start difference. First operand 26384 states and 32888 transitions. Second operand 5 states. [2018-10-23 17:59:04,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 17:59:04,776 INFO L93 Difference]: Finished difference Result 98638 states and 123348 transitions. [2018-10-23 17:59:04,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 17:59:04,776 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 251 [2018-10-23 17:59:04,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 17:59:04,894 INFO L225 Difference]: With dead ends: 98638 [2018-10-23 17:59:04,894 INFO L226 Difference]: Without dead ends: 72256 [2018-10-23 17:59:04,927 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 17:59:04,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72256 states. [2018-10-23 17:59:05,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72256 to 72256. [2018-10-23 17:59:05,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72256 states. [2018-10-23 17:59:05,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72256 states to 72256 states and 84563 transitions. [2018-10-23 17:59:05,642 INFO L78 Accepts]: Start accepts. Automaton has 72256 states and 84563 transitions. Word has length 251 [2018-10-23 17:59:05,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 17:59:05,642 INFO L481 AbstractCegarLoop]: Abstraction has 72256 states and 84563 transitions. [2018-10-23 17:59:05,642 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 17:59:05,642 INFO L276 IsEmpty]: Start isEmpty. Operand 72256 states and 84563 transitions. [2018-10-23 17:59:05,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-10-23 17:59:05,654 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 17:59:05,654 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-23 17:59:05,654 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 17:59:05,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 17:59:05,655 INFO L82 PathProgramCache]: Analyzing trace with hash 891280383, now seen corresponding path program 1 times [2018-10-23 17:59:05,655 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 17:59:05,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 17:59:05,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:59:05,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 17:59:05,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:59:05,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 17:59:06,226 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 19 [2018-10-23 17:59:06,321 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 203 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-10-23 17:59:06,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 17:59:06,322 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-23 17:59:06,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 17:59:06,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 17:59:06,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 17:59:07,064 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-10-23 17:59:07,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 17:59:07,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-10-23 17:59:07,099 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 17:59:07,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 17:59:07,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-23 17:59:07,106 INFO L87 Difference]: Start difference. First operand 72256 states and 84563 transitions. Second operand 6 states. [2018-10-23 17:59:08,948 WARN L179 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 18 [2018-10-23 17:59:26,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 17:59:26,269 INFO L93 Difference]: Finished difference Result 176128 states and 202657 transitions. [2018-10-23 17:59:26,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-23 17:59:26,277 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 275 [2018-10-23 17:59:26,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 17:59:26,400 INFO L225 Difference]: With dead ends: 176128 [2018-10-23 17:59:26,401 INFO L226 Difference]: Without dead ends: 102367 [2018-10-23 17:59:26,445 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 276 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-23 17:59:26,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102367 states. [2018-10-23 17:59:27,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102367 to 73759. [2018-10-23 17:59:27,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73759 states. [2018-10-23 17:59:27,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73759 states to 73759 states and 84004 transitions. [2018-10-23 17:59:27,838 INFO L78 Accepts]: Start accepts. Automaton has 73759 states and 84004 transitions. Word has length 275 [2018-10-23 17:59:27,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 17:59:27,838 INFO L481 AbstractCegarLoop]: Abstraction has 73759 states and 84004 transitions. [2018-10-23 17:59:27,839 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 17:59:27,839 INFO L276 IsEmpty]: Start isEmpty. Operand 73759 states and 84004 transitions. [2018-10-23 17:59:27,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-10-23 17:59:27,848 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 17:59:27,849 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 17:59:27,849 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 17:59:27,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 17:59:27,850 INFO L82 PathProgramCache]: Analyzing trace with hash 28154518, now seen corresponding path program 1 times [2018-10-23 17:59:27,850 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 17:59:27,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 17:59:27,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:59:27,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 17:59:27,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:59:27,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 17:59:28,223 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-10-23 17:59:28,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 17:59:28,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 17:59:28,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 17:59:28,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 17:59:28,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 17:59:28,225 INFO L87 Difference]: Start difference. First operand 73759 states and 84004 transitions. Second operand 3 states. [2018-10-23 17:59:34,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 17:59:34,726 INFO L93 Difference]: Finished difference Result 162556 states and 184984 transitions. [2018-10-23 17:59:34,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 17:59:34,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 278 [2018-10-23 17:59:34,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 17:59:34,835 INFO L225 Difference]: With dead ends: 162556 [2018-10-23 17:59:34,835 INFO L226 Difference]: Without dead ends: 89551 [2018-10-23 17:59:34,876 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-23 17:59:34,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89551 states. [2018-10-23 17:59:35,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89551 to 89551. [2018-10-23 17:59:35,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89551 states. [2018-10-23 17:59:35,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89551 states to 89551 states and 100849 transitions. [2018-10-23 17:59:35,823 INFO L78 Accepts]: Start accepts. Automaton has 89551 states and 100849 transitions. Word has length 278 [2018-10-23 17:59:35,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 17:59:35,823 INFO L481 AbstractCegarLoop]: Abstraction has 89551 states and 100849 transitions. [2018-10-23 17:59:35,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 17:59:35,824 INFO L276 IsEmpty]: Start isEmpty. Operand 89551 states and 100849 transitions. [2018-10-23 17:59:35,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2018-10-23 17:59:35,845 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 17:59:35,845 INFO L375 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 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] [2018-10-23 17:59:35,846 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 17:59:35,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 17:59:35,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1666325953, now seen corresponding path program 1 times [2018-10-23 17:59:35,846 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 17:59:35,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 17:59:35,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:59:35,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 17:59:35,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:59:35,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 17:59:36,241 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-23 17:59:36,712 WARN L179 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 23 [2018-10-23 17:59:37,049 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2018-10-23 17:59:37,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 17:59:37,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-23 17:59:37,050 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 17:59:37,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 17:59:37,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-23 17:59:37,050 INFO L87 Difference]: Start difference. First operand 89551 states and 100849 transitions. Second operand 6 states. [2018-10-23 17:59:48,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 17:59:48,067 INFO L93 Difference]: Finished difference Result 207677 states and 235838 transitions. [2018-10-23 17:59:48,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 17:59:48,067 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 377 [2018-10-23 17:59:48,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 17:59:48,197 INFO L225 Difference]: With dead ends: 207677 [2018-10-23 17:59:48,197 INFO L226 Difference]: Without dead ends: 112101 [2018-10-23 17:59:48,244 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-10-23 17:59:48,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112101 states. [2018-10-23 17:59:49,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112101 to 110597. [2018-10-23 17:59:49,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110597 states. [2018-10-23 17:59:49,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110597 states to 110597 states and 122825 transitions. [2018-10-23 17:59:49,251 INFO L78 Accepts]: Start accepts. Automaton has 110597 states and 122825 transitions. Word has length 377 [2018-10-23 17:59:49,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 17:59:49,252 INFO L481 AbstractCegarLoop]: Abstraction has 110597 states and 122825 transitions. [2018-10-23 17:59:49,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 17:59:49,252 INFO L276 IsEmpty]: Start isEmpty. Operand 110597 states and 122825 transitions. [2018-10-23 17:59:49,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2018-10-23 17:59:49,273 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 17:59:49,273 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-23 17:59:49,273 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 17:59:49,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 17:59:49,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1258323644, now seen corresponding path program 1 times [2018-10-23 17:59:49,274 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 17:59:49,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 17:59:49,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:59:49,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 17:59:49,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:59:49,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 17:59:49,587 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 485 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-10-23 17:59:49,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 17:59:49,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 17:59:49,588 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 17:59:49,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 17:59:49,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 17:59:49,589 INFO L87 Difference]: Start difference. First operand 110597 states and 122825 transitions. Second operand 3 states. [2018-10-23 17:59:55,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 17:59:55,864 INFO L93 Difference]: Finished difference Result 241496 states and 268474 transitions. [2018-10-23 17:59:55,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 17:59:55,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 459 [2018-10-23 17:59:55,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 17:59:56,102 INFO L225 Difference]: With dead ends: 241496 [2018-10-23 17:59:56,102 INFO L226 Difference]: Without dead ends: 131653 [2018-10-23 17:59:56,158 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-23 17:59:56,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131653 states. [2018-10-23 17:59:57,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131653 to 130901. [2018-10-23 17:59:57,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130901 states. [2018-10-23 17:59:57,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130901 states to 130901 states and 142197 transitions. [2018-10-23 17:59:57,161 INFO L78 Accepts]: Start accepts. Automaton has 130901 states and 142197 transitions. Word has length 459 [2018-10-23 17:59:57,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 17:59:57,162 INFO L481 AbstractCegarLoop]: Abstraction has 130901 states and 142197 transitions. [2018-10-23 17:59:57,162 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 17:59:57,162 INFO L276 IsEmpty]: Start isEmpty. Operand 130901 states and 142197 transitions. [2018-10-23 17:59:57,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2018-10-23 17:59:57,176 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 17:59:57,177 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-23 17:59:57,177 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 17:59:57,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 17:59:57,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1041678296, now seen corresponding path program 1 times [2018-10-23 17:59:57,178 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 17:59:57,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 17:59:57,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:59:57,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 17:59:57,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 17:59:57,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 17:59:57,570 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-23 17:59:57,910 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 585 proven. 8 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-10-23 17:59:57,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 17:59:57,911 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-23 17:59:57,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 17:59:58,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 17:59:58,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 17:59:58,715 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 479 trivial. 0 not checked. [2018-10-23 17:59:58,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 17:59:58,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-10-23 17:59:58,738 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-23 17:59:58,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-23 17:59:58,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-10-23 17:59:58,738 INFO L87 Difference]: Start difference. First operand 130901 states and 142197 transitions. Second operand 7 states. [2018-10-23 18:00:13,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:00:13,759 INFO L93 Difference]: Finished difference Result 258787 states and 281383 transitions. [2018-10-23 18:00:13,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-23 18:00:13,761 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 497 [2018-10-23 18:00:13,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:00:13,928 INFO L225 Difference]: With dead ends: 258787 [2018-10-23 18:00:13,928 INFO L226 Difference]: Without dead ends: 128640 [2018-10-23 18:00:14,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 499 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-10-23 18:00:14,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128640 states. [2018-10-23 18:00:15,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128640 to 125632. [2018-10-23 18:00:15,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125632 states. [2018-10-23 18:00:15,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125632 states to 125632 states and 132732 transitions. [2018-10-23 18:00:15,614 INFO L78 Accepts]: Start accepts. Automaton has 125632 states and 132732 transitions. Word has length 497 [2018-10-23 18:00:15,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:00:15,615 INFO L481 AbstractCegarLoop]: Abstraction has 125632 states and 132732 transitions. [2018-10-23 18:00:15,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-23 18:00:15,615 INFO L276 IsEmpty]: Start isEmpty. Operand 125632 states and 132732 transitions. [2018-10-23 18:00:15,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 699 [2018-10-23 18:00:15,648 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:00:15,649 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 18:00:15,649 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:00:15,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:00:15,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1463867924, now seen corresponding path program 1 times [2018-10-23 18:00:15,649 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:00:15,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:00:15,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:00:15,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:00:15,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:00:15,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:00:16,349 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-10-23 18:00:16,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:00:16,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 18:00:16,350 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:00:16,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:00:16,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:00:16,351 INFO L87 Difference]: Start difference. First operand 125632 states and 132732 transitions. Second operand 4 states. [2018-10-23 18:00:24,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:00:24,182 INFO L93 Difference]: Finished difference Result 261790 states and 276791 transitions. [2018-10-23 18:00:24,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:00:24,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 698 [2018-10-23 18:00:24,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:00:24,324 INFO L225 Difference]: With dead ends: 261790 [2018-10-23 18:00:24,324 INFO L226 Difference]: Without dead ends: 136912 [2018-10-23 18:00:24,384 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-23 18:00:24,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136912 states. [2018-10-23 18:00:25,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136912 to 133904. [2018-10-23 18:00:25,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133904 states. [2018-10-23 18:00:25,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133904 states to 133904 states and 140186 transitions. [2018-10-23 18:00:25,403 INFO L78 Accepts]: Start accepts. Automaton has 133904 states and 140186 transitions. Word has length 698 [2018-10-23 18:00:25,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:00:25,404 INFO L481 AbstractCegarLoop]: Abstraction has 133904 states and 140186 transitions. [2018-10-23 18:00:25,404 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:00:25,405 INFO L276 IsEmpty]: Start isEmpty. Operand 133904 states and 140186 transitions. [2018-10-23 18:00:25,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 906 [2018-10-23 18:00:25,468 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:00:25,469 INFO L375 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 18:00:25,469 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:00:25,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:00:25,470 INFO L82 PathProgramCache]: Analyzing trace with hash -28131880, now seen corresponding path program 1 times [2018-10-23 18:00:25,470 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:00:25,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:00:25,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:00:25,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:00:25,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:00:25,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:00:27,410 INFO L134 CoverageAnalysis]: Checked inductivity of 833 backedges. 738 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-10-23 18:00:27,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:00:27,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 18:00:27,412 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:00:27,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:00:27,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:00:27,413 INFO L87 Difference]: Start difference. First operand 133904 states and 140186 transitions. Second operand 4 states. [2018-10-23 18:00:34,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:00:34,738 INFO L93 Difference]: Finished difference Result 267054 states and 279613 transitions. [2018-10-23 18:00:34,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:00:34,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 905 [2018-10-23 18:00:34,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:00:34,875 INFO L225 Difference]: With dead ends: 267054 [2018-10-23 18:00:34,875 INFO L226 Difference]: Without dead ends: 129383 [2018-10-23 18:00:34,920 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:00:34,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129383 states. [2018-10-23 18:00:35,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129383 to 124871. [2018-10-23 18:00:35,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124871 states. [2018-10-23 18:00:35,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124871 states to 124871 states and 128727 transitions. [2018-10-23 18:00:35,976 INFO L78 Accepts]: Start accepts. Automaton has 124871 states and 128727 transitions. Word has length 905 [2018-10-23 18:00:35,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:00:35,977 INFO L481 AbstractCegarLoop]: Abstraction has 124871 states and 128727 transitions. [2018-10-23 18:00:35,977 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:00:35,977 INFO L276 IsEmpty]: Start isEmpty. Operand 124871 states and 128727 transitions. [2018-10-23 18:00:36,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 994 [2018-10-23 18:00:36,035 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:00:36,036 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 18:00:36,036 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:00:36,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:00:36,037 INFO L82 PathProgramCache]: Analyzing trace with hash 760328512, now seen corresponding path program 1 times [2018-10-23 18:00:36,037 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:00:36,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:00:36,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:00:36,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:00:36,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:00:36,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:00:37,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1554 backedges. 1123 proven. 0 refuted. 0 times theorem prover too weak. 431 trivial. 0 not checked. [2018-10-23 18:00:37,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:00:37,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 18:00:37,509 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:00:37,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:00:37,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:00:37,510 INFO L87 Difference]: Start difference. First operand 124871 states and 128727 transitions. Second operand 4 states. [2018-10-23 18:00:44,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:00:44,204 INFO L93 Difference]: Finished difference Result 249740 states and 257451 transitions. [2018-10-23 18:00:44,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:00:44,205 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 993 [2018-10-23 18:00:44,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:00:44,324 INFO L225 Difference]: With dead ends: 249740 [2018-10-23 18:00:44,324 INFO L226 Difference]: Without dead ends: 120353 [2018-10-23 18:00:44,369 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-23 18:00:44,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120353 states. [2018-10-23 18:00:45,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120353 to 118849. [2018-10-23 18:00:45,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118849 states. [2018-10-23 18:00:45,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118849 states to 118849 states and 122482 transitions. [2018-10-23 18:00:45,483 INFO L78 Accepts]: Start accepts. Automaton has 118849 states and 122482 transitions. Word has length 993 [2018-10-23 18:00:45,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:00:45,483 INFO L481 AbstractCegarLoop]: Abstraction has 118849 states and 122482 transitions. [2018-10-23 18:00:45,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:00:45,483 INFO L276 IsEmpty]: Start isEmpty. Operand 118849 states and 122482 transitions. [2018-10-23 18:00:45,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1077 [2018-10-23 18:00:45,549 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:00:45,550 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 18:00:45,550 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:00:45,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:00:45,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1341308809, now seen corresponding path program 1 times [2018-10-23 18:00:45,551 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:00:45,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:00:45,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:00:45,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:00:45,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:00:45,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:00:46,347 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-23 18:00:48,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1725 backedges. 1014 proven. 461 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2018-10-23 18:00:48,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 18:00:48,628 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-23 18:00:48,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:00:48,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:00:48,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 18:00:50,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1725 backedges. 1250 proven. 0 refuted. 0 times theorem prover too weak. 475 trivial. 0 not checked. [2018-10-23 18:00:50,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 18:00:50,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2018-10-23 18:00:50,111 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-23 18:00:50,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-23 18:00:50,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-10-23 18:00:50,112 INFO L87 Difference]: Start difference. First operand 118849 states and 122482 transitions. Second operand 11 states. [2018-10-23 18:01:31,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:01:31,779 INFO L93 Difference]: Finished difference Result 258001 states and 265953 transitions. [2018-10-23 18:01:31,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-23 18:01:31,780 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 1076 [2018-10-23 18:01:31,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:01:31,920 INFO L225 Difference]: With dead ends: 258001 [2018-10-23 18:01:31,920 INFO L226 Difference]: Without dead ends: 131621 [2018-10-23 18:01:31,974 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1103 GetRequests, 1082 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2018-10-23 18:01:32,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131621 states. [2018-10-23 18:01:33,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131621 to 111317. [2018-10-23 18:01:33,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111317 states. [2018-10-23 18:01:33,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111317 states to 111317 states and 113919 transitions. [2018-10-23 18:01:33,269 INFO L78 Accepts]: Start accepts. Automaton has 111317 states and 113919 transitions. Word has length 1076 [2018-10-23 18:01:33,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:01:33,270 INFO L481 AbstractCegarLoop]: Abstraction has 111317 states and 113919 transitions. [2018-10-23 18:01:33,270 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-23 18:01:33,270 INFO L276 IsEmpty]: Start isEmpty. Operand 111317 states and 113919 transitions. [2018-10-23 18:01:33,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1089 [2018-10-23 18:01:33,318 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:01:33,319 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 18:01:33,319 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:01:33,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:01:33,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1911710261, now seen corresponding path program 1 times [2018-10-23 18:01:33,320 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:01:33,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:01:33,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:01:33,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:01:33,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:01:33,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:01:34,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1822 backedges. 1267 proven. 0 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2018-10-23 18:01:34,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:01:34,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 18:01:34,802 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:01:34,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:01:34,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:01:34,803 INFO L87 Difference]: Start difference. First operand 111317 states and 113919 transitions. Second operand 4 states. Received shutdown request... [2018-10-23 18:01:35,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:01:35,677 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-23 18:01:35,682 WARN L205 ceAbstractionStarter]: Timeout [2018-10-23 18:01:35,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 06:01:35 BoogieIcfgContainer [2018-10-23 18:01:35,683 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-23 18:01:35,684 INFO L168 Benchmark]: Toolchain (without parser) took 230519.49 ms. Allocated memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: 1.8 GB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 98.8 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2018-10-23 18:01:35,685 INFO L168 Benchmark]: CDTParser took 0.20 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-23 18:01:35,686 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2058.53 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 202.9 MB). Peak memory consumption was 202.9 MB. Max. memory is 7.1 GB. [2018-10-23 18:01:35,687 INFO L168 Benchmark]: Boogie Procedure Inliner took 624.90 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 815.3 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 68.8 MB. Max. memory is 7.1 GB. [2018-10-23 18:01:35,688 INFO L168 Benchmark]: Boogie Preprocessor took 261.64 ms. Allocated memory is still 2.4 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. [2018-10-23 18:01:35,689 INFO L168 Benchmark]: RCFGBuilder took 8691.66 ms. Allocated memory was 2.4 GB in the beginning and 2.6 GB in the end (delta: 202.4 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -136.5 MB). Peak memory consumption was 614.9 MB. Max. memory is 7.1 GB. [2018-10-23 18:01:35,690 INFO L168 Benchmark]: TraceAbstraction took 218876.69 ms. Allocated memory was 2.6 GB in the beginning and 3.3 GB in the end (delta: 757.6 MB). Free memory was 2.3 GB in the beginning and 1.3 GB in the end (delta: 1.0 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-10-23 18:01:35,695 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.20 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 2058.53 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 202.9 MB). Peak memory consumption was 202.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 624.90 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 815.3 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 68.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 261.64 ms. Allocated memory is still 2.4 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 8691.66 ms. Allocated memory was 2.4 GB in the beginning and 2.6 GB in the end (delta: 202.4 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -136.5 MB). Peak memory consumption was 614.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 218876.69 ms. Allocated memory was 2.6 GB in the beginning and 3.3 GB in the end (delta: 757.6 MB). Free memory was 2.3 GB in the beginning and 1.3 GB in the end (delta: 1.0 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 63]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 63). Cancelled while BasicCegarLoop was constructing difference of abstraction (111317states) and FLOYD_HOARE automaton (currently 4 states, 4 states before enhancement),while ReachableStatesComputation was computing reachable states (1274 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 819 locations, 1 error locations. TIMEOUT Result, 218.7s OverallTime, 16 OverallIterations, 7 TraceHistogramMax, 188.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8709 SDtfs, 37080 SDslu, 1946 SDs, 0 SdLazy, 115108 SolverSat, 15026 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 150.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1964 GetRequests, 1882 SyntacticMatches, 25 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133904occurred in iteration=12, 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: 12.5s AutomataMinimizationTime, 15 MinimizatonAttempts, 82831 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 9.7s InterpolantComputationTime, 9322 NumberOfCodeBlocks, 9322 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 9303 ConstructedInterpolants, 0 QuantifiedInterpolants, 14511282 SizeOfPredicates, 6 NumberOfNonLiveVariables, 2345 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 19 InterpolantComputations, 16 PerfectInterpolantSequences, 11327/11801 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown