java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label58_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 15:02:36,248 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 15:02:36,251 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 15:02:36,265 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 15:02:36,266 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 15:02:36,267 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 15:02:36,268 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 15:02:36,270 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 15:02:36,272 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 15:02:36,273 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 15:02:36,274 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 15:02:36,274 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 15:02:36,275 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 15:02:36,276 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 15:02:36,279 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 15:02:36,279 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 15:02:36,280 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 15:02:36,282 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 15:02:36,291 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 15:02:36,292 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 15:02:36,294 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 15:02:36,295 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 15:02:36,300 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 15:02:36,301 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 15:02:36,301 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 15:02:36,305 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 15:02:36,306 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 15:02:36,307 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 15:02:36,311 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 15:02:36,312 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 15:02:36,312 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 15:02:36,313 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 15:02:36,314 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 15:02:36,316 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 15:02:36,317 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 15:02:36,317 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 15:02:36,318 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-24 15:02:36,347 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 15:02:36,348 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 15:02:36,350 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 15:02:36,350 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 15:02:36,352 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 15:02:36,352 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 15:02:36,352 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 15:02:36,353 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 15:02:36,353 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 15:02:36,353 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 15:02:36,353 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 15:02:36,353 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 15:02:36,353 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 15:02:36,354 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 15:02:36,354 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 15:02:36,354 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 15:02:36,355 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 15:02:36,355 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 15:02:36,355 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 15:02:36,355 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 15:02:36,355 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 15:02:36,356 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 15:02:36,356 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 15:02:36,356 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 15:02:36,356 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 15:02:36,356 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 15:02:36,357 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 15:02:36,358 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 15:02:36,429 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 15:02:36,448 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 15:02:36,453 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 15:02:36,455 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 15:02:36,456 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 15:02:36,457 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label58_true-unreach-call.c [2018-10-24 15:02:36,521 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/57e52b740/9d575e8c4dbd4bd9a7298bc52f5dac64/FLAGd9331966b [2018-10-24 15:02:37,270 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 15:02:37,274 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label58_true-unreach-call.c [2018-10-24 15:02:37,310 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/57e52b740/9d575e8c4dbd4bd9a7298bc52f5dac64/FLAGd9331966b [2018-10-24 15:02:37,333 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/57e52b740/9d575e8c4dbd4bd9a7298bc52f5dac64 [2018-10-24 15:02:37,347 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 15:02:37,349 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 15:02:37,350 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 15:02:37,350 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 15:02:37,356 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 15:02:37,357 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:02:37" (1/1) ... [2018-10-24 15:02:37,361 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76f0772 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:02:37, skipping insertion in model container [2018-10-24 15:02:37,361 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:02:37" (1/1) ... [2018-10-24 15:02:37,372 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 15:02:37,476 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 15:02:38,195 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 15:02:38,201 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 15:02:38,543 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 15:02:38,564 INFO L193 MainTranslator]: Completed translation [2018-10-24 15:02:38,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:02:38 WrapperNode [2018-10-24 15:02:38,564 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 15:02:38,565 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 15:02:38,566 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 15:02:38,566 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 15:02:38,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:02:38" (1/1) ... [2018-10-24 15:02:38,615 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:02:38" (1/1) ... [2018-10-24 15:02:38,879 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 15:02:38,880 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 15:02:38,880 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 15:02:38,880 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 15:02:38,892 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:02:38" (1/1) ... [2018-10-24 15:02:38,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:02:38" (1/1) ... [2018-10-24 15:02:38,900 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:02:38" (1/1) ... [2018-10-24 15:02:38,900 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:02:38" (1/1) ... [2018-10-24 15:02:38,968 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:02:38" (1/1) ... [2018-10-24 15:02:38,998 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:02:38" (1/1) ... [2018-10-24 15:02:39,017 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:02:38" (1/1) ... [2018-10-24 15:02:39,030 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 15:02:39,031 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 15:02:39,031 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 15:02:39,032 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 15:02:39,033 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:02:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 15:02:39,109 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 15:02:39,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 15:02:39,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 15:02:44,937 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 15:02:44,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:02:44 BoogieIcfgContainer [2018-10-24 15:02:44,938 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 15:02:44,939 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 15:02:44,940 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 15:02:44,943 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 15:02:44,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 03:02:37" (1/3) ... [2018-10-24 15:02:44,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68f5e857 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:02:44, skipping insertion in model container [2018-10-24 15:02:44,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:02:38" (2/3) ... [2018-10-24 15:02:44,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68f5e857 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:02:44, skipping insertion in model container [2018-10-24 15:02:44,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:02:44" (3/3) ... [2018-10-24 15:02:44,949 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label58_true-unreach-call.c [2018-10-24 15:02:44,960 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 15:02:44,979 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 15:02:44,998 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 15:02:45,053 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 15:02:45,054 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 15:02:45,054 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 15:02:45,054 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 15:02:45,054 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 15:02:45,055 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 15:02:45,055 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 15:02:45,055 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 15:02:45,055 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 15:02:45,082 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-24 15:02:45,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-10-24 15:02:45,100 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:02:45,102 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] [2018-10-24 15:02:45,104 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:02:45,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:02:45,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1203458046, now seen corresponding path program 1 times [2018-10-24 15:02:45,114 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:02:45,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:02:45,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:45,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:02:45,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:02:45,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 15:02:45,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:02:45,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 15:02:45,948 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:02:45,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:02:45,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:02:45,969 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 3 states. [2018-10-24 15:02:48,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:02:48,069 INFO L93 Difference]: Finished difference Result 832 states and 1481 transitions. [2018-10-24 15:02:48,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:02:48,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2018-10-24 15:02:48,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:02:48,100 INFO L225 Difference]: With dead ends: 832 [2018-10-24 15:02:48,100 INFO L226 Difference]: Without dead ends: 525 [2018-10-24 15:02:48,106 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:02:48,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2018-10-24 15:02:48,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 511. [2018-10-24 15:02:48,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2018-10-24 15:02:48,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 878 transitions. [2018-10-24 15:02:48,196 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 878 transitions. Word has length 161 [2018-10-24 15:02:48,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:02:48,197 INFO L481 AbstractCegarLoop]: Abstraction has 511 states and 878 transitions. [2018-10-24 15:02:48,198 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:02:48,198 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 878 transitions. [2018-10-24 15:02:48,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-10-24 15:02:48,204 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:02:48,204 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] [2018-10-24 15:02:48,205 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:02:48,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:02:48,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1307036209, now seen corresponding path program 1 times [2018-10-24 15:02:48,205 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:02:48,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:02:48,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:48,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:02:48,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:48,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:02:48,432 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 15:02:48,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:02:48,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:02:48,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:02:48,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:02:48,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:02:48,436 INFO L87 Difference]: Start difference. First operand 511 states and 878 transitions. Second operand 4 states. [2018-10-24 15:02:54,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:02:54,137 INFO L93 Difference]: Finished difference Result 1892 states and 3348 transitions. [2018-10-24 15:02:54,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:02:54,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2018-10-24 15:02:54,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:02:54,149 INFO L225 Difference]: With dead ends: 1892 [2018-10-24 15:02:54,149 INFO L226 Difference]: Without dead ends: 1383 [2018-10-24 15:02:54,153 INFO L605 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-10-24 15:02:54,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2018-10-24 15:02:54,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 923. [2018-10-24 15:02:54,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-10-24 15:02:54,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1514 transitions. [2018-10-24 15:02:54,238 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1514 transitions. Word has length 167 [2018-10-24 15:02:54,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:02:54,238 INFO L481 AbstractCegarLoop]: Abstraction has 923 states and 1514 transitions. [2018-10-24 15:02:54,239 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:02:54,239 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1514 transitions. [2018-10-24 15:02:54,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-24 15:02:54,245 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:02:54,245 INFO L375 BasicCegarLoop]: trace histogram [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-10-24 15:02:54,246 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:02:54,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:02:54,246 INFO L82 PathProgramCache]: Analyzing trace with hash -161212219, now seen corresponding path program 1 times [2018-10-24 15:02:54,246 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:02:54,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:02:54,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:54,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:02:54,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:54,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:02:54,393 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 15:02:54,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:02:54,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 15:02:54,395 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:02:54,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:02:54,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:02:54,396 INFO L87 Difference]: Start difference. First operand 923 states and 1514 transitions. Second operand 3 states. [2018-10-24 15:02:55,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:02:55,969 INFO L93 Difference]: Finished difference Result 1823 states and 2997 transitions. [2018-10-24 15:02:55,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:02:55,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2018-10-24 15:02:55,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:02:55,977 INFO L225 Difference]: With dead ends: 1823 [2018-10-24 15:02:55,977 INFO L226 Difference]: Without dead ends: 902 [2018-10-24 15:02:55,979 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:02:55,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2018-10-24 15:02:56,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 902. [2018-10-24 15:02:56,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 902 states. [2018-10-24 15:02:56,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1435 transitions. [2018-10-24 15:02:56,004 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1435 transitions. Word has length 175 [2018-10-24 15:02:56,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:02:56,004 INFO L481 AbstractCegarLoop]: Abstraction has 902 states and 1435 transitions. [2018-10-24 15:02:56,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:02:56,004 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1435 transitions. [2018-10-24 15:02:56,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-10-24 15:02:56,010 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:02:56,010 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:02:56,010 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:02:56,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:02:56,013 INFO L82 PathProgramCache]: Analyzing trace with hash -632556310, now seen corresponding path program 1 times [2018-10-24 15:02:56,014 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:02:56,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:02:56,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:56,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:02:56,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:56,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:02:56,222 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-24 15:02:56,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:02:56,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:02:56,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:02:56,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:02:56,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:02:56,224 INFO L87 Difference]: Start difference. First operand 902 states and 1435 transitions. Second operand 4 states. [2018-10-24 15:02:58,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:02:58,820 INFO L93 Difference]: Finished difference Result 3477 states and 5598 transitions. [2018-10-24 15:02:58,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:02:58,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2018-10-24 15:02:58,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:02:58,834 INFO L225 Difference]: With dead ends: 3477 [2018-10-24 15:02:58,834 INFO L226 Difference]: Without dead ends: 2577 [2018-10-24 15:02:58,837 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:02:58,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2577 states. [2018-10-24 15:02:58,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2577 to 1723. [2018-10-24 15:02:58,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1723 states. [2018-10-24 15:02:58,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2603 transitions. [2018-10-24 15:02:58,885 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2603 transitions. Word has length 177 [2018-10-24 15:02:58,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:02:58,885 INFO L481 AbstractCegarLoop]: Abstraction has 1723 states and 2603 transitions. [2018-10-24 15:02:58,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:02:58,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2603 transitions. [2018-10-24 15:02:58,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-24 15:02:58,890 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:02:58,891 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:02:58,891 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:02:58,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:02:58,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1264201284, now seen corresponding path program 1 times [2018-10-24 15:02:58,892 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:02:58,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:02:58,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:58,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:02:58,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:58,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:02:59,048 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-24 15:02:59,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:02:59,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 15:02:59,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:02:59,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:02:59,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:02:59,050 INFO L87 Difference]: Start difference. First operand 1723 states and 2603 transitions. Second operand 3 states. [2018-10-24 15:03:00,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:03:00,286 INFO L93 Difference]: Finished difference Result 4273 states and 6419 transitions. [2018-10-24 15:03:00,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:03:00,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2018-10-24 15:03:00,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:03:00,300 INFO L225 Difference]: With dead ends: 4273 [2018-10-24 15:03:00,300 INFO L226 Difference]: Without dead ends: 2552 [2018-10-24 15:03:00,303 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:03:00,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2018-10-24 15:03:00,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 2551. [2018-10-24 15:03:00,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2551 states. [2018-10-24 15:03:00,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2551 states to 2551 states and 3792 transitions. [2018-10-24 15:03:00,353 INFO L78 Accepts]: Start accepts. Automaton has 2551 states and 3792 transitions. Word has length 180 [2018-10-24 15:03:00,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:03:00,353 INFO L481 AbstractCegarLoop]: Abstraction has 2551 states and 3792 transitions. [2018-10-24 15:03:00,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:03:00,354 INFO L276 IsEmpty]: Start isEmpty. Operand 2551 states and 3792 transitions. [2018-10-24 15:03:00,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-24 15:03:00,360 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:03:00,360 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2018-10-24 15:03:00,360 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:03:00,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:03:00,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1447699458, now seen corresponding path program 1 times [2018-10-24 15:03:00,361 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:03:00,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:03:00,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:00,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:03:00,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:00,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:03:00,486 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-24 15:03:00,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:03:00,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 15:03:00,488 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:03:00,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:03:00,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:03:00,488 INFO L87 Difference]: Start difference. First operand 2551 states and 3792 transitions. Second operand 3 states. [2018-10-24 15:03:01,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:03:01,604 INFO L93 Difference]: Finished difference Result 7640 states and 11360 transitions. [2018-10-24 15:03:01,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:03:01,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2018-10-24 15:03:01,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:03:01,631 INFO L225 Difference]: With dead ends: 7640 [2018-10-24 15:03:01,632 INFO L226 Difference]: Without dead ends: 5091 [2018-10-24 15:03:01,638 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:03:01,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5091 states. [2018-10-24 15:03:01,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5091 to 5089. [2018-10-24 15:03:01,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5089 states. [2018-10-24 15:03:01,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5089 states to 5089 states and 7560 transitions. [2018-10-24 15:03:01,755 INFO L78 Accepts]: Start accepts. Automaton has 5089 states and 7560 transitions. Word has length 184 [2018-10-24 15:03:01,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:03:01,755 INFO L481 AbstractCegarLoop]: Abstraction has 5089 states and 7560 transitions. [2018-10-24 15:03:01,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:03:01,756 INFO L276 IsEmpty]: Start isEmpty. Operand 5089 states and 7560 transitions. [2018-10-24 15:03:01,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-24 15:03:01,763 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:03:01,764 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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] [2018-10-24 15:03:01,764 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:03:01,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:03:01,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1313542557, now seen corresponding path program 1 times [2018-10-24 15:03:01,765 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:03:01,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:03:01,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:01,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:03:01,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:01,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:03:01,888 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 15:03:01,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:03:01,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:03:01,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:03:01,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:03:01,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:03:01,891 INFO L87 Difference]: Start difference. First operand 5089 states and 7560 transitions. Second operand 3 states. [2018-10-24 15:03:04,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:03:04,152 INFO L93 Difference]: Finished difference Result 14871 states and 22177 transitions. [2018-10-24 15:03:04,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:03:04,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2018-10-24 15:03:04,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:03:04,190 INFO L225 Difference]: With dead ends: 14871 [2018-10-24 15:03:04,191 INFO L226 Difference]: Without dead ends: 9784 [2018-10-24 15:03:04,202 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:03:04,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9784 states. [2018-10-24 15:03:04,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9784 to 9782. [2018-10-24 15:03:04,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9782 states. [2018-10-24 15:03:04,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9782 states to 9782 states and 13465 transitions. [2018-10-24 15:03:04,401 INFO L78 Accepts]: Start accepts. Automaton has 9782 states and 13465 transitions. Word has length 186 [2018-10-24 15:03:04,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:03:04,402 INFO L481 AbstractCegarLoop]: Abstraction has 9782 states and 13465 transitions. [2018-10-24 15:03:04,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:03:04,402 INFO L276 IsEmpty]: Start isEmpty. Operand 9782 states and 13465 transitions. [2018-10-24 15:03:04,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-24 15:03:04,413 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:03:04,413 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:03:04,414 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:03:04,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:03:04,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1878651544, now seen corresponding path program 2 times [2018-10-24 15:03:04,414 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:03:04,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:03:04,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:04,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:03:04,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:04,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:03:04,529 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 15:03:04,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:03:04,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:03:04,531 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:03:04,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:03:04,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:03:04,532 INFO L87 Difference]: Start difference. First operand 9782 states and 13465 transitions. Second operand 3 states. [2018-10-24 15:03:06,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:03:06,870 INFO L93 Difference]: Finished difference Result 27930 states and 38574 transitions. [2018-10-24 15:03:06,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:03:06,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2018-10-24 15:03:06,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:03:06,928 INFO L225 Difference]: With dead ends: 27930 [2018-10-24 15:03:06,928 INFO L226 Difference]: Without dead ends: 18150 [2018-10-24 15:03:06,944 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:03:06,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18150 states. [2018-10-24 15:03:07,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18150 to 18146. [2018-10-24 15:03:07,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18146 states. [2018-10-24 15:03:07,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18146 states to 18146 states and 22636 transitions. [2018-10-24 15:03:07,464 INFO L78 Accepts]: Start accepts. Automaton has 18146 states and 22636 transitions. Word has length 188 [2018-10-24 15:03:07,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:03:07,464 INFO L481 AbstractCegarLoop]: Abstraction has 18146 states and 22636 transitions. [2018-10-24 15:03:07,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:03:07,464 INFO L276 IsEmpty]: Start isEmpty. Operand 18146 states and 22636 transitions. [2018-10-24 15:03:07,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-24 15:03:07,487 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:03:07,487 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:03:07,487 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:03:07,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:03:07,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1084271195, now seen corresponding path program 1 times [2018-10-24 15:03:07,488 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:03:07,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:03:07,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:07,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 15:03:07,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:07,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:03:07,634 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-24 15:03:07,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:03:07,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:03:07,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:03:07,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:03:07,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:03:07,636 INFO L87 Difference]: Start difference. First operand 18146 states and 22636 transitions. Second operand 4 states. [2018-10-24 15:03:09,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:03:09,356 INFO L93 Difference]: Finished difference Result 35880 states and 44699 transitions. [2018-10-24 15:03:09,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:03:09,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 206 [2018-10-24 15:03:09,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:03:09,402 INFO L225 Difference]: With dead ends: 35880 [2018-10-24 15:03:09,402 INFO L226 Difference]: Without dead ends: 17736 [2018-10-24 15:03:09,422 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:03:09,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17736 states. [2018-10-24 15:03:09,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17736 to 17734. [2018-10-24 15:03:09,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17734 states. [2018-10-24 15:03:09,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17734 states to 17734 states and 21102 transitions. [2018-10-24 15:03:09,691 INFO L78 Accepts]: Start accepts. Automaton has 17734 states and 21102 transitions. Word has length 206 [2018-10-24 15:03:09,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:03:09,691 INFO L481 AbstractCegarLoop]: Abstraction has 17734 states and 21102 transitions. [2018-10-24 15:03:09,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:03:09,692 INFO L276 IsEmpty]: Start isEmpty. Operand 17734 states and 21102 transitions. [2018-10-24 15:03:09,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-10-24 15:03:09,717 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:03:09,717 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:03:09,717 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:03:09,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:03:09,718 INFO L82 PathProgramCache]: Analyzing trace with hash 939934429, now seen corresponding path program 1 times [2018-10-24 15:03:09,718 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:03:09,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:03:09,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:09,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:03:09,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:09,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:03:10,188 WARN L179 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-10-24 15:03:10,260 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 87 proven. 4 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-24 15:03:10,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 15:03:10,260 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 15:03:10,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:03:10,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:03:10,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 15:03:10,592 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-24 15:03:10,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 15:03:10,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-10-24 15:03:10,628 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 15:03:10,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 15:03:10,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-24 15:03:10,631 INFO L87 Difference]: Start difference. First operand 17734 states and 21102 transitions. Second operand 7 states. [2018-10-24 15:03:20,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:03:20,757 INFO L93 Difference]: Finished difference Result 76878 states and 91858 transitions. [2018-10-24 15:03:20,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-24 15:03:20,758 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 232 [2018-10-24 15:03:20,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:03:20,876 INFO L225 Difference]: With dead ends: 76878 [2018-10-24 15:03:20,877 INFO L226 Difference]: Without dead ends: 59146 [2018-10-24 15:03:20,908 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-10-24 15:03:20,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59146 states. [2018-10-24 15:03:21,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59146 to 57510. [2018-10-24 15:03:21,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57510 states. [2018-10-24 15:03:21,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57510 states to 57510 states and 65040 transitions. [2018-10-24 15:03:21,964 INFO L78 Accepts]: Start accepts. Automaton has 57510 states and 65040 transitions. Word has length 232 [2018-10-24 15:03:21,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:03:21,965 INFO L481 AbstractCegarLoop]: Abstraction has 57510 states and 65040 transitions. [2018-10-24 15:03:21,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 15:03:21,965 INFO L276 IsEmpty]: Start isEmpty. Operand 57510 states and 65040 transitions. [2018-10-24 15:03:22,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-10-24 15:03:22,046 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:03:22,046 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 15:03:22,047 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:03:22,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:03:22,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1191696217, now seen corresponding path program 1 times [2018-10-24 15:03:22,047 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:03:22,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:03:22,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:22,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:03:22,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:22,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:03:22,614 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-24 15:03:22,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:03:22,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:03:22,616 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:03:22,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:03:22,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:03:22,617 INFO L87 Difference]: Start difference. First operand 57510 states and 65040 transitions. Second operand 3 states. [2018-10-24 15:03:24,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:03:24,502 INFO L93 Difference]: Finished difference Result 111948 states and 126719 transitions. [2018-10-24 15:03:24,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:03:24,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 294 [2018-10-24 15:03:24,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:03:24,553 INFO L225 Difference]: With dead ends: 111948 [2018-10-24 15:03:24,553 INFO L226 Difference]: Without dead ends: 54440 [2018-10-24 15:03:24,589 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:03:24,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54440 states. [2018-10-24 15:03:25,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54440 to 54434. [2018-10-24 15:03:25,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54434 states. [2018-10-24 15:03:25,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54434 states to 54434 states and 59941 transitions. [2018-10-24 15:03:25,282 INFO L78 Accepts]: Start accepts. Automaton has 54434 states and 59941 transitions. Word has length 294 [2018-10-24 15:03:25,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:03:25,282 INFO L481 AbstractCegarLoop]: Abstraction has 54434 states and 59941 transitions. [2018-10-24 15:03:25,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:03:25,283 INFO L276 IsEmpty]: Start isEmpty. Operand 54434 states and 59941 transitions. [2018-10-24 15:03:25,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-10-24 15:03:25,332 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:03:25,333 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 15:03:25,333 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:03:25,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:03:25,333 INFO L82 PathProgramCache]: Analyzing trace with hash -572156507, now seen corresponding path program 1 times [2018-10-24 15:03:25,334 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:03:25,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:03:25,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:25,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:03:25,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:25,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:03:25,593 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2018-10-24 15:03:25,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:03:25,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 15:03:25,594 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 15:03:25,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 15:03:25,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 15:03:25,594 INFO L87 Difference]: Start difference. First operand 54434 states and 59941 transitions. Second operand 5 states. [2018-10-24 15:03:28,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:03:28,275 INFO L93 Difference]: Finished difference Result 112792 states and 124338 transitions. [2018-10-24 15:03:28,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 15:03:28,275 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 336 [2018-10-24 15:03:28,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:03:28,330 INFO L225 Difference]: With dead ends: 112792 [2018-10-24 15:03:28,331 INFO L226 Difference]: Without dead ends: 58360 [2018-10-24 15:03:28,359 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 15:03:28,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58360 states. [2018-10-24 15:03:28,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58360 to 54838. [2018-10-24 15:03:28,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54838 states. [2018-10-24 15:03:28,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54838 states to 54838 states and 60222 transitions. [2018-10-24 15:03:28,976 INFO L78 Accepts]: Start accepts. Automaton has 54838 states and 60222 transitions. Word has length 336 [2018-10-24 15:03:28,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:03:28,976 INFO L481 AbstractCegarLoop]: Abstraction has 54838 states and 60222 transitions. [2018-10-24 15:03:28,976 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 15:03:28,976 INFO L276 IsEmpty]: Start isEmpty. Operand 54838 states and 60222 transitions. [2018-10-24 15:03:29,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-10-24 15:03:29,011 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:03:29,011 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 15:03:29,011 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:03:29,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:03:29,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1004908900, now seen corresponding path program 1 times [2018-10-24 15:03:29,012 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:03:29,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:03:29,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:29,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:03:29,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:29,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:03:29,435 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-10-24 15:03:29,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:03:29,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:03:29,436 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:03:29,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:03:29,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:03:29,437 INFO L87 Difference]: Start difference. First operand 54838 states and 60222 transitions. Second operand 4 states. [2018-10-24 15:03:31,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:03:31,772 INFO L93 Difference]: Finished difference Result 167935 states and 184282 transitions. [2018-10-24 15:03:31,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:03:31,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 362 [2018-10-24 15:03:31,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:03:31,897 INFO L225 Difference]: With dead ends: 167935 [2018-10-24 15:03:31,898 INFO L226 Difference]: Without dead ends: 113099 [2018-10-24 15:03:31,948 INFO L605 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-10-24 15:03:32,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113099 states. [2018-10-24 15:03:33,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113099 to 87062. [2018-10-24 15:03:33,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87062 states. [2018-10-24 15:03:33,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87062 states to 87062 states and 95038 transitions. [2018-10-24 15:03:33,464 INFO L78 Accepts]: Start accepts. Automaton has 87062 states and 95038 transitions. Word has length 362 [2018-10-24 15:03:33,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:03:33,464 INFO L481 AbstractCegarLoop]: Abstraction has 87062 states and 95038 transitions. [2018-10-24 15:03:33,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:03:33,464 INFO L276 IsEmpty]: Start isEmpty. Operand 87062 states and 95038 transitions. [2018-10-24 15:03:33,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2018-10-24 15:03:33,506 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:03:33,507 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 15:03:33,507 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:03:33,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:03:33,507 INFO L82 PathProgramCache]: Analyzing trace with hash -459397716, now seen corresponding path program 1 times [2018-10-24 15:03:33,507 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:03:33,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:03:33,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:33,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:03:33,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:33,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:03:33,990 WARN L179 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-10-24 15:03:34,119 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2018-10-24 15:03:34,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:03:34,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 15:03:34,120 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:03:34,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:03:34,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:03:34,121 INFO L87 Difference]: Start difference. First operand 87062 states and 95038 transitions. Second operand 4 states. [2018-10-24 15:03:37,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:03:37,305 INFO L93 Difference]: Finished difference Result 177616 states and 193734 transitions. [2018-10-24 15:03:37,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:03:37,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 365 [2018-10-24 15:03:37,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:03:37,444 INFO L225 Difference]: With dead ends: 177616 [2018-10-24 15:03:37,445 INFO L226 Difference]: Without dead ends: 90556 [2018-10-24 15:03:37,512 INFO L605 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-10-24 15:03:37,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90556 states. [2018-10-24 15:03:38,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90556 to 87061. [2018-10-24 15:03:38,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87061 states. [2018-10-24 15:03:39,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87061 states to 87061 states and 94704 transitions. [2018-10-24 15:03:39,793 INFO L78 Accepts]: Start accepts. Automaton has 87061 states and 94704 transitions. Word has length 365 [2018-10-24 15:03:39,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:03:39,793 INFO L481 AbstractCegarLoop]: Abstraction has 87061 states and 94704 transitions. [2018-10-24 15:03:39,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:03:39,793 INFO L276 IsEmpty]: Start isEmpty. Operand 87061 states and 94704 transitions. [2018-10-24 15:03:39,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2018-10-24 15:03:39,849 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:03:39,850 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:03:39,850 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:03:39,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:03:39,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1828943484, now seen corresponding path program 1 times [2018-10-24 15:03:39,851 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:03:39,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:03:39,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:39,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:03:39,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:39,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:03:40,227 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2018-10-24 15:03:40,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:03:40,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:03:40,228 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:03:40,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:03:40,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:03:40,229 INFO L87 Difference]: Start difference. First operand 87061 states and 94704 transitions. Second operand 4 states. [2018-10-24 15:03:43,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:03:43,262 INFO L93 Difference]: Finished difference Result 254578 states and 276221 transitions. [2018-10-24 15:03:43,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:03:43,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 371 [2018-10-24 15:03:43,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:03:43,459 INFO L225 Difference]: With dead ends: 254578 [2018-10-24 15:03:43,459 INFO L226 Difference]: Without dead ends: 167519 [2018-10-24 15:03:43,535 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:03:43,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167519 states. [2018-10-24 15:03:44,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167519 to 163228. [2018-10-24 15:03:44,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163228 states. [2018-10-24 15:03:45,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163228 states to 163228 states and 176899 transitions. [2018-10-24 15:03:45,184 INFO L78 Accepts]: Start accepts. Automaton has 163228 states and 176899 transitions. Word has length 371 [2018-10-24 15:03:45,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:03:45,184 INFO L481 AbstractCegarLoop]: Abstraction has 163228 states and 176899 transitions. [2018-10-24 15:03:45,184 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:03:45,185 INFO L276 IsEmpty]: Start isEmpty. Operand 163228 states and 176899 transitions. [2018-10-24 15:03:45,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2018-10-24 15:03:45,249 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:03:45,249 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-24 15:03:45,250 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:03:45,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:03:45,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1063794315, now seen corresponding path program 1 times [2018-10-24 15:03:45,250 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:03:45,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:03:45,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:45,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:03:45,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:46,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:03:46,942 WARN L179 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-10-24 15:03:47,111 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-10-24 15:03:47,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:03:47,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 15:03:47,112 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 15:03:47,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 15:03:47,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 15:03:47,113 INFO L87 Difference]: Start difference. First operand 163228 states and 176899 transitions. Second operand 5 states. [2018-10-24 15:03:52,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:03:52,700 INFO L93 Difference]: Finished difference Result 578114 states and 628235 transitions. [2018-10-24 15:03:52,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 15:03:52,701 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 383 [2018-10-24 15:03:52,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:03:53,244 INFO L225 Difference]: With dead ends: 578114 [2018-10-24 15:03:53,244 INFO L226 Difference]: Without dead ends: 414888 [2018-10-24 15:03:53,408 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 15:03:53,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414888 states. [2018-10-24 15:03:59,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414888 to 326218. [2018-10-24 15:03:59,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326218 states. [2018-10-24 15:04:00,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326218 states to 326218 states and 354335 transitions. [2018-10-24 15:04:00,165 INFO L78 Accepts]: Start accepts. Automaton has 326218 states and 354335 transitions. Word has length 383 [2018-10-24 15:04:00,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:04:00,165 INFO L481 AbstractCegarLoop]: Abstraction has 326218 states and 354335 transitions. [2018-10-24 15:04:00,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 15:04:00,165 INFO L276 IsEmpty]: Start isEmpty. Operand 326218 states and 354335 transitions. [2018-10-24 15:04:00,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-10-24 15:04:00,194 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:04:00,195 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:04:00,195 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:04:00,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:04:00,195 INFO L82 PathProgramCache]: Analyzing trace with hash -288142344, now seen corresponding path program 1 times [2018-10-24 15:04:00,196 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:04:00,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:04:00,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:04:00,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:04:00,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:04:00,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:04:00,611 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 226 proven. 10 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2018-10-24 15:04:00,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 15:04:00,612 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 15:04:00,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:04:00,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:04:00,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 15:04:00,935 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-10-24 15:04:00,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 15:04:00,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2018-10-24 15:04:00,958 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 15:04:00,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 15:04:00,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-10-24 15:04:00,959 INFO L87 Difference]: Start difference. First operand 326218 states and 354335 transitions. Second operand 8 states. [2018-10-24 15:04:30,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:04:30,944 INFO L93 Difference]: Finished difference Result 2959481 states and 3209997 transitions. [2018-10-24 15:04:30,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-24 15:04:30,944 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 392 [2018-10-24 15:04:30,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:04:35,268 INFO L225 Difference]: With dead ends: 2959481 [2018-10-24 15:04:35,268 INFO L226 Difference]: Without dead ends: 2633469 [2018-10-24 15:04:35,642 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 391 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2018-10-24 15:04:37,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2633469 states. [2018-10-24 15:05:21,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2633469 to 1699314. [2018-10-24 15:05:21,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1699314 states. [2018-10-24 15:05:48,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699314 states to 1699314 states and 1829095 transitions. [2018-10-24 15:05:48,715 INFO L78 Accepts]: Start accepts. Automaton has 1699314 states and 1829095 transitions. Word has length 392 [2018-10-24 15:05:48,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:05:48,716 INFO L481 AbstractCegarLoop]: Abstraction has 1699314 states and 1829095 transitions. [2018-10-24 15:05:48,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 15:05:48,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1699314 states and 1829095 transitions. [2018-10-24 15:05:48,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2018-10-24 15:05:48,804 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:05:48,804 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 15:05:48,804 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:05:48,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:05:48,805 INFO L82 PathProgramCache]: Analyzing trace with hash -662806004, now seen corresponding path program 1 times [2018-10-24 15:05:48,805 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:05:48,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:05:48,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:05:48,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:05:48,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:05:48,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:05:49,192 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2018-10-24 15:05:49,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:05:49,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 15:05:49,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:05:49,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:05:49,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:05:49,194 INFO L87 Difference]: Start difference. First operand 1699314 states and 1829095 transitions. Second operand 4 states. Received shutdown request... [2018-10-24 15:05:56,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:05:56,588 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 15:05:56,593 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 15:05:56,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 03:05:56 BoogieIcfgContainer [2018-10-24 15:05:56,593 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 15:05:56,594 INFO L168 Benchmark]: Toolchain (without parser) took 199246.92 ms. Allocated memory was 1.5 GB in the beginning and 7.1 GB in the end (delta: 5.6 GB). Free memory was 1.4 GB in the beginning and 4.6 GB in the end (delta: -3.2 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-10-24 15:05:56,595 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 15:05:56,596 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1214.87 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2018-10-24 15:05:56,596 INFO L168 Benchmark]: Boogie Procedure Inliner took 313.92 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 736.1 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -869.4 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. [2018-10-24 15:05:56,597 INFO L168 Benchmark]: Boogie Preprocessor took 151.22 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2018-10-24 15:05:56,598 INFO L168 Benchmark]: RCFGBuilder took 5907.24 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 274.6 MB). Peak memory consumption was 274.6 MB. Max. memory is 7.1 GB. [2018-10-24 15:05:56,599 INFO L168 Benchmark]: TraceAbstraction took 191653.90 ms. Allocated memory was 2.2 GB in the beginning and 7.1 GB in the end (delta: 4.9 GB). Free memory was 1.9 GB in the beginning and 4.6 GB in the end (delta: -2.7 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-10-24 15:05:56,604 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.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1214.87 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 313.92 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 736.1 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -869.4 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 151.22 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5907.24 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 274.6 MB). Peak memory consumption was 274.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 191653.90 ms. Allocated memory was 2.2 GB in the beginning and 7.1 GB in the end (delta: 4.9 GB). Free memory was 1.9 GB in the beginning and 4.6 GB in the end (delta: -2.7 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1515]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1515). Cancelled while BasicCegarLoop was constructing difference of abstraction (1699314states) and FLOYD_HOARE automaton (currently 4 states, 4 states before enhancement),while ReachableStatesComputation was computing reachable states (146849 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 191.5s OverallTime, 18 OverallIterations, 6 TraceHistogramMax, 93.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5457 SDtfs, 17841 SDslu, 5859 SDs, 0 SdLazy, 22433 SolverSat, 4592 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 44.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 709 GetRequests, 648 SyntacticMatches, 7 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1699314occurred in iteration=17, 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: 89.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 1063151 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 5415 NumberOfCodeBlocks, 5415 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 5395 ConstructedInterpolants, 0 QuantifiedInterpolants, 3159276 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1194 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 20 InterpolantComputations, 18 PerfectInterpolantSequences, 3448/3462 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown