java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/locks/test_locks_5.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:00:19,609 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:00:19,611 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:00:19,624 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:00:19,624 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:00:19,625 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:00:19,627 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:00:19,629 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:00:19,641 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:00:19,643 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:00:19,644 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:00:19,646 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:00:19,647 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:00:19,648 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:00:19,649 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:00:19,651 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:00:19,652 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:00:19,653 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:00:19,655 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:00:19,657 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:00:19,658 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:00:19,662 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:00:19,664 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:00:19,665 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:00:19,667 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:00:19,667 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:00:19,668 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:00:19,669 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:00:19,669 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:00:19,671 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:00:19,672 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:00:19,673 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:00:19,675 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:00:19,676 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:00:19,677 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:00:19,677 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:00:19,680 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:00:19,680 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:00:19,680 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:00:19,681 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:00:19,682 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:00:19,684 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-20 13:00:19,708 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:00:19,708 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:00:19,710 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 13:00:19,711 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 13:00:19,711 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 13:00:19,711 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:00:19,712 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:00:19,712 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 13:00:19,712 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:00:19,712 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:00:19,713 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:00:19,713 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:00:19,714 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:00:19,714 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:00:19,714 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:00:19,715 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 13:00:19,715 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:00:19,715 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:00:19,715 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:00:19,716 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 13:00:19,716 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 13:00:19,716 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:00:19,716 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:00:19,717 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:00:19,717 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 13:00:19,717 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 13:00:19,717 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:00:19,718 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 13:00:19,718 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:00:19,771 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:00:19,790 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:00:19,795 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:00:19,796 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:00:19,797 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:00:19,798 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_5.c [2019-09-20 13:00:19,874 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2dbbde42/98871c4ccde64b79bf166deacae0542f/FLAGcd6ab251f [2019-09-20 13:00:20,294 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:00:20,295 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_5.c [2019-09-20 13:00:20,302 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2dbbde42/98871c4ccde64b79bf166deacae0542f/FLAGcd6ab251f [2019-09-20 13:00:20,677 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2dbbde42/98871c4ccde64b79bf166deacae0542f [2019-09-20 13:00:20,695 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:00:20,698 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:00:20,701 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:00:20,701 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:00:20,705 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:00:20,706 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:00:20" (1/1) ... [2019-09-20 13:00:20,709 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dc1d1fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:20, skipping insertion in model container [2019-09-20 13:00:20,709 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:00:20" (1/1) ... [2019-09-20 13:00:20,717 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:00:20,742 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:00:20,944 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:00:20,949 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:00:20,971 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:00:20,987 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:00:20,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:20 WrapperNode [2019-09-20 13:00:20,988 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:00:20,989 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:00:20,989 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:00:20,989 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:00:21,090 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:20" (1/1) ... [2019-09-20 13:00:21,091 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:20" (1/1) ... [2019-09-20 13:00:21,099 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:20" (1/1) ... [2019-09-20 13:00:21,101 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:20" (1/1) ... [2019-09-20 13:00:21,110 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:20" (1/1) ... [2019-09-20 13:00:21,118 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:20" (1/1) ... [2019-09-20 13:00:21,126 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:20" (1/1) ... [2019-09-20 13:00:21,132 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:00:21,132 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:00:21,132 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:00:21,132 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:00:21,133 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:20" (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 [2019-09-20 13:00:21,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:00:21,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:00:21,184 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:00:21,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:00:21,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:00:21,184 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:00:21,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:00:21,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:00:21,451 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:00:21,451 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:00:21,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:00:21 BoogieIcfgContainer [2019-09-20 13:00:21,453 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:00:21,462 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:00:21,463 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:00:21,468 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:00:21,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:00:20" (1/3) ... [2019-09-20 13:00:21,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@769c7f5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:00:21, skipping insertion in model container [2019-09-20 13:00:21,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:20" (2/3) ... [2019-09-20 13:00:21,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@769c7f5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:00:21, skipping insertion in model container [2019-09-20 13:00:21,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:00:21" (3/3) ... [2019-09-20 13:00:21,482 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_5.c [2019-09-20 13:00:21,493 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:00:21,502 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:00:21,528 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:00:21,559 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 13:00:21,560 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:00:21,560 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 13:00:21,560 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:00:21,561 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:00:21,561 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:00:21,561 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:00:21,561 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:00:21,561 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:00:21,581 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-09-20 13:00:21,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-20 13:00:21,587 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:21,588 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:21,590 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:21,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:21,595 INFO L82 PathProgramCache]: Analyzing trace with hash 316328318, now seen corresponding path program 1 times [2019-09-20 13:00:21,597 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:21,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:21,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:21,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:21,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:21,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:21,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:21,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:21,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:21,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:21,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:21,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:21,792 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2019-09-20 13:00:21,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:21,857 INFO L93 Difference]: Finished difference Result 57 states and 90 transitions. [2019-09-20 13:00:21,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:21,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-09-20 13:00:21,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:21,870 INFO L225 Difference]: With dead ends: 57 [2019-09-20 13:00:21,871 INFO L226 Difference]: Without dead ends: 42 [2019-09-20 13:00:21,873 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:21,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-20 13:00:21,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2019-09-20 13:00:21,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-20 13:00:21,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 49 transitions. [2019-09-20 13:00:21,920 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 49 transitions. Word has length 15 [2019-09-20 13:00:21,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:21,920 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 49 transitions. [2019-09-20 13:00:21,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:21,921 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 49 transitions. [2019-09-20 13:00:21,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-20 13:00:21,922 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:21,922 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:21,922 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:21,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:21,923 INFO L82 PathProgramCache]: Analyzing trace with hash -493018308, now seen corresponding path program 1 times [2019-09-20 13:00:21,923 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:21,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:21,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:21,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:21,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:21,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:22,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:22,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:22,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:22,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:22,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:22,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:22,012 INFO L87 Difference]: Start difference. First operand 30 states and 49 transitions. Second operand 3 states. [2019-09-20 13:00:22,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:22,072 INFO L93 Difference]: Finished difference Result 67 states and 112 transitions. [2019-09-20 13:00:22,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:22,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-09-20 13:00:22,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:22,074 INFO L225 Difference]: With dead ends: 67 [2019-09-20 13:00:22,075 INFO L226 Difference]: Without dead ends: 42 [2019-09-20 13:00:22,076 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:22,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-20 13:00:22,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-09-20 13:00:22,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-20 13:00:22,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 65 transitions. [2019-09-20 13:00:22,089 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 65 transitions. Word has length 15 [2019-09-20 13:00:22,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:22,090 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 65 transitions. [2019-09-20 13:00:22,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:22,091 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 65 transitions. [2019-09-20 13:00:22,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-20 13:00:22,093 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:22,093 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:22,094 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:22,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:22,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1216458266, now seen corresponding path program 1 times [2019-09-20 13:00:22,096 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:22,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:22,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:22,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:22,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:22,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:22,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:22,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:22,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:22,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:22,183 INFO L87 Difference]: Start difference. First operand 40 states and 65 transitions. Second operand 3 states. [2019-09-20 13:00:22,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:22,224 INFO L93 Difference]: Finished difference Result 63 states and 99 transitions. [2019-09-20 13:00:22,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:22,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-09-20 13:00:22,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:22,228 INFO L225 Difference]: With dead ends: 63 [2019-09-20 13:00:22,230 INFO L226 Difference]: Without dead ends: 45 [2019-09-20 13:00:22,231 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:22,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-20 13:00:22,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2019-09-20 13:00:22,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-20 13:00:22,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 67 transitions. [2019-09-20 13:00:22,248 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 67 transitions. Word has length 16 [2019-09-20 13:00:22,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:22,249 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 67 transitions. [2019-09-20 13:00:22,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:22,251 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 67 transitions. [2019-09-20 13:00:22,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-20 13:00:22,253 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:22,258 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:22,259 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:22,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:22,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1896516636, now seen corresponding path program 1 times [2019-09-20 13:00:22,261 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:22,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:22,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:22,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:22,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:22,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:22,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:22,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:22,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:22,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:22,323 INFO L87 Difference]: Start difference. First operand 43 states and 67 transitions. Second operand 3 states. [2019-09-20 13:00:22,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:22,355 INFO L93 Difference]: Finished difference Result 76 states and 120 transitions. [2019-09-20 13:00:22,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:22,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-09-20 13:00:22,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:22,358 INFO L225 Difference]: With dead ends: 76 [2019-09-20 13:00:22,359 INFO L226 Difference]: Without dead ends: 74 [2019-09-20 13:00:22,360 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:22,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-20 13:00:22,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 56. [2019-09-20 13:00:22,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-20 13:00:22,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 88 transitions. [2019-09-20 13:00:22,379 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 88 transitions. Word has length 16 [2019-09-20 13:00:22,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:22,380 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 88 transitions. [2019-09-20 13:00:22,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:22,380 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 88 transitions. [2019-09-20 13:00:22,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-20 13:00:22,381 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:22,382 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:22,382 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:22,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:22,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1087170010, now seen corresponding path program 1 times [2019-09-20 13:00:22,383 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:22,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:22,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:22,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:22,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:22,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:22,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:22,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:22,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:22,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:22,427 INFO L87 Difference]: Start difference. First operand 56 states and 88 transitions. Second operand 3 states. [2019-09-20 13:00:22,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:22,457 INFO L93 Difference]: Finished difference Result 124 states and 198 transitions. [2019-09-20 13:00:22,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:22,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-09-20 13:00:22,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:22,463 INFO L225 Difference]: With dead ends: 124 [2019-09-20 13:00:22,463 INFO L226 Difference]: Without dead ends: 76 [2019-09-20 13:00:22,464 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:22,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-20 13:00:22,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2019-09-20 13:00:22,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-09-20 13:00:22,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 114 transitions. [2019-09-20 13:00:22,473 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 114 transitions. Word has length 16 [2019-09-20 13:00:22,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:22,474 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 114 transitions. [2019-09-20 13:00:22,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:22,474 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 114 transitions. [2019-09-20 13:00:22,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-20 13:00:22,476 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:22,476 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:22,476 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:22,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:22,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1337311087, now seen corresponding path program 1 times [2019-09-20 13:00:22,478 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:22,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:22,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:22,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:22,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:22,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:22,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:22,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:22,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:22,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:22,551 INFO L87 Difference]: Start difference. First operand 74 states and 114 transitions. Second operand 3 states. [2019-09-20 13:00:22,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:22,585 INFO L93 Difference]: Finished difference Result 111 states and 169 transitions. [2019-09-20 13:00:22,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:22,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-20 13:00:22,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:22,587 INFO L225 Difference]: With dead ends: 111 [2019-09-20 13:00:22,587 INFO L226 Difference]: Without dead ends: 78 [2019-09-20 13:00:22,587 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:22,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-20 13:00:22,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-09-20 13:00:22,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-20 13:00:22,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 114 transitions. [2019-09-20 13:00:22,596 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 114 transitions. Word has length 17 [2019-09-20 13:00:22,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:22,597 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 114 transitions. [2019-09-20 13:00:22,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:22,597 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 114 transitions. [2019-09-20 13:00:22,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-20 13:00:22,598 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:22,598 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:22,599 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:22,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:22,599 INFO L82 PathProgramCache]: Analyzing trace with hash -657252717, now seen corresponding path program 1 times [2019-09-20 13:00:22,599 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:22,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:22,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:22,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:22,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:22,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:22,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:22,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:22,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:22,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:22,629 INFO L87 Difference]: Start difference. First operand 76 states and 114 transitions. Second operand 3 states. [2019-09-20 13:00:22,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:22,653 INFO L93 Difference]: Finished difference Result 132 states and 200 transitions. [2019-09-20 13:00:22,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:22,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-20 13:00:22,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:22,656 INFO L225 Difference]: With dead ends: 132 [2019-09-20 13:00:22,656 INFO L226 Difference]: Without dead ends: 130 [2019-09-20 13:00:22,656 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:22,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-09-20 13:00:22,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 104. [2019-09-20 13:00:22,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-20 13:00:22,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 154 transitions. [2019-09-20 13:00:22,668 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 154 transitions. Word has length 17 [2019-09-20 13:00:22,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:22,669 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 154 transitions. [2019-09-20 13:00:22,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:22,669 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 154 transitions. [2019-09-20 13:00:22,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-20 13:00:22,670 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:22,671 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:22,671 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:22,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:22,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1466599343, now seen corresponding path program 1 times [2019-09-20 13:00:22,672 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:22,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:22,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:22,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:22,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:22,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:22,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:22,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:22,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:22,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:22,700 INFO L87 Difference]: Start difference. First operand 104 states and 154 transitions. Second operand 3 states. [2019-09-20 13:00:22,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:22,736 INFO L93 Difference]: Finished difference Result 232 states and 344 transitions. [2019-09-20 13:00:22,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:22,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-20 13:00:22,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:22,739 INFO L225 Difference]: With dead ends: 232 [2019-09-20 13:00:22,739 INFO L226 Difference]: Without dead ends: 138 [2019-09-20 13:00:22,740 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:22,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-09-20 13:00:22,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2019-09-20 13:00:22,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-09-20 13:00:22,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 194 transitions. [2019-09-20 13:00:22,754 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 194 transitions. Word has length 17 [2019-09-20 13:00:22,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:22,754 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 194 transitions. [2019-09-20 13:00:22,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:22,755 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 194 transitions. [2019-09-20 13:00:22,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-20 13:00:22,756 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:22,756 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:22,757 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:22,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:22,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1100217935, now seen corresponding path program 1 times [2019-09-20 13:00:22,757 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:22,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:22,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:22,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:22,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:22,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:22,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:22,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:22,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:22,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:22,781 INFO L87 Difference]: Start difference. First operand 136 states and 194 transitions. Second operand 3 states. [2019-09-20 13:00:22,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:22,799 INFO L93 Difference]: Finished difference Result 204 states and 288 transitions. [2019-09-20 13:00:22,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:22,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-20 13:00:22,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:22,801 INFO L225 Difference]: With dead ends: 204 [2019-09-20 13:00:22,801 INFO L226 Difference]: Without dead ends: 142 [2019-09-20 13:00:22,802 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:22,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-09-20 13:00:22,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2019-09-20 13:00:22,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-20 13:00:22,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 194 transitions. [2019-09-20 13:00:22,813 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 194 transitions. Word has length 18 [2019-09-20 13:00:22,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:22,814 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 194 transitions. [2019-09-20 13:00:22,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:22,814 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 194 transitions. [2019-09-20 13:00:22,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-20 13:00:22,816 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:22,816 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:22,816 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:22,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:22,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1780276305, now seen corresponding path program 1 times [2019-09-20 13:00:22,817 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:22,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:22,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:22,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:22,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:22,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:22,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:22,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:22,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:22,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:22,840 INFO L87 Difference]: Start difference. First operand 140 states and 194 transitions. Second operand 3 states. [2019-09-20 13:00:22,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:22,873 INFO L93 Difference]: Finished difference Result 236 states and 328 transitions. [2019-09-20 13:00:22,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:22,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-20 13:00:22,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:22,879 INFO L225 Difference]: With dead ends: 236 [2019-09-20 13:00:22,880 INFO L226 Difference]: Without dead ends: 234 [2019-09-20 13:00:22,881 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:22,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-09-20 13:00:22,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 200. [2019-09-20 13:00:22,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-20 13:00:22,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 270 transitions. [2019-09-20 13:00:22,894 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 270 transitions. Word has length 18 [2019-09-20 13:00:22,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:22,895 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 270 transitions. [2019-09-20 13:00:22,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:22,895 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 270 transitions. [2019-09-20 13:00:22,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-20 13:00:22,897 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:22,897 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:22,898 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:22,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:22,898 INFO L82 PathProgramCache]: Analyzing trace with hash 970929679, now seen corresponding path program 1 times [2019-09-20 13:00:22,899 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:22,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:22,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:22,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:22,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:22,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:22,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:22,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:22,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:22,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:22,931 INFO L87 Difference]: Start difference. First operand 200 states and 270 transitions. Second operand 3 states. [2019-09-20 13:00:22,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:22,954 INFO L93 Difference]: Finished difference Result 444 states and 592 transitions. [2019-09-20 13:00:22,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:22,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-20 13:00:22,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:22,957 INFO L225 Difference]: With dead ends: 444 [2019-09-20 13:00:22,957 INFO L226 Difference]: Without dead ends: 258 [2019-09-20 13:00:22,958 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:22,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-09-20 13:00:22,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-09-20 13:00:22,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:00:22,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 326 transitions. [2019-09-20 13:00:22,972 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 326 transitions. Word has length 18 [2019-09-20 13:00:22,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:22,973 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 326 transitions. [2019-09-20 13:00:22,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:22,973 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 326 transitions. [2019-09-20 13:00:22,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-20 13:00:22,974 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:22,975 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:22,975 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:22,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:22,975 INFO L82 PathProgramCache]: Analyzing trace with hash -645793370, now seen corresponding path program 1 times [2019-09-20 13:00:22,975 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:22,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:22,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:22,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:23,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:23,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:23,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:23,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:23,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:23,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:23,014 INFO L87 Difference]: Start difference. First operand 256 states and 326 transitions. Second operand 3 states. [2019-09-20 13:00:23,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:23,036 INFO L93 Difference]: Finished difference Result 384 states and 484 transitions. [2019-09-20 13:00:23,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:23,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-20 13:00:23,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:23,039 INFO L225 Difference]: With dead ends: 384 [2019-09-20 13:00:23,039 INFO L226 Difference]: Without dead ends: 266 [2019-09-20 13:00:23,040 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:23,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-09-20 13:00:23,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 264. [2019-09-20 13:00:23,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-09-20 13:00:23,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 326 transitions. [2019-09-20 13:00:23,052 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 326 transitions. Word has length 19 [2019-09-20 13:00:23,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:23,053 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 326 transitions. [2019-09-20 13:00:23,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:23,053 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 326 transitions. [2019-09-20 13:00:23,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-20 13:00:23,054 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:23,054 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:23,055 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:23,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:23,055 INFO L82 PathProgramCache]: Analyzing trace with hash 34265000, now seen corresponding path program 1 times [2019-09-20 13:00:23,055 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:23,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:23,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:23,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:23,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:23,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:23,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:23,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:23,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:23,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:23,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:23,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:23,081 INFO L87 Difference]: Start difference. First operand 264 states and 326 transitions. Second operand 3 states. [2019-09-20 13:00:23,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:23,103 INFO L93 Difference]: Finished difference Result 426 states and 519 transitions. [2019-09-20 13:00:23,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:23,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-20 13:00:23,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:23,106 INFO L225 Difference]: With dead ends: 426 [2019-09-20 13:00:23,106 INFO L226 Difference]: Without dead ends: 424 [2019-09-20 13:00:23,107 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:23,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-09-20 13:00:23,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 392. [2019-09-20 13:00:23,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-09-20 13:00:23,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 470 transitions. [2019-09-20 13:00:23,120 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 470 transitions. Word has length 19 [2019-09-20 13:00:23,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:23,120 INFO L475 AbstractCegarLoop]: Abstraction has 392 states and 470 transitions. [2019-09-20 13:00:23,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:23,121 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 470 transitions. [2019-09-20 13:00:23,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-20 13:00:23,122 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:23,122 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:23,122 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:23,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:23,123 INFO L82 PathProgramCache]: Analyzing trace with hash -775081626, now seen corresponding path program 1 times [2019-09-20 13:00:23,123 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:23,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:23,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:23,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:23,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:23,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:23,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:23,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:23,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:23,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:23,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:23,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:23,147 INFO L87 Difference]: Start difference. First operand 392 states and 470 transitions. Second operand 3 states. [2019-09-20 13:00:23,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:23,172 INFO L93 Difference]: Finished difference Result 856 states and 998 transitions. [2019-09-20 13:00:23,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:23,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-20 13:00:23,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:23,173 INFO L225 Difference]: With dead ends: 856 [2019-09-20 13:00:23,173 INFO L226 Difference]: Without dead ends: 0 [2019-09-20 13:00:23,175 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:23,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-20 13:00:23,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-20 13:00:23,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-20 13:00:23,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-20 13:00:23,176 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2019-09-20 13:00:23,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:23,176 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-20 13:00:23,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:23,177 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-20 13:00:23,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-20 13:00:23,182 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-20 13:00:23,208 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-20 13:00:23,209 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-20 13:00:23,209 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-20 13:00:23,209 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-20 13:00:23,209 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-20 13:00:23,209 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-20 13:00:23,209 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-09-20 13:00:23,209 INFO L446 ceAbstractionStarter]: At program point L89(lines 5 93) the Hoare annotation is: true [2019-09-20 13:00:23,210 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 93) no Hoare annotation was computed. [2019-09-20 13:00:23,210 INFO L443 ceAbstractionStarter]: For program point L73-1(lines 24 88) no Hoare annotation was computed. [2019-09-20 13:00:23,210 INFO L443 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-09-20 13:00:23,210 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 24 88) no Hoare annotation was computed. [2019-09-20 13:00:23,210 INFO L443 ceAbstractionStarter]: For program point L53-1(lines 24 88) no Hoare annotation was computed. [2019-09-20 13:00:23,210 INFO L443 ceAbstractionStarter]: For program point L49-1(lines 24 88) no Hoare annotation was computed. [2019-09-20 13:00:23,210 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 24 88) no Hoare annotation was computed. [2019-09-20 13:00:23,210 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 24 88) no Hoare annotation was computed. [2019-09-20 13:00:23,211 INFO L443 ceAbstractionStarter]: For program point L74(line 74) no Hoare annotation was computed. [2019-09-20 13:00:23,211 INFO L443 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2019-09-20 13:00:23,211 INFO L443 ceAbstractionStarter]: For program point L41-2(lines 24 88) no Hoare annotation was computed. [2019-09-20 13:00:23,211 INFO L446 ceAbstractionStarter]: At program point L83-1(lines 24 88) the Hoare annotation is: true [2019-09-20 13:00:23,211 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-09-20 13:00:23,211 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 93) no Hoare annotation was computed. [2019-09-20 13:00:23,211 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 24 88) no Hoare annotation was computed. [2019-09-20 13:00:23,211 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 93) the Hoare annotation is: true [2019-09-20 13:00:23,211 INFO L443 ceAbstractionStarter]: For program point L26(lines 26 28) no Hoare annotation was computed. [2019-09-20 13:00:23,212 INFO L443 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-09-20 13:00:23,212 INFO L439 ceAbstractionStarter]: At program point L84-1(lines 5 93) the Hoare annotation is: false [2019-09-20 13:00:23,212 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 91) no Hoare annotation was computed. [2019-09-20 13:00:23,212 INFO L443 ceAbstractionStarter]: For program point L68-1(lines 24 88) no Hoare annotation was computed. [2019-09-20 13:00:23,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:00:23 BoogieIcfgContainer [2019-09-20 13:00:23,221 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 13:00:23,224 INFO L168 Benchmark]: Toolchain (without parser) took 2525.99 ms. Allocated memory was 132.1 MB in the beginning and 221.2 MB in the end (delta: 89.1 MB). Free memory was 87.8 MB in the beginning and 148.0 MB in the end (delta: -60.2 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. [2019-09-20 13:00:23,225 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 132.1 MB. Free memory was 106.1 MB in the beginning and 105.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-20 13:00:23,226 INFO L168 Benchmark]: CACSL2BoogieTranslator took 287.92 ms. Allocated memory is still 132.1 MB. Free memory was 87.6 MB in the beginning and 77.7 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-09-20 13:00:23,227 INFO L168 Benchmark]: Boogie Preprocessor took 142.81 ms. Allocated memory was 132.1 MB in the beginning and 198.2 MB in the end (delta: 66.1 MB). Free memory was 77.7 MB in the beginning and 174.6 MB in the end (delta: -96.8 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. [2019-09-20 13:00:23,228 INFO L168 Benchmark]: RCFGBuilder took 321.25 ms. Allocated memory is still 198.2 MB. Free memory was 174.6 MB in the beginning and 159.4 MB in the end (delta: 15.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 7.1 GB. [2019-09-20 13:00:23,228 INFO L168 Benchmark]: TraceAbstraction took 1758.86 ms. Allocated memory was 198.2 MB in the beginning and 221.2 MB in the end (delta: 23.1 MB). Free memory was 159.4 MB in the beginning and 148.0 MB in the end (delta: 11.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. [2019-09-20 13:00:23,232 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.50 ms. Allocated memory is still 132.1 MB. Free memory was 106.1 MB in the beginning and 105.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 287.92 ms. Allocated memory is still 132.1 MB. Free memory was 87.6 MB in the beginning and 77.7 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 142.81 ms. Allocated memory was 132.1 MB in the beginning and 198.2 MB in the end (delta: 66.1 MB). Free memory was 77.7 MB in the beginning and 174.6 MB in the end (delta: -96.8 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 321.25 ms. Allocated memory is still 198.2 MB. Free memory was 174.6 MB in the beginning and 159.4 MB in the end (delta: 15.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1758.86 ms. Allocated memory was 198.2 MB in the beginning and 221.2 MB in the end (delta: 23.1 MB). Free memory was 159.4 MB in the beginning and 148.0 MB in the end (delta: 11.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 91]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. SAFE Result, 1.6s OverallTime, 14 OverallIterations, 1 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 654 SDtfs, 285 SDslu, 428 SDs, 0 SdLazy, 75 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=392occurred in iteration=13, 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: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 138 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 42 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 240 NumberOfCodeBlocks, 240 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 226 ConstructedInterpolants, 0 QuantifiedInterpolants, 6424 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...