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_label28_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 19:11:11,654 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 19:11:11,656 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 19:11:11,669 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 19:11:11,669 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 19:11:11,671 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 19:11:11,672 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 19:11:11,674 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 19:11:11,676 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 19:11:11,677 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 19:11:11,678 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 19:11:11,678 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 19:11:11,679 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 19:11:11,680 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 19:11:11,681 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 19:11:11,682 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 19:11:11,683 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 19:11:11,685 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 19:11:11,687 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 19:11:11,689 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 19:11:11,691 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 19:11:11,692 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 19:11:11,695 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 19:11:11,695 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 19:11:11,696 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 19:11:11,697 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 19:11:11,698 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 19:11:11,699 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 19:11:11,699 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 19:11:11,701 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 19:11:11,701 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 19:11:11,702 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 19:11:11,702 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 19:11:11,702 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 19:11:11,703 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 19:11:11,704 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 19:11:11,705 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 19:11:11,721 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 19:11:11,721 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 19:11:11,722 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 19:11:11,722 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 19:11:11,723 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 19:11:11,723 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 19:11:11,724 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 19:11:11,724 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 19:11:11,724 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 19:11:11,724 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 19:11:11,724 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 19:11:11,725 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 19:11:11,725 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 19:11:11,725 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 19:11:11,725 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 19:11:11,726 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 19:11:11,726 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 19:11:11,726 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 19:11:11,726 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 19:11:11,726 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:11:11,727 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 19:11:11,727 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 19:11:11,727 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 19:11:11,727 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 19:11:11,728 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 19:11:11,728 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 19:11:11,728 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 19:11:11,728 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 19:11:11,774 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 19:11:11,788 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 19:11:11,792 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 19:11:11,794 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 19:11:11,795 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 19:11:11,796 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label28_false-unreach-call.c [2018-11-06 19:11:11,862 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1796a8ecf/e694c424df364b018a67fdba11a7e6fe/FLAGbdb899673 [2018-11-06 19:11:12,709 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 19:11:12,710 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label28_false-unreach-call.c [2018-11-06 19:11:12,759 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1796a8ecf/e694c424df364b018a67fdba11a7e6fe/FLAGbdb899673 [2018-11-06 19:11:12,775 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1796a8ecf/e694c424df364b018a67fdba11a7e6fe [2018-11-06 19:11:12,787 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 19:11:12,788 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 19:11:12,791 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 19:11:12,791 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 19:11:12,795 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 19:11:12,797 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:11:12" (1/1) ... [2018-11-06 19:11:12,800 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60fab143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:11:12, skipping insertion in model container [2018-11-06 19:11:12,800 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:11:12" (1/1) ... [2018-11-06 19:11:12,812 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 19:11:13,009 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 19:11:14,695 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:11:14,701 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 19:11:15,477 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:11:15,518 INFO L193 MainTranslator]: Completed translation [2018-11-06 19:11:15,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:11:15 WrapperNode [2018-11-06 19:11:15,519 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 19:11:15,521 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 19:11:15,521 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 19:11:15,521 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 19:11:15,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:11:15" (1/1) ... [2018-11-06 19:11:15,918 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:11:15" (1/1) ... [2018-11-06 19:11:16,357 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 19:11:16,358 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 19:11:16,358 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 19:11:16,359 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 19:11:16,372 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:11:15" (1/1) ... [2018-11-06 19:11:16,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:11:15" (1/1) ... [2018-11-06 19:11:16,462 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:11:15" (1/1) ... [2018-11-06 19:11:16,463 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:11:15" (1/1) ... [2018-11-06 19:11:16,656 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:11:15" (1/1) ... [2018-11-06 19:11:16,712 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:11:15" (1/1) ... [2018-11-06 19:11:16,793 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:11:15" (1/1) ... [2018-11-06 19:11:16,864 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 19:11:16,864 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 19:11:16,865 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 19:11:16,865 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 19:11:16,866 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:11:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:11:16,942 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 19:11:16,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 19:11:16,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 19:11:27,283 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 19:11:27,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:11:27 BoogieIcfgContainer [2018-11-06 19:11:27,284 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 19:11:27,284 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 19:11:27,285 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 19:11:27,288 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 19:11:27,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:11:12" (1/3) ... [2018-11-06 19:11:27,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@456b21a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:11:27, skipping insertion in model container [2018-11-06 19:11:27,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:11:15" (2/3) ... [2018-11-06 19:11:27,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@456b21a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:11:27, skipping insertion in model container [2018-11-06 19:11:27,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:11:27" (3/3) ... [2018-11-06 19:11:27,292 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label28_false-unreach-call.c [2018-11-06 19:11:27,302 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 19:11:27,313 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 19:11:27,333 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 19:11:27,397 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 19:11:27,398 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 19:11:27,398 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 19:11:27,398 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 19:11:27,398 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 19:11:27,398 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 19:11:27,399 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 19:11:27,399 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 19:11:27,399 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 19:11:27,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states. [2018-11-06 19:11:27,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-06 19:11:27,461 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:11:27,462 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:11:27,464 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:11:27,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:11:27,471 INFO L82 PathProgramCache]: Analyzing trace with hash 666618706, now seen corresponding path program 1 times [2018-11-06 19:11:27,473 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:11:27,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:11:27,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:11:27,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:11:27,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:11:27,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:11:27,891 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-11-06 19:11:27,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:11:27,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:11:27,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:11:27,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:11:27,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:11:27,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:11:27,927 INFO L87 Difference]: Start difference. First operand 1099 states. Second operand 4 states. [2018-11-06 19:11:40,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:11:40,672 INFO L93 Difference]: Finished difference Result 3879 states and 7287 transitions. [2018-11-06 19:11:40,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:11:40,674 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-11-06 19:11:40,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:11:40,720 INFO L225 Difference]: With dead ends: 3879 [2018-11-06 19:11:40,720 INFO L226 Difference]: Without dead ends: 2773 [2018-11-06 19:11:40,730 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:11:40,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2773 states. [2018-11-06 19:11:40,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2773 to 2742. [2018-11-06 19:11:40,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2742 states. [2018-11-06 19:11:40,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2742 states to 2742 states and 4466 transitions. [2018-11-06 19:11:40,905 INFO L78 Accepts]: Start accepts. Automaton has 2742 states and 4466 transitions. Word has length 16 [2018-11-06 19:11:40,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:11:40,906 INFO L480 AbstractCegarLoop]: Abstraction has 2742 states and 4466 transitions. [2018-11-06 19:11:40,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:11:40,906 INFO L276 IsEmpty]: Start isEmpty. Operand 2742 states and 4466 transitions. [2018-11-06 19:11:40,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-06 19:11:40,911 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:11:40,911 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:11:40,911 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:11:40,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:11:40,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1158074430, now seen corresponding path program 1 times [2018-11-06 19:11:40,912 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:11:40,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:11:40,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:11:40,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:11:40,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:11:41,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:11:41,363 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-06 19:11:41,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:11:41,364 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:11:41,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:11:41,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:11:41,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:11:41,494 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:11:41,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:11:41,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-11-06 19:11:41,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:11:41,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:11:41,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:11:41,536 INFO L87 Difference]: Start difference. First operand 2742 states and 4466 transitions. Second operand 4 states. [2018-11-06 19:11:55,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:11:55,197 INFO L93 Difference]: Finished difference Result 10279 states and 16957 transitions. [2018-11-06 19:11:55,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:11:55,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2018-11-06 19:11:55,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:11:55,240 INFO L225 Difference]: With dead ends: 10279 [2018-11-06 19:11:55,240 INFO L226 Difference]: Without dead ends: 7539 [2018-11-06 19:11:55,247 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:11:55,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7539 states. [2018-11-06 19:11:55,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7539 to 5128. [2018-11-06 19:11:55,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5128 states. [2018-11-06 19:11:55,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5128 states to 5128 states and 8009 transitions. [2018-11-06 19:11:55,368 INFO L78 Accepts]: Start accepts. Automaton has 5128 states and 8009 transitions. Word has length 106 [2018-11-06 19:11:55,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:11:55,369 INFO L480 AbstractCegarLoop]: Abstraction has 5128 states and 8009 transitions. [2018-11-06 19:11:55,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:11:55,369 INFO L276 IsEmpty]: Start isEmpty. Operand 5128 states and 8009 transitions. [2018-11-06 19:11:55,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-06 19:11:55,382 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:11:55,383 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:11:55,384 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:11:55,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:11:55,384 INFO L82 PathProgramCache]: Analyzing trace with hash 305775270, now seen corresponding path program 1 times [2018-11-06 19:11:55,384 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:11:55,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:11:55,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:11:55,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:11:55,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:11:55,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:11:56,025 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-06 19:11:56,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:11:56,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:11:56,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:11:56,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:11:56,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:11:56,027 INFO L87 Difference]: Start difference. First operand 5128 states and 8009 transitions. Second operand 5 states. [2018-11-06 19:12:05,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:12:05,956 INFO L93 Difference]: Finished difference Result 16563 states and 25362 transitions. [2018-11-06 19:12:05,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:12:05,964 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 155 [2018-11-06 19:12:05,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:12:06,012 INFO L225 Difference]: With dead ends: 16563 [2018-11-06 19:12:06,013 INFO L226 Difference]: Without dead ends: 11437 [2018-11-06 19:12:06,021 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:12:06,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11437 states. [2018-11-06 19:12:06,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11437 to 11436. [2018-11-06 19:12:06,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11436 states. [2018-11-06 19:12:06,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11436 states to 11436 states and 15909 transitions. [2018-11-06 19:12:06,227 INFO L78 Accepts]: Start accepts. Automaton has 11436 states and 15909 transitions. Word has length 155 [2018-11-06 19:12:06,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:12:06,228 INFO L480 AbstractCegarLoop]: Abstraction has 11436 states and 15909 transitions. [2018-11-06 19:12:06,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:12:06,228 INFO L276 IsEmpty]: Start isEmpty. Operand 11436 states and 15909 transitions. [2018-11-06 19:12:06,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-06 19:12:06,231 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:12:06,232 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:12:06,232 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:12:06,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:12:06,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1703937609, now seen corresponding path program 1 times [2018-11-06 19:12:06,233 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:12:06,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:12:06,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:12:06,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:12:06,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:12:06,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:12:06,597 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 27 proven. 66 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-06 19:12:06,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:12:06,598 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:12:06,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:12:06,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:12:06,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:12:06,837 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:12:06,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:12:06,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2018-11-06 19:12:06,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:12:06,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:12:06,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:12:06,872 INFO L87 Difference]: Start difference. First operand 11436 states and 15909 transitions. Second operand 5 states. [2018-11-06 19:12:20,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:12:20,588 INFO L93 Difference]: Finished difference Result 43401 states and 61089 transitions. [2018-11-06 19:12:20,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:12:20,589 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 181 [2018-11-06 19:12:20,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:12:20,670 INFO L225 Difference]: With dead ends: 43401 [2018-11-06 19:12:20,670 INFO L226 Difference]: Without dead ends: 32755 [2018-11-06 19:12:20,686 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 180 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 19:12:20,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32755 states. [2018-11-06 19:12:21,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32755 to 25621. [2018-11-06 19:12:21,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25621 states. [2018-11-06 19:12:21,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25621 states to 25621 states and 33098 transitions. [2018-11-06 19:12:21,102 INFO L78 Accepts]: Start accepts. Automaton has 25621 states and 33098 transitions. Word has length 181 [2018-11-06 19:12:21,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:12:21,103 INFO L480 AbstractCegarLoop]: Abstraction has 25621 states and 33098 transitions. [2018-11-06 19:12:21,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:12:21,103 INFO L276 IsEmpty]: Start isEmpty. Operand 25621 states and 33098 transitions. [2018-11-06 19:12:21,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-11-06 19:12:21,106 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:12:21,106 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:12:21,107 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:12:21,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:12:21,107 INFO L82 PathProgramCache]: Analyzing trace with hash -472738906, now seen corresponding path program 1 times [2018-11-06 19:12:21,107 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:12:21,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:12:21,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:12:21,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:12:21,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:12:21,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:12:21,355 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-06 19:12:21,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:12:21,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:12:21,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:12:21,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:12:21,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:12:21,358 INFO L87 Difference]: Start difference. First operand 25621 states and 33098 transitions. Second operand 3 states. [2018-11-06 19:12:27,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:12:27,597 INFO L93 Difference]: Finished difference Result 73301 states and 95285 transitions. [2018-11-06 19:12:27,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:12:27,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2018-11-06 19:12:27,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:12:27,691 INFO L225 Difference]: With dead ends: 73301 [2018-11-06 19:12:27,691 INFO L226 Difference]: Without dead ends: 48470 [2018-11-06 19:12:27,726 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 19:12:27,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48470 states. [2018-11-06 19:12:28,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48470 to 48469. [2018-11-06 19:12:28,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48469 states. [2018-11-06 19:12:28,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48469 states to 48469 states and 58804 transitions. [2018-11-06 19:12:28,525 INFO L78 Accepts]: Start accepts. Automaton has 48469 states and 58804 transitions. Word has length 192 [2018-11-06 19:12:28,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:12:28,525 INFO L480 AbstractCegarLoop]: Abstraction has 48469 states and 58804 transitions. [2018-11-06 19:12:28,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:12:28,526 INFO L276 IsEmpty]: Start isEmpty. Operand 48469 states and 58804 transitions. [2018-11-06 19:12:28,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-11-06 19:12:28,533 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:12:28,533 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-11-06 19:12:28,534 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:12:28,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:12:28,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1442007739, now seen corresponding path program 1 times [2018-11-06 19:12:28,534 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:12:28,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:12:28,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:12:28,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:12:28,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:12:28,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:12:29,127 WARN L179 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 6 [2018-11-06 19:12:29,314 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 184 proven. 4 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-11-06 19:12:29,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:12:29,315 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:12:29,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:12:29,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:12:29,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:12:29,629 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-06 19:12:29,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:12:29,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-11-06 19:12:29,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:12:29,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:12:29,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:12:29,665 INFO L87 Difference]: Start difference. First operand 48469 states and 58804 transitions. Second operand 4 states. [2018-11-06 19:12:38,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:12:38,184 INFO L93 Difference]: Finished difference Result 114312 states and 136549 transitions. [2018-11-06 19:12:38,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:12:38,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 309 [2018-11-06 19:12:38,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:12:38,346 INFO L225 Difference]: With dead ends: 114312 [2018-11-06 19:12:38,346 INFO L226 Difference]: Without dead ends: 66633 [2018-11-06 19:12:38,389 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:12:38,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66633 states. [2018-11-06 19:12:39,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66633 to 57138. [2018-11-06 19:12:39,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57138 states. [2018-11-06 19:12:39,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57138 states to 57138 states and 68104 transitions. [2018-11-06 19:12:39,108 INFO L78 Accepts]: Start accepts. Automaton has 57138 states and 68104 transitions. Word has length 309 [2018-11-06 19:12:39,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:12:39,109 INFO L480 AbstractCegarLoop]: Abstraction has 57138 states and 68104 transitions. [2018-11-06 19:12:39,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:12:39,109 INFO L276 IsEmpty]: Start isEmpty. Operand 57138 states and 68104 transitions. [2018-11-06 19:12:39,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-11-06 19:12:39,121 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:12:39,121 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:12:39,121 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:12:39,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:12:39,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1145284850, now seen corresponding path program 1 times [2018-11-06 19:12:39,122 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:12:39,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:12:39,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:12:39,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:12:39,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:12:39,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:12:39,564 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-06 19:12:39,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:12:39,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:12:39,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:12:39,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:12:39,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:12:39,566 INFO L87 Difference]: Start difference. First operand 57138 states and 68104 transitions. Second operand 4 states. [2018-11-06 19:12:46,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:12:46,670 INFO L93 Difference]: Finished difference Result 122940 states and 146167 transitions. [2018-11-06 19:12:46,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:12:46,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 338 [2018-11-06 19:12:46,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:12:46,797 INFO L225 Difference]: With dead ends: 122940 [2018-11-06 19:12:46,797 INFO L226 Difference]: Without dead ends: 57862 [2018-11-06 19:12:46,849 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:12:46,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57862 states. [2018-11-06 19:12:48,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57862 to 50769. [2018-11-06 19:12:48,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50769 states. [2018-11-06 19:12:48,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50769 states to 50769 states and 59099 transitions. [2018-11-06 19:12:48,164 INFO L78 Accepts]: Start accepts. Automaton has 50769 states and 59099 transitions. Word has length 338 [2018-11-06 19:12:48,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:12:48,165 INFO L480 AbstractCegarLoop]: Abstraction has 50769 states and 59099 transitions. [2018-11-06 19:12:48,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:12:48,165 INFO L276 IsEmpty]: Start isEmpty. Operand 50769 states and 59099 transitions. [2018-11-06 19:12:48,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-11-06 19:12:48,171 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:12:48,171 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 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] [2018-11-06 19:12:48,172 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:12:48,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:12:48,172 INFO L82 PathProgramCache]: Analyzing trace with hash -772890852, now seen corresponding path program 1 times [2018-11-06 19:12:48,172 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:12:48,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:12:48,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:12:48,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:12:48,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:12:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:12:48,616 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-06 19:12:48,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:12:48,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:12:48,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:12:48,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:12:48,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:12:48,618 INFO L87 Difference]: Start difference. First operand 50769 states and 59099 transitions. Second operand 4 states. [2018-11-06 19:12:56,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:12:56,565 INFO L93 Difference]: Finished difference Result 130717 states and 153407 transitions. [2018-11-06 19:12:56,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:12:56,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 358 [2018-11-06 19:12:56,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:12:56,675 INFO L225 Difference]: With dead ends: 130717 [2018-11-06 19:12:56,675 INFO L226 Difference]: Without dead ends: 80738 [2018-11-06 19:12:56,723 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:12:56,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80738 states. [2018-11-06 19:12:58,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80738 to 78349. [2018-11-06 19:12:58,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78349 states. [2018-11-06 19:12:58,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78349 states to 78349 states and 89264 transitions. [2018-11-06 19:12:58,283 INFO L78 Accepts]: Start accepts. Automaton has 78349 states and 89264 transitions. Word has length 358 [2018-11-06 19:12:58,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:12:58,283 INFO L480 AbstractCegarLoop]: Abstraction has 78349 states and 89264 transitions. [2018-11-06 19:12:58,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:12:58,283 INFO L276 IsEmpty]: Start isEmpty. Operand 78349 states and 89264 transitions. [2018-11-06 19:12:58,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2018-11-06 19:12:58,288 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:12:58,288 INFO L375 BasicCegarLoop]: trace histogram [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, 3, 3, 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, 1] [2018-11-06 19:12:58,289 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:12:58,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:12:58,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1803461265, now seen corresponding path program 1 times [2018-11-06 19:12:58,289 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:12:58,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:12:58,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:12:58,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:12:58,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:12:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:12:58,802 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 437 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-06 19:12:58,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:12:58,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:12:58,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:12:58,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:12:58,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:12:58,804 INFO L87 Difference]: Start difference. First operand 78349 states and 89264 transitions. Second operand 5 states. [2018-11-06 19:13:14,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:13:14,804 INFO L93 Difference]: Finished difference Result 283823 states and 323171 transitions. [2018-11-06 19:13:14,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:13:14,804 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 373 [2018-11-06 19:13:14,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:13:15,126 INFO L225 Difference]: With dead ends: 283823 [2018-11-06 19:13:15,126 INFO L226 Difference]: Without dead ends: 206261 [2018-11-06 19:13:15,201 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 19:13:15,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206261 states. [2018-11-06 19:13:16,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206261 to 195057. [2018-11-06 19:13:16,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195057 states. [2018-11-06 19:13:16,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195057 states to 195057 states and 218170 transitions. [2018-11-06 19:13:16,928 INFO L78 Accepts]: Start accepts. Automaton has 195057 states and 218170 transitions. Word has length 373 [2018-11-06 19:13:16,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:13:16,929 INFO L480 AbstractCegarLoop]: Abstraction has 195057 states and 218170 transitions. [2018-11-06 19:13:16,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:13:16,929 INFO L276 IsEmpty]: Start isEmpty. Operand 195057 states and 218170 transitions. [2018-11-06 19:13:16,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2018-11-06 19:13:16,937 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:13:16,937 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2018-11-06 19:13:16,938 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:13:16,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:13:16,938 INFO L82 PathProgramCache]: Analyzing trace with hash 2125912829, now seen corresponding path program 1 times [2018-11-06 19:13:16,938 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:13:16,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:13:16,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:13:16,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:13:16,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:13:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:13:18,731 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 697 proven. 0 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-11-06 19:13:18,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:13:18,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:13:18,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:13:18,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:13:18,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:13:18,733 INFO L87 Difference]: Start difference. First operand 195057 states and 218170 transitions. Second operand 4 states. [2018-11-06 19:13:26,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:13:26,860 INFO L93 Difference]: Finished difference Result 387786 states and 433873 transitions. [2018-11-06 19:13:26,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:13:26,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 463 [2018-11-06 19:13:26,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:13:27,072 INFO L225 Difference]: With dead ends: 387786 [2018-11-06 19:13:27,073 INFO L226 Difference]: Without dead ends: 193519 [2018-11-06 19:13:27,184 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:13:27,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193519 states. [2018-11-06 19:13:29,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193519 to 191900. [2018-11-06 19:13:29,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191900 states. [2018-11-06 19:13:29,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191900 states to 191900 states and 208002 transitions. [2018-11-06 19:13:29,972 INFO L78 Accepts]: Start accepts. Automaton has 191900 states and 208002 transitions. Word has length 463 [2018-11-06 19:13:29,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:13:29,972 INFO L480 AbstractCegarLoop]: Abstraction has 191900 states and 208002 transitions. [2018-11-06 19:13:29,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:13:29,973 INFO L276 IsEmpty]: Start isEmpty. Operand 191900 states and 208002 transitions. [2018-11-06 19:13:29,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2018-11-06 19:13:29,978 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:13:29,978 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:13:29,979 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:13:29,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:13:29,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1451251648, now seen corresponding path program 1 times [2018-11-06 19:13:29,979 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:13:29,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:13:29,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:13:29,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:13:29,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:13:30,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:13:30,341 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 536 proven. 0 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-11-06 19:13:30,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:13:30,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:13:30,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:13:30,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:13:30,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:13:30,343 INFO L87 Difference]: Start difference. First operand 191900 states and 208002 transitions. Second operand 4 states. [2018-11-06 19:13:45,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:13:45,037 INFO L93 Difference]: Finished difference Result 429655 states and 466207 transitions. [2018-11-06 19:13:45,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:13:45,038 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 474 [2018-11-06 19:13:45,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:13:45,372 INFO L225 Difference]: With dead ends: 429655 [2018-11-06 19:13:45,372 INFO L226 Difference]: Without dead ends: 238545 [2018-11-06 19:13:45,445 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:13:45,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238545 states. [2018-11-06 19:13:54,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238545 to 236838. [2018-11-06 19:13:54,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236838 states. [2018-11-06 19:13:54,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236838 states to 236838 states and 256228 transitions. [2018-11-06 19:13:54,432 INFO L78 Accepts]: Start accepts. Automaton has 236838 states and 256228 transitions. Word has length 474 [2018-11-06 19:13:54,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:13:54,432 INFO L480 AbstractCegarLoop]: Abstraction has 236838 states and 256228 transitions. [2018-11-06 19:13:54,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:13:54,433 INFO L276 IsEmpty]: Start isEmpty. Operand 236838 states and 256228 transitions. [2018-11-06 19:13:54,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2018-11-06 19:13:54,438 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:13:54,438 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1] [2018-11-06 19:13:54,439 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:13:54,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:13:54,439 INFO L82 PathProgramCache]: Analyzing trace with hash -747758649, now seen corresponding path program 1 times [2018-11-06 19:13:54,439 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:13:54,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:13:54,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:13:54,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:13:54,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:13:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:13:54,909 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 591 proven. 0 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-11-06 19:13:54,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:13:54,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:13:54,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:13:54,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:13:54,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:13:54,910 INFO L87 Difference]: Start difference. First operand 236838 states and 256228 transitions. Second operand 4 states. [2018-11-06 19:14:03,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:14:03,340 INFO L93 Difference]: Finished difference Result 460228 states and 498756 transitions. [2018-11-06 19:14:03,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:14:03,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 493 [2018-11-06 19:14:03,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:14:03,665 INFO L225 Difference]: With dead ends: 460228 [2018-11-06 19:14:03,666 INFO L226 Difference]: Without dead ends: 224180 [2018-11-06 19:14:03,788 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 19:14:03,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224180 states. [2018-11-06 19:14:06,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224180 to 217871. [2018-11-06 19:14:06,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217871 states. [2018-11-06 19:14:06,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217871 states to 217871 states and 229910 transitions. [2018-11-06 19:14:06,763 INFO L78 Accepts]: Start accepts. Automaton has 217871 states and 229910 transitions. Word has length 493 [2018-11-06 19:14:06,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:14:06,764 INFO L480 AbstractCegarLoop]: Abstraction has 217871 states and 229910 transitions. [2018-11-06 19:14:06,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:14:06,764 INFO L276 IsEmpty]: Start isEmpty. Operand 217871 states and 229910 transitions. [2018-11-06 19:14:06,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2018-11-06 19:14:06,769 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:14:06,769 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-11-06 19:14:06,769 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:14:06,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:14:06,770 INFO L82 PathProgramCache]: Analyzing trace with hash -424031071, now seen corresponding path program 1 times [2018-11-06 19:14:06,770 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:14:06,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:14:06,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:14:06,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:14:06,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:14:06,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:14:08,167 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 318 proven. 0 refuted. 0 times theorem prover too weak. 543 trivial. 0 not checked. [2018-11-06 19:14:08,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:14:08,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:14:08,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:14:08,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:14:08,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:14:08,169 INFO L87 Difference]: Start difference. First operand 217871 states and 229910 transitions. Second operand 3 states. [2018-11-06 19:14:12,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:14:12,012 INFO L93 Difference]: Finished difference Result 434150 states and 458114 transitions. [2018-11-06 19:14:12,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:14:12,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 499 [2018-11-06 19:14:12,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:14:12,263 INFO L225 Difference]: With dead ends: 434150 [2018-11-06 19:14:12,264 INFO L226 Difference]: Without dead ends: 217067 [2018-11-06 19:14:12,406 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:14:12,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217067 states. [2018-11-06 19:14:15,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217067 to 217067. [2018-11-06 19:14:15,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217067 states. [2018-11-06 19:14:15,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217067 states to 217067 states and 228973 transitions. [2018-11-06 19:14:15,551 INFO L78 Accepts]: Start accepts. Automaton has 217067 states and 228973 transitions. Word has length 499 [2018-11-06 19:14:15,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:14:15,552 INFO L480 AbstractCegarLoop]: Abstraction has 217067 states and 228973 transitions. [2018-11-06 19:14:15,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:14:15,552 INFO L276 IsEmpty]: Start isEmpty. Operand 217067 states and 228973 transitions. [2018-11-06 19:14:15,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2018-11-06 19:14:15,558 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:14:15,558 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:14:15,559 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:14:15,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:14:15,559 INFO L82 PathProgramCache]: Analyzing trace with hash 118459583, now seen corresponding path program 1 times [2018-11-06 19:14:15,559 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:14:15,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:14:15,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:14:15,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:14:15,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:14:15,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:14:16,181 WARN L179 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-11-06 19:14:16,919 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 332 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2018-11-06 19:14:16,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:14:16,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:14:16,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:14:16,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:14:16,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:14:16,924 INFO L87 Difference]: Start difference. First operand 217067 states and 228973 transitions. Second operand 4 states. [2018-11-06 19:14:26,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:14:26,128 INFO L93 Difference]: Finished difference Result 433380 states and 457096 transitions. [2018-11-06 19:14:26,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:14:26,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 504 [2018-11-06 19:14:26,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:14:26,394 INFO L225 Difference]: With dead ends: 433380 [2018-11-06 19:14:26,394 INFO L226 Difference]: Without dead ends: 217103 [2018-11-06 19:14:26,467 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:14:26,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217103 states. [2018-11-06 19:14:29,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217103 to 205242. [2018-11-06 19:14:29,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205242 states. [2018-11-06 19:14:29,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205242 states to 205242 states and 213841 transitions. [2018-11-06 19:14:29,531 INFO L78 Accepts]: Start accepts. Automaton has 205242 states and 213841 transitions. Word has length 504 [2018-11-06 19:14:29,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:14:29,531 INFO L480 AbstractCegarLoop]: Abstraction has 205242 states and 213841 transitions. [2018-11-06 19:14:29,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:14:29,531 INFO L276 IsEmpty]: Start isEmpty. Operand 205242 states and 213841 transitions. [2018-11-06 19:14:29,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2018-11-06 19:14:29,537 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:14:29,538 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:14:29,538 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:14:29,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:14:29,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1313538292, now seen corresponding path program 1 times [2018-11-06 19:14:29,539 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:14:29,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:14:29,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:14:29,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:14:29,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:14:29,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:14:30,027 INFO L134 CoverageAnalysis]: Checked inductivity of 894 backedges. 332 proven. 0 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2018-11-06 19:14:30,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:14:30,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:14:30,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:14:30,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:14:30,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:14:30,029 INFO L87 Difference]: Start difference. First operand 205242 states and 213841 transitions. Second operand 4 states. [2018-11-06 19:14:39,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:14:39,637 INFO L93 Difference]: Finished difference Result 436509 states and 454578 transitions. [2018-11-06 19:14:39,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:14:39,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 513 [2018-11-06 19:14:39,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:14:39,900 INFO L225 Difference]: With dead ends: 436509 [2018-11-06 19:14:39,900 INFO L226 Difference]: Without dead ends: 232057 [2018-11-06 19:14:39,990 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 19:14:40,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232057 states. [2018-11-06 19:14:46,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232057 to 202877. [2018-11-06 19:14:46,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202877 states. [2018-11-06 19:14:46,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202877 states to 202877 states and 210504 transitions. [2018-11-06 19:14:46,558 INFO L78 Accepts]: Start accepts. Automaton has 202877 states and 210504 transitions. Word has length 513 [2018-11-06 19:14:46,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:14:46,558 INFO L480 AbstractCegarLoop]: Abstraction has 202877 states and 210504 transitions. [2018-11-06 19:14:46,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:14:46,558 INFO L276 IsEmpty]: Start isEmpty. Operand 202877 states and 210504 transitions. [2018-11-06 19:14:46,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2018-11-06 19:14:46,565 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:14:46,566 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:14:46,566 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:14:46,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:14:46,566 INFO L82 PathProgramCache]: Analyzing trace with hash -159324424, now seen corresponding path program 1 times [2018-11-06 19:14:46,566 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:14:46,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:14:46,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:14:46,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:14:46,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:14:46,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:14:47,258 WARN L179 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 7 [2018-11-06 19:14:47,639 WARN L179 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 8 [2018-11-06 19:14:47,821 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 580 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2018-11-06 19:14:47,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:14:47,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 19:14:47,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 19:14:47,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 19:14:47,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:14:47,823 INFO L87 Difference]: Start difference. First operand 202877 states and 210504 transitions. Second operand 6 states. Received shutdown request... [2018-11-06 19:14:52,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 19:14:52,442 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-06 19:14:52,448 WARN L205 ceAbstractionStarter]: Timeout [2018-11-06 19:14:52,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:14:52 BoogieIcfgContainer [2018-11-06 19:14:52,449 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 19:14:52,449 INFO L168 Benchmark]: Toolchain (without parser) took 219662.16 ms. Allocated memory was 1.5 GB in the beginning and 5.2 GB in the end (delta: 3.7 GB). Free memory was 1.4 GB in the beginning and 4.1 GB in the end (delta: -2.7 GB). Peak memory consumption was 984.5 MB. Max. memory is 7.1 GB. [2018-11-06 19:14:52,451 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 19:14:52,451 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2728.89 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. [2018-11-06 19:14:52,452 INFO L168 Benchmark]: Boogie Procedure Inliner took 836.61 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 797.4 MB). Free memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: -989.5 MB). Peak memory consumption was 67.6 MB. Max. memory is 7.1 GB. [2018-11-06 19:14:52,453 INFO L168 Benchmark]: Boogie Preprocessor took 505.93 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 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 19:14:52,454 INFO L168 Benchmark]: RCFGBuilder took 10419.15 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 251.7 MB). Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 26.4 MB). Peak memory consumption was 579.1 MB. Max. memory is 7.1 GB. [2018-11-06 19:14:52,455 INFO L168 Benchmark]: TraceAbstraction took 205164.28 ms. Allocated memory was 2.6 GB in the beginning and 5.2 GB in the end (delta: 2.6 GB). Free memory was 2.0 GB in the beginning and 4.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 577.0 MB. Max. memory is 7.1 GB. [2018-11-06 19:14:52,460 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2728.89 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 836.61 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 797.4 MB). Free memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: -989.5 MB). Peak memory consumption was 67.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 505.93 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 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 10419.15 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 251.7 MB). Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 26.4 MB). Peak memory consumption was 579.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 205164.28 ms. Allocated memory was 2.6 GB in the beginning and 5.2 GB in the end (delta: 2.6 GB). Free memory was 2.0 GB in the beginning and 4.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 577.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 57]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 57). Cancelled while BasicCegarLoop was constructing difference of abstraction (202877states) and FLOYD_HOARE automaton (currently 6 states, 6 states before enhancement),while ReachableStatesComputation was computing reachable states (13360 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1099 locations, 1 error locations. TIMEOUT Result, 205.0s OverallTime, 16 OverallIterations, 6 TraceHistogramMax, 158.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 11546 SDtfs, 34113 SDslu, 3978 SDs, 0 SdLazy, 75831 SolverSat, 15227 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 119.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 660 GetRequests, 615 SyntacticMatches, 9 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=236838occurred in iteration=11, 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: 34.5s AutomataMinimizationTime, 15 MinimizatonAttempts, 90435 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 6142 NumberOfCodeBlocks, 6142 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 6123 ConstructedInterpolants, 0 QuantifiedInterpolants, 5375636 SizeOfPredicates, 1 NumberOfNonLiveVariables, 877 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 19 InterpolantComputations, 16 PerfectInterpolantSequences, 8088/8162 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown