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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/locks/test_locks_13.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 17:04:34,862 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 17:04:34,864 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 17:04:34,876 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 17:04:34,876 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 17:04:34,877 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 17:04:34,879 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 17:04:34,880 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 17:04:34,882 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 17:04:34,883 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 17:04:34,884 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 17:04:34,885 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 17:04:34,885 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 17:04:34,886 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 17:04:34,887 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 17:04:34,888 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 17:04:34,889 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 17:04:34,890 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 17:04:34,891 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 17:04:34,893 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 17:04:34,895 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 17:04:34,896 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 17:04:34,897 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 17:04:34,897 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 17:04:34,899 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 17:04:34,900 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 17:04:34,900 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 17:04:34,901 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 17:04:34,901 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 17:04:34,902 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 17:04:34,902 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 17:04:34,903 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 17:04:34,904 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 17:04:34,905 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 17:04:34,906 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 17:04:34,906 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 17:04:34,906 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 17:04:34,907 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 17:04:34,907 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 17:04:34,908 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 17:04:34,908 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 17:04:34,909 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-16 17:04:34,923 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 17:04:34,923 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 17:04:34,924 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-16 17:04:34,924 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-16 17:04:34,924 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-16 17:04:34,925 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-16 17:04:34,925 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-16 17:04:34,925 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-16 17:04:34,925 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-16 17:04:34,925 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-16 17:04:34,926 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 17:04:34,926 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 17:04:34,927 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 17:04:34,927 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 17:04:34,927 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 17:04:34,927 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 17:04:34,927 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 17:04:34,928 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 17:04:34,928 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 17:04:34,928 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 17:04:34,928 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 17:04:34,928 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-16 17:04:34,929 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 17:04:34,929 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:04:34,929 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 17:04:34,929 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 17:04:34,929 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-16 17:04:34,930 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 17:04:34,930 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 17:04:34,930 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-16 17:04:34,957 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 17:04:34,969 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 17:04:34,972 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 17:04:34,974 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 17:04:34,974 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 17:04:34,975 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_13.c [2019-09-16 17:04:35,037 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d8f5384c/8ecb6602ff9d44c6a257423dac74a732/FLAGfc3efd45f [2019-09-16 17:04:35,493 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 17:04:35,494 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_13.c [2019-09-16 17:04:35,506 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d8f5384c/8ecb6602ff9d44c6a257423dac74a732/FLAGfc3efd45f [2019-09-16 17:04:35,867 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d8f5384c/8ecb6602ff9d44c6a257423dac74a732 [2019-09-16 17:04:35,876 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 17:04:35,877 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 17:04:35,878 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 17:04:35,878 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 17:04:35,883 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 17:04:35,885 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:04:35" (1/1) ... [2019-09-16 17:04:35,888 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c806856 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:35, skipping insertion in model container [2019-09-16 17:04:35,888 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:04:35" (1/1) ... [2019-09-16 17:04:35,895 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 17:04:35,919 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 17:04:36,103 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:04:36,108 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 17:04:36,161 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:04:36,272 INFO L192 MainTranslator]: Completed translation [2019-09-16 17:04:36,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:36 WrapperNode [2019-09-16 17:04:36,273 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 17:04:36,274 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 17:04:36,274 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 17:04:36,274 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 17:04:36,289 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:36" (1/1) ... [2019-09-16 17:04:36,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:36" (1/1) ... [2019-09-16 17:04:36,305 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:36" (1/1) ... [2019-09-16 17:04:36,306 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:36" (1/1) ... [2019-09-16 17:04:36,312 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:36" (1/1) ... [2019-09-16 17:04:36,320 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:36" (1/1) ... [2019-09-16 17:04:36,322 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:36" (1/1) ... [2019-09-16 17:04:36,325 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 17:04:36,325 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 17:04:36,325 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 17:04:36,326 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 17:04:36,327 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:04:36,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 17:04:36,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 17:04:36,389 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 17:04:36,389 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 17:04:36,389 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 17:04:36,390 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 17:04:36,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 17:04:36,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 17:04:36,757 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 17:04:36,757 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-16 17:04:36,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:04:36 BoogieIcfgContainer [2019-09-16 17:04:36,759 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 17:04:36,760 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 17:04:36,760 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 17:04:36,764 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 17:04:36,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 05:04:35" (1/3) ... [2019-09-16 17:04:36,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bc4ea9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:04:36, skipping insertion in model container [2019-09-16 17:04:36,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:36" (2/3) ... [2019-09-16 17:04:36,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bc4ea9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:04:36, skipping insertion in model container [2019-09-16 17:04:36,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:04:36" (3/3) ... [2019-09-16 17:04:36,767 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_13.c [2019-09-16 17:04:36,777 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 17:04:36,792 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 17:04:36,817 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 17:04:36,846 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 17:04:36,846 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-16 17:04:36,847 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 17:04:36,847 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 17:04:36,847 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 17:04:36,847 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 17:04:36,847 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 17:04:36,847 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 17:04:36,866 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2019-09-16 17:04:36,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-16 17:04:36,877 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:36,878 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:36,881 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:36,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:36,887 INFO L82 PathProgramCache]: Analyzing trace with hash 2062980600, now seen corresponding path program 1 times [2019-09-16 17:04:36,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:36,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:36,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:36,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:36,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:36,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:37,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:37,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:37,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:37,083 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:37,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:37,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:37,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,107 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 3 states. [2019-09-16 17:04:37,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:37,176 INFO L93 Difference]: Finished difference Result 98 states and 173 transitions. [2019-09-16 17:04:37,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:37,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-16 17:04:37,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:37,192 INFO L225 Difference]: With dead ends: 98 [2019-09-16 17:04:37,192 INFO L226 Difference]: Without dead ends: 90 [2019-09-16 17:04:37,195 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-16 17:04:37,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 62. [2019-09-16 17:04:37,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-16 17:04:37,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 113 transitions. [2019-09-16 17:04:37,240 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 113 transitions. Word has length 23 [2019-09-16 17:04:37,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:37,241 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 113 transitions. [2019-09-16 17:04:37,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:37,242 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 113 transitions. [2019-09-16 17:04:37,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-16 17:04:37,243 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:37,243 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:37,244 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:37,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:37,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1041912246, now seen corresponding path program 1 times [2019-09-16 17:04:37,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:37,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:37,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:37,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:37,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:37,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:37,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:37,330 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:37,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:37,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:37,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,333 INFO L87 Difference]: Start difference. First operand 62 states and 113 transitions. Second operand 3 states. [2019-09-16 17:04:37,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:37,371 INFO L93 Difference]: Finished difference Result 90 states and 162 transitions. [2019-09-16 17:04:37,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:37,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-16 17:04:37,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:37,374 INFO L225 Difference]: With dead ends: 90 [2019-09-16 17:04:37,374 INFO L226 Difference]: Without dead ends: 90 [2019-09-16 17:04:37,375 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-16 17:04:37,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2019-09-16 17:04:37,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-16 17:04:37,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 161 transitions. [2019-09-16 17:04:37,393 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 161 transitions. Word has length 23 [2019-09-16 17:04:37,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:37,394 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 161 transitions. [2019-09-16 17:04:37,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:37,394 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 161 transitions. [2019-09-16 17:04:37,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-16 17:04:37,398 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:37,398 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:37,399 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:37,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:37,400 INFO L82 PathProgramCache]: Analyzing trace with hash -471898432, now seen corresponding path program 1 times [2019-09-16 17:04:37,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:37,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:37,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,405 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:37,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:37,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:37,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:37,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:37,473 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:37,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:37,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:37,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,474 INFO L87 Difference]: Start difference. First operand 88 states and 161 transitions. Second operand 3 states. [2019-09-16 17:04:37,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:37,509 INFO L93 Difference]: Finished difference Result 93 states and 164 transitions. [2019-09-16 17:04:37,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:37,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-16 17:04:37,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:37,512 INFO L225 Difference]: With dead ends: 93 [2019-09-16 17:04:37,512 INFO L226 Difference]: Without dead ends: 93 [2019-09-16 17:04:37,513 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-09-16 17:04:37,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2019-09-16 17:04:37,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-16 17:04:37,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 163 transitions. [2019-09-16 17:04:37,529 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 163 transitions. Word has length 24 [2019-09-16 17:04:37,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:37,529 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 163 transitions. [2019-09-16 17:04:37,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:37,530 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 163 transitions. [2019-09-16 17:04:37,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-16 17:04:37,531 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:37,531 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:37,531 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:37,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:37,532 INFO L82 PathProgramCache]: Analyzing trace with hash -2060246334, now seen corresponding path program 1 times [2019-09-16 17:04:37,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:37,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:37,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,534 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:37,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:37,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:37,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:37,610 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:37,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:37,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:37,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,613 INFO L87 Difference]: Start difference. First operand 91 states and 163 transitions. Second operand 3 states. [2019-09-16 17:04:37,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:37,649 INFO L93 Difference]: Finished difference Result 170 states and 309 transitions. [2019-09-16 17:04:37,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:37,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-16 17:04:37,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:37,652 INFO L225 Difference]: With dead ends: 170 [2019-09-16 17:04:37,652 INFO L226 Difference]: Without dead ends: 170 [2019-09-16 17:04:37,653 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-09-16 17:04:37,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 120. [2019-09-16 17:04:37,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-16 17:04:37,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 216 transitions. [2019-09-16 17:04:37,665 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 216 transitions. Word has length 24 [2019-09-16 17:04:37,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:37,666 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 216 transitions. [2019-09-16 17:04:37,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:37,666 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 216 transitions. [2019-09-16 17:04:37,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-16 17:04:37,668 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:37,668 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:37,668 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:37,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:37,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1213652608, now seen corresponding path program 1 times [2019-09-16 17:04:37,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:37,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:37,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,671 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:37,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:37,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:37,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:37,731 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:37,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:37,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:37,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,733 INFO L87 Difference]: Start difference. First operand 120 states and 216 transitions. Second operand 3 states. [2019-09-16 17:04:37,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:37,763 INFO L93 Difference]: Finished difference Result 172 states and 307 transitions. [2019-09-16 17:04:37,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:37,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-16 17:04:37,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:37,765 INFO L225 Difference]: With dead ends: 172 [2019-09-16 17:04:37,766 INFO L226 Difference]: Without dead ends: 172 [2019-09-16 17:04:37,766 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-09-16 17:04:37,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2019-09-16 17:04:37,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-16 17:04:37,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 306 transitions. [2019-09-16 17:04:37,778 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 306 transitions. Word has length 24 [2019-09-16 17:04:37,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:37,778 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 306 transitions. [2019-09-16 17:04:37,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:37,779 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 306 transitions. [2019-09-16 17:04:37,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-16 17:04:37,780 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:37,781 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:37,781 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:37,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:37,781 INFO L82 PathProgramCache]: Analyzing trace with hash 557085835, now seen corresponding path program 1 times [2019-09-16 17:04:37,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:37,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:37,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:37,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:37,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:37,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:37,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:37,855 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:37,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:37,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:37,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,857 INFO L87 Difference]: Start difference. First operand 170 states and 306 transitions. Second operand 3 states. [2019-09-16 17:04:37,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:37,875 INFO L93 Difference]: Finished difference Result 174 states and 307 transitions. [2019-09-16 17:04:37,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:37,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-16 17:04:37,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:37,878 INFO L225 Difference]: With dead ends: 174 [2019-09-16 17:04:37,878 INFO L226 Difference]: Without dead ends: 174 [2019-09-16 17:04:37,878 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-09-16 17:04:37,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2019-09-16 17:04:37,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-16 17:04:37,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 306 transitions. [2019-09-16 17:04:37,888 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 306 transitions. Word has length 25 [2019-09-16 17:04:37,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:37,889 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 306 transitions. [2019-09-16 17:04:37,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:37,889 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 306 transitions. [2019-09-16 17:04:37,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-16 17:04:37,891 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:37,891 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:37,891 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:37,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:37,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1031262067, now seen corresponding path program 1 times [2019-09-16 17:04:37,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:37,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:37,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,894 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:37,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:37,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:37,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:37,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:37,959 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:37,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:37,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:37,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,966 INFO L87 Difference]: Start difference. First operand 172 states and 306 transitions. Second operand 3 states. [2019-09-16 17:04:37,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:37,993 INFO L93 Difference]: Finished difference Result 322 states and 579 transitions. [2019-09-16 17:04:37,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:37,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-16 17:04:37,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:37,997 INFO L225 Difference]: With dead ends: 322 [2019-09-16 17:04:37,997 INFO L226 Difference]: Without dead ends: 322 [2019-09-16 17:04:37,998 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-09-16 17:04:38,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 232. [2019-09-16 17:04:38,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-09-16 17:04:38,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 410 transitions. [2019-09-16 17:04:38,022 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 410 transitions. Word has length 25 [2019-09-16 17:04:38,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:38,022 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 410 transitions. [2019-09-16 17:04:38,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:38,023 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 410 transitions. [2019-09-16 17:04:38,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-16 17:04:38,024 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:38,025 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:38,025 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:38,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:38,026 INFO L82 PathProgramCache]: Analyzing trace with hash -2052330421, now seen corresponding path program 1 times [2019-09-16 17:04:38,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:38,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:38,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,028 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:38,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:38,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:38,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:38,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:38,056 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:38,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:38,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:38,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:38,058 INFO L87 Difference]: Start difference. First operand 232 states and 410 transitions. Second operand 3 states. [2019-09-16 17:04:38,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:38,085 INFO L93 Difference]: Finished difference Result 330 states and 579 transitions. [2019-09-16 17:04:38,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:38,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-16 17:04:38,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:38,089 INFO L225 Difference]: With dead ends: 330 [2019-09-16 17:04:38,089 INFO L226 Difference]: Without dead ends: 330 [2019-09-16 17:04:38,090 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:38,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-09-16 17:04:38,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 328. [2019-09-16 17:04:38,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-09-16 17:04:38,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 578 transitions. [2019-09-16 17:04:38,099 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 578 transitions. Word has length 25 [2019-09-16 17:04:38,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:38,100 INFO L475 AbstractCegarLoop]: Abstraction has 328 states and 578 transitions. [2019-09-16 17:04:38,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:38,100 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 578 transitions. [2019-09-16 17:04:38,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-16 17:04:38,106 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:38,106 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:38,106 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:38,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:38,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1904139915, now seen corresponding path program 1 times [2019-09-16 17:04:38,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:38,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:38,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,109 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:38,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:38,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:38,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:38,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:38,162 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:38,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:38,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:38,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:38,164 INFO L87 Difference]: Start difference. First operand 328 states and 578 transitions. Second operand 3 states. [2019-09-16 17:04:38,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:38,182 INFO L93 Difference]: Finished difference Result 334 states and 579 transitions. [2019-09-16 17:04:38,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:38,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-16 17:04:38,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:38,187 INFO L225 Difference]: With dead ends: 334 [2019-09-16 17:04:38,187 INFO L226 Difference]: Without dead ends: 334 [2019-09-16 17:04:38,188 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:38,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-09-16 17:04:38,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 332. [2019-09-16 17:04:38,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-09-16 17:04:38,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 578 transitions. [2019-09-16 17:04:38,197 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 578 transitions. Word has length 26 [2019-09-16 17:04:38,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:38,197 INFO L475 AbstractCegarLoop]: Abstraction has 332 states and 578 transitions. [2019-09-16 17:04:38,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:38,198 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 578 transitions. [2019-09-16 17:04:38,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-16 17:04:38,199 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:38,199 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:38,199 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:38,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:38,200 INFO L82 PathProgramCache]: Analyzing trace with hash 802479479, now seen corresponding path program 1 times [2019-09-16 17:04:38,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:38,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:38,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:38,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:38,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:38,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:38,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:38,231 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:38,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:38,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:38,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:38,232 INFO L87 Difference]: Start difference. First operand 332 states and 578 transitions. Second operand 3 states. [2019-09-16 17:04:38,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:38,250 INFO L93 Difference]: Finished difference Result 618 states and 1087 transitions. [2019-09-16 17:04:38,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:38,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-16 17:04:38,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:38,254 INFO L225 Difference]: With dead ends: 618 [2019-09-16 17:04:38,254 INFO L226 Difference]: Without dead ends: 618 [2019-09-16 17:04:38,255 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:38,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-09-16 17:04:38,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 456. [2019-09-16 17:04:38,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-09-16 17:04:38,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 782 transitions. [2019-09-16 17:04:38,271 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 782 transitions. Word has length 26 [2019-09-16 17:04:38,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:38,274 INFO L475 AbstractCegarLoop]: Abstraction has 456 states and 782 transitions. [2019-09-16 17:04:38,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:38,275 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 782 transitions. [2019-09-16 17:04:38,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-16 17:04:38,278 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:38,278 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:38,279 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:38,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:38,279 INFO L82 PathProgramCache]: Analyzing trace with hash -218588875, now seen corresponding path program 1 times [2019-09-16 17:04:38,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:38,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:38,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:38,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:38,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:38,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:38,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:38,306 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:38,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:38,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:38,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:38,307 INFO L87 Difference]: Start difference. First operand 456 states and 782 transitions. Second operand 3 states. [2019-09-16 17:04:38,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:38,326 INFO L93 Difference]: Finished difference Result 642 states and 1095 transitions. [2019-09-16 17:04:38,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:38,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-16 17:04:38,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:38,330 INFO L225 Difference]: With dead ends: 642 [2019-09-16 17:04:38,331 INFO L226 Difference]: Without dead ends: 642 [2019-09-16 17:04:38,331 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:38,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-09-16 17:04:38,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 640. [2019-09-16 17:04:38,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-09-16 17:04:38,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1094 transitions. [2019-09-16 17:04:38,348 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 1094 transitions. Word has length 26 [2019-09-16 17:04:38,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:38,348 INFO L475 AbstractCegarLoop]: Abstraction has 640 states and 1094 transitions. [2019-09-16 17:04:38,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:38,349 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1094 transitions. [2019-09-16 17:04:38,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-16 17:04:38,350 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:38,350 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:38,350 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:38,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:38,351 INFO L82 PathProgramCache]: Analyzing trace with hash -892726496, now seen corresponding path program 1 times [2019-09-16 17:04:38,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:38,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:38,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,352 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:38,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:38,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:38,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:38,373 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:38,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:38,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:38,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:38,375 INFO L87 Difference]: Start difference. First operand 640 states and 1094 transitions. Second operand 3 states. [2019-09-16 17:04:38,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:38,393 INFO L93 Difference]: Finished difference Result 650 states and 1095 transitions. [2019-09-16 17:04:38,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:38,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-16 17:04:38,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:38,398 INFO L225 Difference]: With dead ends: 650 [2019-09-16 17:04:38,398 INFO L226 Difference]: Without dead ends: 650 [2019-09-16 17:04:38,399 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:38,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-09-16 17:04:38,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 648. [2019-09-16 17:04:38,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-09-16 17:04:38,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1094 transitions. [2019-09-16 17:04:38,417 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1094 transitions. Word has length 27 [2019-09-16 17:04:38,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:38,418 INFO L475 AbstractCegarLoop]: Abstraction has 648 states and 1094 transitions. [2019-09-16 17:04:38,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:38,418 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1094 transitions. [2019-09-16 17:04:38,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-16 17:04:38,419 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:38,420 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:38,420 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:38,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:38,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1813892898, now seen corresponding path program 1 times [2019-09-16 17:04:38,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:38,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:38,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:38,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:38,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:38,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:38,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:38,445 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:38,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:38,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:38,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:38,446 INFO L87 Difference]: Start difference. First operand 648 states and 1094 transitions. Second operand 3 states. [2019-09-16 17:04:38,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:38,465 INFO L93 Difference]: Finished difference Result 1194 states and 2039 transitions. [2019-09-16 17:04:38,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:38,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-16 17:04:38,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:38,472 INFO L225 Difference]: With dead ends: 1194 [2019-09-16 17:04:38,472 INFO L226 Difference]: Without dead ends: 1194 [2019-09-16 17:04:38,473 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:38,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2019-09-16 17:04:38,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 904. [2019-09-16 17:04:38,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2019-09-16 17:04:38,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1494 transitions. [2019-09-16 17:04:38,497 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1494 transitions. Word has length 27 [2019-09-16 17:04:38,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:38,498 INFO L475 AbstractCegarLoop]: Abstraction has 904 states and 1494 transitions. [2019-09-16 17:04:38,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:38,498 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1494 transitions. [2019-09-16 17:04:38,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-16 17:04:38,500 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:38,500 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:38,500 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:38,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:38,501 INFO L82 PathProgramCache]: Analyzing trace with hash 792824544, now seen corresponding path program 1 times [2019-09-16 17:04:38,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:38,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:38,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,502 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:38,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:38,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:38,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:38,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:38,529 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:38,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:38,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:38,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:38,531 INFO L87 Difference]: Start difference. First operand 904 states and 1494 transitions. Second operand 3 states. [2019-09-16 17:04:38,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:38,557 INFO L93 Difference]: Finished difference Result 1258 states and 2071 transitions. [2019-09-16 17:04:38,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:38,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-16 17:04:38,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:38,565 INFO L225 Difference]: With dead ends: 1258 [2019-09-16 17:04:38,566 INFO L226 Difference]: Without dead ends: 1258 [2019-09-16 17:04:38,566 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:38,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2019-09-16 17:04:38,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1256. [2019-09-16 17:04:38,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2019-09-16 17:04:38,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 2070 transitions. [2019-09-16 17:04:38,600 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 2070 transitions. Word has length 27 [2019-09-16 17:04:38,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:38,601 INFO L475 AbstractCegarLoop]: Abstraction has 1256 states and 2070 transitions. [2019-09-16 17:04:38,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:38,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 2070 transitions. [2019-09-16 17:04:38,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-16 17:04:38,603 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:38,603 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:38,603 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:38,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:38,604 INFO L82 PathProgramCache]: Analyzing trace with hash 396318762, now seen corresponding path program 1 times [2019-09-16 17:04:38,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:38,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:38,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:38,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:38,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:38,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:38,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:38,629 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:38,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:38,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:38,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:38,630 INFO L87 Difference]: Start difference. First operand 1256 states and 2070 transitions. Second operand 3 states. [2019-09-16 17:04:38,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:38,652 INFO L93 Difference]: Finished difference Result 1274 states and 2071 transitions. [2019-09-16 17:04:38,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:38,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-16 17:04:38,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:38,660 INFO L225 Difference]: With dead ends: 1274 [2019-09-16 17:04:38,660 INFO L226 Difference]: Without dead ends: 1274 [2019-09-16 17:04:38,661 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:38,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2019-09-16 17:04:38,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1272. [2019-09-16 17:04:38,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1272 states. [2019-09-16 17:04:38,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 2070 transitions. [2019-09-16 17:04:38,697 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 2070 transitions. Word has length 28 [2019-09-16 17:04:38,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:38,698 INFO L475 AbstractCegarLoop]: Abstraction has 1272 states and 2070 transitions. [2019-09-16 17:04:38,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:38,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 2070 transitions. [2019-09-16 17:04:38,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-16 17:04:38,700 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:38,701 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:38,701 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:38,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:38,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1192029140, now seen corresponding path program 1 times [2019-09-16 17:04:38,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:38,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:38,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,704 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:38,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:38,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:38,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:38,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:38,740 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:38,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:38,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:38,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:38,741 INFO L87 Difference]: Start difference. First operand 1272 states and 2070 transitions. Second operand 3 states. [2019-09-16 17:04:38,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:38,769 INFO L93 Difference]: Finished difference Result 2314 states and 3815 transitions. [2019-09-16 17:04:38,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:38,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-16 17:04:38,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:38,781 INFO L225 Difference]: With dead ends: 2314 [2019-09-16 17:04:38,782 INFO L226 Difference]: Without dead ends: 2314 [2019-09-16 17:04:38,782 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:38,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2019-09-16 17:04:38,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 1800. [2019-09-16 17:04:38,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1800 states. [2019-09-16 17:04:38,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 2854 transitions. [2019-09-16 17:04:38,834 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 2854 transitions. Word has length 28 [2019-09-16 17:04:38,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:38,834 INFO L475 AbstractCegarLoop]: Abstraction has 1800 states and 2854 transitions. [2019-09-16 17:04:38,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:38,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 2854 transitions. [2019-09-16 17:04:38,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-16 17:04:38,838 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:38,838 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:38,838 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:38,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:38,839 INFO L82 PathProgramCache]: Analyzing trace with hash 2081869802, now seen corresponding path program 1 times [2019-09-16 17:04:38,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:38,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:38,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,840 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:38,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:38,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:38,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:38,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:38,859 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:38,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:38,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:38,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:38,860 INFO L87 Difference]: Start difference. First operand 1800 states and 2854 transitions. Second operand 3 states. [2019-09-16 17:04:38,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:38,890 INFO L93 Difference]: Finished difference Result 2474 states and 3911 transitions. [2019-09-16 17:04:38,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:38,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-16 17:04:38,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:38,904 INFO L225 Difference]: With dead ends: 2474 [2019-09-16 17:04:38,904 INFO L226 Difference]: Without dead ends: 2474 [2019-09-16 17:04:38,905 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:38,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2474 states. [2019-09-16 17:04:38,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2474 to 2472. [2019-09-16 17:04:38,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2472 states. [2019-09-16 17:04:38,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 3910 transitions. [2019-09-16 17:04:38,965 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 3910 transitions. Word has length 28 [2019-09-16 17:04:38,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:38,966 INFO L475 AbstractCegarLoop]: Abstraction has 2472 states and 3910 transitions. [2019-09-16 17:04:38,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:38,966 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 3910 transitions. [2019-09-16 17:04:38,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-16 17:04:38,969 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:38,970 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:38,970 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:38,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:38,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1702016437, now seen corresponding path program 1 times [2019-09-16 17:04:38,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:38,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:38,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,972 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:38,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:38,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:38,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:38,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:38,993 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:38,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:38,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:38,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:38,995 INFO L87 Difference]: Start difference. First operand 2472 states and 3910 transitions. Second operand 3 states. [2019-09-16 17:04:39,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:39,038 INFO L93 Difference]: Finished difference Result 2506 states and 3911 transitions. [2019-09-16 17:04:39,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:39,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-16 17:04:39,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:39,056 INFO L225 Difference]: With dead ends: 2506 [2019-09-16 17:04:39,057 INFO L226 Difference]: Without dead ends: 2506 [2019-09-16 17:04:39,058 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:39,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2019-09-16 17:04:39,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2504. [2019-09-16 17:04:39,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2504 states. [2019-09-16 17:04:39,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 3910 transitions. [2019-09-16 17:04:39,139 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 3910 transitions. Word has length 29 [2019-09-16 17:04:39,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:39,139 INFO L475 AbstractCegarLoop]: Abstraction has 2504 states and 3910 transitions. [2019-09-16 17:04:39,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:39,139 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 3910 transitions. [2019-09-16 17:04:39,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-16 17:04:39,143 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:39,143 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:39,143 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:39,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:39,144 INFO L82 PathProgramCache]: Analyzing trace with hash 113668535, now seen corresponding path program 1 times [2019-09-16 17:04:39,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:39,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:39,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:39,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:39,147 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:39,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:39,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:39,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:39,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:39,184 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:39,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:39,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:39,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:39,186 INFO L87 Difference]: Start difference. First operand 2504 states and 3910 transitions. Second operand 3 states. [2019-09-16 17:04:39,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:39,251 INFO L93 Difference]: Finished difference Result 4490 states and 7111 transitions. [2019-09-16 17:04:39,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:39,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-16 17:04:39,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:39,281 INFO L225 Difference]: With dead ends: 4490 [2019-09-16 17:04:39,282 INFO L226 Difference]: Without dead ends: 4490 [2019-09-16 17:04:39,283 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:39,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2019-09-16 17:04:39,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 3592. [2019-09-16 17:04:39,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3592 states. [2019-09-16 17:04:39,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3592 states to 3592 states and 5446 transitions. [2019-09-16 17:04:39,410 INFO L78 Accepts]: Start accepts. Automaton has 3592 states and 5446 transitions. Word has length 29 [2019-09-16 17:04:39,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:39,410 INFO L475 AbstractCegarLoop]: Abstraction has 3592 states and 5446 transitions. [2019-09-16 17:04:39,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:39,410 INFO L276 IsEmpty]: Start isEmpty. Operand 3592 states and 5446 transitions. [2019-09-16 17:04:39,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-16 17:04:39,416 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:39,416 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:39,416 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:39,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:39,417 INFO L82 PathProgramCache]: Analyzing trace with hash -907399819, now seen corresponding path program 1 times [2019-09-16 17:04:39,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:39,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:39,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:39,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:39,419 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:39,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:39,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:39,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:39,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:39,446 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:39,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:39,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:39,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:39,447 INFO L87 Difference]: Start difference. First operand 3592 states and 5446 transitions. Second operand 3 states. [2019-09-16 17:04:39,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:39,495 INFO L93 Difference]: Finished difference Result 4874 states and 7367 transitions. [2019-09-16 17:04:39,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:39,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-16 17:04:39,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:39,526 INFO L225 Difference]: With dead ends: 4874 [2019-09-16 17:04:39,526 INFO L226 Difference]: Without dead ends: 4874 [2019-09-16 17:04:39,527 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:39,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4874 states. [2019-09-16 17:04:39,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4874 to 4872. [2019-09-16 17:04:39,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4872 states. [2019-09-16 17:04:39,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4872 states to 4872 states and 7366 transitions. [2019-09-16 17:04:39,674 INFO L78 Accepts]: Start accepts. Automaton has 4872 states and 7366 transitions. Word has length 29 [2019-09-16 17:04:39,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:39,674 INFO L475 AbstractCegarLoop]: Abstraction has 4872 states and 7366 transitions. [2019-09-16 17:04:39,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:39,674 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states and 7366 transitions. [2019-09-16 17:04:39,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-16 17:04:39,681 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:39,681 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:39,682 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:39,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:39,682 INFO L82 PathProgramCache]: Analyzing trace with hash -771028257, now seen corresponding path program 1 times [2019-09-16 17:04:39,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:39,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:39,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:39,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:39,684 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:39,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:39,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:39,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:39,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:39,711 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:39,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:39,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:39,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:39,712 INFO L87 Difference]: Start difference. First operand 4872 states and 7366 transitions. Second operand 3 states. [2019-09-16 17:04:39,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:39,754 INFO L93 Difference]: Finished difference Result 4938 states and 7367 transitions. [2019-09-16 17:04:39,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:39,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-16 17:04:39,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:39,781 INFO L225 Difference]: With dead ends: 4938 [2019-09-16 17:04:39,781 INFO L226 Difference]: Without dead ends: 4938 [2019-09-16 17:04:39,782 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:39,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4938 states. [2019-09-16 17:04:39,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4938 to 4936. [2019-09-16 17:04:39,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4936 states. [2019-09-16 17:04:39,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4936 states to 4936 states and 7366 transitions. [2019-09-16 17:04:39,925 INFO L78 Accepts]: Start accepts. Automaton has 4936 states and 7366 transitions. Word has length 30 [2019-09-16 17:04:39,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:39,926 INFO L475 AbstractCegarLoop]: Abstraction has 4936 states and 7366 transitions. [2019-09-16 17:04:39,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:39,926 INFO L276 IsEmpty]: Start isEmpty. Operand 4936 states and 7366 transitions. [2019-09-16 17:04:39,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-16 17:04:39,933 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:39,933 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:39,934 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:39,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:39,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1935591137, now seen corresponding path program 1 times [2019-09-16 17:04:39,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:39,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:39,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:39,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:39,942 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:39,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:39,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:39,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:39,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:39,968 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:39,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:39,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:39,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:39,971 INFO L87 Difference]: Start difference. First operand 4936 states and 7366 transitions. Second operand 3 states. [2019-09-16 17:04:40,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:40,028 INFO L93 Difference]: Finished difference Result 9610 states and 13959 transitions. [2019-09-16 17:04:40,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:40,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-16 17:04:40,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:40,054 INFO L225 Difference]: With dead ends: 9610 [2019-09-16 17:04:40,054 INFO L226 Difference]: Without dead ends: 9610 [2019-09-16 17:04:40,055 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:40,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9610 states. [2019-09-16 17:04:40,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9610 to 9608. [2019-09-16 17:04:40,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9608 states. [2019-09-16 17:04:40,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9608 states to 9608 states and 13958 transitions. [2019-09-16 17:04:40,294 INFO L78 Accepts]: Start accepts. Automaton has 9608 states and 13958 transitions. Word has length 30 [2019-09-16 17:04:40,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:40,294 INFO L475 AbstractCegarLoop]: Abstraction has 9608 states and 13958 transitions. [2019-09-16 17:04:40,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:40,294 INFO L276 IsEmpty]: Start isEmpty. Operand 9608 states and 13958 transitions. [2019-09-16 17:04:40,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-16 17:04:40,306 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:40,306 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:40,306 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:40,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:40,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1338307805, now seen corresponding path program 1 times [2019-09-16 17:04:40,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:40,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:40,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:40,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:40,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:40,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:40,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:40,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:40,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:40,337 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:40,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:40,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:40,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:40,338 INFO L87 Difference]: Start difference. First operand 9608 states and 13958 transitions. Second operand 3 states. [2019-09-16 17:04:40,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:40,391 INFO L93 Difference]: Finished difference Result 11146 states and 16647 transitions. [2019-09-16 17:04:40,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:40,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-16 17:04:40,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:40,418 INFO L225 Difference]: With dead ends: 11146 [2019-09-16 17:04:40,419 INFO L226 Difference]: Without dead ends: 11146 [2019-09-16 17:04:40,420 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:40,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11146 states. [2019-09-16 17:04:40,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11146 to 9608. [2019-09-16 17:04:40,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9608 states. [2019-09-16 17:04:40,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9608 states to 9608 states and 13830 transitions. [2019-09-16 17:04:40,615 INFO L78 Accepts]: Start accepts. Automaton has 9608 states and 13830 transitions. Word has length 30 [2019-09-16 17:04:40,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:40,615 INFO L475 AbstractCegarLoop]: Abstraction has 9608 states and 13830 transitions. [2019-09-16 17:04:40,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:40,615 INFO L276 IsEmpty]: Start isEmpty. Operand 9608 states and 13830 transitions. [2019-09-16 17:04:40,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-16 17:04:40,627 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:40,628 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:40,628 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:40,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:40,629 INFO L82 PathProgramCache]: Analyzing trace with hash -126002102, now seen corresponding path program 1 times [2019-09-16 17:04:40,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:40,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:40,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:40,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:40,632 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:40,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:40,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:40,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:40,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:40,657 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:40,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:40,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:40,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:40,658 INFO L87 Difference]: Start difference. First operand 9608 states and 13830 transitions. Second operand 3 states. [2019-09-16 17:04:40,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:40,736 INFO L93 Difference]: Finished difference Result 16778 states and 24455 transitions. [2019-09-16 17:04:40,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:40,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-16 17:04:40,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:40,784 INFO L225 Difference]: With dead ends: 16778 [2019-09-16 17:04:40,785 INFO L226 Difference]: Without dead ends: 16778 [2019-09-16 17:04:40,791 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:40,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16778 states. [2019-09-16 17:04:41,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16778 to 14216. [2019-09-16 17:04:41,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14216 states. [2019-09-16 17:04:41,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14216 states to 14216 states and 19846 transitions. [2019-09-16 17:04:41,242 INFO L78 Accepts]: Start accepts. Automaton has 14216 states and 19846 transitions. Word has length 31 [2019-09-16 17:04:41,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:41,242 INFO L475 AbstractCegarLoop]: Abstraction has 14216 states and 19846 transitions. [2019-09-16 17:04:41,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:41,242 INFO L276 IsEmpty]: Start isEmpty. Operand 14216 states and 19846 transitions. [2019-09-16 17:04:41,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-16 17:04:41,267 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:41,268 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:41,268 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:41,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:41,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1147070456, now seen corresponding path program 1 times [2019-09-16 17:04:41,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:41,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:41,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:41,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:41,271 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:41,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:41,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:41,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:41,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:41,296 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:41,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:41,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:41,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:41,297 INFO L87 Difference]: Start difference. First operand 14216 states and 19846 transitions. Second operand 3 states. [2019-09-16 17:04:41,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:41,379 INFO L93 Difference]: Finished difference Result 18826 states and 26119 transitions. [2019-09-16 17:04:41,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:41,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-16 17:04:41,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:41,425 INFO L225 Difference]: With dead ends: 18826 [2019-09-16 17:04:41,426 INFO L226 Difference]: Without dead ends: 18826 [2019-09-16 17:04:41,426 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:41,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18826 states. [2019-09-16 17:04:41,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18826 to 18824. [2019-09-16 17:04:41,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18824 states. [2019-09-16 17:04:41,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18824 states to 18824 states and 26118 transitions. [2019-09-16 17:04:41,744 INFO L78 Accepts]: Start accepts. Automaton has 18824 states and 26118 transitions. Word has length 31 [2019-09-16 17:04:41,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:41,745 INFO L475 AbstractCegarLoop]: Abstraction has 18824 states and 26118 transitions. [2019-09-16 17:04:41,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:41,745 INFO L276 IsEmpty]: Start isEmpty. Operand 18824 states and 26118 transitions. [2019-09-16 17:04:42,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-16 17:04:42,265 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:42,265 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:42,266 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:42,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:42,266 INFO L82 PathProgramCache]: Analyzing trace with hash 389117270, now seen corresponding path program 1 times [2019-09-16 17:04:42,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:42,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:42,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:42,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:42,268 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:42,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:42,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:42,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:42,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:42,287 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:42,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:42,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:42,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:42,288 INFO L87 Difference]: Start difference. First operand 18824 states and 26118 transitions. Second operand 3 states. [2019-09-16 17:04:42,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:42,359 INFO L93 Difference]: Finished difference Result 19210 states and 26375 transitions. [2019-09-16 17:04:42,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:42,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-09-16 17:04:42,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:42,395 INFO L225 Difference]: With dead ends: 19210 [2019-09-16 17:04:42,395 INFO L226 Difference]: Without dead ends: 19210 [2019-09-16 17:04:42,396 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:42,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19210 states. [2019-09-16 17:04:42,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19210 to 19208. [2019-09-16 17:04:42,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19208 states. [2019-09-16 17:04:42,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19208 states to 19208 states and 26374 transitions. [2019-09-16 17:04:42,644 INFO L78 Accepts]: Start accepts. Automaton has 19208 states and 26374 transitions. Word has length 32 [2019-09-16 17:04:42,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:42,645 INFO L475 AbstractCegarLoop]: Abstraction has 19208 states and 26374 transitions. [2019-09-16 17:04:42,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:42,645 INFO L276 IsEmpty]: Start isEmpty. Operand 19208 states and 26374 transitions. [2019-09-16 17:04:42,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-16 17:04:42,666 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:42,667 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:42,667 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:42,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:42,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1199230632, now seen corresponding path program 1 times [2019-09-16 17:04:42,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:42,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:42,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:42,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:42,672 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:42,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:42,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:42,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:42,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:42,699 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:42,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:42,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:42,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:42,700 INFO L87 Difference]: Start difference. First operand 19208 states and 26374 transitions. Second operand 3 states. [2019-09-16 17:04:42,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:42,811 INFO L93 Difference]: Finished difference Result 32778 states and 45319 transitions. [2019-09-16 17:04:42,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:42,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-09-16 17:04:42,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:42,880 INFO L225 Difference]: With dead ends: 32778 [2019-09-16 17:04:42,881 INFO L226 Difference]: Without dead ends: 32778 [2019-09-16 17:04:42,881 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:42,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32778 states. [2019-09-16 17:04:43,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32778 to 28680. [2019-09-16 17:04:43,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28680 states. [2019-09-16 17:04:43,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28680 states to 28680 states and 38150 transitions. [2019-09-16 17:04:43,462 INFO L78 Accepts]: Start accepts. Automaton has 28680 states and 38150 transitions. Word has length 32 [2019-09-16 17:04:43,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:43,462 INFO L475 AbstractCegarLoop]: Abstraction has 28680 states and 38150 transitions. [2019-09-16 17:04:43,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:43,462 INFO L276 IsEmpty]: Start isEmpty. Operand 28680 states and 38150 transitions. [2019-09-16 17:04:43,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-16 17:04:43,504 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:43,504 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:43,504 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:43,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:43,505 INFO L82 PathProgramCache]: Analyzing trace with hash 2074668310, now seen corresponding path program 1 times [2019-09-16 17:04:43,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:43,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:43,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:43,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:43,506 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:43,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:43,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:43,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:43,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:43,530 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:43,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:43,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:43,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:43,531 INFO L87 Difference]: Start difference. First operand 28680 states and 38150 transitions. Second operand 3 states. [2019-09-16 17:04:43,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:43,660 INFO L93 Difference]: Finished difference Result 37386 states and 49159 transitions. [2019-09-16 17:04:43,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:43,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-09-16 17:04:43,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:43,738 INFO L225 Difference]: With dead ends: 37386 [2019-09-16 17:04:43,738 INFO L226 Difference]: Without dead ends: 37386 [2019-09-16 17:04:43,739 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:43,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37386 states. [2019-09-16 17:04:44,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37386 to 37384. [2019-09-16 17:04:44,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37384 states. [2019-09-16 17:04:44,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37384 states to 37384 states and 49158 transitions. [2019-09-16 17:04:44,384 INFO L78 Accepts]: Start accepts. Automaton has 37384 states and 49158 transitions. Word has length 32 [2019-09-16 17:04:44,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:44,384 INFO L475 AbstractCegarLoop]: Abstraction has 37384 states and 49158 transitions. [2019-09-16 17:04:44,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:44,384 INFO L276 IsEmpty]: Start isEmpty. Operand 37384 states and 49158 transitions. [2019-09-16 17:04:44,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-16 17:04:44,414 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:44,415 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:44,415 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:44,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:44,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1478771549, now seen corresponding path program 1 times [2019-09-16 17:04:44,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:44,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:44,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:44,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:44,417 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:44,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:44,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:44,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:44,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:44,438 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:44,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:44,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:44,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:44,440 INFO L87 Difference]: Start difference. First operand 37384 states and 49158 transitions. Second operand 3 states. [2019-09-16 17:04:44,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:44,549 INFO L93 Difference]: Finished difference Result 37898 states and 49159 transitions. [2019-09-16 17:04:44,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:44,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-09-16 17:04:44,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:44,597 INFO L225 Difference]: With dead ends: 37898 [2019-09-16 17:04:44,598 INFO L226 Difference]: Without dead ends: 37898 [2019-09-16 17:04:44,599 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:44,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37898 states. [2019-09-16 17:04:45,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37898 to 37896. [2019-09-16 17:04:45,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37896 states. [2019-09-16 17:04:45,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37896 states to 37896 states and 49158 transitions. [2019-09-16 17:04:45,791 INFO L78 Accepts]: Start accepts. Automaton has 37896 states and 49158 transitions. Word has length 33 [2019-09-16 17:04:45,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:45,791 INFO L475 AbstractCegarLoop]: Abstraction has 37896 states and 49158 transitions. [2019-09-16 17:04:45,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:45,792 INFO L276 IsEmpty]: Start isEmpty. Operand 37896 states and 49158 transitions. [2019-09-16 17:04:45,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-16 17:04:45,841 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:45,841 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:45,841 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:45,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:45,842 INFO L82 PathProgramCache]: Analyzing trace with hash -109576353, now seen corresponding path program 1 times [2019-09-16 17:04:45,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:45,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:45,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:45,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:45,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:45,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:45,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:45,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:45,867 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:45,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:45,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:45,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:45,868 INFO L87 Difference]: Start difference. First operand 37896 states and 49158 transitions. Second operand 3 states. [2019-09-16 17:04:46,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:46,006 INFO L93 Difference]: Finished difference Result 63498 states and 82439 transitions. [2019-09-16 17:04:46,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:46,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-09-16 17:04:46,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:46,081 INFO L225 Difference]: With dead ends: 63498 [2019-09-16 17:04:46,081 INFO L226 Difference]: Without dead ends: 63498 [2019-09-16 17:04:46,082 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:46,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63498 states. [2019-09-16 17:04:46,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63498 to 57352. [2019-09-16 17:04:46,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57352 states. [2019-09-16 17:04:46,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57352 states to 57352 states and 72198 transitions. [2019-09-16 17:04:46,886 INFO L78 Accepts]: Start accepts. Automaton has 57352 states and 72198 transitions. Word has length 33 [2019-09-16 17:04:46,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:46,886 INFO L475 AbstractCegarLoop]: Abstraction has 57352 states and 72198 transitions. [2019-09-16 17:04:46,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:46,886 INFO L276 IsEmpty]: Start isEmpty. Operand 57352 states and 72198 transitions. [2019-09-16 17:04:46,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-16 17:04:46,927 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:46,927 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:46,927 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:46,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:46,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1130644707, now seen corresponding path program 1 times [2019-09-16 17:04:46,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:46,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:46,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:46,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:46,929 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:46,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:46,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:46,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:46,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:46,947 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:46,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:46,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:46,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:46,948 INFO L87 Difference]: Start difference. First operand 57352 states and 72198 transitions. Second operand 3 states. [2019-09-16 17:04:47,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:47,121 INFO L93 Difference]: Finished difference Result 73738 states and 91143 transitions. [2019-09-16 17:04:47,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:47,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-09-16 17:04:47,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:47,206 INFO L225 Difference]: With dead ends: 73738 [2019-09-16 17:04:47,206 INFO L226 Difference]: Without dead ends: 73738 [2019-09-16 17:04:47,207 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:47,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73738 states. [2019-09-16 17:04:47,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73738 to 73736. [2019-09-16 17:04:47,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73736 states. [2019-09-16 17:04:48,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73736 states to 73736 states and 91142 transitions. [2019-09-16 17:04:48,065 INFO L78 Accepts]: Start accepts. Automaton has 73736 states and 91142 transitions. Word has length 33 [2019-09-16 17:04:48,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:48,065 INFO L475 AbstractCegarLoop]: Abstraction has 73736 states and 91142 transitions. [2019-09-16 17:04:48,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:48,065 INFO L276 IsEmpty]: Start isEmpty. Operand 73736 states and 91142 transitions. [2019-09-16 17:04:48,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-16 17:04:48,098 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:48,098 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:48,098 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:48,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:48,099 INFO L82 PathProgramCache]: Analyzing trace with hash 898316171, now seen corresponding path program 1 times [2019-09-16 17:04:48,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:48,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:48,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:48,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:48,100 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:48,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:48,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:48,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:48,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:48,130 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:48,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:48,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:48,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:48,130 INFO L87 Difference]: Start difference. First operand 73736 states and 91142 transitions. Second operand 3 states. [2019-09-16 17:04:48,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:48,310 INFO L93 Difference]: Finished difference Result 74762 states and 91143 transitions. [2019-09-16 17:04:48,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:48,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-09-16 17:04:48,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:48,365 INFO L225 Difference]: With dead ends: 74762 [2019-09-16 17:04:48,365 INFO L226 Difference]: Without dead ends: 74762 [2019-09-16 17:04:48,366 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:48,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74762 states. [2019-09-16 17:04:49,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74762 to 74760. [2019-09-16 17:04:49,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74760 states. [2019-09-16 17:04:49,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74760 states to 74760 states and 91142 transitions. [2019-09-16 17:04:49,180 INFO L78 Accepts]: Start accepts. Automaton has 74760 states and 91142 transitions. Word has length 34 [2019-09-16 17:04:49,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:49,180 INFO L475 AbstractCegarLoop]: Abstraction has 74760 states and 91142 transitions. [2019-09-16 17:04:49,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:49,180 INFO L276 IsEmpty]: Start isEmpty. Operand 74760 states and 91142 transitions. [2019-09-16 17:04:49,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-16 17:04:49,212 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:49,212 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:49,213 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:49,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:49,213 INFO L82 PathProgramCache]: Analyzing trace with hash -690031731, now seen corresponding path program 1 times [2019-09-16 17:04:49,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:49,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:49,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:49,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:49,214 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:49,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:49,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:49,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:49,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:49,232 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:49,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:49,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:49,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:49,234 INFO L87 Difference]: Start difference. First operand 74760 states and 91142 transitions. Second operand 3 states. [2019-09-16 17:04:49,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:49,478 INFO L93 Difference]: Finished difference Result 122890 states and 148487 transitions. [2019-09-16 17:04:49,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:49,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-09-16 17:04:49,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:49,602 INFO L225 Difference]: With dead ends: 122890 [2019-09-16 17:04:49,602 INFO L226 Difference]: Without dead ends: 122890 [2019-09-16 17:04:49,602 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:49,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122890 states. [2019-09-16 17:04:50,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122890 to 114696. [2019-09-16 17:04:50,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114696 states. [2019-09-16 17:04:50,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114696 states to 114696 states and 136198 transitions. [2019-09-16 17:04:50,880 INFO L78 Accepts]: Start accepts. Automaton has 114696 states and 136198 transitions. Word has length 34 [2019-09-16 17:04:50,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:50,881 INFO L475 AbstractCegarLoop]: Abstraction has 114696 states and 136198 transitions. [2019-09-16 17:04:50,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:50,881 INFO L276 IsEmpty]: Start isEmpty. Operand 114696 states and 136198 transitions. [2019-09-16 17:04:50,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-16 17:04:50,945 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:50,946 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:50,946 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:50,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:50,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1711100085, now seen corresponding path program 1 times [2019-09-16 17:04:50,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:50,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:50,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:50,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:50,947 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:50,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:50,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:50,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:50,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:50,967 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:50,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:50,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:50,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:50,968 INFO L87 Difference]: Start difference. First operand 114696 states and 136198 transitions. Second operand 3 states. [2019-09-16 17:04:51,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:51,556 INFO L93 Difference]: Finished difference Result 145418 states and 167943 transitions. [2019-09-16 17:04:51,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:51,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-09-16 17:04:51,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:51,661 INFO L225 Difference]: With dead ends: 145418 [2019-09-16 17:04:51,662 INFO L226 Difference]: Without dead ends: 145418 [2019-09-16 17:04:51,662 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:51,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145418 states. [2019-09-16 17:04:55,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145418 to 145416. [2019-09-16 17:04:55,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145416 states. [2019-09-16 17:04:55,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145416 states to 145416 states and 167942 transitions. [2019-09-16 17:04:55,815 INFO L78 Accepts]: Start accepts. Automaton has 145416 states and 167942 transitions. Word has length 34 [2019-09-16 17:04:55,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:55,815 INFO L475 AbstractCegarLoop]: Abstraction has 145416 states and 167942 transitions. [2019-09-16 17:04:55,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:55,815 INFO L276 IsEmpty]: Start isEmpty. Operand 145416 states and 167942 transitions. [2019-09-16 17:04:55,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-16 17:04:55,894 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:55,894 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:55,894 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:55,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:55,895 INFO L82 PathProgramCache]: Analyzing trace with hash 84068978, now seen corresponding path program 1 times [2019-09-16 17:04:55,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:55,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:55,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:55,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:55,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:55,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:55,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:55,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:55,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:55,918 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:55,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:55,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:55,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:55,919 INFO L87 Difference]: Start difference. First operand 145416 states and 167942 transitions. Second operand 3 states. [2019-09-16 17:04:56,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:56,230 INFO L93 Difference]: Finished difference Result 147466 states and 167943 transitions. [2019-09-16 17:04:56,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:56,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-09-16 17:04:56,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:56,372 INFO L225 Difference]: With dead ends: 147466 [2019-09-16 17:04:56,372 INFO L226 Difference]: Without dead ends: 147466 [2019-09-16 17:04:56,373 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:56,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147466 states. [2019-09-16 17:04:59,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147466 to 147464. [2019-09-16 17:04:59,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147464 states. [2019-09-16 17:04:59,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147464 states to 147464 states and 167942 transitions. [2019-09-16 17:04:59,480 INFO L78 Accepts]: Start accepts. Automaton has 147464 states and 167942 transitions. Word has length 35 [2019-09-16 17:04:59,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:59,480 INFO L475 AbstractCegarLoop]: Abstraction has 147464 states and 167942 transitions. [2019-09-16 17:04:59,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:59,480 INFO L276 IsEmpty]: Start isEmpty. Operand 147464 states and 167942 transitions. [2019-09-16 17:04:59,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-16 17:04:59,554 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:59,554 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:59,554 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:59,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:59,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1504278924, now seen corresponding path program 1 times [2019-09-16 17:04:59,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:59,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:59,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:59,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:59,556 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:59,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:59,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:59,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:59,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:59,578 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:59,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:59,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:59,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:59,579 INFO L87 Difference]: Start difference. First operand 147464 states and 167942 transitions. Second operand 3 states. [2019-09-16 17:05:00,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:00,044 INFO L93 Difference]: Finished difference Result 237576 states and 264198 transitions. [2019-09-16 17:05:00,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:00,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-09-16 17:05:00,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:00,374 INFO L225 Difference]: With dead ends: 237576 [2019-09-16 17:05:00,375 INFO L226 Difference]: Without dead ends: 237576 [2019-09-16 17:05:00,375 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:00,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237576 states. [2019-09-16 17:05:02,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237576 to 229384. [2019-09-16 17:05:02,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229384 states. [2019-09-16 17:05:02,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229384 states to 229384 states and 256006 transitions. [2019-09-16 17:05:02,908 INFO L78 Accepts]: Start accepts. Automaton has 229384 states and 256006 transitions. Word has length 35 [2019-09-16 17:05:02,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:02,909 INFO L475 AbstractCegarLoop]: Abstraction has 229384 states and 256006 transitions. [2019-09-16 17:05:02,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:02,909 INFO L276 IsEmpty]: Start isEmpty. Operand 229384 states and 256006 transitions. [2019-09-16 17:05:03,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-16 17:05:03,055 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:03,055 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:03,056 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:03,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:03,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1769620018, now seen corresponding path program 1 times [2019-09-16 17:05:03,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:03,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:03,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:03,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:03,057 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:03,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:05:03,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:03,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:03,077 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:03,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:03,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:03,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:03,078 INFO L87 Difference]: Start difference. First operand 229384 states and 256006 transitions. Second operand 3 states. [2019-09-16 17:05:06,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:06,436 INFO L93 Difference]: Finished difference Result 286726 states and 307205 transitions. [2019-09-16 17:05:06,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:06,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-09-16 17:05:06,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:06,436 INFO L225 Difference]: With dead ends: 286726 [2019-09-16 17:05:06,436 INFO L226 Difference]: Without dead ends: 0 [2019-09-16 17:05:06,437 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:06,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-16 17:05:06,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-16 17:05:06,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-16 17:05:06,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-16 17:05:06,437 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2019-09-16 17:05:06,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:06,438 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-16 17:05:06,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:06,438 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-16 17:05:06,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-16 17:05:06,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 05:05:06 BoogieIcfgContainer [2019-09-16 17:05:06,444 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 17:05:06,447 INFO L168 Benchmark]: Toolchain (without parser) took 30568.88 ms. Allocated memory was 132.1 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 87.9 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 598.9 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:06,447 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 132.1 MB. Free memory was 106.3 MB in the beginning and 106.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-16 17:05:06,448 INFO L168 Benchmark]: CACSL2BoogieTranslator took 395.48 ms. Allocated memory was 132.1 MB in the beginning and 199.8 MB in the end (delta: 67.6 MB). Free memory was 87.7 MB in the beginning and 176.6 MB in the end (delta: -88.9 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:06,449 INFO L168 Benchmark]: Boogie Preprocessor took 50.94 ms. Allocated memory is still 199.8 MB. Free memory was 176.6 MB in the beginning and 174.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:06,449 INFO L168 Benchmark]: RCFGBuilder took 434.05 ms. Allocated memory is still 199.8 MB. Free memory was 174.1 MB in the beginning and 152.5 MB in the end (delta: 21.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:06,450 INFO L168 Benchmark]: TraceAbstraction took 29683.75 ms. Allocated memory was 199.8 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 152.5 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 595.9 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:06,453 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.21 ms. Allocated memory is still 132.1 MB. Free memory was 106.3 MB in the beginning and 106.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 395.48 ms. Allocated memory was 132.1 MB in the beginning and 199.8 MB in the end (delta: 67.6 MB). Free memory was 87.7 MB in the beginning and 176.6 MB in the end (delta: -88.9 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.94 ms. Allocated memory is still 199.8 MB. Free memory was 176.6 MB in the beginning and 174.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 434.05 ms. Allocated memory is still 199.8 MB. Free memory was 174.1 MB in the beginning and 152.5 MB in the end (delta: 21.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 29683.75 ms. Allocated memory was 199.8 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 152.5 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 595.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 203]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 53 locations, 1 error locations. SAFE Result, 29.6s OverallTime, 37 OverallIterations, 1 TraceHistogramMax, 8.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4001 SDtfs, 1984 SDslu, 2752 SDs, 0 SdLazy, 197 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=229384occurred in iteration=36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 18.3s AutomataMinimizationTime, 37 MinimizatonAttempts, 32808 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1077 NumberOfCodeBlocks, 1077 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1040 ConstructedInterpolants, 0 QuantifiedInterpolants, 61562 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...