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_14-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 13:04:35,656 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 13:04:35,658 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 13:04:35,672 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 13:04:35,672 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 13:04:35,674 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 13:04:35,675 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 13:04:35,677 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 13:04:35,684 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 13:04:35,685 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 13:04:35,686 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 13:04:35,689 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 13:04:35,690 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 13:04:35,691 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 13:04:35,692 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 13:04:35,693 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 13:04:35,694 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 13:04:35,695 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 13:04:35,699 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 13:04:35,703 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 13:04:35,706 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 13:04:35,708 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 13:04:35,710 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 13:04:35,711 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 13:04:35,714 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 13:04:35,714 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 13:04:35,714 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 13:04:35,716 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 13:04:35,718 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 13:04:35,719 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 13:04:35,719 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 13:04:35,721 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 13:04:35,722 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 13:04:35,723 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 13:04:35,727 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 13:04:35,727 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 13:04:35,728 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 13:04:35,728 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 13:04:35,728 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 13:04:35,730 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 13:04:35,730 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 13:04:35,731 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:04:35,758 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 13:04:35,758 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 13:04:35,759 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 13:04:35,759 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 13:04:35,760 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 13:04:35,760 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 13:04:35,760 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 13:04:35,760 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 13:04:35,761 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 13:04:35,761 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 13:04:35,761 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 13:04:35,761 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 13:04:35,761 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 13:04:35,762 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 13:04:35,762 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 13:04:35,762 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 13:04:35,762 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 13:04:35,763 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 13:04:35,763 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 13:04:35,763 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 13:04:35,763 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 13:04:35,763 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 13:04:35,764 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 13:04:35,764 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 13:04:35,764 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 13:04:35,764 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 13:04:35,765 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 13:04:35,765 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 13:04:35,765 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 13:04:35,797 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 13:04:35,810 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 13:04:35,814 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 13:04:35,815 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 13:04:35,815 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 13:04:35,816 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_14-1.c [2019-09-07 13:04:35,881 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21c35bfd6/9e0ff424231f4bada338fcc1cc2ba2d7/FLAG657fb6b39 [2019-09-07 13:04:36,340 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 13:04:36,340 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_14-1.c [2019-09-07 13:04:36,350 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21c35bfd6/9e0ff424231f4bada338fcc1cc2ba2d7/FLAG657fb6b39 [2019-09-07 13:04:36,757 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21c35bfd6/9e0ff424231f4bada338fcc1cc2ba2d7 [2019-09-07 13:04:36,766 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 13:04:36,768 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 13:04:36,769 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 13:04:36,769 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 13:04:36,772 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 13:04:36,773 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 01:04:36" (1/1) ... [2019-09-07 13:04:36,776 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@664351b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:04:36, skipping insertion in model container [2019-09-07 13:04:36,776 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 01:04:36" (1/1) ... [2019-09-07 13:04:36,784 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 13:04:36,807 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 13:04:37,072 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 13:04:37,079 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 13:04:37,206 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 13:04:37,220 INFO L192 MainTranslator]: Completed translation [2019-09-07 13:04:37,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:04:37 WrapperNode [2019-09-07 13:04:37,221 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 13:04:37,222 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 13:04:37,222 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 13:04:37,222 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 13:04:37,233 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:04:37" (1/1) ... [2019-09-07 13:04:37,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:04:37" (1/1) ... [2019-09-07 13:04:37,239 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:04:37" (1/1) ... [2019-09-07 13:04:37,239 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:04:37" (1/1) ... [2019-09-07 13:04:37,245 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:04:37" (1/1) ... [2019-09-07 13:04:37,254 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:04:37" (1/1) ... [2019-09-07 13:04:37,256 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:04:37" (1/1) ... [2019-09-07 13:04:37,259 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 13:04:37,259 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 13:04:37,259 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 13:04:37,259 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 13:04:37,260 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:04:37" (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:04:37,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 13:04:37,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 13:04:37,306 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 13:04:37,306 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 13:04:37,307 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 13:04:37,307 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 13:04:37,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 13:04:37,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 13:04:37,693 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 13:04:37,694 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 13:04:37,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 01:04:37 BoogieIcfgContainer [2019-09-07 13:04:37,695 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 13:04:37,697 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 13:04:37,697 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 13:04:37,700 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 13:04:37,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 01:04:36" (1/3) ... [2019-09-07 13:04:37,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@119b6f55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 01:04:37, skipping insertion in model container [2019-09-07 13:04:37,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:04:37" (2/3) ... [2019-09-07 13:04:37,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@119b6f55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 01:04:37, skipping insertion in model container [2019-09-07 13:04:37,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 01:04:37" (3/3) ... [2019-09-07 13:04:37,704 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_14-1.c [2019-09-07 13:04:37,714 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 13:04:37,721 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 13:04:37,735 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 13:04:37,764 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 13:04:37,765 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 13:04:37,765 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 13:04:37,765 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 13:04:37,765 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 13:04:37,766 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 13:04:37,766 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 13:04:37,766 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 13:04:37,766 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 13:04:37,783 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2019-09-07 13:04:37,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-07 13:04:37,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:37,790 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, 1] [2019-09-07 13:04:37,792 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:37,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:37,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1694520263, now seen corresponding path program 1 times [2019-09-07 13:04:37,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:37,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:37,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:37,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:37,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:37,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:38,017 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:04:38,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:38,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:38,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:38,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:38,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:38,041 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 3 states. [2019-09-07 13:04:38,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:38,101 INFO L93 Difference]: Finished difference Result 111 states and 198 transitions. [2019-09-07 13:04:38,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:38,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-07 13:04:38,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:38,120 INFO L225 Difference]: With dead ends: 111 [2019-09-07 13:04:38,120 INFO L226 Difference]: Without dead ends: 96 [2019-09-07 13:04:38,125 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:04:38,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-07 13:04:38,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 66. [2019-09-07 13:04:38,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-07 13:04:38,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 121 transitions. [2019-09-07 13:04:38,174 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 121 transitions. Word has length 24 [2019-09-07 13:04:38,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:38,175 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 121 transitions. [2019-09-07 13:04:38,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:38,176 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 121 transitions. [2019-09-07 13:04:38,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-07 13:04:38,177 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:38,177 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, 1] [2019-09-07 13:04:38,178 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:38,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:38,178 INFO L82 PathProgramCache]: Analyzing trace with hash 106172361, now seen corresponding path program 1 times [2019-09-07 13:04:38,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:38,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:38,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:38,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:38,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:38,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:38,269 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:04:38,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:38,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:38,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:38,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:38,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:38,275 INFO L87 Difference]: Start difference. First operand 66 states and 121 transitions. Second operand 3 states. [2019-09-07 13:04:38,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:38,334 INFO L93 Difference]: Finished difference Result 157 states and 292 transitions. [2019-09-07 13:04:38,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:38,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-07 13:04:38,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:38,337 INFO L225 Difference]: With dead ends: 157 [2019-09-07 13:04:38,338 INFO L226 Difference]: Without dead ends: 96 [2019-09-07 13:04:38,339 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:04:38,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-07 13:04:38,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2019-09-07 13:04:38,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-09-07 13:04:38,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 173 transitions. [2019-09-07 13:04:38,354 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 173 transitions. Word has length 24 [2019-09-07 13:04:38,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:38,355 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 173 transitions. [2019-09-07 13:04:38,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:38,357 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 173 transitions. [2019-09-07 13:04:38,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-07 13:04:38,358 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:38,358 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, 1, 1] [2019-09-07 13:04:38,359 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:38,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:38,359 INFO L82 PathProgramCache]: Analyzing trace with hash 990732685, now seen corresponding path program 1 times [2019-09-07 13:04:38,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:38,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:38,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:38,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:38,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:38,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:38,422 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:04:38,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:38,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:38,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:38,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:38,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:38,424 INFO L87 Difference]: Start difference. First operand 94 states and 173 transitions. Second operand 3 states. [2019-09-07 13:04:38,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:38,461 INFO L93 Difference]: Finished difference Result 144 states and 261 transitions. [2019-09-07 13:04:38,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:38,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-07 13:04:38,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:38,464 INFO L225 Difference]: With dead ends: 144 [2019-09-07 13:04:38,464 INFO L226 Difference]: Without dead ends: 99 [2019-09-07 13:04:38,467 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:04:38,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-07 13:04:38,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2019-09-07 13:04:38,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-09-07 13:04:38,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 175 transitions. [2019-09-07 13:04:38,486 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 175 transitions. Word has length 25 [2019-09-07 13:04:38,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:38,486 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 175 transitions. [2019-09-07 13:04:38,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:38,487 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 175 transitions. [2019-09-07 13:04:38,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-07 13:04:38,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:38,488 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, 1, 1] [2019-09-07 13:04:38,491 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:38,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:38,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1003412021, now seen corresponding path program 1 times [2019-09-07 13:04:38,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:38,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:38,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:38,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:38,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:38,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:38,562 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:04:38,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:38,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:38,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:38,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:38,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:38,564 INFO L87 Difference]: Start difference. First operand 97 states and 175 transitions. Second operand 3 states. [2019-09-07 13:04:38,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:38,592 INFO L93 Difference]: Finished difference Result 184 states and 336 transitions. [2019-09-07 13:04:38,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:38,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-07 13:04:38,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:38,595 INFO L225 Difference]: With dead ends: 184 [2019-09-07 13:04:38,595 INFO L226 Difference]: Without dead ends: 182 [2019-09-07 13:04:38,595 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:04:38,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-07 13:04:38,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 128. [2019-09-07 13:04:38,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-09-07 13:04:38,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 232 transitions. [2019-09-07 13:04:38,609 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 232 transitions. Word has length 25 [2019-09-07 13:04:38,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:38,609 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 232 transitions. [2019-09-07 13:04:38,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:38,610 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 232 transitions. [2019-09-07 13:04:38,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-07 13:04:38,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:38,611 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, 1, 1] [2019-09-07 13:04:38,611 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:38,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:38,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1703207373, now seen corresponding path program 1 times [2019-09-07 13:04:38,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:38,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:38,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:38,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:38,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:38,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:38,658 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:04:38,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:38,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:38,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:38,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:38,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:38,659 INFO L87 Difference]: Start difference. First operand 128 states and 232 transitions. Second operand 3 states. [2019-09-07 13:04:38,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:38,687 INFO L93 Difference]: Finished difference Result 304 states and 558 transitions. [2019-09-07 13:04:38,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:38,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-07 13:04:38,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:38,690 INFO L225 Difference]: With dead ends: 304 [2019-09-07 13:04:38,690 INFO L226 Difference]: Without dead ends: 184 [2019-09-07 13:04:38,692 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:04:38,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-09-07 13:04:38,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182. [2019-09-07 13:04:38,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-09-07 13:04:38,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 330 transitions. [2019-09-07 13:04:38,708 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 330 transitions. Word has length 25 [2019-09-07 13:04:38,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:38,708 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 330 transitions. [2019-09-07 13:04:38,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:38,709 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 330 transitions. [2019-09-07 13:04:38,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-07 13:04:38,710 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:38,710 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, 1, 1, 1] [2019-09-07 13:04:38,711 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:38,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:38,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1040789154, now seen corresponding path program 1 times [2019-09-07 13:04:38,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:38,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:38,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:38,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:38,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:38,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:38,746 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:04:38,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:38,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:38,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:38,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:38,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:38,747 INFO L87 Difference]: Start difference. First operand 182 states and 330 transitions. Second operand 3 states. [2019-09-07 13:04:38,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:38,767 INFO L93 Difference]: Finished difference Result 273 states and 493 transitions. [2019-09-07 13:04:38,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:38,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-07 13:04:38,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:38,769 INFO L225 Difference]: With dead ends: 273 [2019-09-07 13:04:38,769 INFO L226 Difference]: Without dead ends: 186 [2019-09-07 13:04:38,771 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:04:38,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-09-07 13:04:38,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2019-09-07 13:04:38,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-07 13:04:38,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 330 transitions. [2019-09-07 13:04:38,796 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 330 transitions. Word has length 26 [2019-09-07 13:04:38,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:38,797 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 330 transitions. [2019-09-07 13:04:38,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:38,801 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 330 transitions. [2019-09-07 13:04:38,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-07 13:04:38,802 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:38,803 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, 1, 1, 1] [2019-09-07 13:04:38,803 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:38,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:38,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1260033436, now seen corresponding path program 1 times [2019-09-07 13:04:38,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:38,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:38,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:38,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:38,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:38,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:38,877 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:04:38,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:38,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:38,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:38,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:38,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:38,879 INFO L87 Difference]: Start difference. First operand 184 states and 330 transitions. Second operand 3 states. [2019-09-07 13:04:38,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:38,907 INFO L93 Difference]: Finished difference Result 348 states and 632 transitions. [2019-09-07 13:04:38,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:38,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-07 13:04:38,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:38,910 INFO L225 Difference]: With dead ends: 348 [2019-09-07 13:04:38,911 INFO L226 Difference]: Without dead ends: 346 [2019-09-07 13:04:38,911 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:04:38,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-09-07 13:04:38,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 248. [2019-09-07 13:04:38,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-09-07 13:04:38,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 442 transitions. [2019-09-07 13:04:38,922 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 442 transitions. Word has length 26 [2019-09-07 13:04:38,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:38,923 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 442 transitions. [2019-09-07 13:04:38,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:38,923 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 442 transitions. [2019-09-07 13:04:38,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-07 13:04:38,924 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:38,925 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, 1, 1, 1] [2019-09-07 13:04:38,925 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:38,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:38,925 INFO L82 PathProgramCache]: Analyzing trace with hash -328314466, now seen corresponding path program 1 times [2019-09-07 13:04:38,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:38,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:38,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:38,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:38,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:38,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:38,957 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:04:38,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:38,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:38,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:38,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:38,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:38,958 INFO L87 Difference]: Start difference. First operand 248 states and 442 transitions. Second operand 3 states. [2019-09-07 13:04:38,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:38,995 INFO L93 Difference]: Finished difference Result 592 states and 1064 transitions. [2019-09-07 13:04:38,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:38,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-07 13:04:38,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:38,999 INFO L225 Difference]: With dead ends: 592 [2019-09-07 13:04:38,999 INFO L226 Difference]: Without dead ends: 354 [2019-09-07 13:04:39,004 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:04:39,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-09-07 13:04:39,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 352. [2019-09-07 13:04:39,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-07 13:04:39,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 626 transitions. [2019-09-07 13:04:39,022 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 626 transitions. Word has length 26 [2019-09-07 13:04:39,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:39,022 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 626 transitions. [2019-09-07 13:04:39,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:39,022 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 626 transitions. [2019-09-07 13:04:39,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-07 13:04:39,028 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:39,028 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, 1, 1, 1, 1] [2019-09-07 13:04:39,028 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:39,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:39,029 INFO L82 PathProgramCache]: Analyzing trace with hash 406543618, now seen corresponding path program 1 times [2019-09-07 13:04:39,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:39,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:39,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:39,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:39,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:39,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:39,081 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:04:39,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:39,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:39,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:39,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:39,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:39,082 INFO L87 Difference]: Start difference. First operand 352 states and 626 transitions. Second operand 3 states. [2019-09-07 13:04:39,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:39,105 INFO L93 Difference]: Finished difference Result 528 states and 936 transitions. [2019-09-07 13:04:39,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:39,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-07 13:04:39,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:39,108 INFO L225 Difference]: With dead ends: 528 [2019-09-07 13:04:39,108 INFO L226 Difference]: Without dead ends: 358 [2019-09-07 13:04:39,110 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:04:39,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-09-07 13:04:39,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2019-09-07 13:04:39,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-09-07 13:04:39,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 626 transitions. [2019-09-07 13:04:39,123 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 626 transitions. Word has length 27 [2019-09-07 13:04:39,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:39,125 INFO L475 AbstractCegarLoop]: Abstraction has 356 states and 626 transitions. [2019-09-07 13:04:39,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:39,125 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 626 transitions. [2019-09-07 13:04:39,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-07 13:04:39,129 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:39,129 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, 1, 1, 1, 1] [2019-09-07 13:04:39,129 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:39,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:39,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1587601088, now seen corresponding path program 1 times [2019-09-07 13:04:39,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:39,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:39,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:39,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:39,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:39,168 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:04:39,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:39,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:39,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:39,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:39,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:39,170 INFO L87 Difference]: Start difference. First operand 356 states and 626 transitions. Second operand 3 states. [2019-09-07 13:04:39,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:39,196 INFO L93 Difference]: Finished difference Result 668 states and 1192 transitions. [2019-09-07 13:04:39,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:39,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-07 13:04:39,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:39,201 INFO L225 Difference]: With dead ends: 668 [2019-09-07 13:04:39,201 INFO L226 Difference]: Without dead ends: 666 [2019-09-07 13:04:39,201 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:04:39,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2019-09-07 13:04:39,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 488. [2019-09-07 13:04:39,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-09-07 13:04:39,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 846 transitions. [2019-09-07 13:04:39,217 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 846 transitions. Word has length 27 [2019-09-07 13:04:39,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:39,218 INFO L475 AbstractCegarLoop]: Abstraction has 488 states and 846 transitions. [2019-09-07 13:04:39,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:39,218 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 846 transitions. [2019-09-07 13:04:39,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-07 13:04:39,220 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:39,222 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, 1, 1, 1, 1] [2019-09-07 13:04:39,223 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:39,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:39,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1119018306, now seen corresponding path program 1 times [2019-09-07 13:04:39,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:39,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:39,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:39,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:39,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:39,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:39,248 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:04:39,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:39,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:39,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:39,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:39,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:39,250 INFO L87 Difference]: Start difference. First operand 488 states and 846 transitions. Second operand 3 states. [2019-09-07 13:04:39,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:39,277 INFO L93 Difference]: Finished difference Result 1164 states and 2032 transitions. [2019-09-07 13:04:39,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:39,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-07 13:04:39,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:39,282 INFO L225 Difference]: With dead ends: 1164 [2019-09-07 13:04:39,282 INFO L226 Difference]: Without dead ends: 690 [2019-09-07 13:04:39,283 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:04:39,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2019-09-07 13:04:39,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 688. [2019-09-07 13:04:39,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2019-09-07 13:04:39,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1190 transitions. [2019-09-07 13:04:39,303 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1190 transitions. Word has length 27 [2019-09-07 13:04:39,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:39,303 INFO L475 AbstractCegarLoop]: Abstraction has 688 states and 1190 transitions. [2019-09-07 13:04:39,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:39,304 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1190 transitions. [2019-09-07 13:04:39,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-07 13:04:39,305 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:39,305 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, 1, 1, 1, 1, 1] [2019-09-07 13:04:39,305 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:39,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:39,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1970780365, now seen corresponding path program 1 times [2019-09-07 13:04:39,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:39,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:39,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:39,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:39,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:39,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:39,328 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:04:39,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:39,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:39,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:39,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:39,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:39,330 INFO L87 Difference]: Start difference. First operand 688 states and 1190 transitions. Second operand 3 states. [2019-09-07 13:04:39,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:39,355 INFO L93 Difference]: Finished difference Result 1032 states and 1780 transitions. [2019-09-07 13:04:39,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:39,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-07 13:04:39,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:39,360 INFO L225 Difference]: With dead ends: 1032 [2019-09-07 13:04:39,360 INFO L226 Difference]: Without dead ends: 698 [2019-09-07 13:04:39,361 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:04:39,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2019-09-07 13:04:39,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 696. [2019-09-07 13:04:39,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2019-09-07 13:04:39,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1190 transitions. [2019-09-07 13:04:39,380 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1190 transitions. Word has length 28 [2019-09-07 13:04:39,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:39,381 INFO L475 AbstractCegarLoop]: Abstraction has 696 states and 1190 transitions. [2019-09-07 13:04:39,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:39,381 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1190 transitions. [2019-09-07 13:04:39,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-07 13:04:39,382 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:39,382 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, 1, 1, 1, 1, 1] [2019-09-07 13:04:39,382 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:39,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:39,383 INFO L82 PathProgramCache]: Analyzing trace with hash 330042225, now seen corresponding path program 1 times [2019-09-07 13:04:39,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:39,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:39,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:39,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:39,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:39,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:39,402 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:04:39,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:39,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:39,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:39,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:39,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:39,404 INFO L87 Difference]: Start difference. First operand 696 states and 1190 transitions. Second operand 3 states. [2019-09-07 13:04:39,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:39,429 INFO L93 Difference]: Finished difference Result 1292 states and 2248 transitions. [2019-09-07 13:04:39,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:39,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-07 13:04:39,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:39,436 INFO L225 Difference]: With dead ends: 1292 [2019-09-07 13:04:39,437 INFO L226 Difference]: Without dead ends: 1290 [2019-09-07 13:04:39,437 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:04:39,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2019-09-07 13:04:39,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 968. [2019-09-07 13:04:39,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2019-09-07 13:04:39,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1622 transitions. [2019-09-07 13:04:39,469 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1622 transitions. Word has length 28 [2019-09-07 13:04:39,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:39,471 INFO L475 AbstractCegarLoop]: Abstraction has 968 states and 1622 transitions. [2019-09-07 13:04:39,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:39,471 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1622 transitions. [2019-09-07 13:04:39,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-07 13:04:39,474 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:39,474 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, 1, 1, 1, 1, 1] [2019-09-07 13:04:39,474 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:39,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:39,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1258305677, now seen corresponding path program 1 times [2019-09-07 13:04:39,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:39,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:39,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:39,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:39,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:39,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:39,498 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:04:39,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:39,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:39,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:39,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:39,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:39,499 INFO L87 Difference]: Start difference. First operand 968 states and 1622 transitions. Second operand 3 states. [2019-09-07 13:04:39,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:39,539 INFO L93 Difference]: Finished difference Result 2300 states and 3880 transitions. [2019-09-07 13:04:39,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:39,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-07 13:04:39,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:39,548 INFO L225 Difference]: With dead ends: 2300 [2019-09-07 13:04:39,549 INFO L226 Difference]: Without dead ends: 1354 [2019-09-07 13:04:39,552 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:04:39,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2019-09-07 13:04:39,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1352. [2019-09-07 13:04:39,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2019-09-07 13:04:39,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 2262 transitions. [2019-09-07 13:04:39,608 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 2262 transitions. Word has length 28 [2019-09-07 13:04:39,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:39,609 INFO L475 AbstractCegarLoop]: Abstraction has 1352 states and 2262 transitions. [2019-09-07 13:04:39,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:39,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 2262 transitions. [2019-09-07 13:04:39,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-07 13:04:39,612 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:39,624 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, 1, 1, 1, 1, 1, 1] [2019-09-07 13:04:39,625 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:39,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:39,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1641587831, now seen corresponding path program 1 times [2019-09-07 13:04:39,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:39,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:39,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:39,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:39,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:39,645 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:04:39,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:39,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:39,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:39,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:39,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:39,648 INFO L87 Difference]: Start difference. First operand 1352 states and 2262 transitions. Second operand 3 states. [2019-09-07 13:04:39,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:39,685 INFO L93 Difference]: Finished difference Result 2028 states and 3384 transitions. [2019-09-07 13:04:39,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:39,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-07 13:04:39,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:39,695 INFO L225 Difference]: With dead ends: 2028 [2019-09-07 13:04:39,695 INFO L226 Difference]: Without dead ends: 1370 [2019-09-07 13:04:39,699 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:04:39,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2019-09-07 13:04:39,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1368. [2019-09-07 13:04:39,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1368 states. [2019-09-07 13:04:39,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 2262 transitions. [2019-09-07 13:04:39,740 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 2262 transitions. Word has length 29 [2019-09-07 13:04:39,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:39,741 INFO L475 AbstractCegarLoop]: Abstraction has 1368 states and 2262 transitions. [2019-09-07 13:04:39,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:39,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 2262 transitions. [2019-09-07 13:04:39,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-07 13:04:39,743 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:39,743 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, 1, 1, 1, 1, 1, 1] [2019-09-07 13:04:39,744 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:39,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:39,744 INFO L82 PathProgramCache]: Analyzing trace with hash -352556875, now seen corresponding path program 1 times [2019-09-07 13:04:39,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:39,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:39,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:39,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:39,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:39,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:39,788 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:04:39,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:39,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:39,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:39,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:39,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:39,790 INFO L87 Difference]: Start difference. First operand 1368 states and 2262 transitions. Second operand 3 states. [2019-09-07 13:04:39,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:39,832 INFO L93 Difference]: Finished difference Result 2508 states and 4232 transitions. [2019-09-07 13:04:39,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:39,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-07 13:04:39,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:39,845 INFO L225 Difference]: With dead ends: 2508 [2019-09-07 13:04:39,845 INFO L226 Difference]: Without dead ends: 2506 [2019-09-07 13:04:39,846 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:04:39,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2019-09-07 13:04:39,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 1928. [2019-09-07 13:04:39,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2019-09-07 13:04:39,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 3110 transitions. [2019-09-07 13:04:39,903 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 3110 transitions. Word has length 29 [2019-09-07 13:04:39,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:39,904 INFO L475 AbstractCegarLoop]: Abstraction has 1928 states and 3110 transitions. [2019-09-07 13:04:39,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:39,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 3110 transitions. [2019-09-07 13:04:39,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-07 13:04:39,907 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:39,907 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, 1, 1, 1, 1, 1, 1] [2019-09-07 13:04:39,907 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:39,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:39,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1940904777, now seen corresponding path program 1 times [2019-09-07 13:04:39,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:39,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:39,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:39,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:39,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:39,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:39,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:04:39,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:39,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:39,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:39,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:39,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:39,933 INFO L87 Difference]: Start difference. First operand 1928 states and 3110 transitions. Second operand 3 states. [2019-09-07 13:04:39,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:39,985 INFO L93 Difference]: Finished difference Result 4556 states and 7400 transitions. [2019-09-07 13:04:39,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:39,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-07 13:04:39,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:39,998 INFO L225 Difference]: With dead ends: 4556 [2019-09-07 13:04:39,999 INFO L226 Difference]: Without dead ends: 2666 [2019-09-07 13:04:40,003 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:04:40,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2019-09-07 13:04:40,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 2664. [2019-09-07 13:04:40,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2664 states. [2019-09-07 13:04:40,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2664 states and 4294 transitions. [2019-09-07 13:04:40,079 INFO L78 Accepts]: Start accepts. Automaton has 2664 states and 4294 transitions. Word has length 29 [2019-09-07 13:04:40,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:40,079 INFO L475 AbstractCegarLoop]: Abstraction has 2664 states and 4294 transitions. [2019-09-07 13:04:40,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:40,079 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 4294 transitions. [2019-09-07 13:04:40,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-07 13:04:40,083 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:40,083 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:04:40,083 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:40,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:40,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1955852552, now seen corresponding path program 1 times [2019-09-07 13:04:40,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:40,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:40,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:40,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:40,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:40,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:40,108 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:04:40,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:40,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:40,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:40,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:40,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:40,109 INFO L87 Difference]: Start difference. First operand 2664 states and 4294 transitions. Second operand 3 states. [2019-09-07 13:04:40,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:40,161 INFO L93 Difference]: Finished difference Result 3996 states and 6424 transitions. [2019-09-07 13:04:40,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:40,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-07 13:04:40,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:40,174 INFO L225 Difference]: With dead ends: 3996 [2019-09-07 13:04:40,174 INFO L226 Difference]: Without dead ends: 2698 [2019-09-07 13:04:40,177 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:04:40,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2019-09-07 13:04:40,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2696. [2019-09-07 13:04:40,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2696 states. [2019-09-07 13:04:40,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2696 states to 2696 states and 4294 transitions. [2019-09-07 13:04:40,251 INFO L78 Accepts]: Start accepts. Automaton has 2696 states and 4294 transitions. Word has length 30 [2019-09-07 13:04:40,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:40,251 INFO L475 AbstractCegarLoop]: Abstraction has 2696 states and 4294 transitions. [2019-09-07 13:04:40,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:40,251 INFO L276 IsEmpty]: Start isEmpty. Operand 2696 states and 4294 transitions. [2019-09-07 13:04:40,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-07 13:04:40,255 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:40,255 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:04:40,256 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:40,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:40,256 INFO L82 PathProgramCache]: Analyzing trace with hash -38292154, now seen corresponding path program 1 times [2019-09-07 13:04:40,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:40,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:40,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:40,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:40,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:40,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:40,300 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:04:40,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:40,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:40,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:40,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:40,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:40,302 INFO L87 Difference]: Start difference. First operand 2696 states and 4294 transitions. Second operand 3 states. [2019-09-07 13:04:40,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:40,360 INFO L93 Difference]: Finished difference Result 4876 states and 7944 transitions. [2019-09-07 13:04:40,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:40,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-07 13:04:40,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:40,383 INFO L225 Difference]: With dead ends: 4876 [2019-09-07 13:04:40,383 INFO L226 Difference]: Without dead ends: 4874 [2019-09-07 13:04:40,386 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:04:40,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4874 states. [2019-09-07 13:04:40,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4874 to 3848. [2019-09-07 13:04:40,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3848 states. [2019-09-07 13:04:40,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3848 states to 3848 states and 5958 transitions. [2019-09-07 13:04:40,514 INFO L78 Accepts]: Start accepts. Automaton has 3848 states and 5958 transitions. Word has length 30 [2019-09-07 13:04:40,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:40,515 INFO L475 AbstractCegarLoop]: Abstraction has 3848 states and 5958 transitions. [2019-09-07 13:04:40,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:40,515 INFO L276 IsEmpty]: Start isEmpty. Operand 3848 states and 5958 transitions. [2019-09-07 13:04:40,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-07 13:04:40,521 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:40,521 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:04:40,522 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:40,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:40,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1626640056, now seen corresponding path program 1 times [2019-09-07 13:04:40,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:40,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:40,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:40,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:40,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:40,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:40,543 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:04:40,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:40,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:40,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:40,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:40,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:40,544 INFO L87 Difference]: Start difference. First operand 3848 states and 5958 transitions. Second operand 3 states. [2019-09-07 13:04:40,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:40,625 INFO L93 Difference]: Finished difference Result 9036 states and 14088 transitions. [2019-09-07 13:04:40,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:40,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-07 13:04:40,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:40,662 INFO L225 Difference]: With dead ends: 9036 [2019-09-07 13:04:40,662 INFO L226 Difference]: Without dead ends: 5258 [2019-09-07 13:04:40,669 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:04:40,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5258 states. [2019-09-07 13:04:40,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5258 to 5256. [2019-09-07 13:04:40,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5256 states. [2019-09-07 13:04:40,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5256 states to 5256 states and 8134 transitions. [2019-09-07 13:04:40,808 INFO L78 Accepts]: Start accepts. Automaton has 5256 states and 8134 transitions. Word has length 30 [2019-09-07 13:04:40,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:40,808 INFO L475 AbstractCegarLoop]: Abstraction has 5256 states and 8134 transitions. [2019-09-07 13:04:40,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:40,809 INFO L276 IsEmpty]: Start isEmpty. Operand 5256 states and 8134 transitions. [2019-09-07 13:04:40,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-07 13:04:40,815 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:40,816 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:04:40,816 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:40,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:40,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1186842644, now seen corresponding path program 1 times [2019-09-07 13:04:40,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:40,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:40,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:40,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:40,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:40,841 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:04:40,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:40,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:40,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:40,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:40,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:40,843 INFO L87 Difference]: Start difference. First operand 5256 states and 8134 transitions. Second operand 3 states. [2019-09-07 13:04:40,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:40,935 INFO L93 Difference]: Finished difference Result 7884 states and 12168 transitions. [2019-09-07 13:04:40,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:40,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-07 13:04:40,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:40,947 INFO L225 Difference]: With dead ends: 7884 [2019-09-07 13:04:40,947 INFO L226 Difference]: Without dead ends: 5322 [2019-09-07 13:04:40,953 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:04:40,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5322 states. [2019-09-07 13:04:41,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5322 to 5320. [2019-09-07 13:04:41,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5320 states. [2019-09-07 13:04:41,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5320 states to 5320 states and 8134 transitions. [2019-09-07 13:04:41,067 INFO L78 Accepts]: Start accepts. Automaton has 5320 states and 8134 transitions. Word has length 31 [2019-09-07 13:04:41,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:41,067 INFO L475 AbstractCegarLoop]: Abstraction has 5320 states and 8134 transitions. [2019-09-07 13:04:41,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:41,067 INFO L276 IsEmpty]: Start isEmpty. Operand 5320 states and 8134 transitions. [2019-09-07 13:04:41,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-07 13:04:41,074 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:41,074 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:04:41,074 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:41,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:41,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1113979946, now seen corresponding path program 1 times [2019-09-07 13:04:41,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:41,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:41,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:41,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:41,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:41,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:41,095 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:04:41,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:41,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:41,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:41,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:41,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:41,096 INFO L87 Difference]: Start difference. First operand 5320 states and 8134 transitions. Second operand 3 states. [2019-09-07 13:04:41,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:41,220 INFO L93 Difference]: Finished difference Result 15564 states and 23624 transitions. [2019-09-07 13:04:41,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:41,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-07 13:04:41,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:41,242 INFO L225 Difference]: With dead ends: 15564 [2019-09-07 13:04:41,242 INFO L226 Difference]: Without dead ends: 10378 [2019-09-07 13:04:41,255 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:04:41,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10378 states. [2019-09-07 13:04:41,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10378 to 10376. [2019-09-07 13:04:41,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10376 states. [2019-09-07 13:04:41,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10376 states to 10376 states and 15494 transitions. [2019-09-07 13:04:41,642 INFO L78 Accepts]: Start accepts. Automaton has 10376 states and 15494 transitions. Word has length 31 [2019-09-07 13:04:41,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:41,643 INFO L475 AbstractCegarLoop]: Abstraction has 10376 states and 15494 transitions. [2019-09-07 13:04:41,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:41,643 INFO L276 IsEmpty]: Start isEmpty. Operand 10376 states and 15494 transitions. [2019-09-07 13:04:41,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-07 13:04:41,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:41,659 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:04:41,659 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:41,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:41,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1592639448, now seen corresponding path program 1 times [2019-09-07 13:04:41,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:41,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:41,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:41,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:41,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:41,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:41,693 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:04:41,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:41,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:41,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:41,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:41,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:41,695 INFO L87 Difference]: Start difference. First operand 10376 states and 15494 transitions. Second operand 3 states. [2019-09-07 13:04:41,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:41,881 INFO L93 Difference]: Finished difference Result 12172 states and 18824 transitions. [2019-09-07 13:04:41,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:41,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-07 13:04:41,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:41,907 INFO L225 Difference]: With dead ends: 12172 [2019-09-07 13:04:41,907 INFO L226 Difference]: Without dead ends: 12170 [2019-09-07 13:04:41,912 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:04:41,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12170 states. [2019-09-07 13:04:42,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12170 to 10376. [2019-09-07 13:04:42,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10376 states. [2019-09-07 13:04:42,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10376 states to 10376 states and 15366 transitions. [2019-09-07 13:04:42,143 INFO L78 Accepts]: Start accepts. Automaton has 10376 states and 15366 transitions. Word has length 31 [2019-09-07 13:04:42,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:42,143 INFO L475 AbstractCegarLoop]: Abstraction has 10376 states and 15366 transitions. [2019-09-07 13:04:42,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:42,143 INFO L276 IsEmpty]: Start isEmpty. Operand 10376 states and 15366 transitions. [2019-09-07 13:04:42,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-07 13:04:42,155 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:42,155 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:04:42,155 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:42,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:42,156 INFO L82 PathProgramCache]: Analyzing trace with hash 173854429, now seen corresponding path program 1 times [2019-09-07 13:04:42,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:42,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:42,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:42,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:42,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:42,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:42,179 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:04:42,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:42,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:42,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:42,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:42,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:42,181 INFO L87 Difference]: Start difference. First operand 10376 states and 15366 transitions. Second operand 3 states. [2019-09-07 13:04:42,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:42,446 INFO L93 Difference]: Finished difference Result 18316 states and 27784 transitions. [2019-09-07 13:04:42,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:42,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-09-07 13:04:42,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:42,476 INFO L225 Difference]: With dead ends: 18316 [2019-09-07 13:04:42,477 INFO L226 Difference]: Without dead ends: 18314 [2019-09-07 13:04:42,484 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:04:42,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18314 states. [2019-09-07 13:04:42,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18314 to 15240. [2019-09-07 13:04:42,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15240 states. [2019-09-07 13:04:42,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15240 states to 15240 states and 21894 transitions. [2019-09-07 13:04:42,774 INFO L78 Accepts]: Start accepts. Automaton has 15240 states and 21894 transitions. Word has length 32 [2019-09-07 13:04:42,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:42,775 INFO L475 AbstractCegarLoop]: Abstraction has 15240 states and 21894 transitions. [2019-09-07 13:04:42,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:42,775 INFO L276 IsEmpty]: Start isEmpty. Operand 15240 states and 21894 transitions. [2019-09-07 13:04:42,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-07 13:04:42,799 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:42,800 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:04:42,800 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:42,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:42,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1414493473, now seen corresponding path program 1 times [2019-09-07 13:04:42,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:42,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:42,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:42,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:42,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:42,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:42,829 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:04:42,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:42,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:42,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:42,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:42,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:42,830 INFO L87 Difference]: Start difference. First operand 15240 states and 21894 transitions. Second operand 3 states. [2019-09-07 13:04:43,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:43,510 INFO L93 Difference]: Finished difference Result 35468 states and 51336 transitions. [2019-09-07 13:04:43,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:43,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-09-07 13:04:43,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:43,543 INFO L225 Difference]: With dead ends: 35468 [2019-09-07 13:04:43,543 INFO L226 Difference]: Without dead ends: 20362 [2019-09-07 13:04:43,566 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:04:43,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20362 states. [2019-09-07 13:04:43,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20362 to 20360. [2019-09-07 13:04:43,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20360 states. [2019-09-07 13:04:43,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20360 states to 20360 states and 29190 transitions. [2019-09-07 13:04:43,900 INFO L78 Accepts]: Start accepts. Automaton has 20360 states and 29190 transitions. Word has length 32 [2019-09-07 13:04:43,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:43,900 INFO L475 AbstractCegarLoop]: Abstraction has 20360 states and 29190 transitions. [2019-09-07 13:04:43,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:43,901 INFO L276 IsEmpty]: Start isEmpty. Operand 20360 states and 29190 transitions. [2019-09-07 13:04:43,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-07 13:04:43,922 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:43,922 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:04:43,922 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:43,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:43,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1094734815, now seen corresponding path program 1 times [2019-09-07 13:04:43,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:43,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:43,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:43,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:43,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:43,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:43,942 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:04:43,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:43,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:43,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:43,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:43,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:43,944 INFO L87 Difference]: Start difference. First operand 20360 states and 29190 transitions. Second operand 3 states. [2019-09-07 13:04:44,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:44,206 INFO L93 Difference]: Finished difference Result 30732 states and 44040 transitions. [2019-09-07 13:04:44,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:44,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-09-07 13:04:44,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:44,240 INFO L225 Difference]: With dead ends: 30732 [2019-09-07 13:04:44,240 INFO L226 Difference]: Without dead ends: 20746 [2019-09-07 13:04:44,258 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:04:44,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20746 states. [2019-09-07 13:04:44,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20746 to 20744. [2019-09-07 13:04:44,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20744 states. [2019-09-07 13:04:44,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20744 states to 20744 states and 29446 transitions. [2019-09-07 13:04:44,575 INFO L78 Accepts]: Start accepts. Automaton has 20744 states and 29446 transitions. Word has length 33 [2019-09-07 13:04:44,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:44,575 INFO L475 AbstractCegarLoop]: Abstraction has 20744 states and 29446 transitions. [2019-09-07 13:04:44,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:44,575 INFO L276 IsEmpty]: Start isEmpty. Operand 20744 states and 29446 transitions. [2019-09-07 13:04:44,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-07 13:04:44,597 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:44,597 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:04:44,597 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:44,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:44,598 INFO L82 PathProgramCache]: Analyzing trace with hash -899409891, now seen corresponding path program 1 times [2019-09-07 13:04:44,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:44,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:44,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:44,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:44,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:44,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:44,616 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:04:44,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:44,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:44,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:44,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:44,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:44,618 INFO L87 Difference]: Start difference. First operand 20744 states and 29446 transitions. Second operand 3 states. [2019-09-07 13:04:45,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:45,042 INFO L93 Difference]: Finished difference Result 35852 states and 51976 transitions. [2019-09-07 13:04:45,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:45,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-09-07 13:04:45,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:45,103 INFO L225 Difference]: With dead ends: 35852 [2019-09-07 13:04:45,103 INFO L226 Difference]: Without dead ends: 35850 [2019-09-07 13:04:45,111 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:04:45,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35850 states. [2019-09-07 13:04:45,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35850 to 30728. [2019-09-07 13:04:45,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30728 states. [2019-09-07 13:04:45,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30728 states to 30728 states and 42246 transitions. [2019-09-07 13:04:45,604 INFO L78 Accepts]: Start accepts. Automaton has 30728 states and 42246 transitions. Word has length 33 [2019-09-07 13:04:45,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:45,604 INFO L475 AbstractCegarLoop]: Abstraction has 30728 states and 42246 transitions. [2019-09-07 13:04:45,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:45,605 INFO L276 IsEmpty]: Start isEmpty. Operand 30728 states and 42246 transitions. [2019-09-07 13:04:45,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-07 13:04:45,643 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:45,643 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:04:45,643 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:45,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:45,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1807209503, now seen corresponding path program 1 times [2019-09-07 13:04:45,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:45,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:45,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:45,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:45,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:45,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:45,664 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:04:45,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:45,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:45,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:45,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:45,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:45,666 INFO L87 Difference]: Start difference. First operand 30728 states and 42246 transitions. Second operand 3 states. [2019-09-07 13:04:46,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:46,139 INFO L93 Difference]: Finished difference Result 70668 states and 97544 transitions. [2019-09-07 13:04:46,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:46,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-09-07 13:04:46,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:46,190 INFO L225 Difference]: With dead ends: 70668 [2019-09-07 13:04:46,190 INFO L226 Difference]: Without dead ends: 40458 [2019-09-07 13:04:46,237 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:04:46,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40458 states. [2019-09-07 13:04:46,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40458 to 40456. [2019-09-07 13:04:46,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40456 states. [2019-09-07 13:04:46,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40456 states to 40456 states and 55302 transitions. [2019-09-07 13:04:46,941 INFO L78 Accepts]: Start accepts. Automaton has 40456 states and 55302 transitions. Word has length 33 [2019-09-07 13:04:46,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:46,941 INFO L475 AbstractCegarLoop]: Abstraction has 40456 states and 55302 transitions. [2019-09-07 13:04:46,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:46,941 INFO L276 IsEmpty]: Start isEmpty. Operand 40456 states and 55302 transitions. [2019-09-07 13:04:46,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-07 13:04:46,979 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:46,980 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:04:46,980 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:46,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:46,980 INFO L82 PathProgramCache]: Analyzing trace with hash -2111687692, now seen corresponding path program 1 times [2019-09-07 13:04:46,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:46,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:46,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:46,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:46,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:46,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:47,181 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:04:47,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:47,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:47,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:47,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:47,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:47,182 INFO L87 Difference]: Start difference. First operand 40456 states and 55302 transitions. Second operand 3 states. [2019-09-07 13:04:47,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:47,500 INFO L93 Difference]: Finished difference Result 60684 states and 82696 transitions. [2019-09-07 13:04:47,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:47,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-09-07 13:04:47,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:47,545 INFO L225 Difference]: With dead ends: 60684 [2019-09-07 13:04:47,545 INFO L226 Difference]: Without dead ends: 40970 [2019-09-07 13:04:47,575 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:04:47,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40970 states. [2019-09-07 13:04:48,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40970 to 40968. [2019-09-07 13:04:48,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40968 states. [2019-09-07 13:04:48,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40968 states to 40968 states and 55302 transitions. [2019-09-07 13:04:48,396 INFO L78 Accepts]: Start accepts. Automaton has 40968 states and 55302 transitions. Word has length 34 [2019-09-07 13:04:48,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:48,397 INFO L475 AbstractCegarLoop]: Abstraction has 40968 states and 55302 transitions. [2019-09-07 13:04:48,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:48,397 INFO L276 IsEmpty]: Start isEmpty. Operand 40968 states and 55302 transitions. [2019-09-07 13:04:48,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-07 13:04:48,423 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:48,423 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:04:48,424 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:48,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:48,424 INFO L82 PathProgramCache]: Analyzing trace with hash 189134898, now seen corresponding path program 1 times [2019-09-07 13:04:48,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:48,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:48,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:48,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:48,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:48,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:48,444 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:04:48,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:48,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:48,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:48,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:48,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:48,445 INFO L87 Difference]: Start difference. First operand 40968 states and 55302 transitions. Second operand 3 states. [2019-09-07 13:04:48,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:48,921 INFO L93 Difference]: Finished difference Result 69644 states and 95752 transitions. [2019-09-07 13:04:48,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:48,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-09-07 13:04:48,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:48,993 INFO L225 Difference]: With dead ends: 69644 [2019-09-07 13:04:48,993 INFO L226 Difference]: Without dead ends: 69642 [2019-09-07 13:04:49,016 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:04:49,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69642 states. [2019-09-07 13:04:51,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69642 to 61448. [2019-09-07 13:04:51,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61448 states. [2019-09-07 13:04:51,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61448 states to 61448 states and 80390 transitions. [2019-09-07 13:04:51,116 INFO L78 Accepts]: Start accepts. Automaton has 61448 states and 80390 transitions. Word has length 34 [2019-09-07 13:04:51,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:51,116 INFO L475 AbstractCegarLoop]: Abstraction has 61448 states and 80390 transitions. [2019-09-07 13:04:51,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:51,116 INFO L276 IsEmpty]: Start isEmpty. Operand 61448 states and 80390 transitions. [2019-09-07 13:04:51,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-07 13:04:51,153 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:51,154 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:04:51,155 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:51,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:51,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1399213004, now seen corresponding path program 1 times [2019-09-07 13:04:51,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:51,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:51,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:51,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:51,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:51,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:51,174 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:04:51,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:51,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:51,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:51,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:51,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:51,176 INFO L87 Difference]: Start difference. First operand 61448 states and 80390 transitions. Second operand 3 states. [2019-09-07 13:04:51,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:51,757 INFO L93 Difference]: Finished difference Result 140300 states and 183816 transitions. [2019-09-07 13:04:51,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:51,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-09-07 13:04:51,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:51,823 INFO L225 Difference]: With dead ends: 140300 [2019-09-07 13:04:51,824 INFO L226 Difference]: Without dead ends: 79882 [2019-09-07 13:04:51,871 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:04:51,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79882 states. [2019-09-07 13:04:52,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79882 to 79880. [2019-09-07 13:04:52,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79880 states. [2019-09-07 13:04:52,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79880 states to 79880 states and 103430 transitions. [2019-09-07 13:04:52,954 INFO L78 Accepts]: Start accepts. Automaton has 79880 states and 103430 transitions. Word has length 34 [2019-09-07 13:04:52,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:52,955 INFO L475 AbstractCegarLoop]: Abstraction has 79880 states and 103430 transitions. [2019-09-07 13:04:52,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:52,955 INFO L276 IsEmpty]: Start isEmpty. Operand 79880 states and 103430 transitions. [2019-09-07 13:04:52,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-07 13:04:52,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:52,992 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:04:52,992 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:52,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:52,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1568430036, now seen corresponding path program 1 times [2019-09-07 13:04:52,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:52,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:52,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:52,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:52,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:52,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:53,013 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:04:53,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:53,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:53,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:53,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:53,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:53,015 INFO L87 Difference]: Start difference. First operand 79880 states and 103430 transitions. Second operand 3 states. [2019-09-07 13:04:54,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:54,725 INFO L93 Difference]: Finished difference Result 119820 states and 154632 transitions. [2019-09-07 13:04:54,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:54,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-09-07 13:04:54,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:54,806 INFO L225 Difference]: With dead ends: 119820 [2019-09-07 13:04:54,806 INFO L226 Difference]: Without dead ends: 80906 [2019-09-07 13:04:54,830 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:04:54,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80906 states. [2019-09-07 13:04:55,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80906 to 80904. [2019-09-07 13:04:55,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80904 states. [2019-09-07 13:04:55,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80904 states to 80904 states and 103430 transitions. [2019-09-07 13:04:55,546 INFO L78 Accepts]: Start accepts. Automaton has 80904 states and 103430 transitions. Word has length 35 [2019-09-07 13:04:55,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:55,547 INFO L475 AbstractCegarLoop]: Abstraction has 80904 states and 103430 transitions. [2019-09-07 13:04:55,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:55,547 INFO L276 IsEmpty]: Start isEmpty. Operand 80904 states and 103430 transitions. [2019-09-07 13:04:55,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-07 13:04:55,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:55,572 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:04:55,572 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:55,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:55,572 INFO L82 PathProgramCache]: Analyzing trace with hash -425714670, now seen corresponding path program 1 times [2019-09-07 13:04:55,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:55,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:55,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:55,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:55,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:55,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:55,589 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:04:55,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:55,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:55,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:55,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:55,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:55,590 INFO L87 Difference]: Start difference. First operand 80904 states and 103430 transitions. Second operand 3 states. [2019-09-07 13:04:56,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:04:56,522 INFO L93 Difference]: Finished difference Result 135180 states and 175112 transitions. [2019-09-07 13:04:56,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:04:56,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-09-07 13:04:56,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:04:56,633 INFO L225 Difference]: With dead ends: 135180 [2019-09-07 13:04:56,633 INFO L226 Difference]: Without dead ends: 135178 [2019-09-07 13:04:56,663 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:04:56,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135178 states. [2019-09-07 13:04:59,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135178 to 122888. [2019-09-07 13:04:59,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122888 states. [2019-09-07 13:04:59,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122888 states to 122888 states and 152582 transitions. [2019-09-07 13:04:59,436 INFO L78 Accepts]: Start accepts. Automaton has 122888 states and 152582 transitions. Word has length 35 [2019-09-07 13:04:59,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:04:59,436 INFO L475 AbstractCegarLoop]: Abstraction has 122888 states and 152582 transitions. [2019-09-07 13:04:59,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:04:59,436 INFO L276 IsEmpty]: Start isEmpty. Operand 122888 states and 152582 transitions. [2019-09-07 13:04:59,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-07 13:04:59,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:04:59,488 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:04:59,488 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:04:59,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:04:59,488 INFO L82 PathProgramCache]: Analyzing trace with hash -2014062572, now seen corresponding path program 1 times [2019-09-07 13:04:59,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:04:59,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:04:59,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:59,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:04:59,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:04:59,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:04:59,505 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:04:59,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:04:59,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:04:59,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:04:59,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:04:59,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:04:59,506 INFO L87 Difference]: Start difference. First operand 122888 states and 152582 transitions. Second operand 3 states. [2019-09-07 13:05:01,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:01,024 INFO L93 Difference]: Finished difference Result 278540 states and 345096 transitions. [2019-09-07 13:05:01,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:01,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-09-07 13:05:01,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:01,142 INFO L225 Difference]: With dead ends: 278540 [2019-09-07 13:05:01,143 INFO L226 Difference]: Without dead ends: 157706 [2019-09-07 13:05:01,206 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:01,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157706 states. [2019-09-07 13:05:05,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157706 to 157704. [2019-09-07 13:05:05,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157704 states. [2019-09-07 13:05:05,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157704 states to 157704 states and 192518 transitions. [2019-09-07 13:05:05,893 INFO L78 Accepts]: Start accepts. Automaton has 157704 states and 192518 transitions. Word has length 35 [2019-09-07 13:05:05,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:05,893 INFO L475 AbstractCegarLoop]: Abstraction has 157704 states and 192518 transitions. [2019-09-07 13:05:05,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:05,893 INFO L276 IsEmpty]: Start isEmpty. Operand 157704 states and 192518 transitions. [2019-09-07 13:05:05,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-07 13:05:05,946 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:05,946 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:05:05,946 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:05,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:05,947 INFO L82 PathProgramCache]: Analyzing trace with hash -312037047, now seen corresponding path program 1 times [2019-09-07 13:05:05,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:05,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:05,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:05,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:05,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:05,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:05,963 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:05,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:05,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:05,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:05,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:05,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:05,964 INFO L87 Difference]: Start difference. First operand 157704 states and 192518 transitions. Second operand 3 states. [2019-09-07 13:05:06,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:06,919 INFO L93 Difference]: Finished difference Result 236556 states and 287752 transitions. [2019-09-07 13:05:06,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:06,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-09-07 13:05:06,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:07,059 INFO L225 Difference]: With dead ends: 236556 [2019-09-07 13:05:07,060 INFO L226 Difference]: Without dead ends: 159754 [2019-09-07 13:05:07,127 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:07,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159754 states. [2019-09-07 13:05:09,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159754 to 159752. [2019-09-07 13:05:09,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159752 states. [2019-09-07 13:05:09,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159752 states to 159752 states and 192518 transitions. [2019-09-07 13:05:09,185 INFO L78 Accepts]: Start accepts. Automaton has 159752 states and 192518 transitions. Word has length 36 [2019-09-07 13:05:09,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:09,186 INFO L475 AbstractCegarLoop]: Abstraction has 159752 states and 192518 transitions. [2019-09-07 13:05:09,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:09,186 INFO L276 IsEmpty]: Start isEmpty. Operand 159752 states and 192518 transitions. [2019-09-07 13:05:09,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-07 13:05:09,241 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:09,241 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:05:09,241 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:09,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:09,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1988785543, now seen corresponding path program 1 times [2019-09-07 13:05:09,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:09,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:09,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:09,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:09,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:09,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:09,261 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:09,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:09,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:09,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:09,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:09,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:09,262 INFO L87 Difference]: Start difference. First operand 159752 states and 192518 transitions. Second operand 3 states. [2019-09-07 13:05:12,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:12,942 INFO L93 Difference]: Finished difference Result 262156 states and 317448 transitions. [2019-09-07 13:05:12,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:12,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-09-07 13:05:12,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:13,159 INFO L225 Difference]: With dead ends: 262156 [2019-09-07 13:05:13,159 INFO L226 Difference]: Without dead ends: 262154 [2019-09-07 13:05:13,192 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,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262154 states. [2019-09-07 13:05:15,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262154 to 245768. [2019-09-07 13:05:15,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245768 states. [2019-09-07 13:05:15,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245768 states to 245768 states and 288774 transitions. [2019-09-07 13:05:15,693 INFO L78 Accepts]: Start accepts. Automaton has 245768 states and 288774 transitions. Word has length 36 [2019-09-07 13:05:15,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:15,693 INFO L475 AbstractCegarLoop]: Abstraction has 245768 states and 288774 transitions. [2019-09-07 13:05:15,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:15,693 INFO L276 IsEmpty]: Start isEmpty. Operand 245768 states and 288774 transitions. [2019-09-07 13:05:15,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-07 13:05:15,810 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:15,810 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:05:15,810 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:15,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:15,810 INFO L82 PathProgramCache]: Analyzing trace with hash 400437641, now seen corresponding path program 1 times [2019-09-07 13:05:15,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:15,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:15,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:15,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:15,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:15,835 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:15,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:15,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:15,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:15,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:15,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:15,837 INFO L87 Difference]: Start difference. First operand 245768 states and 288774 transitions. Second operand 3 states. [2019-09-07 13:05:18,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:18,671 INFO L93 Difference]: Finished difference Result 552972 states and 645128 transitions. [2019-09-07 13:05:18,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:18,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-09-07 13:05:18,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:18,968 INFO L225 Difference]: With dead ends: 552972 [2019-09-07 13:05:18,969 INFO L226 Difference]: Without dead ends: 311306 [2019-09-07 13:05:19,130 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:19,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311306 states. [2019-09-07 13:05:26,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311306 to 311304. [2019-09-07 13:05:26,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311304 states. [2019-09-07 13:05:27,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311304 states to 311304 states and 356358 transitions. [2019-09-07 13:05:27,356 INFO L78 Accepts]: Start accepts. Automaton has 311304 states and 356358 transitions. Word has length 36 [2019-09-07 13:05:27,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:27,356 INFO L475 AbstractCegarLoop]: Abstraction has 311304 states and 356358 transitions. [2019-09-07 13:05:27,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:27,357 INFO L276 IsEmpty]: Start isEmpty. Operand 311304 states and 356358 transitions. [2019-09-07 13:05:27,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-07 13:05:27,486 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:27,486 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:05:27,486 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:27,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:27,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1523025865, now seen corresponding path program 1 times [2019-09-07 13:05:27,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:27,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:27,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:27,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:27,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:27,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:27,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:27,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:27,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:27,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:27,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:27,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:27,503 INFO L87 Difference]: Start difference. First operand 311304 states and 356358 transitions. Second operand 3 states. [2019-09-07 13:05:30,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:30,553 INFO L93 Difference]: Finished difference Result 466956 states and 532488 transitions. [2019-09-07 13:05:30,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:30,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-09-07 13:05:30,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:30,856 INFO L225 Difference]: With dead ends: 466956 [2019-09-07 13:05:30,857 INFO L226 Difference]: Without dead ends: 315402 [2019-09-07 13:05:35,906 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:36,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315402 states. [2019-09-07 13:05:38,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315402 to 315400. [2019-09-07 13:05:38,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315400 states. [2019-09-07 13:05:39,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315400 states to 315400 states and 356358 transitions. [2019-09-07 13:05:39,813 INFO L78 Accepts]: Start accepts. Automaton has 315400 states and 356358 transitions. Word has length 37 [2019-09-07 13:05:39,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:39,814 INFO L475 AbstractCegarLoop]: Abstraction has 315400 states and 356358 transitions. [2019-09-07 13:05:39,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:39,814 INFO L276 IsEmpty]: Start isEmpty. Operand 315400 states and 356358 transitions. [2019-09-07 13:05:39,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-07 13:05:39,945 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:39,945 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:05:39,945 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:39,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:39,945 INFO L82 PathProgramCache]: Analyzing trace with hash -471118841, now seen corresponding path program 1 times [2019-09-07 13:05:39,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:39,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:39,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:39,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:39,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:39,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:39,980 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:39,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:39,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:39,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:39,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:39,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:39,982 INFO L87 Difference]: Start difference. First operand 315400 states and 356358 transitions. Second operand 3 states. [2019-09-07 13:05:48,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:48,012 INFO L93 Difference]: Finished difference Result 507914 states and 569351 transitions. [2019-09-07 13:05:48,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:48,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-09-07 13:05:48,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:48,472 INFO L225 Difference]: With dead ends: 507914 [2019-09-07 13:05:48,473 INFO L226 Difference]: Without dead ends: 507912 [2019-09-07 13:05:48,518 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:48,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507912 states. [2019-09-07 13:05:53,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507912 to 491528. [2019-09-07 13:05:53,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491528 states. [2019-09-07 13:05:54,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491528 states to 491528 states and 544774 transitions. [2019-09-07 13:05:54,484 INFO L78 Accepts]: Start accepts. Automaton has 491528 states and 544774 transitions. Word has length 37 [2019-09-07 13:05:54,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:54,484 INFO L475 AbstractCegarLoop]: Abstraction has 491528 states and 544774 transitions. [2019-09-07 13:05:54,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:54,484 INFO L276 IsEmpty]: Start isEmpty. Operand 491528 states and 544774 transitions. [2019-09-07 13:05:55,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-07 13:05:55,869 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:55,869 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:05:55,869 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:55,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:55,870 INFO L82 PathProgramCache]: Analyzing trace with hash -2059466743, now seen corresponding path program 1 times [2019-09-07 13:05:55,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:55,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:55,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:55,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:55,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:55,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:55,894 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:55,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:55,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:55,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:55,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:55,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:55,895 INFO L87 Difference]: Start difference. First operand 491528 states and 544774 transitions. Second operand 3 states. [2019-09-07 13:06:05,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:06:05,796 INFO L93 Difference]: Finished difference Result 1097736 states and 1200134 transitions. [2019-09-07 13:06:05,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:06:05,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-09-07 13:06:05,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:06:05,797 INFO L225 Difference]: With dead ends: 1097736 [2019-09-07 13:06:05,797 INFO L226 Difference]: Without dead ends: 0 [2019-09-07 13:06:06,938 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:06:06,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-07 13:06:06,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-07 13:06:06,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-07 13:06:06,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-07 13:06:06,938 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2019-09-07 13:06:06,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:06:06,939 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-07 13:06:06,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:06:06,939 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-07 13:06:06,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-07 13:06:06,942 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-07 13:06:07,009 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-07 13:06:07,009 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-07 13:06:07,009 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-07 13:06:07,009 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-07 13:06:07,009 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-07 13:06:07,009 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-07 13:06:07,009 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 219) no Hoare annotation was computed. [2019-09-07 13:06:07,009 INFO L443 ceAbstractionStarter]: For program point L184-1(lines 51 214) no Hoare annotation was computed. [2019-09-07 13:06:07,010 INFO L443 ceAbstractionStarter]: For program point L118-1(lines 51 214) no Hoare annotation was computed. [2019-09-07 13:06:07,010 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 51 214) no Hoare annotation was computed. [2019-09-07 13:06:07,010 INFO L443 ceAbstractionStarter]: For program point L185(line 185) no Hoare annotation was computed. [2019-09-07 13:06:07,010 INFO L443 ceAbstractionStarter]: For program point L86(lines 86 88) no Hoare annotation was computed. [2019-09-07 13:06:07,010 INFO L443 ceAbstractionStarter]: For program point L53(lines 53 55) no Hoare annotation was computed. [2019-09-07 13:06:07,010 INFO L443 ceAbstractionStarter]: For program point L86-2(lines 51 214) no Hoare annotation was computed. [2019-09-07 13:06:07,010 INFO L443 ceAbstractionStarter]: For program point L169-1(lines 51 214) no Hoare annotation was computed. [2019-09-07 13:06:07,010 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 219) no Hoare annotation was computed. [2019-09-07 13:06:07,010 INFO L443 ceAbstractionStarter]: For program point L170(line 170) no Hoare annotation was computed. [2019-09-07 13:06:07,011 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 217) no Hoare annotation was computed. [2019-09-07 13:06:07,011 INFO L443 ceAbstractionStarter]: For program point L154-1(lines 51 214) no Hoare annotation was computed. [2019-09-07 13:06:07,011 INFO L443 ceAbstractionStarter]: For program point L204-1(lines 51 214) no Hoare annotation was computed. [2019-09-07 13:06:07,011 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 51 214) no Hoare annotation was computed. [2019-09-07 13:06:07,011 INFO L443 ceAbstractionStarter]: For program point L155(line 155) no Hoare annotation was computed. [2019-09-07 13:06:07,011 INFO L443 ceAbstractionStarter]: For program point L122-1(lines 51 214) no Hoare annotation was computed. [2019-09-07 13:06:07,011 INFO L443 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-09-07 13:06:07,011 INFO L443 ceAbstractionStarter]: For program point L106-1(lines 51 214) no Hoare annotation was computed. [2019-09-07 13:06:07,012 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 51 214) no Hoare annotation was computed. [2019-09-07 13:06:07,012 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 51 214) no Hoare annotation was computed. [2019-09-07 13:06:07,012 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-09-07 13:06:07,012 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 51 214) no Hoare annotation was computed. [2019-09-07 13:06:07,012 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-09-07 13:06:07,012 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 51 214) no Hoare annotation was computed. [2019-09-07 13:06:07,012 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 51 214) no Hoare annotation was computed. [2019-09-07 13:06:07,012 INFO L446 ceAbstractionStarter]: At program point L209-1(lines 51 214) the Hoare annotation is: true [2019-09-07 13:06:07,012 INFO L443 ceAbstractionStarter]: For program point L110-1(lines 51 214) no Hoare annotation was computed. [2019-09-07 13:06:07,013 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-09-07 13:06:07,013 INFO L443 ceAbstractionStarter]: For program point L94-1(lines 51 214) no Hoare annotation was computed. [2019-09-07 13:06:07,013 INFO L443 ceAbstractionStarter]: For program point L210(line 210) no Hoare annotation was computed. [2019-09-07 13:06:07,013 INFO L439 ceAbstractionStarter]: At program point L210-1(lines 5 219) the Hoare annotation is: false [2019-09-07 13:06:07,013 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 51 214) no Hoare annotation was computed. [2019-09-07 13:06:07,013 INFO L443 ceAbstractionStarter]: For program point L194-1(lines 51 214) no Hoare annotation was computed. [2019-09-07 13:06:07,013 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-09-07 13:06:07,013 INFO L443 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2019-09-07 13:06:07,013 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 219) the Hoare annotation is: true [2019-09-07 13:06:07,014 INFO L443 ceAbstractionStarter]: For program point L179-1(lines 51 214) no Hoare annotation was computed. [2019-09-07 13:06:07,014 INFO L443 ceAbstractionStarter]: For program point L130-1(lines 51 214) no Hoare annotation was computed. [2019-09-07 13:06:07,014 INFO L443 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-09-07 13:06:07,014 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 51 214) no Hoare annotation was computed. [2019-09-07 13:06:07,014 INFO L443 ceAbstractionStarter]: For program point L164-1(lines 51 214) no Hoare annotation was computed. [2019-09-07 13:06:07,014 INFO L443 ceAbstractionStarter]: For program point L98-1(lines 51 214) no Hoare annotation was computed. [2019-09-07 13:06:07,014 INFO L443 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2019-09-07 13:06:07,014 INFO L446 ceAbstractionStarter]: At program point L215(lines 5 219) the Hoare annotation is: true [2019-09-07 13:06:07,014 INFO L443 ceAbstractionStarter]: For program point L149-1(lines 51 214) no Hoare annotation was computed. [2019-09-07 13:06:07,014 INFO L443 ceAbstractionStarter]: For program point L199-1(lines 51 214) no Hoare annotation was computed. [2019-09-07 13:06:07,015 INFO L443 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-09-07 13:06:07,015 INFO L443 ceAbstractionStarter]: For program point L200(line 200) no Hoare annotation was computed. [2019-09-07 13:06:07,015 INFO L443 ceAbstractionStarter]: For program point L134-1(lines 51 214) no Hoare annotation was computed. [2019-09-07 13:06:07,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.09 01:06:07 BoogieIcfgContainer [2019-09-07 13:06:07,023 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-07 13:06:07,025 INFO L168 Benchmark]: Toolchain (without parser) took 90256.33 ms. Allocated memory was 140.5 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 87.9 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-09-07 13:06:07,026 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 140.5 MB. Free memory was 106.6 MB in the beginning and 106.4 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:06:07,026 INFO L168 Benchmark]: CACSL2BoogieTranslator took 452.43 ms. Allocated memory was 140.5 MB in the beginning and 199.2 MB in the end (delta: 58.7 MB). Free memory was 87.5 MB in the beginning and 176.3 MB in the end (delta: -88.8 MB). Peak memory consumption was 21.4 MB. Max. memory is 7.1 GB. [2019-09-07 13:06:07,027 INFO L168 Benchmark]: Boogie Preprocessor took 37.01 ms. Allocated memory is still 199.2 MB. Free memory was 176.3 MB in the beginning and 174.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-09-07 13:06:07,027 INFO L168 Benchmark]: RCFGBuilder took 436.97 ms. Allocated memory is still 199.2 MB. Free memory was 174.5 MB in the beginning and 152.4 MB in the end (delta: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. [2019-09-07 13:06:07,028 INFO L168 Benchmark]: TraceAbstraction took 89325.65 ms. Allocated memory was 199.2 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 152.4 MB in the beginning and 1.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-09-07 13:06:07,031 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.45 ms. Allocated memory is still 140.5 MB. Free memory was 106.6 MB in the beginning and 106.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 452.43 ms. Allocated memory was 140.5 MB in the beginning and 199.2 MB in the end (delta: 58.7 MB). Free memory was 87.5 MB in the beginning and 176.3 MB in the end (delta: -88.8 MB). Peak memory consumption was 21.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.01 ms. Allocated memory is still 199.2 MB. Free memory was 176.3 MB in the beginning and 174.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 436.97 ms. Allocated memory is still 199.2 MB. Free memory was 174.5 MB in the beginning and 152.4 MB in the end (delta: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 89325.65 ms. Allocated memory was 199.2 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 152.4 MB in the beginning and 1.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 217]: 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: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 56 locations, 1 error locations. SAFE Result, 89.2s OverallTime, 40 OverallIterations, 1 TraceHistogramMax, 46.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4632 SDtfs, 2311 SDslu, 3194 SDs, 0 SdLazy, 213 SolverSat, 40 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=491528occurred in iteration=39, 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: 38.5s AutomataMinimizationTime, 40 MinimizatonAttempts, 65580 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 16394 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1225 NumberOfCodeBlocks, 1225 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1185 ConstructedInterpolants, 0 QuantifiedInterpolants, 74775 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 40 InterpolantComputations, 40 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...