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/Problem13_label00_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 21:14:51,364 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 21:14:51,366 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 21:14:51,382 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 21:14:51,383 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 21:14:51,384 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 21:14:51,385 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 21:14:51,387 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 21:14:51,389 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 21:14:51,389 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 21:14:51,390 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 21:14:51,391 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 21:14:51,392 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 21:14:51,393 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 21:14:51,394 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 21:14:51,395 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 21:14:51,395 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 21:14:51,397 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 21:14:51,399 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 21:14:51,401 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 21:14:51,402 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 21:14:51,403 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 21:14:51,405 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 21:14:51,406 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 21:14:51,406 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 21:14:51,407 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 21:14:51,408 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 21:14:51,409 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 21:14:51,410 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 21:14:51,411 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 21:14:51,411 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 21:14:51,412 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 21:14:51,415 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 21:14:51,415 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 21:14:51,416 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 21:14:51,420 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 21:14:51,421 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 21:14:51,452 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 21:14:51,452 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 21:14:51,455 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 21:14:51,455 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 21:14:51,456 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 21:14:51,456 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 21:14:51,456 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 21:14:51,457 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 21:14:51,457 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 21:14:51,457 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 21:14:51,457 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 21:14:51,457 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 21:14:51,458 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 21:14:51,458 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 21:14:51,458 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 21:14:51,458 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 21:14:51,458 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 21:14:51,459 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 21:14:51,459 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 21:14:51,459 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:14:51,459 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 21:14:51,459 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 21:14:51,460 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 21:14:51,460 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 21:14:51,460 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 21:14:51,460 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 21:14:51,460 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 21:14:51,461 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 21:14:51,503 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 21:14:51,518 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 21:14:51,523 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 21:14:51,524 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 21:14:51,525 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 21:14:51,525 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label00_true-unreach-call.c [2018-11-06 21:14:51,587 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/900d96182/01f0bd6ae5ba458793f73300813f5855/FLAG1dd25fb3f [2018-11-06 21:14:52,408 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 21:14:52,409 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label00_true-unreach-call.c [2018-11-06 21:14:52,449 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/900d96182/01f0bd6ae5ba458793f73300813f5855/FLAG1dd25fb3f [2018-11-06 21:14:52,471 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/900d96182/01f0bd6ae5ba458793f73300813f5855 [2018-11-06 21:14:52,483 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 21:14:52,486 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 21:14:52,487 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 21:14:52,487 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 21:14:52,491 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 21:14:52,492 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:14:52" (1/1) ... [2018-11-06 21:14:52,497 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70cac6dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:52, skipping insertion in model container [2018-11-06 21:14:52,497 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:14:52" (1/1) ... [2018-11-06 21:14:52,508 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 21:14:52,709 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 21:14:54,085 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:14:54,090 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 21:14:54,710 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:14:54,749 INFO L193 MainTranslator]: Completed translation [2018-11-06 21:14:54,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:54 WrapperNode [2018-11-06 21:14:54,750 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 21:14:54,751 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 21:14:54,751 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 21:14:54,751 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 21:14:54,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:54" (1/1) ... [2018-11-06 21:14:55,139 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:54" (1/1) ... [2018-11-06 21:14:55,575 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 21:14:55,575 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 21:14:55,576 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 21:14:55,576 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 21:14:55,587 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:54" (1/1) ... [2018-11-06 21:14:55,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:54" (1/1) ... [2018-11-06 21:14:55,637 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:54" (1/1) ... [2018-11-06 21:14:55,637 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:54" (1/1) ... [2018-11-06 21:14:55,818 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:54" (1/1) ... [2018-11-06 21:14:55,889 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:54" (1/1) ... [2018-11-06 21:14:56,031 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:54" (1/1) ... [2018-11-06 21:14:56,131 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 21:14:56,131 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 21:14:56,131 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 21:14:56,132 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 21:14:56,132 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:54" (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 21:14:56,205 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 21:14:56,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 21:14:56,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 21:15:09,707 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 21:15:09,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:15:09 BoogieIcfgContainer [2018-11-06 21:15:09,707 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 21:15:09,708 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 21:15:09,709 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 21:15:09,712 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 21:15:09,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:14:52" (1/3) ... [2018-11-06 21:15:09,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@220de5d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:15:09, skipping insertion in model container [2018-11-06 21:15:09,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:54" (2/3) ... [2018-11-06 21:15:09,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@220de5d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:15:09, skipping insertion in model container [2018-11-06 21:15:09,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:15:09" (3/3) ... [2018-11-06 21:15:09,716 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label00_true-unreach-call.c [2018-11-06 21:15:09,726 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 21:15:09,736 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 21:15:09,755 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 21:15:09,806 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 21:15:09,807 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 21:15:09,807 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 21:15:09,808 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 21:15:09,808 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 21:15:09,808 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 21:15:09,808 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 21:15:09,808 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 21:15:09,808 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 21:15:09,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states. [2018-11-06 21:15:09,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-06 21:15:09,860 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:15:09,861 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] [2018-11-06 21:15:09,863 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:15:09,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:15:09,869 INFO L82 PathProgramCache]: Analyzing trace with hash -387853398, now seen corresponding path program 1 times [2018-11-06 21:15:09,872 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:15:09,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:15:09,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:15:09,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:15:09,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:15:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:15:10,359 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 21:15:10,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:15:10,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:15:10,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:15:10,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:15:10,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:15:10,387 INFO L87 Difference]: Start difference. First operand 1099 states. Second operand 4 states. [2018-11-06 21:15:24,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:15:24,112 INFO L93 Difference]: Finished difference Result 3896 states and 7286 transitions. [2018-11-06 21:15:24,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:15:24,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-11-06 21:15:24,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:15:24,158 INFO L225 Difference]: With dead ends: 3896 [2018-11-06 21:15:24,159 INFO L226 Difference]: Without dead ends: 2790 [2018-11-06 21:15:24,169 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 21:15:24,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2790 states. [2018-11-06 21:15:24,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2790 to 1945. [2018-11-06 21:15:24,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1945 states. [2018-11-06 21:15:24,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1945 states to 1945 states and 3412 transitions. [2018-11-06 21:15:24,353 INFO L78 Accepts]: Start accepts. Automaton has 1945 states and 3412 transitions. Word has length 38 [2018-11-06 21:15:24,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:15:24,354 INFO L480 AbstractCegarLoop]: Abstraction has 1945 states and 3412 transitions. [2018-11-06 21:15:24,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:15:24,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1945 states and 3412 transitions. [2018-11-06 21:15:24,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-06 21:15:24,362 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:15:24,363 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:15:24,363 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:15:24,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:15:24,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1177519246, now seen corresponding path program 1 times [2018-11-06 21:15:24,364 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:15:24,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:15:24,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:15:24,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:15:24,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:15:24,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:15:25,363 WARN L179 SmtUtils]: Spent 646.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 27 [2018-11-06 21:15:25,641 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:15:25,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:15:25,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:15:25,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:15:25,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:15:25,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:15:25,645 INFO L87 Difference]: Start difference. First operand 1945 states and 3412 transitions. Second operand 5 states. [2018-11-06 21:15:25,881 WARN L179 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-06 21:15:40,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:15:40,290 INFO L93 Difference]: Finished difference Result 7061 states and 12475 transitions. [2018-11-06 21:15:40,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:15:40,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2018-11-06 21:15:40,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:15:40,319 INFO L225 Difference]: With dead ends: 7061 [2018-11-06 21:15:40,319 INFO L226 Difference]: Without dead ends: 5118 [2018-11-06 21:15:40,323 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:15:40,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5118 states. [2018-11-06 21:15:40,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5118 to 5117. [2018-11-06 21:15:40,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5117 states. [2018-11-06 21:15:40,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5117 states to 5117 states and 7612 transitions. [2018-11-06 21:15:40,418 INFO L78 Accepts]: Start accepts. Automaton has 5117 states and 7612 transitions. Word has length 104 [2018-11-06 21:15:40,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:15:40,419 INFO L480 AbstractCegarLoop]: Abstraction has 5117 states and 7612 transitions. [2018-11-06 21:15:40,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:15:40,419 INFO L276 IsEmpty]: Start isEmpty. Operand 5117 states and 7612 transitions. [2018-11-06 21:15:40,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-06 21:15:40,425 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:15:40,426 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:15:40,426 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:15:40,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:15:40,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1624504843, now seen corresponding path program 1 times [2018-11-06 21:15:40,427 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:15:40,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:15:40,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:15:40,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:15:40,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:15:40,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:15:40,780 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:15:40,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:15:40,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:15:40,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:15:40,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:15:40,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:15:40,782 INFO L87 Difference]: Start difference. First operand 5117 states and 7612 transitions. Second operand 5 states. [2018-11-06 21:15:55,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:15:55,463 INFO L93 Difference]: Finished difference Result 19933 states and 31606 transitions. [2018-11-06 21:15:55,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:15:55,463 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 164 [2018-11-06 21:15:55,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:15:55,532 INFO L225 Difference]: With dead ends: 19933 [2018-11-06 21:15:55,532 INFO L226 Difference]: Without dead ends: 15606 [2018-11-06 21:15:55,541 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:15:55,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15606 states. [2018-11-06 21:15:55,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15606 to 15434. [2018-11-06 21:15:55,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15434 states. [2018-11-06 21:15:55,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15434 states to 15434 states and 21663 transitions. [2018-11-06 21:15:55,834 INFO L78 Accepts]: Start accepts. Automaton has 15434 states and 21663 transitions. Word has length 164 [2018-11-06 21:15:55,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:15:55,835 INFO L480 AbstractCegarLoop]: Abstraction has 15434 states and 21663 transitions. [2018-11-06 21:15:55,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:15:55,835 INFO L276 IsEmpty]: Start isEmpty. Operand 15434 states and 21663 transitions. [2018-11-06 21:15:55,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-11-06 21:15:55,845 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:15:55,845 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:15:55,849 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:15:55,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:15:55,849 INFO L82 PathProgramCache]: Analyzing trace with hash -952743899, now seen corresponding path program 1 times [2018-11-06 21:15:55,850 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:15:55,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:15:55,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:15:55,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:15:55,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:15:55,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:15:56,339 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 71 proven. 4 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-11-06 21:15:56,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:15:56,340 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 21:15:56,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:15:56,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:15:56,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:15:56,535 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:15:56,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:15:56,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-11-06 21:15:56,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:15:56,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:15:56,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:15:56,566 INFO L87 Difference]: Start difference. First operand 15434 states and 21663 transitions. Second operand 4 states. [2018-11-06 21:16:05,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:16:05,777 INFO L93 Difference]: Finished difference Result 50627 states and 72460 transitions. [2018-11-06 21:16:05,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:16:05,780 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 244 [2018-11-06 21:16:05,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:16:05,854 INFO L225 Difference]: With dead ends: 50627 [2018-11-06 21:16:05,855 INFO L226 Difference]: Without dead ends: 35983 [2018-11-06 21:16:05,877 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 244 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 21:16:05,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35983 states. [2018-11-06 21:16:06,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35983 to 23303. [2018-11-06 21:16:06,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23303 states. [2018-11-06 21:16:06,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23303 states to 23303 states and 30637 transitions. [2018-11-06 21:16:06,293 INFO L78 Accepts]: Start accepts. Automaton has 23303 states and 30637 transitions. Word has length 244 [2018-11-06 21:16:06,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:16:06,294 INFO L480 AbstractCegarLoop]: Abstraction has 23303 states and 30637 transitions. [2018-11-06 21:16:06,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:16:06,294 INFO L276 IsEmpty]: Start isEmpty. Operand 23303 states and 30637 transitions. [2018-11-06 21:16:06,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-11-06 21:16:06,298 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:16:06,299 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:16:06,299 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:16:06,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:16:06,299 INFO L82 PathProgramCache]: Analyzing trace with hash 2137794292, now seen corresponding path program 1 times [2018-11-06 21:16:06,300 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:16:06,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:16:06,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:16:06,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:16:06,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:16:06,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:16:06,571 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-11-06 21:16:06,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:16:06,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 21:16:06,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:16:06,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:16:06,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:16:06,573 INFO L87 Difference]: Start difference. First operand 23303 states and 30637 transitions. Second operand 3 states. [2018-11-06 21:16:15,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:16:15,106 INFO L93 Difference]: Finished difference Result 62355 states and 82233 transitions. [2018-11-06 21:16:15,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:16:15,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 258 [2018-11-06 21:16:15,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:16:15,175 INFO L225 Difference]: With dead ends: 62355 [2018-11-06 21:16:15,175 INFO L226 Difference]: Without dead ends: 39842 [2018-11-06 21:16:15,203 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 21:16:15,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39842 states. [2018-11-06 21:16:15,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39842 to 37475. [2018-11-06 21:16:15,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37475 states. [2018-11-06 21:16:15,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37475 states to 37475 states and 45423 transitions. [2018-11-06 21:16:15,667 INFO L78 Accepts]: Start accepts. Automaton has 37475 states and 45423 transitions. Word has length 258 [2018-11-06 21:16:15,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:16:15,668 INFO L480 AbstractCegarLoop]: Abstraction has 37475 states and 45423 transitions. [2018-11-06 21:16:15,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:16:15,668 INFO L276 IsEmpty]: Start isEmpty. Operand 37475 states and 45423 transitions. [2018-11-06 21:16:15,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2018-11-06 21:16:15,678 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:16:15,679 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:16:15,679 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:16:15,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:16:15,680 INFO L82 PathProgramCache]: Analyzing trace with hash 849089761, now seen corresponding path program 1 times [2018-11-06 21:16:15,680 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:16:15,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:16:15,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:16:15,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:16:15,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:16:15,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:16:16,196 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-06 21:16:16,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:16:16,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:16:16,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:16:16,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:16:16,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:16:16,198 INFO L87 Difference]: Start difference. First operand 37475 states and 45423 transitions. Second operand 5 states. [2018-11-06 21:16:32,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:16:32,382 INFO L93 Difference]: Finished difference Result 113066 states and 141847 transitions. [2018-11-06 21:16:32,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:16:32,382 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 329 [2018-11-06 21:16:32,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:16:32,517 INFO L225 Difference]: With dead ends: 113066 [2018-11-06 21:16:32,517 INFO L226 Difference]: Without dead ends: 76381 [2018-11-06 21:16:32,561 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:16:32,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76381 states. [2018-11-06 21:16:33,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76381 to 76202. [2018-11-06 21:16:33,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76202 states. [2018-11-06 21:16:33,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76202 states to 76202 states and 92170 transitions. [2018-11-06 21:16:33,478 INFO L78 Accepts]: Start accepts. Automaton has 76202 states and 92170 transitions. Word has length 329 [2018-11-06 21:16:33,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:16:33,478 INFO L480 AbstractCegarLoop]: Abstraction has 76202 states and 92170 transitions. [2018-11-06 21:16:33,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:16:33,479 INFO L276 IsEmpty]: Start isEmpty. Operand 76202 states and 92170 transitions. [2018-11-06 21:16:33,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2018-11-06 21:16:33,494 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:16:33,495 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:16:33,495 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:16:33,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:16:33,495 INFO L82 PathProgramCache]: Analyzing trace with hash -882119493, now seen corresponding path program 1 times [2018-11-06 21:16:33,496 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:16:33,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:16:33,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:16:33,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:16:33,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:16:33,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:16:34,289 WARN L179 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-11-06 21:16:34,373 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:16:34,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:16:34,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:16:34,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:16:34,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:16:34,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:16:34,375 INFO L87 Difference]: Start difference. First operand 76202 states and 92170 transitions. Second operand 4 states. [2018-11-06 21:16:46,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:16:46,015 INFO L93 Difference]: Finished difference Result 250151 states and 302675 transitions. [2018-11-06 21:16:46,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:16:46,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 345 [2018-11-06 21:16:46,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:16:46,246 INFO L225 Difference]: With dead ends: 250151 [2018-11-06 21:16:46,246 INFO L226 Difference]: Without dead ends: 174739 [2018-11-06 21:16:46,319 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:16:46,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174739 states. [2018-11-06 21:16:48,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174739 to 169176. [2018-11-06 21:16:48,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169176 states. [2018-11-06 21:16:48,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169176 states to 169176 states and 196675 transitions. [2018-11-06 21:16:48,484 INFO L78 Accepts]: Start accepts. Automaton has 169176 states and 196675 transitions. Word has length 345 [2018-11-06 21:16:48,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:16:48,485 INFO L480 AbstractCegarLoop]: Abstraction has 169176 states and 196675 transitions. [2018-11-06 21:16:48,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:16:48,485 INFO L276 IsEmpty]: Start isEmpty. Operand 169176 states and 196675 transitions. [2018-11-06 21:16:48,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2018-11-06 21:16:48,499 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:16:48,500 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 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 21:16:48,500 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:16:48,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:16:48,500 INFO L82 PathProgramCache]: Analyzing trace with hash -585037851, now seen corresponding path program 1 times [2018-11-06 21:16:48,500 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:16:48,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:16:48,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:16:48,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:16:48,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:16:48,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:16:48,740 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 357 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-06 21:16:48,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:16:48,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:16:48,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:16:48,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:16:48,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:16:48,742 INFO L87 Difference]: Start difference. First operand 169176 states and 196675 transitions. Second operand 3 states. [2018-11-06 21:16:55,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:16:55,190 INFO L93 Difference]: Finished difference Result 337543 states and 392234 transitions. [2018-11-06 21:16:55,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:16:55,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 360 [2018-11-06 21:16:55,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:16:55,376 INFO L225 Difference]: With dead ends: 337543 [2018-11-06 21:16:55,376 INFO L226 Difference]: Without dead ends: 161256 [2018-11-06 21:16:55,445 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 21:16:55,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161256 states. [2018-11-06 21:16:56,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161256 to 154150. [2018-11-06 21:16:56,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154150 states. [2018-11-06 21:16:56,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154150 states to 154150 states and 171344 transitions. [2018-11-06 21:16:56,695 INFO L78 Accepts]: Start accepts. Automaton has 154150 states and 171344 transitions. Word has length 360 [2018-11-06 21:16:56,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:16:56,695 INFO L480 AbstractCegarLoop]: Abstraction has 154150 states and 171344 transitions. [2018-11-06 21:16:56,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:16:56,695 INFO L276 IsEmpty]: Start isEmpty. Operand 154150 states and 171344 transitions. [2018-11-06 21:16:56,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-11-06 21:16:56,706 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:16:56,707 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:16:56,707 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:16:56,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:16:56,708 INFO L82 PathProgramCache]: Analyzing trace with hash -804455487, now seen corresponding path program 1 times [2018-11-06 21:16:56,708 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:16:56,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:16:56,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:16:56,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:16:56,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:16:56,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:16:57,059 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 410 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-06 21:16:57,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:16:57,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:16:57,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:16:57,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:16:57,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:16:57,061 INFO L87 Difference]: Start difference. First operand 154150 states and 171344 transitions. Second operand 4 states. [2018-11-06 21:17:04,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:17:04,608 INFO L93 Difference]: Finished difference Result 316967 states and 351897 transitions. [2018-11-06 21:17:04,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:17:04,609 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 396 [2018-11-06 21:17:04,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:17:04,778 INFO L225 Difference]: With dead ends: 316967 [2018-11-06 21:17:04,779 INFO L226 Difference]: Without dead ends: 149371 [2018-11-06 21:17:04,862 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 21:17:04,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149371 states. [2018-11-06 21:17:06,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149371 to 143851. [2018-11-06 21:17:06,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143851 states. [2018-11-06 21:17:06,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143851 states to 143851 states and 158801 transitions. [2018-11-06 21:17:06,175 INFO L78 Accepts]: Start accepts. Automaton has 143851 states and 158801 transitions. Word has length 396 [2018-11-06 21:17:06,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:17:06,176 INFO L480 AbstractCegarLoop]: Abstraction has 143851 states and 158801 transitions. [2018-11-06 21:17:06,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:17:06,176 INFO L276 IsEmpty]: Start isEmpty. Operand 143851 states and 158801 transitions. [2018-11-06 21:17:06,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2018-11-06 21:17:06,182 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:17:06,183 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:17:06,183 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:17:06,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:17:06,183 INFO L82 PathProgramCache]: Analyzing trace with hash -326556179, now seen corresponding path program 1 times [2018-11-06 21:17:06,183 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:17:06,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:17:06,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:17:06,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:17:06,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:17:06,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:17:07,517 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 566 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-11-06 21:17:07,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:17:07,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:17:07,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:17:07,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:17:07,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:17:07,519 INFO L87 Difference]: Start difference. First operand 143851 states and 158801 transitions. Second operand 4 states. [2018-11-06 21:17:17,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:17:17,528 INFO L93 Difference]: Finished difference Result 327929 states and 362810 transitions. [2018-11-06 21:17:17,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:17:17,529 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 419 [2018-11-06 21:17:17,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:17:17,732 INFO L225 Difference]: With dead ends: 327929 [2018-11-06 21:17:17,732 INFO L226 Difference]: Without dead ends: 182497 [2018-11-06 21:17:17,815 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 21:17:17,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182497 states. [2018-11-06 21:17:20,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182497 to 178513. [2018-11-06 21:17:20,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178513 states. [2018-11-06 21:17:20,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178513 states to 178513 states and 193253 transitions. [2018-11-06 21:17:20,339 INFO L78 Accepts]: Start accepts. Automaton has 178513 states and 193253 transitions. Word has length 419 [2018-11-06 21:17:20,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:17:20,340 INFO L480 AbstractCegarLoop]: Abstraction has 178513 states and 193253 transitions. [2018-11-06 21:17:20,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:17:20,340 INFO L276 IsEmpty]: Start isEmpty. Operand 178513 states and 193253 transitions. [2018-11-06 21:17:20,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2018-11-06 21:17:20,347 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:17:20,348 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:17:20,348 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:17:20,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:17:20,348 INFO L82 PathProgramCache]: Analyzing trace with hash 38868407, now seen corresponding path program 1 times [2018-11-06 21:17:20,349 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:17:20,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:17:20,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:17:20,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:17:20,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:17:20,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:17:20,765 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 416 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-11-06 21:17:20,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:17:20,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:17:20,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:17:20,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:17:20,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:17:20,767 INFO L87 Difference]: Start difference. First operand 178513 states and 193253 transitions. Second operand 4 states. [2018-11-06 21:17:29,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:17:29,199 INFO L93 Difference]: Finished difference Result 355399 states and 385191 transitions. [2018-11-06 21:17:29,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:17:29,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 449 [2018-11-06 21:17:29,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:17:29,376 INFO L225 Difference]: With dead ends: 355399 [2018-11-06 21:17:29,376 INFO L226 Difference]: Without dead ends: 177676 [2018-11-06 21:17:29,449 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 4 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 21:17:29,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177676 states. [2018-11-06 21:17:31,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177676 to 176887. [2018-11-06 21:17:31,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176887 states. [2018-11-06 21:17:31,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176887 states to 176887 states and 187043 transitions. [2018-11-06 21:17:31,956 INFO L78 Accepts]: Start accepts. Automaton has 176887 states and 187043 transitions. Word has length 449 [2018-11-06 21:17:31,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:17:31,957 INFO L480 AbstractCegarLoop]: Abstraction has 176887 states and 187043 transitions. [2018-11-06 21:17:31,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:17:31,957 INFO L276 IsEmpty]: Start isEmpty. Operand 176887 states and 187043 transitions. [2018-11-06 21:17:31,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2018-11-06 21:17:31,966 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:17:31,967 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:17:31,967 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:17:31,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:17:31,968 INFO L82 PathProgramCache]: Analyzing trace with hash 276135368, now seen corresponding path program 1 times [2018-11-06 21:17:31,968 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:17:31,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:17:31,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:17:31,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:17:31,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:17:32,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:17:32,349 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 459 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-11-06 21:17:32,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:17:32,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:17:32,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:17:32,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:17:32,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:17:32,350 INFO L87 Difference]: Start difference. First operand 176887 states and 187043 transitions. Second operand 4 states. [2018-11-06 21:17:43,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:17:43,057 INFO L93 Difference]: Finished difference Result 379785 states and 401932 transitions. [2018-11-06 21:17:43,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:17:43,058 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 518 [2018-11-06 21:17:43,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:17:43,305 INFO L225 Difference]: With dead ends: 379785 [2018-11-06 21:17:43,305 INFO L226 Difference]: Without dead ends: 202109 [2018-11-06 21:17:43,398 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:17:43,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202109 states. [2018-11-06 21:17:45,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202109 to 192628. [2018-11-06 21:17:45,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192628 states. [2018-11-06 21:17:45,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192628 states to 192628 states and 200951 transitions. [2018-11-06 21:17:45,805 INFO L78 Accepts]: Start accepts. Automaton has 192628 states and 200951 transitions. Word has length 518 [2018-11-06 21:17:45,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:17:45,805 INFO L480 AbstractCegarLoop]: Abstraction has 192628 states and 200951 transitions. [2018-11-06 21:17:45,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:17:45,806 INFO L276 IsEmpty]: Start isEmpty. Operand 192628 states and 200951 transitions. [2018-11-06 21:17:45,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 637 [2018-11-06 21:17:45,826 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:17:45,826 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:17:45,827 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:17:45,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:17:45,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1128287145, now seen corresponding path program 1 times [2018-11-06 21:17:45,827 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:17:45,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:17:45,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:17:45,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:17:45,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:17:45,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:17:47,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1117 backedges. 806 proven. 0 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2018-11-06 21:17:47,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:17:47,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:17:47,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:17:47,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:17:47,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:17:47,119 INFO L87 Difference]: Start difference. First operand 192628 states and 200951 transitions. Second operand 4 states. [2018-11-06 21:17:57,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:17:57,795 INFO L93 Difference]: Finished difference Result 385262 states and 401943 transitions. [2018-11-06 21:17:57,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:17:57,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 636 [2018-11-06 21:17:57,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:17:57,999 INFO L225 Difference]: With dead ends: 385262 [2018-11-06 21:17:57,999 INFO L226 Difference]: Without dead ends: 193424 [2018-11-06 21:17:58,086 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:17:58,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193424 states. [2018-11-06 21:17:59,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193424 to 191052. [2018-11-06 21:17:59,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191052 states. [2018-11-06 21:18:00,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191052 states to 191052 states and 198872 transitions. [2018-11-06 21:18:00,057 INFO L78 Accepts]: Start accepts. Automaton has 191052 states and 198872 transitions. Word has length 636 [2018-11-06 21:18:00,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:18:00,057 INFO L480 AbstractCegarLoop]: Abstraction has 191052 states and 198872 transitions. [2018-11-06 21:18:00,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:18:00,057 INFO L276 IsEmpty]: Start isEmpty. Operand 191052 states and 198872 transitions. [2018-11-06 21:18:00,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2018-11-06 21:18:00,076 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:18:00,076 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:18:00,077 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:18:00,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:18:00,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1238155198, now seen corresponding path program 1 times [2018-11-06 21:18:00,077 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:18:00,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:18:00,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:18:00,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:18:00,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:18:00,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:18:01,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1363 backedges. 623 proven. 0 refuted. 0 times theorem prover too weak. 740 trivial. 0 not checked. [2018-11-06 21:18:01,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:18:01,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:18:01,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:18:01,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:18:01,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:18:01,287 INFO L87 Difference]: Start difference. First operand 191052 states and 198872 transitions. Second operand 4 states. [2018-11-06 21:18:09,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:18:09,044 INFO L93 Difference]: Finished difference Result 413675 states and 430411 transitions. [2018-11-06 21:18:09,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:18:09,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 639 [2018-11-06 21:18:09,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:18:09,279 INFO L225 Difference]: With dead ends: 413675 [2018-11-06 21:18:09,279 INFO L226 Difference]: Without dead ends: 203670 [2018-11-06 21:18:09,344 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:18:09,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203670 states. [2018-11-06 21:18:10,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203670 to 170531. [2018-11-06 21:18:10,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170531 states. [2018-11-06 21:18:10,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170531 states to 170531 states and 176959 transitions. [2018-11-06 21:18:10,989 INFO L78 Accepts]: Start accepts. Automaton has 170531 states and 176959 transitions. Word has length 639 [2018-11-06 21:18:10,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:18:10,989 INFO L480 AbstractCegarLoop]: Abstraction has 170531 states and 176959 transitions. [2018-11-06 21:18:10,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:18:10,989 INFO L276 IsEmpty]: Start isEmpty. Operand 170531 states and 176959 transitions. [2018-11-06 21:18:11,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 669 [2018-11-06 21:18:11,005 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:18:11,006 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:18:11,006 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:18:11,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:18:11,007 INFO L82 PathProgramCache]: Analyzing trace with hash 574863026, now seen corresponding path program 1 times [2018-11-06 21:18:11,007 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:18:11,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:18:11,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:18:11,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:18:11,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:18:11,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:18:12,126 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-11-06 21:18:12,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:18:12,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 21:18:12,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:18:12,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:18:12,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:18:12,128 INFO L87 Difference]: Start difference. First operand 170531 states and 176959 transitions. Second operand 5 states. [2018-11-06 21:18:24,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:18:24,031 INFO L93 Difference]: Finished difference Result 420047 states and 436008 transitions. [2018-11-06 21:18:24,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:18:24,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 668 [2018-11-06 21:18:24,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:18:24,301 INFO L225 Difference]: With dead ends: 420047 [2018-11-06 21:18:24,301 INFO L226 Difference]: Without dead ends: 248730 [2018-11-06 21:18:24,399 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:18:24,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248730 states. [2018-11-06 21:18:26,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248730 to 215476. [2018-11-06 21:18:26,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215476 states. [2018-11-06 21:18:26,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215476 states to 215476 states and 223749 transitions. [2018-11-06 21:18:26,827 INFO L78 Accepts]: Start accepts. Automaton has 215476 states and 223749 transitions. Word has length 668 [2018-11-06 21:18:26,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:18:26,828 INFO L480 AbstractCegarLoop]: Abstraction has 215476 states and 223749 transitions. [2018-11-06 21:18:26,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:18:26,828 INFO L276 IsEmpty]: Start isEmpty. Operand 215476 states and 223749 transitions. [2018-11-06 21:18:26,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 781 [2018-11-06 21:18:26,858 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:18:26,859 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:18:26,859 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:18:26,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:18:26,860 INFO L82 PathProgramCache]: Analyzing trace with hash 517541400, now seen corresponding path program 1 times [2018-11-06 21:18:26,860 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:18:26,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:18:26,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:18:26,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:18:26,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:18:26,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:18:29,195 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 472 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-11-06 21:18:29,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:18:29,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:18:29,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:18:29,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:18:29,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:18:29,197 INFO L87 Difference]: Start difference. First operand 215476 states and 223749 transitions. Second operand 5 states. Received shutdown request... [2018-11-06 21:18:39,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:18:39,390 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-06 21:18:39,396 WARN L205 ceAbstractionStarter]: Timeout [2018-11-06 21:18:39,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:18:39 BoogieIcfgContainer [2018-11-06 21:18:39,397 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 21:18:39,398 INFO L168 Benchmark]: Toolchain (without parser) took 226913.01 ms. Allocated memory was 1.5 GB in the beginning and 4.6 GB in the end (delta: 3.0 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -761.4 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2018-11-06 21:18:39,399 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 21:18:39,399 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2263.54 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 232.5 MB). Peak memory consumption was 232.5 MB. Max. memory is 7.1 GB. [2018-11-06 21:18:39,400 INFO L168 Benchmark]: Boogie Procedure Inliner took 824.33 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 834.7 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 67.6 MB. Max. memory is 7.1 GB. [2018-11-06 21:18:39,401 INFO L168 Benchmark]: Boogie Preprocessor took 555.49 ms. Allocated memory is still 2.4 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 67.8 MB). Peak memory consumption was 67.8 MB. Max. memory is 7.1 GB. [2018-11-06 21:18:39,402 INFO L168 Benchmark]: RCFGBuilder took 13576.38 ms. Allocated memory was 2.4 GB in the beginning and 2.6 GB in the end (delta: 234.9 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 16.3 MB). Peak memory consumption was 586.3 MB. Max. memory is 7.1 GB. [2018-11-06 21:18:39,403 INFO L168 Benchmark]: TraceAbstraction took 209688.42 ms. Allocated memory was 2.6 GB in the beginning and 4.6 GB in the end (delta: 2.0 GB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -56.5 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2018-11-06 21:18:39,408 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2263.54 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 232.5 MB). Peak memory consumption was 232.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 824.33 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 834.7 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 67.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 555.49 ms. Allocated memory is still 2.4 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 67.8 MB). Peak memory consumption was 67.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 13576.38 ms. Allocated memory was 2.4 GB in the beginning and 2.6 GB in the end (delta: 234.9 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 16.3 MB). Peak memory consumption was 586.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 209688.42 ms. Allocated memory was 2.6 GB in the beginning and 4.6 GB in the end (delta: 2.0 GB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -56.5 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 123]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 123). Cancelled while BasicCegarLoop was constructing difference of abstraction (215476states) and FLOYD_HOARE automaton (currently 5 states, 5 states before enhancement),while ReachableStatesComputation was computing reachable states (348474 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1099 locations, 1 error locations. TIMEOUT Result, 209.5s OverallTime, 16 OverallIterations, 7 TraceHistogramMax, 175.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 14757 SDtfs, 35630 SDslu, 3966 SDs, 0 SdLazy, 80770 SolverSat, 16894 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 132.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 314 GetRequests, 268 SyntacticMatches, 10 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=215476occurred in iteration=15, 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: 20.5s AutomataMinimizationTime, 15 MinimizatonAttempts, 117452 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 6591 NumberOfCodeBlocks, 6591 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 6574 ConstructedInterpolants, 0 QuantifiedInterpolants, 7033962 SizeOfPredicates, 0 NumberOfNonLiveVariables, 341 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 17 InterpolantComputations, 16 PerfectInterpolantSequences, 7825/7829 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown