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_10.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:13:32,587 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:13:32,590 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:13:32,610 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:13:32,611 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:13:32,613 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:13:32,615 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:13:32,627 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:13:32,629 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:13:32,630 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:13:32,631 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:13:32,632 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:13:32,632 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:13:32,633 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:13:32,634 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:13:32,636 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:13:32,638 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:13:32,640 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:13:32,644 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:13:32,647 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:13:32,650 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:13:32,651 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:13:32,652 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:13:32,653 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:13:32,657 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:13:32,657 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:13:32,657 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:13:32,660 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:13:32,661 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:13:32,664 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:13:32,664 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:13:32,666 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:13:32,667 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:13:32,668 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:13:32,672 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:13:32,672 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:13:32,673 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:13:32,673 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:13:32,673 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:13:32,676 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:13:32,679 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:13:32,680 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-10-14 23:13:32,706 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:13:32,706 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:13:32,709 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:13:32,709 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:13:32,709 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:13:32,709 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:13:32,710 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:13:32,710 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:13:32,710 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:13:32,710 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:13:32,712 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:13:32,712 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:13:32,712 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:13:32,713 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:13:32,713 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:13:32,713 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:13:32,713 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:13:32,714 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:13:32,714 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:13:32,714 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:13:32,714 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:13:32,714 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:13:32,715 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:13:32,715 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:13:32,715 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:13:32,715 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:13:32,715 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:13:32,716 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:13:32,716 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:13:33,050 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:13:33,074 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:13:33,078 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:13:33,080 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:13:33,081 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:13:33,081 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_10.c [2019-10-14 23:13:33,159 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69765667c/6839106b8f56451f9ddaaa63be9e7351/FLAG3a394a407 [2019-10-14 23:13:33,635 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:13:33,636 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_10.c [2019-10-14 23:13:33,644 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69765667c/6839106b8f56451f9ddaaa63be9e7351/FLAG3a394a407 [2019-10-14 23:13:34,002 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69765667c/6839106b8f56451f9ddaaa63be9e7351 [2019-10-14 23:13:34,013 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:13:34,014 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:13:34,015 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:13:34,016 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:13:34,019 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:13:34,020 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:13:34" (1/1) ... [2019-10-14 23:13:34,026 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f5000c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:34, skipping insertion in model container [2019-10-14 23:13:34,026 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:13:34" (1/1) ... [2019-10-14 23:13:34,034 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:13:34,060 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:13:34,249 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:13:34,260 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:13:34,294 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:13:34,310 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:13:34,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:34 WrapperNode [2019-10-14 23:13:34,311 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:13:34,311 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:13:34,312 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:13:34,312 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:13:34,403 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:34" (1/1) ... [2019-10-14 23:13:34,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:34" (1/1) ... [2019-10-14 23:13:34,410 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:34" (1/1) ... [2019-10-14 23:13:34,411 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:34" (1/1) ... [2019-10-14 23:13:34,417 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:34" (1/1) ... [2019-10-14 23:13:34,425 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:34" (1/1) ... [2019-10-14 23:13:34,427 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:34" (1/1) ... [2019-10-14 23:13:34,429 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:13:34,430 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:13:34,430 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:13:34,430 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:13:34,431 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:34" (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-10-14 23:13:34,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:13:34,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:13:34,498 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:13:34,498 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:13:34,498 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:13:34,498 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:13:34,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:13:34,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:13:34,826 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:13:34,826 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-14 23:13:34,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:13:34 BoogieIcfgContainer [2019-10-14 23:13:34,829 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:13:34,830 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:13:34,831 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:13:34,834 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:13:34,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:13:34" (1/3) ... [2019-10-14 23:13:34,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a28c49e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:13:34, skipping insertion in model container [2019-10-14 23:13:34,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:34" (2/3) ... [2019-10-14 23:13:34,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a28c49e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:13:34, skipping insertion in model container [2019-10-14 23:13:34,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:13:34" (3/3) ... [2019-10-14 23:13:34,840 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_10.c [2019-10-14 23:13:34,868 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:13:34,887 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:13:34,912 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:13:34,946 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:13:34,947 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:13:34,947 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:13:34,947 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:13:34,947 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:13:34,947 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:13:34,948 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:13:34,948 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:13:34,966 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-10-14 23:13:34,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-14 23:13:34,973 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:34,974 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:34,976 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:34,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:34,982 INFO L82 PathProgramCache]: Analyzing trace with hash -917347053, now seen corresponding path program 1 times [2019-10-14 23:13:34,991 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:34,992 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976611614] [2019-10-14 23:13:34,992 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:34,992 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:34,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:35,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:35,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:35,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:35,191 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976611614] [2019-10-14 23:13:35,192 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:35,193 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:35,193 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139916690] [2019-10-14 23:13:35,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:35,198 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:35,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:35,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:35,216 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2019-10-14 23:13:35,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:35,282 INFO L93 Difference]: Finished difference Result 87 states and 150 transitions. [2019-10-14 23:13:35,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:35,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-14 23:13:35,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:35,298 INFO L225 Difference]: With dead ends: 87 [2019-10-14 23:13:35,298 INFO L226 Difference]: Without dead ends: 72 [2019-10-14 23:13:35,301 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-14 23:13:35,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-14 23:13:35,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2019-10-14 23:13:35,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-14 23:13:35,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 89 transitions. [2019-10-14 23:13:35,351 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 89 transitions. Word has length 20 [2019-10-14 23:13:35,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:35,352 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 89 transitions. [2019-10-14 23:13:35,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:35,352 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 89 transitions. [2019-10-14 23:13:35,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-14 23:13:35,354 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:35,354 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:35,354 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:35,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:35,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1504153067, now seen corresponding path program 1 times [2019-10-14 23:13:35,355 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:35,355 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678184785] [2019-10-14 23:13:35,356 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:35,356 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:35,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:35,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:35,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:35,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:35,439 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678184785] [2019-10-14 23:13:35,439 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:35,439 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:35,440 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257664865] [2019-10-14 23:13:35,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:35,442 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:35,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:35,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:35,443 INFO L87 Difference]: Start difference. First operand 50 states and 89 transitions. Second operand 3 states. [2019-10-14 23:13:35,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:35,486 INFO L93 Difference]: Finished difference Result 117 states and 212 transitions. [2019-10-14 23:13:35,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:35,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-14 23:13:35,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:35,489 INFO L225 Difference]: With dead ends: 117 [2019-10-14 23:13:35,489 INFO L226 Difference]: Without dead ends: 72 [2019-10-14 23:13:35,491 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-14 23:13:35,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-14 23:13:35,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-10-14 23:13:35,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-14 23:13:35,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 125 transitions. [2019-10-14 23:13:35,504 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 125 transitions. Word has length 20 [2019-10-14 23:13:35,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:35,504 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 125 transitions. [2019-10-14 23:13:35,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:35,505 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 125 transitions. [2019-10-14 23:13:35,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-14 23:13:35,506 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:35,506 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:35,506 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:35,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:35,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1627225809, now seen corresponding path program 1 times [2019-10-14 23:13:35,507 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:35,508 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532134214] [2019-10-14 23:13:35,508 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:35,508 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:35,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:35,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:35,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:35,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:35,567 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532134214] [2019-10-14 23:13:35,567 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:35,567 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:35,568 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108597015] [2019-10-14 23:13:35,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:35,569 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:35,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:35,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:35,570 INFO L87 Difference]: Start difference. First operand 70 states and 125 transitions. Second operand 3 states. [2019-10-14 23:13:35,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:35,602 INFO L93 Difference]: Finished difference Result 108 states and 189 transitions. [2019-10-14 23:13:35,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:35,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-14 23:13:35,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:35,605 INFO L225 Difference]: With dead ends: 108 [2019-10-14 23:13:35,605 INFO L226 Difference]: Without dead ends: 75 [2019-10-14 23:13:35,606 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-14 23:13:35,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-10-14 23:13:35,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-10-14 23:13:35,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-14 23:13:35,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 127 transitions. [2019-10-14 23:13:35,621 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 127 transitions. Word has length 21 [2019-10-14 23:13:35,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:35,624 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 127 transitions. [2019-10-14 23:13:35,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:35,625 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 127 transitions. [2019-10-14 23:13:35,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-14 23:13:35,626 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:35,626 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:35,627 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:35,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:35,627 INFO L82 PathProgramCache]: Analyzing trace with hash 616108559, now seen corresponding path program 1 times [2019-10-14 23:13:35,628 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:35,628 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202596329] [2019-10-14 23:13:35,628 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:35,628 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:35,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:35,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:35,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:35,719 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202596329] [2019-10-14 23:13:35,720 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:35,720 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:35,720 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141158027] [2019-10-14 23:13:35,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:35,721 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:35,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:35,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:35,721 INFO L87 Difference]: Start difference. First operand 73 states and 127 transitions. Second operand 3 states. [2019-10-14 23:13:35,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:35,754 INFO L93 Difference]: Finished difference Result 136 states and 240 transitions. [2019-10-14 23:13:35,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:35,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-14 23:13:35,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:35,756 INFO L225 Difference]: With dead ends: 136 [2019-10-14 23:13:35,756 INFO L226 Difference]: Without dead ends: 134 [2019-10-14 23:13:35,757 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-14 23:13:35,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-10-14 23:13:35,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 96. [2019-10-14 23:13:35,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-10-14 23:13:35,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 168 transitions. [2019-10-14 23:13:35,769 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 168 transitions. Word has length 21 [2019-10-14 23:13:35,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:35,769 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 168 transitions. [2019-10-14 23:13:35,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:35,770 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 168 transitions. [2019-10-14 23:13:35,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-14 23:13:35,771 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:35,771 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:35,771 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:35,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:35,772 INFO L82 PathProgramCache]: Analyzing trace with hash 29302545, now seen corresponding path program 1 times [2019-10-14 23:13:35,772 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:35,772 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279834678] [2019-10-14 23:13:35,773 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:35,773 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:35,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:35,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:35,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:35,830 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279834678] [2019-10-14 23:13:35,830 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:35,831 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:35,831 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160591277] [2019-10-14 23:13:35,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:35,832 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:35,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:35,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:35,832 INFO L87 Difference]: Start difference. First operand 96 states and 168 transitions. Second operand 3 states. [2019-10-14 23:13:35,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:35,866 INFO L93 Difference]: Finished difference Result 224 states and 398 transitions. [2019-10-14 23:13:35,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:35,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-14 23:13:35,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:35,868 INFO L225 Difference]: With dead ends: 224 [2019-10-14 23:13:35,868 INFO L226 Difference]: Without dead ends: 136 [2019-10-14 23:13:35,869 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-14 23:13:35,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-10-14 23:13:35,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2019-10-14 23:13:35,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-10-14 23:13:35,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 234 transitions. [2019-10-14 23:13:35,882 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 234 transitions. Word has length 21 [2019-10-14 23:13:35,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:35,882 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 234 transitions. [2019-10-14 23:13:35,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:35,883 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 234 transitions. [2019-10-14 23:13:35,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 23:13:35,884 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:35,884 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:35,884 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:35,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:35,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1919709866, now seen corresponding path program 1 times [2019-10-14 23:13:35,885 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:35,885 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846864872] [2019-10-14 23:13:35,886 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:35,886 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:35,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:35,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:35,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:35,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:35,934 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846864872] [2019-10-14 23:13:35,934 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:35,936 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:35,936 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664149082] [2019-10-14 23:13:35,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:35,937 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:35,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:35,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:35,937 INFO L87 Difference]: Start difference. First operand 134 states and 234 transitions. Second operand 3 states. [2019-10-14 23:13:35,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:35,957 INFO L93 Difference]: Finished difference Result 201 states and 349 transitions. [2019-10-14 23:13:35,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:35,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-14 23:13:35,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:35,960 INFO L225 Difference]: With dead ends: 201 [2019-10-14 23:13:35,960 INFO L226 Difference]: Without dead ends: 138 [2019-10-14 23:13:35,963 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-14 23:13:35,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-10-14 23:13:35,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2019-10-14 23:13:35,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-10-14 23:13:35,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 234 transitions. [2019-10-14 23:13:35,983 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 234 transitions. Word has length 22 [2019-10-14 23:13:35,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:35,983 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 234 transitions. [2019-10-14 23:13:35,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:35,984 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 234 transitions. [2019-10-14 23:13:35,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 23:13:35,985 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:35,985 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:35,985 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:35,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:35,986 INFO L82 PathProgramCache]: Analyzing trace with hash 908592616, now seen corresponding path program 1 times [2019-10-14 23:13:35,986 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:35,986 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509120253] [2019-10-14 23:13:35,987 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:35,987 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:35,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:36,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:36,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:36,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:36,033 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509120253] [2019-10-14 23:13:36,034 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:36,034 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:36,034 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32499560] [2019-10-14 23:13:36,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:36,036 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:36,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:36,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:36,037 INFO L87 Difference]: Start difference. First operand 136 states and 234 transitions. Second operand 3 states. [2019-10-14 23:13:36,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:36,070 INFO L93 Difference]: Finished difference Result 252 states and 440 transitions. [2019-10-14 23:13:36,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:36,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-14 23:13:36,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:36,073 INFO L225 Difference]: With dead ends: 252 [2019-10-14 23:13:36,073 INFO L226 Difference]: Without dead ends: 250 [2019-10-14 23:13:36,074 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-14 23:13:36,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-10-14 23:13:36,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 184. [2019-10-14 23:13:36,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-10-14 23:13:36,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 314 transitions. [2019-10-14 23:13:36,106 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 314 transitions. Word has length 22 [2019-10-14 23:13:36,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:36,107 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 314 transitions. [2019-10-14 23:13:36,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:36,107 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 314 transitions. [2019-10-14 23:13:36,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 23:13:36,109 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:36,109 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:36,109 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:36,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:36,110 INFO L82 PathProgramCache]: Analyzing trace with hash 321786602, now seen corresponding path program 1 times [2019-10-14 23:13:36,110 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:36,110 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401590150] [2019-10-14 23:13:36,110 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:36,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:36,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:36,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:36,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:36,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:36,142 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401590150] [2019-10-14 23:13:36,143 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:36,143 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:36,143 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630356194] [2019-10-14 23:13:36,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:36,144 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:36,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:36,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:36,145 INFO L87 Difference]: Start difference. First operand 184 states and 314 transitions. Second operand 3 states. [2019-10-14 23:13:36,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:36,175 INFO L93 Difference]: Finished difference Result 432 states and 744 transitions. [2019-10-14 23:13:36,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:36,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-14 23:13:36,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:36,178 INFO L225 Difference]: With dead ends: 432 [2019-10-14 23:13:36,178 INFO L226 Difference]: Without dead ends: 258 [2019-10-14 23:13:36,179 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-14 23:13:36,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-10-14 23:13:36,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-10-14 23:13:36,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-10-14 23:13:36,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 434 transitions. [2019-10-14 23:13:36,202 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 434 transitions. Word has length 22 [2019-10-14 23:13:36,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:36,202 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 434 transitions. [2019-10-14 23:13:36,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:36,203 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 434 transitions. [2019-10-14 23:13:36,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-14 23:13:36,204 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:36,205 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:36,205 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:36,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:36,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1898185914, now seen corresponding path program 1 times [2019-10-14 23:13:36,205 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:36,206 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896977956] [2019-10-14 23:13:36,206 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:36,206 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:36,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:36,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:36,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:36,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:36,234 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896977956] [2019-10-14 23:13:36,235 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:36,235 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:36,237 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865606834] [2019-10-14 23:13:36,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:36,237 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:36,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:36,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:36,240 INFO L87 Difference]: Start difference. First operand 256 states and 434 transitions. Second operand 3 states. [2019-10-14 23:13:36,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:36,267 INFO L93 Difference]: Finished difference Result 384 states and 648 transitions. [2019-10-14 23:13:36,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:36,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-14 23:13:36,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:36,269 INFO L225 Difference]: With dead ends: 384 [2019-10-14 23:13:36,269 INFO L226 Difference]: Without dead ends: 262 [2019-10-14 23:13:36,271 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-14 23:13:36,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-10-14 23:13:36,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2019-10-14 23:13:36,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-10-14 23:13:36,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 434 transitions. [2019-10-14 23:13:36,288 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 434 transitions. Word has length 23 [2019-10-14 23:13:36,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:36,289 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 434 transitions. [2019-10-14 23:13:36,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:36,289 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 434 transitions. [2019-10-14 23:13:36,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-14 23:13:36,297 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:36,297 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:36,299 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:36,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:36,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1385664132, now seen corresponding path program 1 times [2019-10-14 23:13:36,300 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:36,300 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022201488] [2019-10-14 23:13:36,300 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:36,300 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:36,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:36,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:36,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:36,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:36,349 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022201488] [2019-10-14 23:13:36,350 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:36,350 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:36,350 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942537940] [2019-10-14 23:13:36,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:36,352 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:36,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:36,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:36,352 INFO L87 Difference]: Start difference. First operand 260 states and 434 transitions. Second operand 3 states. [2019-10-14 23:13:36,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:36,394 INFO L93 Difference]: Finished difference Result 476 states and 808 transitions. [2019-10-14 23:13:36,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:36,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-14 23:13:36,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:36,398 INFO L225 Difference]: With dead ends: 476 [2019-10-14 23:13:36,398 INFO L226 Difference]: Without dead ends: 474 [2019-10-14 23:13:36,399 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-14 23:13:36,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-10-14 23:13:36,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 360. [2019-10-14 23:13:36,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-10-14 23:13:36,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 590 transitions. [2019-10-14 23:13:36,411 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 590 transitions. Word has length 23 [2019-10-14 23:13:36,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:36,412 INFO L462 AbstractCegarLoop]: Abstraction has 360 states and 590 transitions. [2019-10-14 23:13:36,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:36,412 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 590 transitions. [2019-10-14 23:13:36,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-14 23:13:36,413 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:36,414 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:36,414 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:36,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:36,414 INFO L82 PathProgramCache]: Analyzing trace with hash 798858118, now seen corresponding path program 1 times [2019-10-14 23:13:36,414 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:36,415 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123028937] [2019-10-14 23:13:36,415 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:36,415 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:36,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:36,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:36,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:36,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:36,440 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123028937] [2019-10-14 23:13:36,441 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:36,441 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:36,441 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787728209] [2019-10-14 23:13:36,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:36,442 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:36,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:36,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:36,443 INFO L87 Difference]: Start difference. First operand 360 states and 590 transitions. Second operand 3 states. [2019-10-14 23:13:36,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:36,472 INFO L93 Difference]: Finished difference Result 844 states and 1392 transitions. [2019-10-14 23:13:36,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:36,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-14 23:13:36,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:36,476 INFO L225 Difference]: With dead ends: 844 [2019-10-14 23:13:36,476 INFO L226 Difference]: Without dead ends: 498 [2019-10-14 23:13:36,477 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-14 23:13:36,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-10-14 23:13:36,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 496. [2019-10-14 23:13:36,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2019-10-14 23:13:36,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 806 transitions. [2019-10-14 23:13:36,494 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 806 transitions. Word has length 23 [2019-10-14 23:13:36,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:36,494 INFO L462 AbstractCegarLoop]: Abstraction has 496 states and 806 transitions. [2019-10-14 23:13:36,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:36,495 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 806 transitions. [2019-10-14 23:13:36,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-14 23:13:36,496 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:36,496 INFO L380 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-10-14 23:13:36,496 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:36,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:36,497 INFO L82 PathProgramCache]: Analyzing trace with hash 6129535, now seen corresponding path program 1 times [2019-10-14 23:13:36,497 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:36,497 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455610938] [2019-10-14 23:13:36,497 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:36,497 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:36,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:36,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:36,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:36,524 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455610938] [2019-10-14 23:13:36,525 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:36,525 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:36,525 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310514869] [2019-10-14 23:13:36,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:36,528 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:36,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:36,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:36,529 INFO L87 Difference]: Start difference. First operand 496 states and 806 transitions. Second operand 3 states. [2019-10-14 23:13:36,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:36,561 INFO L93 Difference]: Finished difference Result 744 states and 1204 transitions. [2019-10-14 23:13:36,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:36,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-14 23:13:36,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:36,566 INFO L225 Difference]: With dead ends: 744 [2019-10-14 23:13:36,566 INFO L226 Difference]: Without dead ends: 506 [2019-10-14 23:13:36,567 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-14 23:13:36,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2019-10-14 23:13:36,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 504. [2019-10-14 23:13:36,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-10-14 23:13:36,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 806 transitions. [2019-10-14 23:13:36,586 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 806 transitions. Word has length 24 [2019-10-14 23:13:36,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:36,586 INFO L462 AbstractCegarLoop]: Abstraction has 504 states and 806 transitions. [2019-10-14 23:13:36,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:36,587 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 806 transitions. [2019-10-14 23:13:36,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-14 23:13:36,588 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:36,588 INFO L380 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-10-14 23:13:36,589 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:36,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:36,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1004987715, now seen corresponding path program 1 times [2019-10-14 23:13:36,589 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:36,589 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141031445] [2019-10-14 23:13:36,590 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:36,590 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:36,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:36,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:36,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:36,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:36,626 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141031445] [2019-10-14 23:13:36,626 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:36,626 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:36,626 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935142830] [2019-10-14 23:13:36,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:36,627 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:36,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:36,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:36,633 INFO L87 Difference]: Start difference. First operand 504 states and 806 transitions. Second operand 3 states. [2019-10-14 23:13:36,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:36,665 INFO L93 Difference]: Finished difference Result 908 states and 1480 transitions. [2019-10-14 23:13:36,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:36,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-14 23:13:36,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:36,671 INFO L225 Difference]: With dead ends: 908 [2019-10-14 23:13:36,671 INFO L226 Difference]: Without dead ends: 906 [2019-10-14 23:13:36,673 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-14 23:13:36,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2019-10-14 23:13:36,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 712. [2019-10-14 23:13:36,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2019-10-14 23:13:36,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1110 transitions. [2019-10-14 23:13:36,697 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1110 transitions. Word has length 24 [2019-10-14 23:13:36,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:36,697 INFO L462 AbstractCegarLoop]: Abstraction has 712 states and 1110 transitions. [2019-10-14 23:13:36,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:36,697 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1110 transitions. [2019-10-14 23:13:36,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-14 23:13:36,699 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:36,699 INFO L380 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-10-14 23:13:36,700 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:36,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:36,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1591793729, now seen corresponding path program 1 times [2019-10-14 23:13:36,700 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:36,700 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649646195] [2019-10-14 23:13:36,701 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:36,701 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:36,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:36,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:36,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:36,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:36,727 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649646195] [2019-10-14 23:13:36,727 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:36,727 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:36,728 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588641303] [2019-10-14 23:13:36,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:36,729 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:36,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:36,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:36,729 INFO L87 Difference]: Start difference. First operand 712 states and 1110 transitions. Second operand 3 states. [2019-10-14 23:13:36,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:36,762 INFO L93 Difference]: Finished difference Result 1660 states and 2600 transitions. [2019-10-14 23:13:36,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:36,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-14 23:13:36,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:36,768 INFO L225 Difference]: With dead ends: 1660 [2019-10-14 23:13:36,768 INFO L226 Difference]: Without dead ends: 970 [2019-10-14 23:13:36,770 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-14 23:13:36,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2019-10-14 23:13:36,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 968. [2019-10-14 23:13:36,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2019-10-14 23:13:36,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1494 transitions. [2019-10-14 23:13:36,805 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1494 transitions. Word has length 24 [2019-10-14 23:13:36,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:36,806 INFO L462 AbstractCegarLoop]: Abstraction has 968 states and 1494 transitions. [2019-10-14 23:13:36,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:36,806 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1494 transitions. [2019-10-14 23:13:36,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-14 23:13:36,809 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:36,809 INFO L380 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-10-14 23:13:36,809 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:36,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:36,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1089633349, now seen corresponding path program 1 times [2019-10-14 23:13:36,810 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:36,810 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237368716] [2019-10-14 23:13:36,810 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:36,811 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:36,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:36,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:36,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:36,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:36,844 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237368716] [2019-10-14 23:13:36,844 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:36,844 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:36,845 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169703422] [2019-10-14 23:13:36,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:36,845 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:36,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:36,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:36,846 INFO L87 Difference]: Start difference. First operand 968 states and 1494 transitions. Second operand 3 states. [2019-10-14 23:13:36,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:36,891 INFO L93 Difference]: Finished difference Result 1452 states and 2232 transitions. [2019-10-14 23:13:36,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:36,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-14 23:13:36,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:36,898 INFO L225 Difference]: With dead ends: 1452 [2019-10-14 23:13:36,898 INFO L226 Difference]: Without dead ends: 986 [2019-10-14 23:13:36,902 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-14 23:13:36,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2019-10-14 23:13:36,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 984. [2019-10-14 23:13:36,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2019-10-14 23:13:36,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1494 transitions. [2019-10-14 23:13:36,954 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1494 transitions. Word has length 25 [2019-10-14 23:13:36,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:36,957 INFO L462 AbstractCegarLoop]: Abstraction has 984 states and 1494 transitions. [2019-10-14 23:13:36,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:36,958 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1494 transitions. [2019-10-14 23:13:36,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-14 23:13:36,961 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:36,961 INFO L380 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-10-14 23:13:36,961 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:36,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:36,962 INFO L82 PathProgramCache]: Analyzing trace with hash -2100750599, now seen corresponding path program 1 times [2019-10-14 23:13:36,962 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:36,963 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589145186] [2019-10-14 23:13:36,963 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:36,963 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:36,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:36,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:37,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:37,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:37,022 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589145186] [2019-10-14 23:13:37,022 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:37,025 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:37,026 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037217535] [2019-10-14 23:13:37,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:37,026 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:37,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:37,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:37,027 INFO L87 Difference]: Start difference. First operand 984 states and 1494 transitions. Second operand 3 states. [2019-10-14 23:13:37,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:37,080 INFO L93 Difference]: Finished difference Result 1740 states and 2696 transitions. [2019-10-14 23:13:37,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:37,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-14 23:13:37,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:37,094 INFO L225 Difference]: With dead ends: 1740 [2019-10-14 23:13:37,095 INFO L226 Difference]: Without dead ends: 1738 [2019-10-14 23:13:37,096 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-14 23:13:37,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2019-10-14 23:13:37,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1416. [2019-10-14 23:13:37,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1416 states. [2019-10-14 23:13:37,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 2086 transitions. [2019-10-14 23:13:37,160 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 2086 transitions. Word has length 25 [2019-10-14 23:13:37,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:37,160 INFO L462 AbstractCegarLoop]: Abstraction has 1416 states and 2086 transitions. [2019-10-14 23:13:37,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:37,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 2086 transitions. [2019-10-14 23:13:37,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-14 23:13:37,163 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:37,164 INFO L380 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-10-14 23:13:37,164 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:37,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:37,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1607410683, now seen corresponding path program 1 times [2019-10-14 23:13:37,164 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:37,165 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799756290] [2019-10-14 23:13:37,165 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:37,165 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:37,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:37,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:37,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:37,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:37,193 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799756290] [2019-10-14 23:13:37,193 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:37,193 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:37,194 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164642] [2019-10-14 23:13:37,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:37,197 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:37,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:37,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:37,197 INFO L87 Difference]: Start difference. First operand 1416 states and 2086 transitions. Second operand 3 states. [2019-10-14 23:13:37,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:37,248 INFO L93 Difference]: Finished difference Result 3276 states and 4840 transitions. [2019-10-14 23:13:37,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:37,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-14 23:13:37,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:37,260 INFO L225 Difference]: With dead ends: 3276 [2019-10-14 23:13:37,260 INFO L226 Difference]: Without dead ends: 1898 [2019-10-14 23:13:37,264 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-14 23:13:37,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2019-10-14 23:13:37,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1896. [2019-10-14 23:13:37,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1896 states. [2019-10-14 23:13:37,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2758 transitions. [2019-10-14 23:13:37,323 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2758 transitions. Word has length 25 [2019-10-14 23:13:37,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:37,323 INFO L462 AbstractCegarLoop]: Abstraction has 1896 states and 2758 transitions. [2019-10-14 23:13:37,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:37,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2758 transitions. [2019-10-14 23:13:37,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-14 23:13:37,326 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:37,326 INFO L380 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-10-14 23:13:37,326 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:37,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:37,327 INFO L82 PathProgramCache]: Analyzing trace with hash -698544044, now seen corresponding path program 1 times [2019-10-14 23:13:37,328 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:37,328 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915493044] [2019-10-14 23:13:37,328 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:37,328 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:37,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:37,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:37,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:37,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:37,348 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915493044] [2019-10-14 23:13:37,348 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:37,348 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:37,348 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056710382] [2019-10-14 23:13:37,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:37,349 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:37,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:37,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:37,350 INFO L87 Difference]: Start difference. First operand 1896 states and 2758 transitions. Second operand 3 states. [2019-10-14 23:13:37,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:37,394 INFO L93 Difference]: Finished difference Result 2844 states and 4120 transitions. [2019-10-14 23:13:37,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:37,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-14 23:13:37,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:37,404 INFO L225 Difference]: With dead ends: 2844 [2019-10-14 23:13:37,404 INFO L226 Difference]: Without dead ends: 1930 [2019-10-14 23:13:37,407 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-14 23:13:37,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2019-10-14 23:13:37,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1928. [2019-10-14 23:13:37,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2019-10-14 23:13:37,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2758 transitions. [2019-10-14 23:13:37,467 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2758 transitions. Word has length 26 [2019-10-14 23:13:37,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:37,467 INFO L462 AbstractCegarLoop]: Abstraction has 1928 states and 2758 transitions. [2019-10-14 23:13:37,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:37,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2758 transitions. [2019-10-14 23:13:37,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-14 23:13:37,471 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:37,471 INFO L380 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-10-14 23:13:37,471 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:37,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:37,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1709661294, now seen corresponding path program 1 times [2019-10-14 23:13:37,472 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:37,472 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849889553] [2019-10-14 23:13:37,472 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:37,472 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:37,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:37,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:37,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:37,493 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849889553] [2019-10-14 23:13:37,493 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:37,494 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:37,494 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23324023] [2019-10-14 23:13:37,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:37,495 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:37,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:37,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:37,496 INFO L87 Difference]: Start difference. First operand 1928 states and 2758 transitions. Second operand 3 states. [2019-10-14 23:13:37,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:37,563 INFO L93 Difference]: Finished difference Result 3340 states and 4872 transitions. [2019-10-14 23:13:37,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:37,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-14 23:13:37,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:37,580 INFO L225 Difference]: With dead ends: 3340 [2019-10-14 23:13:37,580 INFO L226 Difference]: Without dead ends: 3338 [2019-10-14 23:13:37,582 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-14 23:13:37,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2019-10-14 23:13:37,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 2824. [2019-10-14 23:13:37,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2824 states. [2019-10-14 23:13:37,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2824 states to 2824 states and 3910 transitions. [2019-10-14 23:13:37,715 INFO L78 Accepts]: Start accepts. Automaton has 2824 states and 3910 transitions. Word has length 26 [2019-10-14 23:13:37,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:37,716 INFO L462 AbstractCegarLoop]: Abstraction has 2824 states and 3910 transitions. [2019-10-14 23:13:37,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:37,716 INFO L276 IsEmpty]: Start isEmpty. Operand 2824 states and 3910 transitions. [2019-10-14 23:13:37,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-14 23:13:37,722 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:37,722 INFO L380 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-10-14 23:13:37,722 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:37,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:37,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1998499988, now seen corresponding path program 1 times [2019-10-14 23:13:37,723 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:37,723 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400859873] [2019-10-14 23:13:37,724 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:37,724 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:37,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:37,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:37,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:37,763 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400859873] [2019-10-14 23:13:37,764 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:37,764 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:37,764 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404807695] [2019-10-14 23:13:37,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:37,765 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:37,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:37,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:37,765 INFO L87 Difference]: Start difference. First operand 2824 states and 3910 transitions. Second operand 3 states. [2019-10-14 23:13:37,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:37,878 INFO L93 Difference]: Finished difference Result 6476 states and 8968 transitions. [2019-10-14 23:13:37,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:37,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-14 23:13:37,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:37,904 INFO L225 Difference]: With dead ends: 6476 [2019-10-14 23:13:37,904 INFO L226 Difference]: Without dead ends: 3722 [2019-10-14 23:13:37,911 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-14 23:13:37,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2019-10-14 23:13:38,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3720. [2019-10-14 23:13:38,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3720 states. [2019-10-14 23:13:38,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3720 states to 3720 states and 5062 transitions. [2019-10-14 23:13:38,040 INFO L78 Accepts]: Start accepts. Automaton has 3720 states and 5062 transitions. Word has length 26 [2019-10-14 23:13:38,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:38,041 INFO L462 AbstractCegarLoop]: Abstraction has 3720 states and 5062 transitions. [2019-10-14 23:13:38,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:38,041 INFO L276 IsEmpty]: Start isEmpty. Operand 3720 states and 5062 transitions. [2019-10-14 23:13:38,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-14 23:13:38,048 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:38,048 INFO L380 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-10-14 23:13:38,048 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:38,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:38,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1459677136, now seen corresponding path program 1 times [2019-10-14 23:13:38,049 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:38,049 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223734367] [2019-10-14 23:13:38,049 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:38,049 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:38,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:38,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:38,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:38,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:38,075 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223734367] [2019-10-14 23:13:38,076 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:38,076 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:38,076 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143882286] [2019-10-14 23:13:38,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:38,076 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:38,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:38,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:38,079 INFO L87 Difference]: Start difference. First operand 3720 states and 5062 transitions. Second operand 3 states. [2019-10-14 23:13:38,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:38,159 INFO L93 Difference]: Finished difference Result 5580 states and 7560 transitions. [2019-10-14 23:13:38,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:38,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-14 23:13:38,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:38,179 INFO L225 Difference]: With dead ends: 5580 [2019-10-14 23:13:38,180 INFO L226 Difference]: Without dead ends: 3786 [2019-10-14 23:13:38,184 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-14 23:13:38,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3786 states. [2019-10-14 23:13:38,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3786 to 3784. [2019-10-14 23:13:38,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-10-14 23:13:38,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5062 transitions. [2019-10-14 23:13:38,345 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5062 transitions. Word has length 27 [2019-10-14 23:13:38,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:38,345 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5062 transitions. [2019-10-14 23:13:38,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:38,345 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5062 transitions. [2019-10-14 23:13:38,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-14 23:13:38,351 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:38,351 INFO L380 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-10-14 23:13:38,351 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:38,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:38,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1824172910, now seen corresponding path program 1 times [2019-10-14 23:13:38,352 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:38,352 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263472826] [2019-10-14 23:13:38,352 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:38,353 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:38,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:38,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:38,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:38,389 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263472826] [2019-10-14 23:13:38,389 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:38,389 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:38,389 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711798311] [2019-10-14 23:13:38,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:38,390 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:38,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:38,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:38,391 INFO L87 Difference]: Start difference. First operand 3784 states and 5062 transitions. Second operand 3 states. [2019-10-14 23:13:38,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:38,509 INFO L93 Difference]: Finished difference Result 10956 states and 14408 transitions. [2019-10-14 23:13:38,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:38,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-14 23:13:38,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:38,541 INFO L225 Difference]: With dead ends: 10956 [2019-10-14 23:13:38,542 INFO L226 Difference]: Without dead ends: 7306 [2019-10-14 23:13:38,551 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-14 23:13:38,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7306 states. [2019-10-14 23:13:38,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7306 to 7304. [2019-10-14 23:13:38,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2019-10-14 23:13:38,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 9350 transitions. [2019-10-14 23:13:38,812 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 9350 transitions. Word has length 27 [2019-10-14 23:13:38,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:38,812 INFO L462 AbstractCegarLoop]: Abstraction has 7304 states and 9350 transitions. [2019-10-14 23:13:38,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:38,813 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 9350 transitions. [2019-10-14 23:13:38,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-14 23:13:38,825 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:38,826 INFO L380 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-10-14 23:13:38,826 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:38,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:38,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1883988372, now seen corresponding path program 1 times [2019-10-14 23:13:38,827 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:38,827 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904347763] [2019-10-14 23:13:38,827 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:38,828 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:38,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:38,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:38,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:38,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:38,851 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904347763] [2019-10-14 23:13:38,851 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:38,851 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:38,852 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966393700] [2019-10-14 23:13:38,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:38,852 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:38,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:38,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:38,853 INFO L87 Difference]: Start difference. First operand 7304 states and 9350 transitions. Second operand 3 states. [2019-10-14 23:13:39,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:39,069 INFO L93 Difference]: Finished difference Result 8076 states and 10632 transitions. [2019-10-14 23:13:39,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:39,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-14 23:13:39,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:39,091 INFO L225 Difference]: With dead ends: 8076 [2019-10-14 23:13:39,091 INFO L226 Difference]: Without dead ends: 8074 [2019-10-14 23:13:39,096 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-14 23:13:39,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2019-10-14 23:13:39,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 7304. [2019-10-14 23:13:39,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2019-10-14 23:13:39,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 9222 transitions. [2019-10-14 23:13:39,509 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 9222 transitions. Word has length 27 [2019-10-14 23:13:39,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:39,510 INFO L462 AbstractCegarLoop]: Abstraction has 7304 states and 9222 transitions. [2019-10-14 23:13:39,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:39,510 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 9222 transitions. [2019-10-14 23:13:39,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-14 23:13:39,524 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:39,524 INFO L380 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-10-14 23:13:39,524 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:39,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:39,525 INFO L82 PathProgramCache]: Analyzing trace with hash 715001129, now seen corresponding path program 1 times [2019-10-14 23:13:39,525 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:39,525 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613563224] [2019-10-14 23:13:39,526 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:39,526 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:39,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:39,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:39,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:39,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:39,551 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613563224] [2019-10-14 23:13:39,551 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:39,552 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:39,552 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740139532] [2019-10-14 23:13:39,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:39,553 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:39,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:39,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:39,554 INFO L87 Difference]: Start difference. First operand 7304 states and 9222 transitions. Second operand 3 states. [2019-10-14 23:13:39,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:39,813 INFO L93 Difference]: Finished difference Result 12172 states and 15496 transitions. [2019-10-14 23:13:39,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:39,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-14 23:13:39,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:39,842 INFO L225 Difference]: With dead ends: 12172 [2019-10-14 23:13:39,843 INFO L226 Difference]: Without dead ends: 12170 [2019-10-14 23:13:39,847 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-14 23:13:39,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12170 states. [2019-10-14 23:13:40,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12170 to 11144. [2019-10-14 23:13:40,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11144 states. [2019-10-14 23:13:40,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11144 states to 11144 states and 13702 transitions. [2019-10-14 23:13:40,208 INFO L78 Accepts]: Start accepts. Automaton has 11144 states and 13702 transitions. Word has length 28 [2019-10-14 23:13:40,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:40,208 INFO L462 AbstractCegarLoop]: Abstraction has 11144 states and 13702 transitions. [2019-10-14 23:13:40,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:40,208 INFO L276 IsEmpty]: Start isEmpty. Operand 11144 states and 13702 transitions. [2019-10-14 23:13:40,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-14 23:13:40,225 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:40,225 INFO L380 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-10-14 23:13:40,225 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:40,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:40,226 INFO L82 PathProgramCache]: Analyzing trace with hash 128195115, now seen corresponding path program 1 times [2019-10-14 23:13:40,226 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:40,226 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893197116] [2019-10-14 23:13:40,226 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:40,227 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:40,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:40,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:40,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:40,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:40,247 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893197116] [2019-10-14 23:13:40,247 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:40,247 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:40,247 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066617381] [2019-10-14 23:13:40,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:40,248 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:40,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:40,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:40,248 INFO L87 Difference]: Start difference. First operand 11144 states and 13702 transitions. Second operand 3 states. [2019-10-14 23:13:40,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:40,475 INFO L93 Difference]: Finished difference Result 25228 states and 30856 transitions. [2019-10-14 23:13:40,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:40,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-14 23:13:40,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:40,506 INFO L225 Difference]: With dead ends: 25228 [2019-10-14 23:13:40,506 INFO L226 Difference]: Without dead ends: 14218 [2019-10-14 23:13:40,528 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-14 23:13:40,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14218 states. [2019-10-14 23:13:41,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14218 to 14216. [2019-10-14 23:13:41,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14216 states. [2019-10-14 23:13:41,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14216 states to 14216 states and 16902 transitions. [2019-10-14 23:13:41,038 INFO L78 Accepts]: Start accepts. Automaton has 14216 states and 16902 transitions. Word has length 28 [2019-10-14 23:13:41,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:41,039 INFO L462 AbstractCegarLoop]: Abstraction has 14216 states and 16902 transitions. [2019-10-14 23:13:41,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:41,039 INFO L276 IsEmpty]: Start isEmpty. Operand 14216 states and 16902 transitions. [2019-10-14 23:13:41,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-14 23:13:41,057 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:41,057 INFO L380 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-10-14 23:13:41,057 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:41,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:41,057 INFO L82 PathProgramCache]: Analyzing trace with hash 690414627, now seen corresponding path program 1 times [2019-10-14 23:13:41,058 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:41,058 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180968601] [2019-10-14 23:13:41,058 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:41,058 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:41,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:41,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:41,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:41,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:41,078 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180968601] [2019-10-14 23:13:41,078 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:41,079 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:41,079 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098010187] [2019-10-14 23:13:41,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:41,079 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:41,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:41,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:41,080 INFO L87 Difference]: Start difference. First operand 14216 states and 16902 transitions. Second operand 3 states. [2019-10-14 23:13:41,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:41,263 INFO L93 Difference]: Finished difference Result 21516 states and 25608 transitions. [2019-10-14 23:13:41,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:41,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-14 23:13:41,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:41,290 INFO L225 Difference]: With dead ends: 21516 [2019-10-14 23:13:41,290 INFO L226 Difference]: Without dead ends: 14602 [2019-10-14 23:13:41,306 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-14 23:13:41,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14602 states. [2019-10-14 23:13:42,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14602 to 14600. [2019-10-14 23:13:42,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14600 states. [2019-10-14 23:13:42,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14600 states to 14600 states and 17158 transitions. [2019-10-14 23:13:42,436 INFO L78 Accepts]: Start accepts. Automaton has 14600 states and 17158 transitions. Word has length 29 [2019-10-14 23:13:42,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:42,437 INFO L462 AbstractCegarLoop]: Abstraction has 14600 states and 17158 transitions. [2019-10-14 23:13:42,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:42,437 INFO L276 IsEmpty]: Start isEmpty. Operand 14600 states and 17158 transitions. [2019-10-14 23:13:42,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-14 23:13:42,464 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:42,464 INFO L380 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-10-14 23:13:42,465 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:42,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:42,467 INFO L82 PathProgramCache]: Analyzing trace with hash -320702623, now seen corresponding path program 1 times [2019-10-14 23:13:42,467 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:42,467 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886127017] [2019-10-14 23:13:42,468 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:42,468 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:42,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:42,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:42,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:42,501 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886127017] [2019-10-14 23:13:42,502 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:42,502 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:42,502 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475349381] [2019-10-14 23:13:42,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:42,503 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:42,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:42,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:42,504 INFO L87 Difference]: Start difference. First operand 14600 states and 17158 transitions. Second operand 3 states. [2019-10-14 23:13:42,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:42,860 INFO L93 Difference]: Finished difference Result 23562 states and 27399 transitions. [2019-10-14 23:13:42,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:42,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-14 23:13:42,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:42,901 INFO L225 Difference]: With dead ends: 23562 [2019-10-14 23:13:42,901 INFO L226 Difference]: Without dead ends: 23560 [2019-10-14 23:13:42,909 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-14 23:13:42,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23560 states. [2019-10-14 23:13:43,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23560 to 22536. [2019-10-14 23:13:43,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22536 states. [2019-10-14 23:13:43,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22536 states to 22536 states and 25862 transitions. [2019-10-14 23:13:43,428 INFO L78 Accepts]: Start accepts. Automaton has 22536 states and 25862 transitions. Word has length 29 [2019-10-14 23:13:43,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:43,428 INFO L462 AbstractCegarLoop]: Abstraction has 22536 states and 25862 transitions. [2019-10-14 23:13:43,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:43,428 INFO L276 IsEmpty]: Start isEmpty. Operand 22536 states and 25862 transitions. [2019-10-14 23:13:43,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-14 23:13:43,461 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:43,461 INFO L380 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-10-14 23:13:43,461 INFO L410 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:43,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:43,462 INFO L82 PathProgramCache]: Analyzing trace with hash -907508637, now seen corresponding path program 1 times [2019-10-14 23:13:43,462 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:43,462 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746541970] [2019-10-14 23:13:43,462 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:43,462 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:43,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:43,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:43,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:43,479 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746541970] [2019-10-14 23:13:43,479 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:43,480 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:43,480 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173519174] [2019-10-14 23:13:43,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:43,480 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:43,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:43,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:43,481 INFO L87 Difference]: Start difference. First operand 22536 states and 25862 transitions. Second operand 3 states. [2019-10-14 23:13:43,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:43,861 INFO L93 Difference]: Finished difference Result 50184 states and 56582 transitions. [2019-10-14 23:13:43,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:43,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-14 23:13:43,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:43,862 INFO L225 Difference]: With dead ends: 50184 [2019-10-14 23:13:43,862 INFO L226 Difference]: Without dead ends: 0 [2019-10-14 23:13:43,933 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-14 23:13:43,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-14 23:13:43,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-14 23:13:43,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-14 23:13:43,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-14 23:13:43,934 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2019-10-14 23:13:43,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:43,934 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-14 23:13:43,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:43,934 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-14 23:13:43,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-14 23:13:43,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-14 23:13:43,965 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-14 23:13:43,965 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:13:43,965 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:13:43,965 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-14 23:13:43,965 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-14 23:13:43,965 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-14 23:13:43,966 INFO L446 ceAbstractionStarter]: At program point L159(lines 5 163) the Hoare annotation is: true [2019-10-14 23:13:43,966 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 163) no Hoare annotation was computed. [2019-10-14 23:13:43,966 INFO L443 ceAbstractionStarter]: For program point L118-1(lines 39 158) no Hoare annotation was computed. [2019-10-14 23:13:43,966 INFO L443 ceAbstractionStarter]: For program point L143-1(lines 39 158) no Hoare annotation was computed. [2019-10-14 23:13:43,966 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 39 158) no Hoare annotation was computed. [2019-10-14 23:13:43,966 INFO L443 ceAbstractionStarter]: For program point L94-1(lines 39 158) no Hoare annotation was computed. [2019-10-14 23:13:43,966 INFO L443 ceAbstractionStarter]: For program point L119(line 119) no Hoare annotation was computed. [2019-10-14 23:13:43,967 INFO L443 ceAbstractionStarter]: For program point L86-1(lines 39 158) no Hoare annotation was computed. [2019-10-14 23:13:43,967 INFO L443 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-10-14 23:13:43,967 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 39 158) no Hoare annotation was computed. [2019-10-14 23:13:43,967 INFO L443 ceAbstractionStarter]: For program point L70-1(lines 39 158) no Hoare annotation was computed. [2019-10-14 23:13:43,967 INFO L443 ceAbstractionStarter]: For program point L128-1(lines 39 158) no Hoare annotation was computed. [2019-10-14 23:13:43,967 INFO L446 ceAbstractionStarter]: At program point L153-1(lines 39 158) the Hoare annotation is: true [2019-10-14 23:13:43,967 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 163) no Hoare annotation was computed. [2019-10-14 23:13:43,967 INFO L443 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-10-14 23:13:43,968 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 163) the Hoare annotation is: true [2019-10-14 23:13:43,968 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-10-14 23:13:43,968 INFO L439 ceAbstractionStarter]: At program point L154-1(lines 5 163) the Hoare annotation is: false [2019-10-14 23:13:43,968 INFO L443 ceAbstractionStarter]: For program point L113-1(lines 39 158) no Hoare annotation was computed. [2019-10-14 23:13:43,968 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 39 158) no Hoare annotation was computed. [2019-10-14 23:13:43,968 INFO L443 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-10-14 23:13:43,968 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-10-14 23:13:43,968 INFO L443 ceAbstractionStarter]: For program point L98-1(lines 39 158) no Hoare annotation was computed. [2019-10-14 23:13:43,969 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 39 158) no Hoare annotation was computed. [2019-10-14 23:13:43,969 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 39 158) no Hoare annotation was computed. [2019-10-14 23:13:43,969 INFO L443 ceAbstractionStarter]: For program point L148-1(lines 39 158) no Hoare annotation was computed. [2019-10-14 23:13:43,969 INFO L443 ceAbstractionStarter]: For program point L82-1(lines 39 158) no Hoare annotation was computed. [2019-10-14 23:13:43,969 INFO L443 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2019-10-14 23:13:43,969 INFO L443 ceAbstractionStarter]: For program point L74-1(lines 39 158) no Hoare annotation was computed. [2019-10-14 23:13:43,969 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 161) no Hoare annotation was computed. [2019-10-14 23:13:43,969 INFO L443 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2019-10-14 23:13:43,970 INFO L443 ceAbstractionStarter]: For program point L66-2(lines 39 158) no Hoare annotation was computed. [2019-10-14 23:13:43,970 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-10-14 23:13:43,970 INFO L443 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2019-10-14 23:13:43,970 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 39 158) no Hoare annotation was computed. [2019-10-14 23:13:43,970 INFO L443 ceAbstractionStarter]: For program point L133-1(lines 39 158) no Hoare annotation was computed. [2019-10-14 23:13:43,970 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-10-14 23:13:43,970 INFO L443 ceAbstractionStarter]: For program point L134(line 134) no Hoare annotation was computed. [2019-10-14 23:13:43,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:13:43 BoogieIcfgContainer [2019-10-14 23:13:43,979 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-14 23:13:43,981 INFO L168 Benchmark]: Toolchain (without parser) took 9966.58 ms. Allocated memory was 137.4 MB in the beginning and 542.1 MB in the end (delta: 404.8 MB). Free memory was 102.6 MB in the beginning and 130.7 MB in the end (delta: -28.1 MB). Peak memory consumption was 376.6 MB. Max. memory is 7.1 GB. [2019-10-14 23:13:43,982 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 137.4 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-14 23:13:43,983 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.75 ms. Allocated memory is still 137.4 MB. Free memory was 102.4 MB in the beginning and 91.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2019-10-14 23:13:43,983 INFO L168 Benchmark]: Boogie Preprocessor took 118.13 ms. Allocated memory was 137.4 MB in the beginning and 200.3 MB in the end (delta: 62.9 MB). Free memory was 91.8 MB in the beginning and 178.0 MB in the end (delta: -86.2 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2019-10-14 23:13:43,984 INFO L168 Benchmark]: RCFGBuilder took 399.32 ms. Allocated memory is still 200.3 MB. Free memory was 178.0 MB in the beginning and 158.7 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 7.1 GB. [2019-10-14 23:13:43,985 INFO L168 Benchmark]: TraceAbstraction took 9148.55 ms. Allocated memory was 200.3 MB in the beginning and 542.1 MB in the end (delta: 341.8 MB). Free memory was 158.7 MB in the beginning and 130.7 MB in the end (delta: 27.9 MB). Peak memory consumption was 369.8 MB. Max. memory is 7.1 GB. [2019-10-14 23:13:43,987 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.52 ms. Allocated memory is still 137.4 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 295.75 ms. Allocated memory is still 137.4 MB. Free memory was 102.4 MB in the beginning and 91.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 118.13 ms. Allocated memory was 137.4 MB in the beginning and 200.3 MB in the end (delta: 62.9 MB). Free memory was 91.8 MB in the beginning and 178.0 MB in the end (delta: -86.2 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 399.32 ms. Allocated memory is still 200.3 MB. Free memory was 178.0 MB in the beginning and 158.7 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9148.55 ms. Allocated memory was 200.3 MB in the beginning and 542.1 MB in the end (delta: 341.8 MB). Free memory was 158.7 MB in the beginning and 130.7 MB in the end (delta: 27.9 MB). Peak memory consumption was 369.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 161]: 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: 39]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 44 locations, 1 error locations. Result: SAFE, OverallTime: 9.0s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2384 SDtfs, 1153 SDslu, 1624 SDs, 0 SdLazy, 149 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22536occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.1s AutomataMinimizationTime, 28 MinimizatonAttempts, 4124 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 1034 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 687 NumberOfCodeBlocks, 687 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 659 ConstructedInterpolants, 0 QuantifiedInterpolants, 31265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...