java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label17_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 19:55:49,298 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 19:55:49,301 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 19:55:49,315 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 19:55:49,315 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 19:55:49,316 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 19:55:49,318 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 19:55:49,320 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 19:55:49,322 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 19:55:49,323 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 19:55:49,324 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 19:55:49,324 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 19:55:49,325 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 19:55:49,326 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 19:55:49,327 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 19:55:49,328 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 19:55:49,329 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 19:55:49,331 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 19:55:49,333 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 19:55:49,335 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 19:55:49,336 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 19:55:49,338 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 19:55:49,340 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 19:55:49,340 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 19:55:49,341 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 19:55:49,342 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 19:55:49,343 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 19:55:49,344 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 19:55:49,345 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 19:55:49,346 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 19:55:49,346 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 19:55:49,347 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 19:55:49,347 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 19:55:49,347 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 19:55:49,348 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 19:55:49,349 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 19:55:49,350 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 19:55:49,366 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 19:55:49,367 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 19:55:49,367 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 19:55:49,368 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 19:55:49,368 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 19:55:49,369 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 19:55:49,369 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 19:55:49,369 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 19:55:49,369 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 19:55:49,370 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 19:55:49,370 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 19:55:49,370 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 19:55:49,370 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 19:55:49,370 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 19:55:49,371 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 19:55:49,371 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 19:55:49,371 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 19:55:49,371 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 19:55:49,372 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 19:55:49,372 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:55:49,372 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 19:55:49,372 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 19:55:49,372 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 19:55:49,373 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 19:55:49,373 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 19:55:49,373 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 19:55:49,373 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 19:55:49,373 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 19:55:49,427 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 19:55:49,441 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 19:55:49,445 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 19:55:49,447 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 19:55:49,447 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 19:55:49,448 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label17_true-unreach-call.c [2018-11-06 19:55:49,518 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfd4ff513/23cc48f9ea7d46c4bddca24f46d5eb91/FLAGce25d9723 [2018-11-06 19:55:50,255 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 19:55:50,256 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label17_true-unreach-call.c [2018-11-06 19:55:50,277 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfd4ff513/23cc48f9ea7d46c4bddca24f46d5eb91/FLAGce25d9723 [2018-11-06 19:55:50,298 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfd4ff513/23cc48f9ea7d46c4bddca24f46d5eb91 [2018-11-06 19:55:50,311 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 19:55:50,313 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 19:55:50,314 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 19:55:50,314 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 19:55:50,318 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 19:55:50,319 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:55:50" (1/1) ... [2018-11-06 19:55:50,323 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cedeeed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:55:50, skipping insertion in model container [2018-11-06 19:55:50,323 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:55:50" (1/1) ... [2018-11-06 19:55:50,334 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 19:55:50,417 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 19:55:51,149 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:55:51,155 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 19:55:51,427 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:55:51,452 INFO L193 MainTranslator]: Completed translation [2018-11-06 19:55:51,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:55:51 WrapperNode [2018-11-06 19:55:51,453 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 19:55:51,455 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 19:55:51,455 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 19:55:51,455 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 19:55:51,466 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:55:51" (1/1) ... [2018-11-06 19:55:51,672 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:55:51" (1/1) ... [2018-11-06 19:55:51,784 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 19:55:51,784 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 19:55:51,785 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 19:55:51,785 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 19:55:51,796 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:55:51" (1/1) ... [2018-11-06 19:55:51,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:55:51" (1/1) ... [2018-11-06 19:55:51,804 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:55:51" (1/1) ... [2018-11-06 19:55:51,804 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:55:51" (1/1) ... [2018-11-06 19:55:51,849 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:55:51" (1/1) ... [2018-11-06 19:55:51,871 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:55:51" (1/1) ... [2018-11-06 19:55:51,895 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:55:51" (1/1) ... [2018-11-06 19:55:51,911 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 19:55:51,912 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 19:55:51,912 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 19:55:51,912 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 19:55:51,913 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:55:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:55:51,985 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 19:55:51,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 19:55:51,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 19:55:57,743 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 19:55:57,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:55:57 BoogieIcfgContainer [2018-11-06 19:55:57,745 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 19:55:57,746 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 19:55:57,746 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 19:55:57,750 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 19:55:57,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:55:50" (1/3) ... [2018-11-06 19:55:57,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12c5135b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:55:57, skipping insertion in model container [2018-11-06 19:55:57,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:55:51" (2/3) ... [2018-11-06 19:55:57,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12c5135b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:55:57, skipping insertion in model container [2018-11-06 19:55:57,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:55:57" (3/3) ... [2018-11-06 19:55:57,754 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label17_true-unreach-call.c [2018-11-06 19:55:57,765 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 19:55:57,773 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 19:55:57,791 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 19:55:57,830 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 19:55:57,831 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 19:55:57,831 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 19:55:57,831 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 19:55:57,831 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 19:55:57,832 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 19:55:57,832 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 19:55:57,832 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 19:55:57,832 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 19:55:57,858 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-11-06 19:55:57,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-11-06 19:55:57,880 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:55:57,881 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:55:57,884 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:55:57,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:55:57,891 INFO L82 PathProgramCache]: Analyzing trace with hash 842622356, now seen corresponding path program 1 times [2018-11-06 19:55:57,893 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:55:57,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:55:57,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:55:57,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:55:57,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:55:58,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:55:58,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:55:58,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:55:58,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:55:58,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:55:58,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:55:58,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:55:58,914 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-11-06 19:56:02,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:02,303 INFO L93 Difference]: Finished difference Result 1075 states and 1921 transitions. [2018-11-06 19:56:02,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:56:02,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 200 [2018-11-06 19:56:02,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:02,393 INFO L225 Difference]: With dead ends: 1075 [2018-11-06 19:56:02,393 INFO L226 Difference]: Without dead ends: 765 [2018-11-06 19:56:02,399 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:56:02,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2018-11-06 19:56:02,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 520. [2018-11-06 19:56:02,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-11-06 19:56:02,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 853 transitions. [2018-11-06 19:56:02,507 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 853 transitions. Word has length 200 [2018-11-06 19:56:02,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:02,508 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 853 transitions. [2018-11-06 19:56:02,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:56:02,508 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 853 transitions. [2018-11-06 19:56:02,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-11-06 19:56:02,514 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:02,515 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:56:02,515 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:02,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:02,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1987087763, now seen corresponding path program 1 times [2018-11-06 19:56:02,516 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:02,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:02,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:02,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:02,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:02,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:02,696 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:56:02,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:56:02,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:56:02,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:56:02,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:56:02,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:56:02,702 INFO L87 Difference]: Start difference. First operand 520 states and 853 transitions. Second operand 3 states. [2018-11-06 19:56:05,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:05,267 INFO L93 Difference]: Finished difference Result 1465 states and 2463 transitions. [2018-11-06 19:56:05,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:56:05,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2018-11-06 19:56:05,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:05,274 INFO L225 Difference]: With dead ends: 1465 [2018-11-06 19:56:05,274 INFO L226 Difference]: Without dead ends: 947 [2018-11-06 19:56:05,278 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:56:05,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2018-11-06 19:56:05,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 931. [2018-11-06 19:56:05,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2018-11-06 19:56:05,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1508 transitions. [2018-11-06 19:56:05,308 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1508 transitions. Word has length 209 [2018-11-06 19:56:05,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:05,308 INFO L480 AbstractCegarLoop]: Abstraction has 931 states and 1508 transitions. [2018-11-06 19:56:05,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:56:05,308 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1508 transitions. [2018-11-06 19:56:05,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-11-06 19:56:05,312 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:05,313 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:56:05,313 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:05,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:05,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1016526360, now seen corresponding path program 1 times [2018-11-06 19:56:05,314 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:05,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:05,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:05,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:05,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:05,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:05,472 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-06 19:56:05,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:56:05,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:56:05,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:56:05,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:56:05,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:56:05,474 INFO L87 Difference]: Start difference. First operand 931 states and 1508 transitions. Second operand 3 states. [2018-11-06 19:56:08,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:08,621 INFO L93 Difference]: Finished difference Result 2774 states and 4502 transitions. [2018-11-06 19:56:08,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:56:08,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 223 [2018-11-06 19:56:08,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:08,632 INFO L225 Difference]: With dead ends: 2774 [2018-11-06 19:56:08,633 INFO L226 Difference]: Without dead ends: 1845 [2018-11-06 19:56:08,635 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:56:08,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1845 states. [2018-11-06 19:56:08,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1845 to 1841. [2018-11-06 19:56:08,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1841 states. [2018-11-06 19:56:08,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2985 transitions. [2018-11-06 19:56:08,693 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2985 transitions. Word has length 223 [2018-11-06 19:56:08,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:08,694 INFO L480 AbstractCegarLoop]: Abstraction has 1841 states and 2985 transitions. [2018-11-06 19:56:08,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:56:08,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2985 transitions. [2018-11-06 19:56:08,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-11-06 19:56:08,701 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:08,702 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:56:08,702 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:08,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:08,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1179694472, now seen corresponding path program 1 times [2018-11-06 19:56:08,703 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:08,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:08,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:08,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:08,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:08,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:08,979 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:56:08,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:56:08,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:56:08,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:56:08,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:56:08,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:56:08,981 INFO L87 Difference]: Start difference. First operand 1841 states and 2985 transitions. Second operand 4 states. [2018-11-06 19:56:11,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:11,766 INFO L93 Difference]: Finished difference Result 7028 states and 11556 transitions. [2018-11-06 19:56:11,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:56:11,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 224 [2018-11-06 19:56:11,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:11,795 INFO L225 Difference]: With dead ends: 7028 [2018-11-06 19:56:11,796 INFO L226 Difference]: Without dead ends: 5189 [2018-11-06 19:56:11,800 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:56:11,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5189 states. [2018-11-06 19:56:11,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5189 to 3481. [2018-11-06 19:56:11,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3481 states. [2018-11-06 19:56:11,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3481 states to 3481 states and 5332 transitions. [2018-11-06 19:56:11,927 INFO L78 Accepts]: Start accepts. Automaton has 3481 states and 5332 transitions. Word has length 224 [2018-11-06 19:56:11,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:11,927 INFO L480 AbstractCegarLoop]: Abstraction has 3481 states and 5332 transitions. [2018-11-06 19:56:11,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:56:11,928 INFO L276 IsEmpty]: Start isEmpty. Operand 3481 states and 5332 transitions. [2018-11-06 19:56:11,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-11-06 19:56:11,938 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:11,939 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:56:11,939 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:11,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:11,940 INFO L82 PathProgramCache]: Analyzing trace with hash -15660827, now seen corresponding path program 1 times [2018-11-06 19:56:11,940 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:11,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:11,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:11,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:11,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:11,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:12,132 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-06 19:56:12,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:56:12,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:56:12,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:56:12,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:56:12,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:56:12,134 INFO L87 Difference]: Start difference. First operand 3481 states and 5332 transitions. Second operand 3 states. [2018-11-06 19:56:12,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:12,864 INFO L93 Difference]: Finished difference Result 6910 states and 10594 transitions. [2018-11-06 19:56:12,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:56:12,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 238 [2018-11-06 19:56:12,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:12,889 INFO L225 Difference]: With dead ends: 6910 [2018-11-06 19:56:12,890 INFO L226 Difference]: Without dead ends: 3431 [2018-11-06 19:56:12,895 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:56:12,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3431 states. [2018-11-06 19:56:12,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3431 to 3431. [2018-11-06 19:56:12,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3431 states. [2018-11-06 19:56:12,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3431 states to 3431 states and 5172 transitions. [2018-11-06 19:56:12,968 INFO L78 Accepts]: Start accepts. Automaton has 3431 states and 5172 transitions. Word has length 238 [2018-11-06 19:56:12,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:12,968 INFO L480 AbstractCegarLoop]: Abstraction has 3431 states and 5172 transitions. [2018-11-06 19:56:12,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:56:12,969 INFO L276 IsEmpty]: Start isEmpty. Operand 3431 states and 5172 transitions. [2018-11-06 19:56:12,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-11-06 19:56:12,977 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:12,977 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:56:12,978 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:12,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:12,978 INFO L82 PathProgramCache]: Analyzing trace with hash -160938096, now seen corresponding path program 1 times [2018-11-06 19:56:12,978 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:12,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:12,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:12,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:12,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:13,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:13,412 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:56:13,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:56:13,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:56:13,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:56:13,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:56:13,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:56:13,413 INFO L87 Difference]: Start difference. First operand 3431 states and 5172 transitions. Second operand 5 states. [2018-11-06 19:56:17,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:17,428 INFO L93 Difference]: Finished difference Result 8133 states and 12410 transitions. [2018-11-06 19:56:17,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:56:17,429 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2018-11-06 19:56:17,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:17,450 INFO L225 Difference]: With dead ends: 8133 [2018-11-06 19:56:17,450 INFO L226 Difference]: Without dead ends: 4704 [2018-11-06 19:56:17,456 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:56:17,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4704 states. [2018-11-06 19:56:17,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4704 to 3839. [2018-11-06 19:56:17,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3839 states. [2018-11-06 19:56:17,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3839 states to 3839 states and 5746 transitions. [2018-11-06 19:56:17,535 INFO L78 Accepts]: Start accepts. Automaton has 3839 states and 5746 transitions. Word has length 240 [2018-11-06 19:56:17,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:17,535 INFO L480 AbstractCegarLoop]: Abstraction has 3839 states and 5746 transitions. [2018-11-06 19:56:17,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:56:17,536 INFO L276 IsEmpty]: Start isEmpty. Operand 3839 states and 5746 transitions. [2018-11-06 19:56:17,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-11-06 19:56:17,544 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:17,544 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:56:17,545 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:17,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:17,545 INFO L82 PathProgramCache]: Analyzing trace with hash -234496693, now seen corresponding path program 1 times [2018-11-06 19:56:17,545 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:17,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:17,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:17,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:17,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:17,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:17,702 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:56:17,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:56:17,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:56:17,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:56:17,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:56:17,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:56:17,704 INFO L87 Difference]: Start difference. First operand 3839 states and 5746 transitions. Second operand 3 states. [2018-11-06 19:56:19,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:19,008 INFO L93 Difference]: Finished difference Result 10952 states and 16371 transitions. [2018-11-06 19:56:19,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:56:19,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2018-11-06 19:56:19,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:19,040 INFO L225 Difference]: With dead ends: 10952 [2018-11-06 19:56:19,040 INFO L226 Difference]: Without dead ends: 7115 [2018-11-06 19:56:19,047 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:56:19,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7115 states. [2018-11-06 19:56:19,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7115 to 7109. [2018-11-06 19:56:19,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7109 states. [2018-11-06 19:56:19,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7109 states to 7109 states and 10002 transitions. [2018-11-06 19:56:19,171 INFO L78 Accepts]: Start accepts. Automaton has 7109 states and 10002 transitions. Word has length 241 [2018-11-06 19:56:19,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:19,172 INFO L480 AbstractCegarLoop]: Abstraction has 7109 states and 10002 transitions. [2018-11-06 19:56:19,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:56:19,172 INFO L276 IsEmpty]: Start isEmpty. Operand 7109 states and 10002 transitions. [2018-11-06 19:56:19,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-11-06 19:56:19,184 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:19,184 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:56:19,185 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:19,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:19,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1666351876, now seen corresponding path program 1 times [2018-11-06 19:56:19,185 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:19,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:19,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:19,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:19,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:19,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:19,426 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:56:19,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:56:19,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:56:19,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:56:19,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:56:19,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:56:19,428 INFO L87 Difference]: Start difference. First operand 7109 states and 10002 transitions. Second operand 3 states. [2018-11-06 19:56:20,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:20,778 INFO L93 Difference]: Finished difference Result 17299 states and 24305 transitions. [2018-11-06 19:56:20,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:56:20,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 242 [2018-11-06 19:56:20,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:20,810 INFO L225 Difference]: With dead ends: 17299 [2018-11-06 19:56:20,810 INFO L226 Difference]: Without dead ends: 10192 [2018-11-06 19:56:20,820 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:56:20,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10192 states. [2018-11-06 19:56:20,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10192 to 10190. [2018-11-06 19:56:20,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10190 states. [2018-11-06 19:56:20,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10190 states to 10190 states and 14205 transitions. [2018-11-06 19:56:20,962 INFO L78 Accepts]: Start accepts. Automaton has 10190 states and 14205 transitions. Word has length 242 [2018-11-06 19:56:20,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:20,963 INFO L480 AbstractCegarLoop]: Abstraction has 10190 states and 14205 transitions. [2018-11-06 19:56:20,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:56:20,963 INFO L276 IsEmpty]: Start isEmpty. Operand 10190 states and 14205 transitions. [2018-11-06 19:56:20,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-11-06 19:56:20,980 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:20,981 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:56:20,981 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:20,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:20,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1670297837, now seen corresponding path program 1 times [2018-11-06 19:56:20,981 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:20,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:20,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:20,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:20,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:21,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:21,127 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-06 19:56:21,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:56:21,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:56:21,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:56:21,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:56:21,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:56:21,129 INFO L87 Difference]: Start difference. First operand 10190 states and 14205 transitions. Second operand 3 states. [2018-11-06 19:56:22,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:22,731 INFO L93 Difference]: Finished difference Result 28950 states and 40308 transitions. [2018-11-06 19:56:22,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:56:22,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2018-11-06 19:56:22,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:22,769 INFO L225 Difference]: With dead ends: 28950 [2018-11-06 19:56:22,769 INFO L226 Difference]: Without dead ends: 18762 [2018-11-06 19:56:22,784 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:56:22,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18762 states. [2018-11-06 19:56:23,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18762 to 18758. [2018-11-06 19:56:23,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18758 states. [2018-11-06 19:56:23,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18758 states to 18758 states and 23310 transitions. [2018-11-06 19:56:23,026 INFO L78 Accepts]: Start accepts. Automaton has 18758 states and 23310 transitions. Word has length 248 [2018-11-06 19:56:23,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:23,026 INFO L480 AbstractCegarLoop]: Abstraction has 18758 states and 23310 transitions. [2018-11-06 19:56:23,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:56:23,026 INFO L276 IsEmpty]: Start isEmpty. Operand 18758 states and 23310 transitions. [2018-11-06 19:56:23,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-11-06 19:56:23,050 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:23,050 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:56:23,051 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:23,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:23,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1318738352, now seen corresponding path program 1 times [2018-11-06 19:56:23,051 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:23,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:23,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:23,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:23,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:23,463 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 52 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:56:23,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:56:23,464 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:56:23,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:23,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:23,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:56:23,832 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:56:23,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:56:23,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-11-06 19:56:23,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 19:56:23,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 19:56:23,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-06 19:56:23,856 INFO L87 Difference]: Start difference. First operand 18758 states and 23310 transitions. Second operand 7 states. [2018-11-06 19:56:32,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:32,586 INFO L93 Difference]: Finished difference Result 69841 states and 87508 transitions. [2018-11-06 19:56:32,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-06 19:56:32,587 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 250 [2018-11-06 19:56:32,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:32,672 INFO L225 Difference]: With dead ends: 69841 [2018-11-06 19:56:32,673 INFO L226 Difference]: Without dead ends: 51085 [2018-11-06 19:56:32,704 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-11-06 19:56:32,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51085 states. [2018-11-06 19:56:33,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51085 to 51065. [2018-11-06 19:56:33,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51065 states. [2018-11-06 19:56:33,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51065 states to 51065 states and 59497 transitions. [2018-11-06 19:56:33,737 INFO L78 Accepts]: Start accepts. Automaton has 51065 states and 59497 transitions. Word has length 250 [2018-11-06 19:56:33,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:33,738 INFO L480 AbstractCegarLoop]: Abstraction has 51065 states and 59497 transitions. [2018-11-06 19:56:33,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 19:56:33,738 INFO L276 IsEmpty]: Start isEmpty. Operand 51065 states and 59497 transitions. [2018-11-06 19:56:33,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2018-11-06 19:56:33,798 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:33,799 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:56:33,799 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:33,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:33,799 INFO L82 PathProgramCache]: Analyzing trace with hash 63592070, now seen corresponding path program 1 times [2018-11-06 19:56:33,799 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:33,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:33,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:33,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:33,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:33,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:34,032 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-06 19:56:34,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:56:34,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:56:34,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:56:34,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:56:34,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:56:34,034 INFO L87 Difference]: Start difference. First operand 51065 states and 59497 transitions. Second operand 3 states. [2018-11-06 19:56:34,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:34,929 INFO L93 Difference]: Finished difference Result 102124 states and 118988 transitions. [2018-11-06 19:56:34,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:56:34,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 331 [2018-11-06 19:56:34,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:34,998 INFO L225 Difference]: With dead ends: 102124 [2018-11-06 19:56:34,998 INFO L226 Difference]: Without dead ends: 51061 [2018-11-06 19:56:35,044 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:56:35,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51061 states. [2018-11-06 19:56:35,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51061 to 51061. [2018-11-06 19:56:35,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51061 states. [2018-11-06 19:56:35,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51061 states to 51061 states and 59489 transitions. [2018-11-06 19:56:35,750 INFO L78 Accepts]: Start accepts. Automaton has 51061 states and 59489 transitions. Word has length 331 [2018-11-06 19:56:35,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:35,751 INFO L480 AbstractCegarLoop]: Abstraction has 51061 states and 59489 transitions. [2018-11-06 19:56:35,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:56:35,751 INFO L276 IsEmpty]: Start isEmpty. Operand 51061 states and 59489 transitions. [2018-11-06 19:56:35,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2018-11-06 19:56:35,794 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:35,795 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:56:35,795 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:35,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:35,796 INFO L82 PathProgramCache]: Analyzing trace with hash 185165231, now seen corresponding path program 1 times [2018-11-06 19:56:35,796 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:35,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:35,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:35,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:35,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:35,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:36,350 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:56:36,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:56:36,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:56:36,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:56:36,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:56:36,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:56:36,352 INFO L87 Difference]: Start difference. First operand 51061 states and 59489 transitions. Second operand 4 states. [2018-11-06 19:56:38,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:38,372 INFO L93 Difference]: Finished difference Result 195234 states and 227813 transitions. [2018-11-06 19:56:38,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:56:38,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 343 [2018-11-06 19:56:38,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:38,557 INFO L225 Difference]: With dead ends: 195234 [2018-11-06 19:56:38,557 INFO L226 Difference]: Without dead ends: 144175 [2018-11-06 19:56:38,610 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:56:38,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144175 states. [2018-11-06 19:56:39,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144175 to 95566. [2018-11-06 19:56:39,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95566 states. [2018-11-06 19:56:39,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95566 states to 95566 states and 111563 transitions. [2018-11-06 19:56:39,903 INFO L78 Accepts]: Start accepts. Automaton has 95566 states and 111563 transitions. Word has length 343 [2018-11-06 19:56:39,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:39,903 INFO L480 AbstractCegarLoop]: Abstraction has 95566 states and 111563 transitions. [2018-11-06 19:56:39,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:56:39,903 INFO L276 IsEmpty]: Start isEmpty. Operand 95566 states and 111563 transitions. [2018-11-06 19:56:39,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-11-06 19:56:39,944 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:39,945 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:56:39,945 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:39,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:39,945 INFO L82 PathProgramCache]: Analyzing trace with hash 385414192, now seen corresponding path program 1 times [2018-11-06 19:56:39,945 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:39,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:39,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:39,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:39,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:39,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:40,213 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-11-06 19:56:40,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:56:40,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:56:40,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:56:40,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:56:40,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:56:40,214 INFO L87 Difference]: Start difference. First operand 95566 states and 111563 transitions. Second operand 4 states. [2018-11-06 19:56:43,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:43,304 INFO L93 Difference]: Finished difference Result 198511 states and 232030 transitions. [2018-11-06 19:56:43,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:56:43,304 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 347 [2018-11-06 19:56:43,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:43,438 INFO L225 Difference]: With dead ends: 198511 [2018-11-06 19:56:43,438 INFO L226 Difference]: Without dead ends: 102947 [2018-11-06 19:56:43,489 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:56:43,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102947 states. [2018-11-06 19:56:44,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102947 to 102928. [2018-11-06 19:56:44,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102928 states. [2018-11-06 19:56:44,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102928 states to 102928 states and 119931 transitions. [2018-11-06 19:56:44,600 INFO L78 Accepts]: Start accepts. Automaton has 102928 states and 119931 transitions. Word has length 347 [2018-11-06 19:56:44,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:44,601 INFO L480 AbstractCegarLoop]: Abstraction has 102928 states and 119931 transitions. [2018-11-06 19:56:44,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:56:44,601 INFO L276 IsEmpty]: Start isEmpty. Operand 102928 states and 119931 transitions. [2018-11-06 19:56:44,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2018-11-06 19:56:44,645 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:44,645 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:56:44,645 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:44,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:44,646 INFO L82 PathProgramCache]: Analyzing trace with hash 2036430867, now seen corresponding path program 1 times [2018-11-06 19:56:44,646 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:44,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:44,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:44,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:44,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:44,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:45,340 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2018-11-06 19:56:45,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:56:45,341 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:56:45,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:45,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:45,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:56:45,729 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-06 19:56:45,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:56:45,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2018-11-06 19:56:45,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 19:56:45,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 19:56:45,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:56:45,767 INFO L87 Difference]: Start difference. First operand 102928 states and 119931 transitions. Second operand 6 states. [2018-11-06 19:56:50,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:50,350 INFO L93 Difference]: Finished difference Result 209741 states and 244270 transitions. [2018-11-06 19:56:50,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 19:56:50,351 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 349 [2018-11-06 19:56:50,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:50,480 INFO L225 Difference]: With dead ends: 209741 [2018-11-06 19:56:50,480 INFO L226 Difference]: Without dead ends: 106815 [2018-11-06 19:56:50,540 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-11-06 19:56:50,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106815 states. [2018-11-06 19:56:51,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106815 to 106186. [2018-11-06 19:56:51,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106186 states. [2018-11-06 19:56:51,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106186 states to 106186 states and 120715 transitions. [2018-11-06 19:56:51,611 INFO L78 Accepts]: Start accepts. Automaton has 106186 states and 120715 transitions. Word has length 349 [2018-11-06 19:56:51,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:51,612 INFO L480 AbstractCegarLoop]: Abstraction has 106186 states and 120715 transitions. [2018-11-06 19:56:51,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 19:56:51,612 INFO L276 IsEmpty]: Start isEmpty. Operand 106186 states and 120715 transitions. [2018-11-06 19:56:51,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2018-11-06 19:56:51,663 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:51,663 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, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:56:51,664 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:51,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:51,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1183289148, now seen corresponding path program 1 times [2018-11-06 19:56:51,664 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:51,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:51,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:51,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:51,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:51,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:51,932 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2018-11-06 19:56:51,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:56:51,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:56:51,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:56:51,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:56:51,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:56:51,935 INFO L87 Difference]: Start difference. First operand 106186 states and 120715 transitions. Second operand 3 states. [2018-11-06 19:56:55,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:55,422 INFO L93 Difference]: Finished difference Result 262194 states and 297306 transitions. [2018-11-06 19:56:55,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:56:55,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 400 [2018-11-06 19:56:55,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:55,606 INFO L225 Difference]: With dead ends: 262194 [2018-11-06 19:56:55,607 INFO L226 Difference]: Without dead ends: 156010 [2018-11-06 19:56:55,677 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:56:55,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156010 states. [2018-11-06 19:56:57,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156010 to 156006. [2018-11-06 19:56:57,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156006 states. [2018-11-06 19:56:57,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156006 states to 156006 states and 176252 transitions. [2018-11-06 19:56:57,368 INFO L78 Accepts]: Start accepts. Automaton has 156006 states and 176252 transitions. Word has length 400 [2018-11-06 19:56:57,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:57,368 INFO L480 AbstractCegarLoop]: Abstraction has 156006 states and 176252 transitions. [2018-11-06 19:56:57,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:56:57,368 INFO L276 IsEmpty]: Start isEmpty. Operand 156006 states and 176252 transitions. [2018-11-06 19:56:57,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2018-11-06 19:56:57,438 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:57,439 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, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:56:57,439 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:57,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:57,439 INFO L82 PathProgramCache]: Analyzing trace with hash -996888344, now seen corresponding path program 2 times [2018-11-06 19:56:57,439 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:57,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:57,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:57,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:57,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:57,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:57,811 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-06 19:56:58,072 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 126 proven. 4 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2018-11-06 19:56:58,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:56:58,073 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:56:58,090 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-06 19:56:58,281 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-06 19:56:58,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 19:56:58,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:56:58,506 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-06 19:56:58,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:56:58,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-11-06 19:56:58,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 19:56:58,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 19:56:58,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:56:58,534 INFO L87 Difference]: Start difference. First operand 156006 states and 176252 transitions. Second operand 6 states. [2018-11-06 19:57:04,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:57:04,671 INFO L93 Difference]: Finished difference Result 424833 states and 480519 transitions. [2018-11-06 19:57:04,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-06 19:57:04,672 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 408 [2018-11-06 19:57:04,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:57:04,997 INFO L225 Difference]: With dead ends: 424833 [2018-11-06 19:57:04,997 INFO L226 Difference]: Without dead ends: 268829 [2018-11-06 19:57:05,107 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-06 19:57:05,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268829 states. [2018-11-06 19:57:08,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268829 to 262480. [2018-11-06 19:57:08,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262480 states. [2018-11-06 19:57:09,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262480 states to 262480 states and 287400 transitions. [2018-11-06 19:57:09,094 INFO L78 Accepts]: Start accepts. Automaton has 262480 states and 287400 transitions. Word has length 408 [2018-11-06 19:57:09,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:57:09,094 INFO L480 AbstractCegarLoop]: Abstraction has 262480 states and 287400 transitions. [2018-11-06 19:57:09,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 19:57:09,095 INFO L276 IsEmpty]: Start isEmpty. Operand 262480 states and 287400 transitions. [2018-11-06 19:57:09,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2018-11-06 19:57:09,180 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:57:09,180 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:57:09,181 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:57:09,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:57:09,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1451375310, now seen corresponding path program 1 times [2018-11-06 19:57:09,181 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:57:09,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:57:09,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:57:09,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-06 19:57:09,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:57:09,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:57:09,533 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-06 19:57:09,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:57:09,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:57:09,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:57:09,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:57:09,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:57:09,534 INFO L87 Difference]: Start difference. First operand 262480 states and 287400 transitions. Second operand 3 states. [2018-11-06 19:57:13,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:57:13,689 INFO L93 Difference]: Finished difference Result 662287 states and 724547 transitions. [2018-11-06 19:57:13,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:57:13,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 408 [2018-11-06 19:57:13,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:57:14,269 INFO L225 Difference]: With dead ends: 662287 [2018-11-06 19:57:14,269 INFO L226 Difference]: Without dead ends: 399809 [2018-11-06 19:57:14,430 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:57:14,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399809 states. [2018-11-06 19:57:25,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399809 to 397148. [2018-11-06 19:57:25,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397148 states. [2018-11-06 19:57:26,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397148 states to 397148 states and 434374 transitions. [2018-11-06 19:57:26,333 INFO L78 Accepts]: Start accepts. Automaton has 397148 states and 434374 transitions. Word has length 408 [2018-11-06 19:57:26,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:57:26,333 INFO L480 AbstractCegarLoop]: Abstraction has 397148 states and 434374 transitions. [2018-11-06 19:57:26,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:57:26,334 INFO L276 IsEmpty]: Start isEmpty. Operand 397148 states and 434374 transitions. [2018-11-06 19:57:26,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2018-11-06 19:57:26,448 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:57:26,448 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:57:26,448 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:57:26,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:57:26,449 INFO L82 PathProgramCache]: Analyzing trace with hash 558565586, now seen corresponding path program 1 times [2018-11-06 19:57:26,449 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:57:26,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:57:26,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:57:26,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:57:26,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:57:26,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:57:27,082 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 245 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-11-06 19:57:27,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:57:27,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:57:27,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:57:27,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:57:27,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:57:27,084 INFO L87 Difference]: Start difference. First operand 397148 states and 434374 transitions. Second operand 3 states. [2018-11-06 19:57:31,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:57:31,430 INFO L93 Difference]: Finished difference Result 730093 states and 798388 transitions. [2018-11-06 19:57:31,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:57:31,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 483 [2018-11-06 19:57:31,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:57:31,871 INFO L225 Difference]: With dead ends: 730093 [2018-11-06 19:57:31,871 INFO L226 Difference]: Without dead ends: 332947 [2018-11-06 19:57:32,038 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:57:32,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332947 states. [2018-11-06 19:57:38,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332947 to 332527. [2018-11-06 19:57:38,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332527 states. [2018-11-06 19:57:38,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332527 states to 332527 states and 356288 transitions. [2018-11-06 19:57:38,578 INFO L78 Accepts]: Start accepts. Automaton has 332527 states and 356288 transitions. Word has length 483 [2018-11-06 19:57:38,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:57:38,579 INFO L480 AbstractCegarLoop]: Abstraction has 332527 states and 356288 transitions. [2018-11-06 19:57:38,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:57:38,579 INFO L276 IsEmpty]: Start isEmpty. Operand 332527 states and 356288 transitions. [2018-11-06 19:57:38,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2018-11-06 19:57:38,695 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:57:38,696 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:57:38,696 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:57:38,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:57:38,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1267603191, now seen corresponding path program 1 times [2018-11-06 19:57:38,697 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:57:38,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:57:38,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:57:38,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:57:38,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:57:38,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:57:39,615 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 459 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-06 19:57:39,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:57:39,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 19:57:39,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 19:57:39,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 19:57:39,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:57:39,617 INFO L87 Difference]: Start difference. First operand 332527 states and 356288 transitions. Second operand 6 states. [2018-11-06 19:57:46,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:57:46,124 INFO L93 Difference]: Finished difference Result 633333 states and 680976 transitions. [2018-11-06 19:57:46,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 19:57:46,124 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 500 [2018-11-06 19:57:46,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:57:46,489 INFO L225 Difference]: With dead ends: 633333 [2018-11-06 19:57:46,489 INFO L226 Difference]: Without dead ends: 300808 [2018-11-06 19:57:46,632 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-06 19:57:46,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300808 states. [2018-11-06 19:57:56,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300808 to 276989. [2018-11-06 19:57:56,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276989 states. [2018-11-06 19:57:56,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276989 states to 276989 states and 296555 transitions. [2018-11-06 19:57:56,840 INFO L78 Accepts]: Start accepts. Automaton has 276989 states and 296555 transitions. Word has length 500 [2018-11-06 19:57:56,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:57:56,840 INFO L480 AbstractCegarLoop]: Abstraction has 276989 states and 296555 transitions. [2018-11-06 19:57:56,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 19:57:56,841 INFO L276 IsEmpty]: Start isEmpty. Operand 276989 states and 296555 transitions. [2018-11-06 19:57:57,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 720 [2018-11-06 19:57:57,049 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:57:57,050 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:57:57,050 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:57:57,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:57:57,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1677207499, now seen corresponding path program 1 times [2018-11-06 19:57:57,051 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:57:57,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:57:57,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:57:57,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:57:57,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:57:57,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:57:57,598 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-06 19:57:57,860 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2018-11-06 19:57:58,017 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2018-11-06 19:57:58,125 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2018-11-06 19:58:00,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1558 backedges. 798 proven. 94 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2018-11-06 19:58:00,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:58:00,047 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:58:00,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:58:00,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:58:00,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:58:00,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1558 backedges. 882 proven. 0 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2018-11-06 19:58:00,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:58:00,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 12 [2018-11-06 19:58:00,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-06 19:58:00,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-06 19:58:00,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-11-06 19:58:00,863 INFO L87 Difference]: Start difference. First operand 276989 states and 296555 transitions. Second operand 12 states. [2018-11-06 19:58:02,613 WARN L179 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2018-11-06 19:58:10,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:58:10,713 INFO L93 Difference]: Finished difference Result 663724 states and 710015 transitions. [2018-11-06 19:58:10,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-06 19:58:10,714 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 719 [2018-11-06 19:58:10,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:58:11,186 INFO L225 Difference]: With dead ends: 663724 [2018-11-06 19:58:11,186 INFO L226 Difference]: Without dead ends: 386737 [2018-11-06 19:58:11,284 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 736 GetRequests, 721 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-11-06 19:58:11,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386737 states. [2018-11-06 19:58:16,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386737 to 342394. [2018-11-06 19:58:16,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342394 states. [2018-11-06 19:58:17,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342394 states to 342394 states and 363941 transitions. [2018-11-06 19:58:17,688 INFO L78 Accepts]: Start accepts. Automaton has 342394 states and 363941 transitions. Word has length 719 [2018-11-06 19:58:17,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:58:17,688 INFO L480 AbstractCegarLoop]: Abstraction has 342394 states and 363941 transitions. [2018-11-06 19:58:17,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-06 19:58:17,689 INFO L276 IsEmpty]: Start isEmpty. Operand 342394 states and 363941 transitions. [2018-11-06 19:58:17,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 869 [2018-11-06 19:58:17,925 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:58:17,925 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 13, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:58:17,926 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:58:17,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:58:17,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1195832830, now seen corresponding path program 1 times [2018-11-06 19:58:17,926 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:58:17,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:58:17,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:17,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:58:17,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:17,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:58:18,646 INFO L134 CoverageAnalysis]: Checked inductivity of 2653 backedges. 987 proven. 9 refuted. 0 times theorem prover too weak. 1657 trivial. 0 not checked. [2018-11-06 19:58:18,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:58:18,647 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:58:18,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:58:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:58:18,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:58:20,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2653 backedges. 986 proven. 0 refuted. 0 times theorem prover too weak. 1667 trivial. 0 not checked. [2018-11-06 19:58:20,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:58:20,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-11-06 19:58:20,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 19:58:20,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 19:58:20,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-06 19:58:20,172 INFO L87 Difference]: Start difference. First operand 342394 states and 363941 transitions. Second operand 7 states. [2018-11-06 19:58:30,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:58:30,491 INFO L93 Difference]: Finished difference Result 1302125 states and 1384990 transitions. [2018-11-06 19:58:30,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-06 19:58:30,491 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 868 [2018-11-06 19:58:30,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:58:31,617 INFO L225 Difference]: With dead ends: 1302125 [2018-11-06 19:58:31,618 INFO L226 Difference]: Without dead ends: 959735 [2018-11-06 19:58:31,793 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 874 GetRequests, 868 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-06 19:58:32,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959735 states. [2018-11-06 19:58:51,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959735 to 614251. [2018-11-06 19:58:51,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614251 states. [2018-11-06 19:58:52,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614251 states to 614251 states and 652747 transitions. [2018-11-06 19:58:52,284 INFO L78 Accepts]: Start accepts. Automaton has 614251 states and 652747 transitions. Word has length 868 [2018-11-06 19:58:52,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:58:52,285 INFO L480 AbstractCegarLoop]: Abstraction has 614251 states and 652747 transitions. [2018-11-06 19:58:52,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 19:58:52,285 INFO L276 IsEmpty]: Start isEmpty. Operand 614251 states and 652747 transitions. [2018-11-06 19:58:54,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 891 [2018-11-06 19:58:54,458 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:58:54,459 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:58:54,459 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:58:54,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:58:54,460 INFO L82 PathProgramCache]: Analyzing trace with hash 949921322, now seen corresponding path program 1 times [2018-11-06 19:58:54,460 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:58:54,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:58:54,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:54,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:58:54,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:54,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:58:55,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2557 backedges. 979 proven. 0 refuted. 0 times theorem prover too weak. 1578 trivial. 0 not checked. [2018-11-06 19:58:55,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:58:55,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:58:55,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:58:55,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:58:55,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:58:55,431 INFO L87 Difference]: Start difference. First operand 614251 states and 652747 transitions. Second operand 4 states. [2018-11-06 19:59:05,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:59:05,997 INFO L93 Difference]: Finished difference Result 1752020 states and 1862522 transitions. [2018-11-06 19:59:05,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:59:05,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 890 [2018-11-06 19:59:05,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:59:07,533 INFO L225 Difference]: With dead ends: 1752020 [2018-11-06 19:59:07,533 INFO L226 Difference]: Without dead ends: 1031373 [2018-11-06 19:59:07,918 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:59:10,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031373 states. Received shutdown request... [2018-11-06 19:59:15,546 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-06 19:59:15,550 WARN L205 ceAbstractionStarter]: Timeout [2018-11-06 19:59:15,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:59:15 BoogieIcfgContainer [2018-11-06 19:59:15,551 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 19:59:15,552 INFO L168 Benchmark]: Toolchain (without parser) took 205239.85 ms. Allocated memory was 1.5 GB in the beginning and 5.8 GB in the end (delta: 4.3 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -919.9 MB). Peak memory consumption was 4.8 GB. Max. memory is 7.1 GB. [2018-11-06 19:59:15,553 INFO L168 Benchmark]: CDTParser took 0.23 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-11-06 19:59:15,553 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1139.29 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: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-11-06 19:59:15,554 INFO L168 Benchmark]: Boogie Procedure Inliner took 329.40 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 721.4 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -845.8 MB). Peak memory consumption was 38.9 MB. Max. memory is 7.1 GB. [2018-11-06 19:59:15,555 INFO L168 Benchmark]: Boogie Preprocessor took 127.30 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: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. [2018-11-06 19:59:15,556 INFO L168 Benchmark]: RCFGBuilder took 5832.77 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: 257.0 MB). Peak memory consumption was 257.0 MB. Max. memory is 7.1 GB. [2018-11-06 19:59:15,559 INFO L168 Benchmark]: TraceAbstraction took 197805.02 ms. Allocated memory was 2.2 GB in the beginning and 5.8 GB in the end (delta: 3.6 GB). Free memory was 1.9 GB in the beginning and 2.3 GB in the end (delta: -430.1 MB). Peak memory consumption was 4.5 GB. Max. memory is 7.1 GB. [2018-11-06 19:59:15,565 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1139.29 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: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 329.40 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 721.4 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -845.8 MB). Peak memory consumption was 38.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 127.30 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: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5832.77 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: 257.0 MB). Peak memory consumption was 257.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 197805.02 ms. Allocated memory was 2.2 GB in the beginning and 5.8 GB in the end (delta: 3.6 GB). Free memory was 1.9 GB in the beginning and 2.3 GB in the end (delta: -430.1 MB). Peak memory consumption was 4.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1632]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1632). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 197.7s OverallTime, 22 OverallIterations, 14 TraceHistogramMax, 103.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6161 SDtfs, 18300 SDslu, 6740 SDs, 0 SdLazy, 27666 SolverSat, 5054 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 52.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2707 GetRequests, 2626 SyntacticMatches, 9 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=614251occurred in iteration=21, 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: 75.0s AutomataMinimizationTime, 22 MinimizatonAttempts, 475207 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 10955 NumberOfCodeBlocks, 10955 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 10928 ConstructedInterpolants, 0 QuantifiedInterpolants, 15495814 SizeOfPredicates, 3 NumberOfNonLiveVariables, 4221 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 27 InterpolantComputations, 22 PerfectInterpolantSequences, 14535/14654 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown