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_7.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 13:05:09,704 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 13:05:09,706 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 13:05:09,720 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 13:05:09,721 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 13:05:09,722 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 13:05:09,723 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 13:05:09,725 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 13:05:09,727 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 13:05:09,728 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 13:05:09,729 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 13:05:09,730 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 13:05:09,731 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 13:05:09,732 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 13:05:09,733 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 13:05:09,734 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 13:05:09,735 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 13:05:09,736 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 13:05:09,737 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 13:05:09,743 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 13:05:09,744 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 13:05:09,748 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 13:05:09,749 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 13:05:09,752 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 13:05:09,758 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 13:05:09,758 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 13:05:09,759 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 13:05:09,760 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 13:05:09,760 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 13:05:09,763 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 13:05:09,763 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 13:05:09,766 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 13:05:09,767 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 13:05:09,769 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 13:05:09,770 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 13:05:09,770 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 13:05:09,771 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 13:05:09,771 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 13:05:09,771 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 13:05:09,772 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 13:05:09,776 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 13:05:09,776 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-07 13:05:09,807 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 13:05:09,808 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 13:05:09,809 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 13:05:09,809 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 13:05:09,810 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 13:05:09,810 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 13:05:09,810 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 13:05:09,810 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 13:05:09,811 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 13:05:09,811 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 13:05:09,811 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 13:05:09,811 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 13:05:09,811 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 13:05:09,812 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 13:05:09,812 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 13:05:09,812 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 13:05:09,812 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 13:05:09,812 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 13:05:09,813 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 13:05:09,813 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 13:05:09,813 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 13:05:09,813 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 13:05:09,814 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 13:05:09,814 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 13:05:09,814 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 13:05:09,814 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 13:05:09,814 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 13:05:09,815 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 13:05:09,815 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 13:05:09,842 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 13:05:09,856 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 13:05:09,860 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 13:05:09,862 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 13:05:09,864 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 13:05:09,865 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_7.c [2019-09-07 13:05:09,936 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1e9afd2a/1ef568d301784124a51d709fa1917027/FLAGc86d0ce81 [2019-09-07 13:05:10,438 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 13:05:10,439 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c [2019-09-07 13:05:10,448 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1e9afd2a/1ef568d301784124a51d709fa1917027/FLAGc86d0ce81 [2019-09-07 13:05:10,847 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1e9afd2a/1ef568d301784124a51d709fa1917027 [2019-09-07 13:05:10,857 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 13:05:10,859 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 13:05:10,859 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 13:05:10,859 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 13:05:10,863 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 13:05:10,864 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 01:05:10" (1/1) ... [2019-09-07 13:05:10,866 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@659a6581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:05:10, skipping insertion in model container [2019-09-07 13:05:10,867 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 01:05:10" (1/1) ... [2019-09-07 13:05:10,874 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 13:05:10,894 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 13:05:11,086 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 13:05:11,091 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 13:05:11,113 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 13:05:11,211 INFO L192 MainTranslator]: Completed translation [2019-09-07 13:05:11,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:05:11 WrapperNode [2019-09-07 13:05:11,211 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 13:05:11,212 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 13:05:11,212 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 13:05:11,212 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 13:05:11,221 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:05:11" (1/1) ... [2019-09-07 13:05:11,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:05:11" (1/1) ... [2019-09-07 13:05:11,226 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:05:11" (1/1) ... [2019-09-07 13:05:11,227 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:05:11" (1/1) ... [2019-09-07 13:05:11,236 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:05:11" (1/1) ... [2019-09-07 13:05:11,243 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:05:11" (1/1) ... [2019-09-07 13:05:11,244 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:05:11" (1/1) ... [2019-09-07 13:05:11,246 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 13:05:11,246 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 13:05:11,247 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 13:05:11,247 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 13:05:11,248 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:05:11" (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-07 13:05:11,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 13:05:11,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 13:05:11,305 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 13:05:11,305 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 13:05:11,305 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 13:05:11,305 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 13:05:11,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 13:05:11,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 13:05:11,539 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 13:05:11,540 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 13:05:11,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 01:05:11 BoogieIcfgContainer [2019-09-07 13:05:11,541 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 13:05:11,542 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 13:05:11,542 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 13:05:11,545 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 13:05:11,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 01:05:10" (1/3) ... [2019-09-07 13:05:11,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ab73be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 01:05:11, skipping insertion in model container [2019-09-07 13:05:11,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:05:11" (2/3) ... [2019-09-07 13:05:11,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ab73be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 01:05:11, skipping insertion in model container [2019-09-07 13:05:11,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 01:05:11" (3/3) ... [2019-09-07 13:05:11,549 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2019-09-07 13:05:11,560 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 13:05:11,568 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 13:05:11,586 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 13:05:11,621 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 13:05:11,622 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 13:05:11,622 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 13:05:11,623 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 13:05:11,623 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 13:05:11,623 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 13:05:11,624 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 13:05:11,624 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 13:05:11,624 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 13:05:11,667 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-09-07 13:05:11,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-07 13:05:11,674 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:11,675 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:05:11,677 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:11,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:11,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1819770524, now seen corresponding path program 1 times [2019-09-07 13:05:11,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:11,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:11,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:11,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:11,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:11,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:11,865 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-07 13:05:11,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:11,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:11,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:11,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:11,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:11,891 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2019-09-07 13:05:11,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:11,953 INFO L93 Difference]: Finished difference Result 69 states and 114 transitions. [2019-09-07 13:05:11,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:11,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-07 13:05:11,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:11,965 INFO L225 Difference]: With dead ends: 69 [2019-09-07 13:05:11,965 INFO L226 Difference]: Without dead ends: 54 [2019-09-07 13:05:11,968 INFO L628 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-07 13:05:11,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-07 13:05:12,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2019-09-07 13:05:12,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-07 13:05:12,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 65 transitions. [2019-09-07 13:05:12,010 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 65 transitions. Word has length 17 [2019-09-07 13:05:12,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:12,011 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 65 transitions. [2019-09-07 13:05:12,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:12,011 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 65 transitions. [2019-09-07 13:05:12,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-07 13:05:12,014 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:12,014 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:05:12,015 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:12,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:12,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1426743514, now seen corresponding path program 1 times [2019-09-07 13:05:12,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:12,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:12,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:12,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:12,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:12,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:12,089 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-07 13:05:12,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:12,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:12,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:12,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:12,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:12,098 INFO L87 Difference]: Start difference. First operand 38 states and 65 transitions. Second operand 3 states. [2019-09-07 13:05:12,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:12,127 INFO L93 Difference]: Finished difference Result 87 states and 152 transitions. [2019-09-07 13:05:12,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:12,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-07 13:05:12,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:12,130 INFO L225 Difference]: With dead ends: 87 [2019-09-07 13:05:12,130 INFO L226 Difference]: Without dead ends: 54 [2019-09-07 13:05:12,131 INFO L628 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-07 13:05:12,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-07 13:05:12,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2019-09-07 13:05:12,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-07 13:05:12,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 89 transitions. [2019-09-07 13:05:12,144 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 89 transitions. Word has length 17 [2019-09-07 13:05:12,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:12,145 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 89 transitions. [2019-09-07 13:05:12,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:12,146 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 89 transitions. [2019-09-07 13:05:12,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-07 13:05:12,147 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:12,147 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:05:12,148 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:12,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:12,149 INFO L82 PathProgramCache]: Analyzing trace with hash 578525748, now seen corresponding path program 1 times [2019-09-07 13:05:12,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:12,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:12,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:12,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:12,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:12,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:12,210 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-07 13:05:12,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:12,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:12,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:12,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:12,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:12,214 INFO L87 Difference]: Start difference. First operand 52 states and 89 transitions. Second operand 3 states. [2019-09-07 13:05:12,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:12,250 INFO L93 Difference]: Finished difference Result 81 states and 135 transitions. [2019-09-07 13:05:12,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:12,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-07 13:05:12,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:12,253 INFO L225 Difference]: With dead ends: 81 [2019-09-07 13:05:12,253 INFO L226 Difference]: Without dead ends: 57 [2019-09-07 13:05:12,254 INFO L628 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-07 13:05:12,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-07 13:05:12,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2019-09-07 13:05:12,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-07 13:05:12,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 91 transitions. [2019-09-07 13:05:12,264 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 91 transitions. Word has length 18 [2019-09-07 13:05:12,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:12,265 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 91 transitions. [2019-09-07 13:05:12,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:12,265 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 91 transitions. [2019-09-07 13:05:12,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-07 13:05:12,266 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:12,267 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:05:12,267 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:12,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:12,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1279590326, now seen corresponding path program 1 times [2019-09-07 13:05:12,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:12,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:12,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:12,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:12,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:12,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:12,314 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-07 13:05:12,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:12,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:12,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:12,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:12,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:12,316 INFO L87 Difference]: Start difference. First operand 55 states and 91 transitions. Second operand 3 states. [2019-09-07 13:05:12,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:12,345 INFO L93 Difference]: Finished difference Result 100 states and 168 transitions. [2019-09-07 13:05:12,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:12,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-07 13:05:12,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:12,347 INFO L225 Difference]: With dead ends: 100 [2019-09-07 13:05:12,347 INFO L226 Difference]: Without dead ends: 98 [2019-09-07 13:05:12,348 INFO L628 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-07 13:05:12,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-09-07 13:05:12,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 72. [2019-09-07 13:05:12,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-07 13:05:12,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 120 transitions. [2019-09-07 13:05:12,359 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 120 transitions. Word has length 18 [2019-09-07 13:05:12,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:12,359 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 120 transitions. [2019-09-07 13:05:12,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:12,360 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 120 transitions. [2019-09-07 13:05:12,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-07 13:05:12,361 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:12,361 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:05:12,361 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:12,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:12,362 INFO L82 PathProgramCache]: Analyzing trace with hash 886563316, now seen corresponding path program 1 times [2019-09-07 13:05:12,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:12,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:12,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:12,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:12,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:12,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:12,396 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-07 13:05:12,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:12,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:12,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:12,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:12,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:12,398 INFO L87 Difference]: Start difference. First operand 72 states and 120 transitions. Second operand 3 states. [2019-09-07 13:05:12,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:12,427 INFO L93 Difference]: Finished difference Result 164 states and 278 transitions. [2019-09-07 13:05:12,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:12,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-07 13:05:12,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:12,428 INFO L225 Difference]: With dead ends: 164 [2019-09-07 13:05:12,429 INFO L226 Difference]: Without dead ends: 100 [2019-09-07 13:05:12,429 INFO L628 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-07 13:05:12,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-09-07 13:05:12,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2019-09-07 13:05:12,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-09-07 13:05:12,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 162 transitions. [2019-09-07 13:05:12,444 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 162 transitions. Word has length 18 [2019-09-07 13:05:12,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:12,444 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 162 transitions. [2019-09-07 13:05:12,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:12,444 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 162 transitions. [2019-09-07 13:05:12,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-07 13:05:12,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:12,447 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:05:12,447 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:12,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:12,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1012809135, now seen corresponding path program 1 times [2019-09-07 13:05:12,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:12,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:12,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:12,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:12,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:12,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:12,502 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-07 13:05:12,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:12,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:12,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:12,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:12,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:12,504 INFO L87 Difference]: Start difference. First operand 98 states and 162 transitions. Second operand 3 states. [2019-09-07 13:05:12,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:12,524 INFO L93 Difference]: Finished difference Result 147 states and 241 transitions. [2019-09-07 13:05:12,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:12,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-07 13:05:12,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:12,525 INFO L225 Difference]: With dead ends: 147 [2019-09-07 13:05:12,526 INFO L226 Difference]: Without dead ends: 102 [2019-09-07 13:05:12,526 INFO L628 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-07 13:05:12,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-09-07 13:05:12,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2019-09-07 13:05:12,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-07 13:05:12,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 162 transitions. [2019-09-07 13:05:12,536 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 162 transitions. Word has length 19 [2019-09-07 13:05:12,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:12,537 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 162 transitions. [2019-09-07 13:05:12,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:12,537 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 162 transitions. [2019-09-07 13:05:12,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-07 13:05:12,538 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:12,538 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:05:12,539 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:12,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:12,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1713873713, now seen corresponding path program 1 times [2019-09-07 13:05:12,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:12,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:12,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:12,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:12,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:12,573 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-07 13:05:12,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:12,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:12,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:12,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:12,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:12,576 INFO L87 Difference]: Start difference. First operand 100 states and 162 transitions. Second operand 3 states. [2019-09-07 13:05:12,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:12,603 INFO L93 Difference]: Finished difference Result 180 states and 296 transitions. [2019-09-07 13:05:12,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:12,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-07 13:05:12,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:12,608 INFO L225 Difference]: With dead ends: 180 [2019-09-07 13:05:12,608 INFO L226 Difference]: Without dead ends: 178 [2019-09-07 13:05:12,609 INFO L628 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-07 13:05:12,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-09-07 13:05:12,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 136. [2019-09-07 13:05:12,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-09-07 13:05:12,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 218 transitions. [2019-09-07 13:05:12,630 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 218 transitions. Word has length 19 [2019-09-07 13:05:12,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:12,631 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 218 transitions. [2019-09-07 13:05:12,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:12,631 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 218 transitions. [2019-09-07 13:05:12,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-07 13:05:12,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:12,633 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:05:12,633 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:12,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:12,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1320846703, now seen corresponding path program 1 times [2019-09-07 13:05:12,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:12,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:12,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:12,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:12,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:12,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:12,660 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-07 13:05:12,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:12,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:12,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:12,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:12,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:12,662 INFO L87 Difference]: Start difference. First operand 136 states and 218 transitions. Second operand 3 states. [2019-09-07 13:05:12,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:12,686 INFO L93 Difference]: Finished difference Result 312 states and 504 transitions. [2019-09-07 13:05:12,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:12,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-07 13:05:12,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:12,688 INFO L225 Difference]: With dead ends: 312 [2019-09-07 13:05:12,688 INFO L226 Difference]: Without dead ends: 186 [2019-09-07 13:05:12,690 INFO L628 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-07 13:05:12,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-09-07 13:05:12,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2019-09-07 13:05:12,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-07 13:05:12,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 290 transitions. [2019-09-07 13:05:12,709 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 290 transitions. Word has length 19 [2019-09-07 13:05:12,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:12,709 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 290 transitions. [2019-09-07 13:05:12,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:12,710 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 290 transitions. [2019-09-07 13:05:12,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-07 13:05:12,716 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:12,716 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:05:12,717 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:12,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:12,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1590692585, now seen corresponding path program 1 times [2019-09-07 13:05:12,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:12,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:12,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:12,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:12,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:12,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:12,763 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-07 13:05:12,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:12,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:12,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:12,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:12,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:12,766 INFO L87 Difference]: Start difference. First operand 184 states and 290 transitions. Second operand 3 states. [2019-09-07 13:05:12,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:12,798 INFO L93 Difference]: Finished difference Result 276 states and 432 transitions. [2019-09-07 13:05:12,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:12,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-07 13:05:12,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:12,801 INFO L225 Difference]: With dead ends: 276 [2019-09-07 13:05:12,802 INFO L226 Difference]: Without dead ends: 190 [2019-09-07 13:05:12,803 INFO L628 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-07 13:05:12,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-09-07 13:05:12,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2019-09-07 13:05:12,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-09-07 13:05:12,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 290 transitions. [2019-09-07 13:05:12,841 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 290 transitions. Word has length 20 [2019-09-07 13:05:12,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:12,843 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 290 transitions. [2019-09-07 13:05:12,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:12,844 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 290 transitions. [2019-09-07 13:05:12,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-07 13:05:12,845 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:12,845 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:05:12,845 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:12,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:12,846 INFO L82 PathProgramCache]: Analyzing trace with hash -2003210133, now seen corresponding path program 1 times [2019-09-07 13:05:12,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:12,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:12,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:12,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:12,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:12,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:12,901 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-07 13:05:12,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:12,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:12,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:12,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:12,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:12,903 INFO L87 Difference]: Start difference. First operand 188 states and 290 transitions. Second operand 3 states. [2019-09-07 13:05:12,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:12,937 INFO L93 Difference]: Finished difference Result 332 states and 520 transitions. [2019-09-07 13:05:12,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:12,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-07 13:05:12,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:12,940 INFO L225 Difference]: With dead ends: 332 [2019-09-07 13:05:12,940 INFO L226 Difference]: Without dead ends: 330 [2019-09-07 13:05:12,941 INFO L628 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-07 13:05:12,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-09-07 13:05:12,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 264. [2019-09-07 13:05:12,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-09-07 13:05:12,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 398 transitions. [2019-09-07 13:05:12,960 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 398 transitions. Word has length 20 [2019-09-07 13:05:12,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:12,961 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 398 transitions. [2019-09-07 13:05:12,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:12,961 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 398 transitions. [2019-09-07 13:05:12,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-07 13:05:12,964 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:12,964 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:05:12,969 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:12,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:12,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1898730153, now seen corresponding path program 1 times [2019-09-07 13:05:12,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:12,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:12,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:12,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:12,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:12,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:13,006 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-07 13:05:13,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:13,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:13,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:13,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:13,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:13,008 INFO L87 Difference]: Start difference. First operand 264 states and 398 transitions. Second operand 3 states. [2019-09-07 13:05:13,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:13,042 INFO L93 Difference]: Finished difference Result 604 states and 912 transitions. [2019-09-07 13:05:13,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:13,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-07 13:05:13,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:13,046 INFO L225 Difference]: With dead ends: 604 [2019-09-07 13:05:13,046 INFO L226 Difference]: Without dead ends: 354 [2019-09-07 13:05:13,049 INFO L628 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-07 13:05:13,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-09-07 13:05:13,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 352. [2019-09-07 13:05:13,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-07 13:05:13,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 518 transitions. [2019-09-07 13:05:13,067 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 518 transitions. Word has length 20 [2019-09-07 13:05:13,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:13,070 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 518 transitions. [2019-09-07 13:05:13,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:13,070 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 518 transitions. [2019-09-07 13:05:13,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-07 13:05:13,072 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:13,072 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:05:13,074 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:13,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:13,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1969756604, now seen corresponding path program 1 times [2019-09-07 13:05:13,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:13,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:13,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:13,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:13,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:13,113 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-07 13:05:13,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:13,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:13,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:13,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:13,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:13,115 INFO L87 Difference]: Start difference. First operand 352 states and 518 transitions. Second operand 3 states. [2019-09-07 13:05:13,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:13,139 INFO L93 Difference]: Finished difference Result 528 states and 772 transitions. [2019-09-07 13:05:13,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:13,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-07 13:05:13,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:13,142 INFO L225 Difference]: With dead ends: 528 [2019-09-07 13:05:13,142 INFO L226 Difference]: Without dead ends: 362 [2019-09-07 13:05:13,143 INFO L628 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-07 13:05:13,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-09-07 13:05:13,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 360. [2019-09-07 13:05:13,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-09-07 13:05:13,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 518 transitions. [2019-09-07 13:05:13,156 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 518 transitions. Word has length 21 [2019-09-07 13:05:13,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:13,156 INFO L475 AbstractCegarLoop]: Abstraction has 360 states and 518 transitions. [2019-09-07 13:05:13,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:13,156 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 518 transitions. [2019-09-07 13:05:13,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-07 13:05:13,159 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:13,159 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:05:13,159 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:13,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:13,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1268692026, now seen corresponding path program 1 times [2019-09-07 13:05:13,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:13,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:13,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:13,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:13,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:13,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:13,198 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-07 13:05:13,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:13,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:13,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:13,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:13,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:13,200 INFO L87 Difference]: Start difference. First operand 360 states and 518 transitions. Second operand 3 states. [2019-09-07 13:05:13,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:13,221 INFO L93 Difference]: Finished difference Result 620 states and 904 transitions. [2019-09-07 13:05:13,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:13,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-07 13:05:13,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:13,226 INFO L225 Difference]: With dead ends: 620 [2019-09-07 13:05:13,226 INFO L226 Difference]: Without dead ends: 618 [2019-09-07 13:05:13,227 INFO L628 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-07 13:05:13,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-09-07 13:05:13,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 520. [2019-09-07 13:05:13,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2019-09-07 13:05:13,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 726 transitions. [2019-09-07 13:05:13,246 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 726 transitions. Word has length 21 [2019-09-07 13:05:13,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:13,246 INFO L475 AbstractCegarLoop]: Abstraction has 520 states and 726 transitions. [2019-09-07 13:05:13,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:13,246 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 726 transitions. [2019-09-07 13:05:13,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-07 13:05:13,248 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:13,248 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:05:13,249 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:13,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:13,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1661719036, now seen corresponding path program 1 times [2019-09-07 13:05:13,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:13,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:13,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:13,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:13,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:13,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:13,278 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-07 13:05:13,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:13,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:13,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:13,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:13,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:13,280 INFO L87 Difference]: Start difference. First operand 520 states and 726 transitions. Second operand 3 states. [2019-09-07 13:05:13,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:13,309 INFO L93 Difference]: Finished difference Result 1180 states and 1640 transitions. [2019-09-07 13:05:13,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:13,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-07 13:05:13,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:13,319 INFO L225 Difference]: With dead ends: 1180 [2019-09-07 13:05:13,319 INFO L226 Difference]: Without dead ends: 682 [2019-09-07 13:05:13,322 INFO L628 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-07 13:05:13,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2019-09-07 13:05:13,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 680. [2019-09-07 13:05:13,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2019-09-07 13:05:13,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 918 transitions. [2019-09-07 13:05:13,346 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 918 transitions. Word has length 21 [2019-09-07 13:05:13,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:13,346 INFO L475 AbstractCegarLoop]: Abstraction has 680 states and 918 transitions. [2019-09-07 13:05:13,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:13,346 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 918 transitions. [2019-09-07 13:05:13,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-07 13:05:13,348 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:13,348 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:05:13,348 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:13,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:13,349 INFO L82 PathProgramCache]: Analyzing trace with hash -674531426, now seen corresponding path program 1 times [2019-09-07 13:05:13,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:13,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:13,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:13,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:13,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:13,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:13,378 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-07 13:05:13,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:13,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:13,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:13,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:13,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:13,379 INFO L87 Difference]: Start difference. First operand 680 states and 918 transitions. Second operand 3 states. [2019-09-07 13:05:13,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:13,407 INFO L93 Difference]: Finished difference Result 1020 states and 1368 transitions. [2019-09-07 13:05:13,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:13,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-07 13:05:13,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:13,411 INFO L225 Difference]: With dead ends: 1020 [2019-09-07 13:05:13,411 INFO L226 Difference]: Without dead ends: 698 [2019-09-07 13:05:13,412 INFO L628 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-07 13:05:13,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2019-09-07 13:05:13,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 696. [2019-09-07 13:05:13,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2019-09-07 13:05:13,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 918 transitions. [2019-09-07 13:05:13,435 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 918 transitions. Word has length 22 [2019-09-07 13:05:13,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:13,437 INFO L475 AbstractCegarLoop]: Abstraction has 696 states and 918 transitions. [2019-09-07 13:05:13,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:13,437 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 918 transitions. [2019-09-07 13:05:13,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-07 13:05:13,438 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:13,438 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:05:13,439 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:13,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:13,439 INFO L82 PathProgramCache]: Analyzing trace with hash 26533152, now seen corresponding path program 1 times [2019-09-07 13:05:13,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:13,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:13,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:13,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:13,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:13,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:13,462 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-07 13:05:13,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:13,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:13,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:13,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:13,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:13,463 INFO L87 Difference]: Start difference. First operand 696 states and 918 transitions. Second operand 3 states. [2019-09-07 13:05:13,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:13,500 INFO L93 Difference]: Finished difference Result 1164 states and 1544 transitions. [2019-09-07 13:05:13,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:13,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-07 13:05:13,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:13,506 INFO L225 Difference]: With dead ends: 1164 [2019-09-07 13:05:13,507 INFO L226 Difference]: Without dead ends: 1162 [2019-09-07 13:05:13,507 INFO L628 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-07 13:05:13,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2019-09-07 13:05:13,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1032. [2019-09-07 13:05:13,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1032 states. [2019-09-07 13:05:13,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1318 transitions. [2019-09-07 13:05:13,542 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1318 transitions. Word has length 22 [2019-09-07 13:05:13,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:13,542 INFO L475 AbstractCegarLoop]: Abstraction has 1032 states and 1318 transitions. [2019-09-07 13:05:13,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:13,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1318 transitions. [2019-09-07 13:05:13,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-07 13:05:13,545 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:13,545 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:05:13,545 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:13,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:13,546 INFO L82 PathProgramCache]: Analyzing trace with hash -366493858, now seen corresponding path program 1 times [2019-09-07 13:05:13,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:13,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:13,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:13,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:13,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:13,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:13,577 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-07 13:05:13,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:13,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:13,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:13,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:13,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:13,578 INFO L87 Difference]: Start difference. First operand 1032 states and 1318 transitions. Second operand 3 states. [2019-09-07 13:05:13,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:13,625 INFO L93 Difference]: Finished difference Result 2316 states and 2920 transitions. [2019-09-07 13:05:13,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:13,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-07 13:05:13,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:13,635 INFO L225 Difference]: With dead ends: 2316 [2019-09-07 13:05:13,635 INFO L226 Difference]: Without dead ends: 1322 [2019-09-07 13:05:13,639 INFO L628 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-07 13:05:13,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2019-09-07 13:05:13,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1320. [2019-09-07 13:05:13,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1320 states. [2019-09-07 13:05:13,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1606 transitions. [2019-09-07 13:05:13,735 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1606 transitions. Word has length 22 [2019-09-07 13:05:13,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:13,736 INFO L475 AbstractCegarLoop]: Abstraction has 1320 states and 1606 transitions. [2019-09-07 13:05:13,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:13,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1606 transitions. [2019-09-07 13:05:13,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-07 13:05:13,740 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:13,740 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:05:13,740 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:13,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:13,741 INFO L82 PathProgramCache]: Analyzing trace with hash 822743769, now seen corresponding path program 1 times [2019-09-07 13:05:13,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:13,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:13,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:13,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:13,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:13,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:13,767 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-07 13:05:13,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:13,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:13,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:13,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:13,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:13,772 INFO L87 Difference]: Start difference. First operand 1320 states and 1606 transitions. Second operand 3 states. [2019-09-07 13:05:13,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:13,820 INFO L93 Difference]: Finished difference Result 1980 states and 2392 transitions. [2019-09-07 13:05:13,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:13,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-07 13:05:13,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:13,830 INFO L225 Difference]: With dead ends: 1980 [2019-09-07 13:05:13,830 INFO L226 Difference]: Without dead ends: 1354 [2019-09-07 13:05:13,832 INFO L628 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-07 13:05:13,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2019-09-07 13:05:13,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1352. [2019-09-07 13:05:13,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2019-09-07 13:05:13,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1606 transitions. [2019-09-07 13:05:13,892 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1606 transitions. Word has length 23 [2019-09-07 13:05:13,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:13,893 INFO L475 AbstractCegarLoop]: Abstraction has 1352 states and 1606 transitions. [2019-09-07 13:05:13,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:13,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1606 transitions. [2019-09-07 13:05:13,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-07 13:05:13,896 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:13,897 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:05:13,897 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:13,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:13,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1523808347, now seen corresponding path program 1 times [2019-09-07 13:05:13,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:13,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:13,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:13,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:13,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:13,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:13,931 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-07 13:05:13,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:13,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:13,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:13,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:13,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:13,932 INFO L87 Difference]: Start difference. First operand 1352 states and 1606 transitions. Second operand 3 states. [2019-09-07 13:05:14,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:14,003 INFO L93 Difference]: Finished difference Result 2186 states and 2567 transitions. [2019-09-07 13:05:14,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:14,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-07 13:05:14,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:14,019 INFO L225 Difference]: With dead ends: 2186 [2019-09-07 13:05:14,019 INFO L226 Difference]: Without dead ends: 2184 [2019-09-07 13:05:14,022 INFO L628 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-07 13:05:14,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2184 states. [2019-09-07 13:05:14,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2184 to 2056. [2019-09-07 13:05:14,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2019-09-07 13:05:14,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 2374 transitions. [2019-09-07 13:05:14,117 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 2374 transitions. Word has length 23 [2019-09-07 13:05:14,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:14,118 INFO L475 AbstractCegarLoop]: Abstraction has 2056 states and 2374 transitions. [2019-09-07 13:05:14,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:14,118 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2374 transitions. [2019-09-07 13:05:14,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-07 13:05:14,124 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:14,124 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:05:14,125 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:14,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:14,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1130781337, now seen corresponding path program 1 times [2019-09-07 13:05:14,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:14,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:14,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:14,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:14,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:14,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:14,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-07 13:05:14,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:14,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:14,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:14,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:14,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:14,147 INFO L87 Difference]: Start difference. First operand 2056 states and 2374 transitions. Second operand 3 states. [2019-09-07 13:05:14,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:14,241 INFO L93 Difference]: Finished difference Result 4552 states and 5126 transitions. [2019-09-07 13:05:14,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:14,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-07 13:05:14,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:14,243 INFO L225 Difference]: With dead ends: 4552 [2019-09-07 13:05:14,243 INFO L226 Difference]: Without dead ends: 0 [2019-09-07 13:05:14,254 INFO L628 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-07 13:05:14,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-07 13:05:14,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-07 13:05:14,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-07 13:05:14,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-07 13:05:14,256 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-09-07 13:05:14,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:14,256 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-07 13:05:14,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:14,256 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-07 13:05:14,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-07 13:05:14,263 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-07 13:05:14,291 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-07 13:05:14,291 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-07 13:05:14,292 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-07 13:05:14,292 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-07 13:05:14,292 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-07 13:05:14,292 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-07 13:05:14,292 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 121) no Hoare annotation was computed. [2019-09-07 13:05:14,293 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 119) no Hoare annotation was computed. [2019-09-07 13:05:14,293 INFO L443 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-09-07 13:05:14,293 INFO L443 ceAbstractionStarter]: For program point L86-1(lines 30 116) no Hoare annotation was computed. [2019-09-07 13:05:14,293 INFO L446 ceAbstractionStarter]: At program point L111-1(lines 30 116) the Hoare annotation is: true [2019-09-07 13:05:14,294 INFO L443 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-09-07 13:05:14,294 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-09-07 13:05:14,294 INFO L439 ceAbstractionStarter]: At program point L112-1(lines 5 121) the Hoare annotation is: false [2019-09-07 13:05:14,294 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 121) no Hoare annotation was computed. [2019-09-07 13:05:14,294 INFO L443 ceAbstractionStarter]: For program point L71-1(lines 30 116) no Hoare annotation was computed. [2019-09-07 13:05:14,295 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 30 116) no Hoare annotation was computed. [2019-09-07 13:05:14,295 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 30 116) no Hoare annotation was computed. [2019-09-07 13:05:14,295 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 121) the Hoare annotation is: true [2019-09-07 13:05:14,295 INFO L443 ceAbstractionStarter]: For program point L55-1(lines 30 116) no Hoare annotation was computed. [2019-09-07 13:05:14,295 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-09-07 13:05:14,295 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 30 116) no Hoare annotation was computed. [2019-09-07 13:05:14,296 INFO L443 ceAbstractionStarter]: For program point L106-1(lines 30 116) no Hoare annotation was computed. [2019-09-07 13:05:14,297 INFO L443 ceAbstractionStarter]: For program point L32(lines 32 34) no Hoare annotation was computed. [2019-09-07 13:05:14,297 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-09-07 13:05:14,299 INFO L443 ceAbstractionStarter]: For program point L107(line 107) no Hoare annotation was computed. [2019-09-07 13:05:14,299 INFO L443 ceAbstractionStarter]: For program point L91-1(lines 30 116) no Hoare annotation was computed. [2019-09-07 13:05:14,299 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 30 116) no Hoare annotation was computed. [2019-09-07 13:05:14,299 INFO L443 ceAbstractionStarter]: For program point L67-1(lines 30 116) no Hoare annotation was computed. [2019-09-07 13:05:14,299 INFO L443 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2019-09-07 13:05:14,299 INFO L443 ceAbstractionStarter]: For program point L59-1(lines 30 116) no Hoare annotation was computed. [2019-09-07 13:05:14,299 INFO L446 ceAbstractionStarter]: At program point L117(lines 5 121) the Hoare annotation is: true [2019-09-07 13:05:14,300 INFO L443 ceAbstractionStarter]: For program point L51(lines 51 53) no Hoare annotation was computed. [2019-09-07 13:05:14,300 INFO L443 ceAbstractionStarter]: For program point L51-2(lines 30 116) no Hoare annotation was computed. [2019-09-07 13:05:14,300 INFO L443 ceAbstractionStarter]: For program point L101-1(lines 30 116) no Hoare annotation was computed. [2019-09-07 13:05:14,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.09 01:05:14 BoogieIcfgContainer [2019-09-07 13:05:14,310 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-07 13:05:14,313 INFO L168 Benchmark]: Toolchain (without parser) took 3453.01 ms. Allocated memory was 134.7 MB in the beginning and 257.4 MB in the end (delta: 122.7 MB). Free memory was 91.3 MB in the beginning and 128.4 MB in the end (delta: -37.1 MB). Peak memory consumption was 85.6 MB. Max. memory is 7.1 GB. [2019-09-07 13:05:14,313 INFO L168 Benchmark]: CDTParser took 0.42 ms. Allocated memory is still 134.7 MB. Free memory was 109.2 MB in the beginning and 109.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-07 13:05:14,314 INFO L168 Benchmark]: CACSL2BoogieTranslator took 352.47 ms. Allocated memory was 134.7 MB in the beginning and 200.3 MB in the end (delta: 65.5 MB). Free memory was 91.1 MB in the beginning and 177.8 MB in the end (delta: -86.7 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB. [2019-09-07 13:05:14,315 INFO L168 Benchmark]: Boogie Preprocessor took 33.98 ms. Allocated memory is still 200.3 MB. Free memory was 177.8 MB in the beginning and 175.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-09-07 13:05:14,316 INFO L168 Benchmark]: RCFGBuilder took 294.89 ms. Allocated memory is still 200.3 MB. Free memory was 175.6 MB in the beginning and 159.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 7.1 GB. [2019-09-07 13:05:14,318 INFO L168 Benchmark]: TraceAbstraction took 2768.05 ms. Allocated memory was 200.3 MB in the beginning and 257.4 MB in the end (delta: 57.1 MB). Free memory was 159.6 MB in the beginning and 128.4 MB in the end (delta: 31.1 MB). Peak memory consumption was 88.3 MB. Max. memory is 7.1 GB. [2019-09-07 13:05:14,328 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.42 ms. Allocated memory is still 134.7 MB. Free memory was 109.2 MB in the beginning and 109.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 352.47 ms. Allocated memory was 134.7 MB in the beginning and 200.3 MB in the end (delta: 65.5 MB). Free memory was 91.1 MB in the beginning and 177.8 MB in the end (delta: -86.7 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.98 ms. Allocated memory is still 200.3 MB. Free memory was 177.8 MB in the beginning and 175.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 294.89 ms. Allocated memory is still 200.3 MB. Free memory was 175.6 MB in the beginning and 159.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2768.05 ms. Allocated memory was 200.3 MB in the beginning and 257.4 MB in the end (delta: 57.1 MB). Free memory was 159.6 MB in the beginning and 128.4 MB in the end (delta: 31.1 MB). Peak memory consumption was 88.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 119]: 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: 30]: 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, 35 locations, 1 error locations. SAFE Result, 2.6s OverallTime, 20 OverallIterations, 1 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1238 SDtfs, 574 SDslu, 829 SDs, 0 SdLazy, 107 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2056occurred in iteration=19, 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.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 530 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 138 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 403 NumberOfCodeBlocks, 403 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 383 ConstructedInterpolants, 0 QuantifiedInterpolants, 13856 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...