java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label51_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 19:59:26,083 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 19:59:26,087 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 19:59:26,103 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 19:59:26,104 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 19:59:26,105 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 19:59:26,106 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 19:59:26,108 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 19:59:26,110 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 19:59:26,111 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 19:59:26,114 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 19:59:26,114 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 19:59:26,115 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 19:59:26,117 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 19:59:26,118 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 19:59:26,119 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 19:59:26,120 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 19:59:26,122 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 19:59:26,124 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 19:59:26,126 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 19:59:26,127 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 19:59:26,129 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 19:59:26,131 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 19:59:26,132 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 19:59:26,132 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 19:59:26,133 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 19:59:26,134 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 19:59:26,135 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 19:59:26,136 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 19:59:26,137 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 19:59:26,138 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 19:59:26,138 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 19:59:26,139 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 19:59:26,139 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 19:59:26,142 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 19:59:26,143 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 19:59:26,143 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 19:59:26,168 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 19:59:26,168 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 19:59:26,169 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 19:59:26,169 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 19:59:26,170 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 19:59:26,170 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 19:59:26,171 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 19:59:26,171 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 19:59:26,171 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 19:59:26,171 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 19:59:26,172 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 19:59:26,172 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 19:59:26,172 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 19:59:26,172 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 19:59:26,172 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 19:59:26,173 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 19:59:26,173 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 19:59:26,173 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 19:59:26,173 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 19:59:26,174 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:59:26,174 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 19:59:26,174 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 19:59:26,174 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 19:59:26,174 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 19:59:26,175 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 19:59:26,175 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 19:59:26,175 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 19:59:26,175 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 19:59:26,243 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 19:59:26,260 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 19:59:26,265 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 19:59:26,267 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 19:59:26,267 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 19:59:26,268 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label51_true-unreach-call.c [2018-11-06 19:59:26,336 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fe2ea043/713f95836c3d48ee9014a79b904ffeb9/FLAG1b0f73504 [2018-11-06 19:59:27,060 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 19:59:27,061 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label51_true-unreach-call.c [2018-11-06 19:59:27,081 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fe2ea043/713f95836c3d48ee9014a79b904ffeb9/FLAG1b0f73504 [2018-11-06 19:59:27,097 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fe2ea043/713f95836c3d48ee9014a79b904ffeb9 [2018-11-06 19:59:27,111 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 19:59:27,113 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 19:59:27,114 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 19:59:27,114 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 19:59:27,119 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 19:59:27,120 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:59:27" (1/1) ... [2018-11-06 19:59:27,123 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d73b804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:27, skipping insertion in model container [2018-11-06 19:59:27,123 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:59:27" (1/1) ... [2018-11-06 19:59:27,134 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 19:59:27,229 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 19:59:27,994 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:59:27,999 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 19:59:28,225 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:59:28,248 INFO L193 MainTranslator]: Completed translation [2018-11-06 19:59:28,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:28 WrapperNode [2018-11-06 19:59:28,249 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 19:59:28,250 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 19:59:28,250 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 19:59:28,251 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 19:59:28,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:28" (1/1) ... [2018-11-06 19:59:28,437 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:28" (1/1) ... [2018-11-06 19:59:28,552 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 19:59:28,553 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 19:59:28,553 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 19:59:28,553 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 19:59:28,563 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:28" (1/1) ... [2018-11-06 19:59:28,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:28" (1/1) ... [2018-11-06 19:59:28,570 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:28" (1/1) ... [2018-11-06 19:59:28,570 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:28" (1/1) ... [2018-11-06 19:59:28,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:28" (1/1) ... [2018-11-06 19:59:28,683 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:28" (1/1) ... [2018-11-06 19:59:28,706 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:28" (1/1) ... [2018-11-06 19:59:28,721 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 19:59:28,721 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 19:59:28,722 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 19:59:28,722 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 19:59:28,723 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:59:28,791 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 19:59:28,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 19:59:28,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 19:59:34,230 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 19:59:34,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:59:34 BoogieIcfgContainer [2018-11-06 19:59:34,231 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 19:59:34,233 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 19:59:34,233 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 19:59:34,236 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 19:59:34,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:59:27" (1/3) ... [2018-11-06 19:59:34,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64758d37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:59:34, skipping insertion in model container [2018-11-06 19:59:34,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:28" (2/3) ... [2018-11-06 19:59:34,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64758d37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:59:34, skipping insertion in model container [2018-11-06 19:59:34,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:59:34" (3/3) ... [2018-11-06 19:59:34,241 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label51_true-unreach-call.c [2018-11-06 19:59:34,251 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 19:59:34,261 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 19:59:34,280 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 19:59:34,321 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 19:59:34,322 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 19:59:34,322 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 19:59:34,322 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 19:59:34,323 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 19:59:34,323 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 19:59:34,323 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 19:59:34,323 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 19:59:34,323 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 19:59:34,351 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-11-06 19:59:34,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-11-06 19:59:34,376 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:59:34,377 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:59:34,379 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:59:34,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:59:34,386 INFO L82 PathProgramCache]: Analyzing trace with hash 328246770, now seen corresponding path program 1 times [2018-11-06 19:59:34,388 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:59:34,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:59:34,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:34,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:34,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:34,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:59:35,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:59:35,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:59:35,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:59:35,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:59:35,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:59:35,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:59:35,457 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-11-06 19:59:38,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:59:38,641 INFO L93 Difference]: Finished difference Result 1089 states and 1954 transitions. [2018-11-06 19:59:38,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:59:38,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2018-11-06 19:59:38,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:59:38,670 INFO L225 Difference]: With dead ends: 1089 [2018-11-06 19:59:38,670 INFO L226 Difference]: Without dead ends: 779 [2018-11-06 19:59:38,676 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:59:38,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2018-11-06 19:59:38,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 515. [2018-11-06 19:59:38,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-11-06 19:59:38,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 887 transitions. [2018-11-06 19:59:38,760 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 887 transitions. Word has length 189 [2018-11-06 19:59:38,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:59:38,761 INFO L480 AbstractCegarLoop]: Abstraction has 515 states and 887 transitions. [2018-11-06 19:59:38,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:59:38,762 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 887 transitions. [2018-11-06 19:59:38,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-11-06 19:59:38,768 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:59:38,768 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-06 19:59:38,768 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:59:38,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:59:38,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1502852001, now seen corresponding path program 1 times [2018-11-06 19:59:38,769 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:59:38,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:59:38,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:38,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:38,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:38,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:59:39,109 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:59:39,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:59:39,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:59:39,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:59:39,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:59:39,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:59:39,116 INFO L87 Difference]: Start difference. First operand 515 states and 887 transitions. Second operand 4 states. [2018-11-06 19:59:43,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:59:43,864 INFO L93 Difference]: Finished difference Result 1904 states and 3379 transitions. [2018-11-06 19:59:43,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:59:43,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 195 [2018-11-06 19:59:43,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:59:43,874 INFO L225 Difference]: With dead ends: 1904 [2018-11-06 19:59:43,874 INFO L226 Difference]: Without dead ends: 1391 [2018-11-06 19:59:43,879 INFO L604 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-11-06 19:59:43,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2018-11-06 19:59:43,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 927. [2018-11-06 19:59:43,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2018-11-06 19:59:43,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1521 transitions. [2018-11-06 19:59:43,919 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1521 transitions. Word has length 195 [2018-11-06 19:59:43,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:59:43,919 INFO L480 AbstractCegarLoop]: Abstraction has 927 states and 1521 transitions. [2018-11-06 19:59:43,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:59:43,920 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1521 transitions. [2018-11-06 19:59:43,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-06 19:59:43,924 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:59:43,924 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:59:43,924 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:59:43,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:59:43,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1209056934, now seen corresponding path program 1 times [2018-11-06 19:59:43,925 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:59:43,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:59:43,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:43,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:43,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:43,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:59:44,041 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:59:44,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:59:44,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:59:44,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:59:44,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:59:44,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:59:44,043 INFO L87 Difference]: Start difference. First operand 927 states and 1521 transitions. Second operand 3 states. [2018-11-06 19:59:45,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:59:45,888 INFO L93 Difference]: Finished difference Result 2711 states and 4483 transitions. [2018-11-06 19:59:45,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:59:45,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2018-11-06 19:59:45,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:59:45,900 INFO L225 Difference]: With dead ends: 2711 [2018-11-06 19:59:45,900 INFO L226 Difference]: Without dead ends: 1786 [2018-11-06 19:59:45,903 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:59:45,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1786 states. [2018-11-06 19:59:45,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1786 to 1784. [2018-11-06 19:59:45,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1784 states. [2018-11-06 19:59:45,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2738 transitions. [2018-11-06 19:59:45,969 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2738 transitions. Word has length 196 [2018-11-06 19:59:45,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:59:45,969 INFO L480 AbstractCegarLoop]: Abstraction has 1784 states and 2738 transitions. [2018-11-06 19:59:45,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:59:45,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2738 transitions. [2018-11-06 19:59:45,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-06 19:59:45,982 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:59:45,983 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:59:45,983 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:59:45,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:59:45,984 INFO L82 PathProgramCache]: Analyzing trace with hash -10320045, now seen corresponding path program 1 times [2018-11-06 19:59:45,984 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:59:45,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:59:45,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:45,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:45,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:46,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:59:46,102 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:59:46,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:59:46,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:59:46,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:59:46,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:59:46,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:59:46,104 INFO L87 Difference]: Start difference. First operand 1784 states and 2738 transitions. Second operand 3 states. [2018-11-06 19:59:47,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:59:47,431 INFO L93 Difference]: Finished difference Result 5215 states and 8074 transitions. [2018-11-06 19:59:47,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:59:47,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2018-11-06 19:59:47,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:59:47,449 INFO L225 Difference]: With dead ends: 5215 [2018-11-06 19:59:47,449 INFO L226 Difference]: Without dead ends: 3433 [2018-11-06 19:59:47,452 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:59:47,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3433 states. [2018-11-06 19:59:47,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3433 to 3416. [2018-11-06 19:59:47,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3416 states. [2018-11-06 19:59:47,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3416 states to 3416 states and 5132 transitions. [2018-11-06 19:59:47,516 INFO L78 Accepts]: Start accepts. Automaton has 3416 states and 5132 transitions. Word has length 198 [2018-11-06 19:59:47,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:59:47,516 INFO L480 AbstractCegarLoop]: Abstraction has 3416 states and 5132 transitions. [2018-11-06 19:59:47,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:59:47,516 INFO L276 IsEmpty]: Start isEmpty. Operand 3416 states and 5132 transitions. [2018-11-06 19:59:47,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-11-06 19:59:47,525 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:59:47,526 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:59:47,526 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:59:47,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:59:47,526 INFO L82 PathProgramCache]: Analyzing trace with hash 902017023, now seen corresponding path program 1 times [2018-11-06 19:59:47,526 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:59:47,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:59:47,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:47,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:47,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:47,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:59:47,897 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:59:47,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:59:47,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:59:47,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:59:47,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:59:47,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:59:47,899 INFO L87 Difference]: Start difference. First operand 3416 states and 5132 transitions. Second operand 4 states. [2018-11-06 19:59:50,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:59:50,282 INFO L93 Difference]: Finished difference Result 13157 states and 19901 transitions. [2018-11-06 19:59:50,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:59:50,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 206 [2018-11-06 19:59:50,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:59:50,323 INFO L225 Difference]: With dead ends: 13157 [2018-11-06 19:59:50,323 INFO L226 Difference]: Without dead ends: 9743 [2018-11-06 19:59:50,331 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:59:50,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9743 states. [2018-11-06 19:59:50,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9743 to 9741. [2018-11-06 19:59:50,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9741 states. [2018-11-06 19:59:50,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9741 states to 9741 states and 13378 transitions. [2018-11-06 19:59:50,526 INFO L78 Accepts]: Start accepts. Automaton has 9741 states and 13378 transitions. Word has length 206 [2018-11-06 19:59:50,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:59:50,528 INFO L480 AbstractCegarLoop]: Abstraction has 9741 states and 13378 transitions. [2018-11-06 19:59:50,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:59:50,528 INFO L276 IsEmpty]: Start isEmpty. Operand 9741 states and 13378 transitions. [2018-11-06 19:59:50,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-11-06 19:59:50,550 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:59:50,551 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:59:50,551 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:59:50,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:59:50,552 INFO L82 PathProgramCache]: Analyzing trace with hash -900143218, now seen corresponding path program 1 times [2018-11-06 19:59:50,552 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:59:50,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:59:50,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:50,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:50,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:50,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:59:50,840 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:59:50,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:59:50,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:59:50,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:59:50,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:59:50,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:59:50,842 INFO L87 Difference]: Start difference. First operand 9741 states and 13378 transitions. Second operand 4 states. [2018-11-06 19:59:54,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:59:54,222 INFO L93 Difference]: Finished difference Result 37082 states and 50608 transitions. [2018-11-06 19:59:54,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:59:54,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2018-11-06 19:59:54,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:59:54,430 INFO L225 Difference]: With dead ends: 37082 [2018-11-06 19:59:54,431 INFO L226 Difference]: Without dead ends: 27343 [2018-11-06 19:59:54,444 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:59:54,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27343 states. [2018-11-06 19:59:54,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27343 to 18515. [2018-11-06 19:59:54,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18515 states. [2018-11-06 19:59:54,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18515 states to 18515 states and 24025 transitions. [2018-11-06 19:59:54,852 INFO L78 Accepts]: Start accepts. Automaton has 18515 states and 24025 transitions. Word has length 213 [2018-11-06 19:59:54,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:59:54,853 INFO L480 AbstractCegarLoop]: Abstraction has 18515 states and 24025 transitions. [2018-11-06 19:59:54,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:59:54,853 INFO L276 IsEmpty]: Start isEmpty. Operand 18515 states and 24025 transitions. [2018-11-06 19:59:54,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-11-06 19:59:54,890 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:59:54,890 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:59:54,891 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:59:54,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:59:54,891 INFO L82 PathProgramCache]: Analyzing trace with hash -753012397, now seen corresponding path program 1 times [2018-11-06 19:59:54,891 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:59:54,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:59:54,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:54,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:54,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:59:55,033 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-06 19:59:55,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:59:55,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:59:55,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:59:55,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:59:55,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:59:55,035 INFO L87 Difference]: Start difference. First operand 18515 states and 24025 transitions. Second operand 3 states. [2018-11-06 19:59:56,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:59:56,675 INFO L93 Difference]: Finished difference Result 36180 states and 46915 transitions. [2018-11-06 19:59:56,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:59:56,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 247 [2018-11-06 19:59:56,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:59:56,707 INFO L225 Difference]: With dead ends: 36180 [2018-11-06 19:59:56,707 INFO L226 Difference]: Without dead ends: 17667 [2018-11-06 19:59:56,726 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:59:56,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17667 states. [2018-11-06 19:59:56,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17667 to 17667. [2018-11-06 19:59:56,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17667 states. [2018-11-06 19:59:56,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17667 states to 17667 states and 22490 transitions. [2018-11-06 19:59:56,993 INFO L78 Accepts]: Start accepts. Automaton has 17667 states and 22490 transitions. Word has length 247 [2018-11-06 19:59:56,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:59:56,994 INFO L480 AbstractCegarLoop]: Abstraction has 17667 states and 22490 transitions. [2018-11-06 19:59:56,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:59:56,994 INFO L276 IsEmpty]: Start isEmpty. Operand 17667 states and 22490 transitions. [2018-11-06 19:59:57,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-11-06 19:59:57,027 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:59:57,028 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:59:57,028 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:59:57,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:59:57,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1019898388, now seen corresponding path program 1 times [2018-11-06 19:59:57,029 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:59:57,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:59:57,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:57,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:57,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:57,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:59:57,247 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-06 19:59:57,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:59:57,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:59:57,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:59:57,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:59:57,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:59:57,249 INFO L87 Difference]: Start difference. First operand 17667 states and 22490 transitions. Second operand 3 states. [2018-11-06 19:59:59,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:59:59,289 INFO L93 Difference]: Finished difference Result 40445 states and 51270 transitions. [2018-11-06 19:59:59,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:59:59,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 251 [2018-11-06 19:59:59,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:59:59,324 INFO L225 Difference]: With dead ends: 40445 [2018-11-06 19:59:59,324 INFO L226 Difference]: Without dead ends: 22780 [2018-11-06 19:59:59,345 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:59:59,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22780 states. [2018-11-06 19:59:59,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22780 to 22779. [2018-11-06 19:59:59,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22779 states. [2018-11-06 19:59:59,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22779 states to 22779 states and 28498 transitions. [2018-11-06 19:59:59,849 INFO L78 Accepts]: Start accepts. Automaton has 22779 states and 28498 transitions. Word has length 251 [2018-11-06 19:59:59,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:59:59,850 INFO L480 AbstractCegarLoop]: Abstraction has 22779 states and 28498 transitions. [2018-11-06 19:59:59,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:59:59,850 INFO L276 IsEmpty]: Start isEmpty. Operand 22779 states and 28498 transitions. [2018-11-06 19:59:59,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-11-06 19:59:59,889 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:59:59,890 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:59:59,890 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:59:59,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:59:59,891 INFO L82 PathProgramCache]: Analyzing trace with hash -231929504, now seen corresponding path program 1 times [2018-11-06 19:59:59,891 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:59:59,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:59:59,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:59,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:59,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:59,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:00:00,292 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 20:00:00,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 20:00:00,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 20:00:00,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 20:00:00,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 20:00:00,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 20:00:00,293 INFO L87 Difference]: Start difference. First operand 22779 states and 28498 transitions. Second operand 4 states. [2018-11-06 20:00:02,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 20:00:02,287 INFO L93 Difference]: Finished difference Result 54995 states and 68164 transitions. [2018-11-06 20:00:02,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 20:00:02,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 253 [2018-11-06 20:00:02,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 20:00:02,338 INFO L225 Difference]: With dead ends: 54995 [2018-11-06 20:00:02,339 INFO L226 Difference]: Without dead ends: 32218 [2018-11-06 20:00:02,366 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 20:00:02,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32218 states. [2018-11-06 20:00:02,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32218 to 23607. [2018-11-06 20:00:02,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23607 states. [2018-11-06 20:00:02,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23607 states to 23607 states and 29214 transitions. [2018-11-06 20:00:02,737 INFO L78 Accepts]: Start accepts. Automaton has 23607 states and 29214 transitions. Word has length 253 [2018-11-06 20:00:02,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 20:00:02,737 INFO L480 AbstractCegarLoop]: Abstraction has 23607 states and 29214 transitions. [2018-11-06 20:00:02,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 20:00:02,737 INFO L276 IsEmpty]: Start isEmpty. Operand 23607 states and 29214 transitions. [2018-11-06 20:00:02,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-11-06 20:00:02,762 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 20:00:02,762 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 20:00:02,763 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 20:00:02,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 20:00:02,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1756670744, now seen corresponding path program 1 times [2018-11-06 20:00:02,763 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 20:00:02,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 20:00:02,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:02,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:00:02,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:02,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:00:03,183 WARN L179 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-11-06 20:00:03,262 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 79 proven. 4 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-06 20:00:03,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 20:00:03,262 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 20:00:03,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:00:03,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:00:03,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 20:00:03,488 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 20:00:03,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 20:00:03,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-11-06 20:00:03,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 20:00:03,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 20:00:03,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-06 20:00:03,511 INFO L87 Difference]: Start difference. First operand 23607 states and 29214 transitions. Second operand 7 states. [2018-11-06 20:00:09,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 20:00:09,135 INFO L93 Difference]: Finished difference Result 54747 states and 67440 transitions. [2018-11-06 20:00:09,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-06 20:00:09,135 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 259 [2018-11-06 20:00:09,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 20:00:09,165 INFO L225 Difference]: With dead ends: 54747 [2018-11-06 20:00:09,165 INFO L226 Difference]: Without dead ends: 31142 [2018-11-06 20:00:09,183 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-11-06 20:00:09,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31142 states. [2018-11-06 20:00:09,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31142 to 30524. [2018-11-06 20:00:09,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30524 states. [2018-11-06 20:00:09,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30524 states to 30524 states and 34505 transitions. [2018-11-06 20:00:09,545 INFO L78 Accepts]: Start accepts. Automaton has 30524 states and 34505 transitions. Word has length 259 [2018-11-06 20:00:09,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 20:00:09,546 INFO L480 AbstractCegarLoop]: Abstraction has 30524 states and 34505 transitions. [2018-11-06 20:00:09,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 20:00:09,546 INFO L276 IsEmpty]: Start isEmpty. Operand 30524 states and 34505 transitions. [2018-11-06 20:00:09,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-11-06 20:00:09,565 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 20:00:09,565 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 20:00:09,566 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 20:00:09,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 20:00:09,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1340174540, now seen corresponding path program 1 times [2018-11-06 20:00:09,566 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 20:00:09,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 20:00:09,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:09,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:00:09,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:09,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:00:10,060 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 74 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 20:00:10,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 20:00:10,061 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 20:00:10,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:00:10,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:00:10,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 20:00:10,348 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 20:00:10,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 20:00:10,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-11-06 20:00:10,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 20:00:10,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 20:00:10,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-06 20:00:10,372 INFO L87 Difference]: Start difference. First operand 30524 states and 34505 transitions. Second operand 6 states. [2018-11-06 20:00:14,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 20:00:14,699 INFO L93 Difference]: Finished difference Result 85634 states and 96626 transitions. [2018-11-06 20:00:14,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-06 20:00:14,700 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 261 [2018-11-06 20:00:14,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 20:00:14,757 INFO L225 Difference]: With dead ends: 85634 [2018-11-06 20:00:14,758 INFO L226 Difference]: Without dead ends: 55112 [2018-11-06 20:00:14,785 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-06 20:00:14,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55112 states. [2018-11-06 20:00:15,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55112 to 49788. [2018-11-06 20:00:15,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49788 states. [2018-11-06 20:00:15,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49788 states to 49788 states and 55263 transitions. [2018-11-06 20:00:15,347 INFO L78 Accepts]: Start accepts. Automaton has 49788 states and 55263 transitions. Word has length 261 [2018-11-06 20:00:15,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 20:00:15,348 INFO L480 AbstractCegarLoop]: Abstraction has 49788 states and 55263 transitions. [2018-11-06 20:00:15,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 20:00:15,348 INFO L276 IsEmpty]: Start isEmpty. Operand 49788 states and 55263 transitions. [2018-11-06 20:00:15,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-11-06 20:00:15,360 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 20:00:15,360 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 20:00:15,361 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 20:00:15,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 20:00:15,361 INFO L82 PathProgramCache]: Analyzing trace with hash -404953050, now seen corresponding path program 1 times [2018-11-06 20:00:15,361 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 20:00:15,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 20:00:15,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:15,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:00:15,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:15,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:00:15,834 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 20:00:15,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 20:00:15,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 20:00:15,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 20:00:15,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 20:00:15,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 20:00:15,836 INFO L87 Difference]: Start difference. First operand 49788 states and 55263 transitions. Second operand 4 states. [2018-11-06 20:00:18,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 20:00:18,733 INFO L93 Difference]: Finished difference Result 99382 states and 110328 transitions. [2018-11-06 20:00:18,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 20:00:18,734 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 264 [2018-11-06 20:00:18,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 20:00:18,783 INFO L225 Difference]: With dead ends: 99382 [2018-11-06 20:00:18,784 INFO L226 Difference]: Without dead ends: 49596 [2018-11-06 20:00:18,810 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 20:00:18,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49596 states. [2018-11-06 20:00:19,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49596 to 49583. [2018-11-06 20:00:19,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49583 states. [2018-11-06 20:00:19,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49583 states to 49583 states and 54701 transitions. [2018-11-06 20:00:19,416 INFO L78 Accepts]: Start accepts. Automaton has 49583 states and 54701 transitions. Word has length 264 [2018-11-06 20:00:19,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 20:00:19,417 INFO L480 AbstractCegarLoop]: Abstraction has 49583 states and 54701 transitions. [2018-11-06 20:00:19,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 20:00:19,417 INFO L276 IsEmpty]: Start isEmpty. Operand 49583 states and 54701 transitions. [2018-11-06 20:00:19,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-11-06 20:00:19,445 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 20:00:19,446 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 20:00:19,446 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 20:00:19,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 20:00:19,447 INFO L82 PathProgramCache]: Analyzing trace with hash -692707392, now seen corresponding path program 1 times [2018-11-06 20:00:19,447 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 20:00:19,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 20:00:19,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:19,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:00:19,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:19,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:00:20,433 WARN L179 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2018-11-06 20:00:20,577 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 20:00:20,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 20:00:20,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 20:00:20,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 20:00:20,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 20:00:20,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 20:00:20,579 INFO L87 Difference]: Start difference. First operand 49583 states and 54701 transitions. Second operand 4 states. [2018-11-06 20:00:22,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 20:00:22,977 INFO L93 Difference]: Finished difference Result 109003 states and 119959 transitions. [2018-11-06 20:00:22,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 20:00:22,978 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 320 [2018-11-06 20:00:22,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 20:00:23,039 INFO L225 Difference]: With dead ends: 109003 [2018-11-06 20:00:23,039 INFO L226 Difference]: Without dead ends: 59422 [2018-11-06 20:00:23,071 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 20:00:23,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59422 states. [2018-11-06 20:00:23,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59422 to 51206. [2018-11-06 20:00:23,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51206 states. [2018-11-06 20:00:23,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51206 states to 51206 states and 55941 transitions. [2018-11-06 20:00:23,619 INFO L78 Accepts]: Start accepts. Automaton has 51206 states and 55941 transitions. Word has length 320 [2018-11-06 20:00:23,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 20:00:23,620 INFO L480 AbstractCegarLoop]: Abstraction has 51206 states and 55941 transitions. [2018-11-06 20:00:23,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 20:00:23,620 INFO L276 IsEmpty]: Start isEmpty. Operand 51206 states and 55941 transitions. [2018-11-06 20:00:23,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-11-06 20:00:23,640 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 20:00:23,640 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 20:00:23,641 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 20:00:23,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 20:00:23,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1045920108, now seen corresponding path program 1 times [2018-11-06 20:00:23,641 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 20:00:23,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 20:00:23,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:23,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:00:23,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:23,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:00:24,285 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 141 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 20:00:24,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 20:00:24,285 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 20:00:24,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:00:24,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:00:24,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 20:00:24,624 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 20:00:24,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 20:00:24,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-11-06 20:00:24,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-06 20:00:24,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-06 20:00:24,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-06 20:00:24,648 INFO L87 Difference]: Start difference. First operand 51206 states and 55941 transitions. Second operand 8 states. [2018-11-06 20:00:33,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 20:00:33,213 INFO L93 Difference]: Finished difference Result 124565 states and 135978 transitions. [2018-11-06 20:00:33,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-06 20:00:33,214 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 328 [2018-11-06 20:00:33,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 20:00:33,306 INFO L225 Difference]: With dead ends: 124565 [2018-11-06 20:00:33,307 INFO L226 Difference]: Without dead ends: 73361 [2018-11-06 20:00:33,344 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2018-11-06 20:00:33,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73361 states. [2018-11-06 20:00:34,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73361 to 69230. [2018-11-06 20:00:34,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69230 states. [2018-11-06 20:00:34,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69230 states to 69230 states and 75341 transitions. [2018-11-06 20:00:34,325 INFO L78 Accepts]: Start accepts. Automaton has 69230 states and 75341 transitions. Word has length 328 [2018-11-06 20:00:34,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 20:00:34,325 INFO L480 AbstractCegarLoop]: Abstraction has 69230 states and 75341 transitions. [2018-11-06 20:00:34,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-06 20:00:34,326 INFO L276 IsEmpty]: Start isEmpty. Operand 69230 states and 75341 transitions. [2018-11-06 20:00:34,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-11-06 20:00:34,354 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 20:00:34,355 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 20:00:34,355 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 20:00:34,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 20:00:34,355 INFO L82 PathProgramCache]: Analyzing trace with hash 814019458, now seen corresponding path program 1 times [2018-11-06 20:00:34,355 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 20:00:34,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 20:00:34,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:34,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:00:34,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:34,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:00:34,683 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-06 20:00:34,774 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-11-06 20:00:34,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 20:00:34,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 20:00:34,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 20:00:34,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 20:00:34,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 20:00:34,776 INFO L87 Difference]: Start difference. First operand 69230 states and 75341 transitions. Second operand 4 states. [2018-11-06 20:00:38,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 20:00:38,880 INFO L93 Difference]: Finished difference Result 249671 states and 271194 transitions. [2018-11-06 20:00:38,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 20:00:38,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 350 [2018-11-06 20:00:38,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 20:00:39,099 INFO L225 Difference]: With dead ends: 249671 [2018-11-06 20:00:39,100 INFO L226 Difference]: Without dead ends: 180443 [2018-11-06 20:00:39,157 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 20:00:39,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180443 states. [2018-11-06 20:00:40,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180443 to 180439. [2018-11-06 20:00:40,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180439 states. [2018-11-06 20:00:40,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180439 states to 180439 states and 195708 transitions. [2018-11-06 20:00:40,996 INFO L78 Accepts]: Start accepts. Automaton has 180439 states and 195708 transitions. Word has length 350 [2018-11-06 20:00:40,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 20:00:40,996 INFO L480 AbstractCegarLoop]: Abstraction has 180439 states and 195708 transitions. [2018-11-06 20:00:40,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 20:00:40,996 INFO L276 IsEmpty]: Start isEmpty. Operand 180439 states and 195708 transitions. [2018-11-06 20:00:41,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2018-11-06 20:00:41,013 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 20:00:41,013 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-11-06 20:00:41,014 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 20:00:41,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 20:00:41,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1125365127, now seen corresponding path program 1 times [2018-11-06 20:00:41,014 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 20:00:41,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 20:00:41,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:41,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:00:41,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:41,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:00:41,427 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-11-06 20:00:41,557 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2018-11-06 20:00:41,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 20:00:41,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 20:00:41,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 20:00:41,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 20:00:41,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 20:00:41,559 INFO L87 Difference]: Start difference. First operand 180439 states and 195708 transitions. Second operand 4 states. [2018-11-06 20:00:44,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 20:00:44,659 INFO L93 Difference]: Finished difference Result 367672 states and 398734 transitions. [2018-11-06 20:00:44,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 20:00:44,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 375 [2018-11-06 20:00:44,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 20:00:44,873 INFO L225 Difference]: With dead ends: 367672 [2018-11-06 20:00:44,873 INFO L226 Difference]: Without dead ends: 187235 [2018-11-06 20:00:44,967 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 20:00:45,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187235 states. [2018-11-06 20:00:46,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187235 to 180847. [2018-11-06 20:00:46,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180847 states. [2018-11-06 20:00:47,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180847 states to 180847 states and 195694 transitions. [2018-11-06 20:00:47,112 INFO L78 Accepts]: Start accepts. Automaton has 180847 states and 195694 transitions. Word has length 375 [2018-11-06 20:00:47,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 20:00:47,112 INFO L480 AbstractCegarLoop]: Abstraction has 180847 states and 195694 transitions. [2018-11-06 20:00:47,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 20:00:47,112 INFO L276 IsEmpty]: Start isEmpty. Operand 180847 states and 195694 transitions. [2018-11-06 20:00:47,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2018-11-06 20:00:47,130 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 20:00:47,131 INFO L375 BasicCegarLoop]: trace histogram [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, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 20:00:47,131 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 20:00:47,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 20:00:47,131 INFO L82 PathProgramCache]: Analyzing trace with hash 638135135, now seen corresponding path program 1 times [2018-11-06 20:00:47,131 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 20:00:47,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 20:00:47,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:47,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:00:47,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:47,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:00:47,454 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-11-06 20:00:47,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 20:00:47,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 20:00:47,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 20:00:47,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 20:00:47,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 20:00:47,456 INFO L87 Difference]: Start difference. First operand 180847 states and 195694 transitions. Second operand 4 states. [2018-11-06 20:00:51,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 20:00:51,078 INFO L93 Difference]: Finished difference Result 522978 states and 564274 transitions. [2018-11-06 20:00:51,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 20:00:51,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 381 [2018-11-06 20:00:51,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 20:00:51,549 INFO L225 Difference]: With dead ends: 522978 [2018-11-06 20:00:51,549 INFO L226 Difference]: Without dead ends: 342133 [2018-11-06 20:00:51,683 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 20:00:51,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342133 states. [2018-11-06 20:00:55,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342133 to 337419. [2018-11-06 20:00:55,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337419 states. [2018-11-06 20:00:56,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337419 states to 337419 states and 363526 transitions. [2018-11-06 20:00:56,077 INFO L78 Accepts]: Start accepts. Automaton has 337419 states and 363526 transitions. Word has length 381 [2018-11-06 20:00:56,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 20:00:56,077 INFO L480 AbstractCegarLoop]: Abstraction has 337419 states and 363526 transitions. [2018-11-06 20:00:56,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 20:00:56,077 INFO L276 IsEmpty]: Start isEmpty. Operand 337419 states and 363526 transitions. [2018-11-06 20:00:56,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2018-11-06 20:00:56,116 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 20:00:56,116 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 20:00:56,116 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 20:00:56,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 20:00:56,117 INFO L82 PathProgramCache]: Analyzing trace with hash 176181070, now seen corresponding path program 1 times [2018-11-06 20:00:56,117 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 20:00:56,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 20:00:56,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:56,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:00:56,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:56,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:00:56,429 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 20:00:56,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 20:00:56,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 20:00:56,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 20:00:56,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 20:00:56,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 20:00:56,431 INFO L87 Difference]: Start difference. First operand 337419 states and 363526 transitions. Second operand 3 states. [2018-11-06 20:01:01,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 20:01:01,376 INFO L93 Difference]: Finished difference Result 650675 states and 700804 transitions. [2018-11-06 20:01:01,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 20:01:01,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 381 [2018-11-06 20:01:01,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 20:01:01,740 INFO L225 Difference]: With dead ends: 650675 [2018-11-06 20:01:01,741 INFO L226 Difference]: Without dead ends: 313462 [2018-11-06 20:01:01,888 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 20:01:02,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313462 states. [2018-11-06 20:01:12,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313462 to 302208. [2018-11-06 20:01:12,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302208 states. [2018-11-06 20:01:13,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302208 states to 302208 states and 320903 transitions. [2018-11-06 20:01:13,531 INFO L78 Accepts]: Start accepts. Automaton has 302208 states and 320903 transitions. Word has length 381 [2018-11-06 20:01:13,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 20:01:13,531 INFO L480 AbstractCegarLoop]: Abstraction has 302208 states and 320903 transitions. [2018-11-06 20:01:13,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 20:01:13,531 INFO L276 IsEmpty]: Start isEmpty. Operand 302208 states and 320903 transitions. [2018-11-06 20:01:13,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2018-11-06 20:01:13,552 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 20:01:13,552 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 20:01:13,552 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 20:01:13,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 20:01:13,553 INFO L82 PathProgramCache]: Analyzing trace with hash 984790807, now seen corresponding path program 1 times [2018-11-06 20:01:13,553 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 20:01:13,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 20:01:13,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:01:13,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:01:13,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:01:13,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:01:14,054 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 269 proven. 10 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2018-11-06 20:01:14,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 20:01:14,055 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 20:01:14,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:01:14,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:01:14,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 20:01:14,440 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-11-06 20:01:14,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 20:01:14,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2018-11-06 20:01:14,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-06 20:01:14,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-06 20:01:14,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-06 20:01:14,481 INFO L87 Difference]: Start difference. First operand 302208 states and 320903 transitions. Second operand 8 states. [2018-11-06 20:01:14,816 WARN L179 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-11-06 20:01:33,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 20:01:33,871 INFO L93 Difference]: Finished difference Result 2173623 states and 2304691 transitions. [2018-11-06 20:01:33,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-06 20:01:33,871 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 409 [2018-11-06 20:01:33,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 20:01:38,899 INFO L225 Difference]: With dead ends: 2173623 [2018-11-06 20:01:38,899 INFO L226 Difference]: Without dead ends: 1849502 [2018-11-06 20:01:39,251 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 419 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2018-11-06 20:01:40,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1849502 states. [2018-11-06 20:02:11,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1849502 to 1126526. [2018-11-06 20:02:11,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1126526 states. [2018-11-06 20:02:15,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126526 states to 1126526 states and 1186868 transitions. [2018-11-06 20:02:15,096 INFO L78 Accepts]: Start accepts. Automaton has 1126526 states and 1186868 transitions. Word has length 409 [2018-11-06 20:02:15,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 20:02:15,097 INFO L480 AbstractCegarLoop]: Abstraction has 1126526 states and 1186868 transitions. [2018-11-06 20:02:15,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-06 20:02:15,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1126526 states and 1186868 transitions. [2018-11-06 20:02:15,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-11-06 20:02:15,123 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 20:02:15,123 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 20:02:15,123 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 20:02:15,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 20:02:15,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1535272811, now seen corresponding path program 1 times [2018-11-06 20:02:15,124 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 20:02:15,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 20:02:15,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:02:15,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:02:15,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:02:15,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:02:15,655 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 332 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-06 20:02:15,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 20:02:15,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 20:02:15,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 20:02:15,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 20:02:15,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 20:02:15,657 INFO L87 Difference]: Start difference. First operand 1126526 states and 1186868 transitions. Second operand 4 states. [2018-11-06 20:02:40,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 20:02:40,602 INFO L93 Difference]: Finished difference Result 2183831 states and 2302772 transitions. [2018-11-06 20:02:40,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 20:02:40,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 412 [2018-11-06 20:02:40,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 20:02:42,963 INFO L225 Difference]: With dead ends: 2183831 [2018-11-06 20:02:42,963 INFO L226 Difference]: Without dead ends: 1057511 [2018-11-06 20:02:43,273 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 20:02:43,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057511 states. Received shutdown request... [2018-11-06 20:02:45,891 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-06 20:02:45,895 WARN L205 ceAbstractionStarter]: Timeout [2018-11-06 20:02:45,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 08:02:45 BoogieIcfgContainer [2018-11-06 20:02:45,895 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 20:02:45,896 INFO L168 Benchmark]: Toolchain (without parser) took 198784.74 ms. Allocated memory was 1.5 GB in the beginning and 7.2 GB in the end (delta: 5.6 GB). Free memory was 1.4 GB in the beginning and 4.2 GB in the end (delta: -2.8 GB). Peak memory consumption was 5.3 GB. Max. memory is 7.1 GB. [2018-11-06 20:02:45,897 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 20:02:45,898 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1135.66 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2018-11-06 20:02:45,899 INFO L168 Benchmark]: Boogie Procedure Inliner took 302.48 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 760.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -861.2 MB). Peak memory consumption was 38.8 MB. Max. memory is 7.1 GB. [2018-11-06 20:02:45,899 INFO L168 Benchmark]: Boogie Preprocessor took 168.17 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 20:02:45,900 INFO L168 Benchmark]: RCFGBuilder took 5510.26 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 267.3 MB). Peak memory consumption was 267.3 MB. Max. memory is 7.1 GB. [2018-11-06 20:02:45,901 INFO L168 Benchmark]: TraceAbstraction took 191662.61 ms. Allocated memory was 2.3 GB in the beginning and 7.2 GB in the end (delta: 4.9 GB). Free memory was 2.0 GB in the beginning and 4.2 GB in the end (delta: -2.3 GB). Peak memory consumption was 5.0 GB. Max. memory is 7.1 GB. [2018-11-06 20:02:45,905 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.28 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 1135.66 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 302.48 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 760.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -861.2 MB). Peak memory consumption was 38.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 168.17 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 5510.26 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 267.3 MB). Peak memory consumption was 267.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 191662.61 ms. Allocated memory was 2.3 GB in the beginning and 7.2 GB in the end (delta: 4.9 GB). Free memory was 2.0 GB in the beginning and 4.2 GB in the end (delta: -2.3 GB). Peak memory consumption was 5.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1599]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1599). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 191.5s OverallTime, 20 OverallIterations, 7 TraceHistogramMax, 117.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5739 SDtfs, 20254 SDslu, 5118 SDs, 0 SdLazy, 29815 SolverSat, 5142 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 53.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1374 GetRequests, 1292 SyntacticMatches, 5 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1126526occurred in iteration=19, 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: 63.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 781827 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.8s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 6945 NumberOfCodeBlocks, 6945 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 6921 ConstructedInterpolants, 0 QuantifiedInterpolants, 5185682 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2201 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 24 InterpolantComputations, 20 PerfectInterpolantSequences, 3657/3679 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown