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/float-benchs/rlim_invariant.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 01:38:08,636 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 01:38:08,638 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 01:38:08,650 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 01:38:08,650 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 01:38:08,651 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 01:38:08,652 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 01:38:08,654 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 01:38:08,656 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 01:38:08,657 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 01:38:08,658 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 01:38:08,659 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 01:38:08,659 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 01:38:08,660 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 01:38:08,661 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 01:38:08,662 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 01:38:08,663 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 01:38:08,664 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 01:38:08,665 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 01:38:08,667 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 01:38:08,670 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 01:38:08,674 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 01:38:08,675 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 01:38:08,676 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 01:38:08,680 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 01:38:08,680 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 01:38:08,680 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 01:38:08,681 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 01:38:08,682 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 01:38:08,683 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 01:38:08,683 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 01:38:08,684 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 01:38:08,685 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 01:38:08,686 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 01:38:08,687 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 01:38:08,687 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 01:38:08,688 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 01:38:08,688 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 01:38:08,688 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 01:38:08,689 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 01:38:08,690 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 01:38:08,691 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-10 01:38:08,705 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 01:38:08,705 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 01:38:08,706 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 01:38:08,706 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 01:38:08,707 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 01:38:08,707 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 01:38:08,707 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 01:38:08,707 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 01:38:08,708 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 01:38:08,708 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 01:38:08,708 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 01:38:08,709 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 01:38:08,709 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 01:38:08,709 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 01:38:08,709 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 01:38:08,709 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 01:38:08,710 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 01:38:08,710 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 01:38:08,710 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 01:38:08,710 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 01:38:08,711 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 01:38:08,711 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 01:38:08,711 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 01:38:08,711 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 01:38:08,711 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 01:38:08,712 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 01:38:08,712 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 01:38:08,712 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 01:38:08,712 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 01:38:08,712 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 01:38:08,743 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 01:38:08,755 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 01:38:08,759 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 01:38:08,760 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 01:38:08,761 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 01:38:08,761 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/rlim_invariant.c.v+nlh-reducer.c [2019-09-10 01:38:08,822 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1eaf6c7e/5baa0ff1e23c46f1b264ef3f8bd0645a/FLAG1811fab0e [2019-09-10 01:38:09,286 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 01:38:09,287 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/rlim_invariant.c.v+nlh-reducer.c [2019-09-10 01:38:09,297 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1eaf6c7e/5baa0ff1e23c46f1b264ef3f8bd0645a/FLAG1811fab0e [2019-09-10 01:38:09,663 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1eaf6c7e/5baa0ff1e23c46f1b264ef3f8bd0645a [2019-09-10 01:38:09,672 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 01:38:09,673 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 01:38:09,674 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 01:38:09,674 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 01:38:09,678 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 01:38:09,679 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:38:09" (1/1) ... [2019-09-10 01:38:09,682 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f924457 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:38:09, skipping insertion in model container [2019-09-10 01:38:09,682 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:38:09" (1/1) ... [2019-09-10 01:38:09,689 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 01:38:09,721 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 01:38:09,946 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:38:09,951 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 01:38:10,089 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:38:10,106 INFO L192 MainTranslator]: Completed translation [2019-09-10 01:38:10,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:38:10 WrapperNode [2019-09-10 01:38:10,107 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 01:38:10,108 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 01:38:10,108 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 01:38:10,108 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 01:38:10,126 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:38:10" (1/1) ... [2019-09-10 01:38:10,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:38:10" (1/1) ... [2019-09-10 01:38:10,135 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:38:10" (1/1) ... [2019-09-10 01:38:10,135 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:38:10" (1/1) ... [2019-09-10 01:38:10,145 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:38:10" (1/1) ... [2019-09-10 01:38:10,152 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:38:10" (1/1) ... [2019-09-10 01:38:10,154 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:38:10" (1/1) ... [2019-09-10 01:38:10,156 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 01:38:10,158 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 01:38:10,158 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 01:38:10,158 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 01:38:10,159 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:38:10" (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-10 01:38:10,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 01:38:10,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 01:38:10,211 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 01:38:10,211 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 01:38:10,211 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2019-09-10 01:38:10,211 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 01:38:10,211 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-10 01:38:10,211 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 01:38:10,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 01:38:10,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 01:38:10,572 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 01:38:10,573 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 01:38:10,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:38:10 BoogieIcfgContainer [2019-09-10 01:38:10,574 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 01:38:10,575 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 01:38:10,575 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 01:38:10,578 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 01:38:10,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 01:38:09" (1/3) ... [2019-09-10 01:38:10,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e83d2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:38:10, skipping insertion in model container [2019-09-10 01:38:10,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:38:10" (2/3) ... [2019-09-10 01:38:10,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e83d2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:38:10, skipping insertion in model container [2019-09-10 01:38:10,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:38:10" (3/3) ... [2019-09-10 01:38:10,582 INFO L109 eAbstractionObserver]: Analyzing ICFG rlim_invariant.c.v+nlh-reducer.c [2019-09-10 01:38:10,594 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 01:38:10,605 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-09-10 01:38:10,621 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-09-10 01:38:10,648 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 01:38:10,648 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 01:38:10,649 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 01:38:10,649 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 01:38:10,649 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 01:38:10,649 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 01:38:10,649 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 01:38:10,650 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 01:38:10,664 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2019-09-10 01:38:10,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-10 01:38:10,673 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:38:10,674 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:38:10,675 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:38:10,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:38:10,680 INFO L82 PathProgramCache]: Analyzing trace with hash 767705956, now seen corresponding path program 1 times [2019-09-10 01:38:10,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:38:10,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:10,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:38:10,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:10,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:38:10,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:38:10,868 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-10 01:38:10,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:38:10,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 01:38:10,871 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:38:10,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 01:38:10,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 01:38:10,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 01:38:10,894 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 4 states. [2019-09-10 01:38:11,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:38:11,008 INFO L93 Difference]: Finished difference Result 76 states and 108 transitions. [2019-09-10 01:38:11,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 01:38:11,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-09-10 01:38:11,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:38:11,025 INFO L225 Difference]: With dead ends: 76 [2019-09-10 01:38:11,025 INFO L226 Difference]: Without dead ends: 66 [2019-09-10 01:38:11,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 01:38:11,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-10 01:38:11,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 45. [2019-09-10 01:38:11,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-10 01:38:11,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2019-09-10 01:38:11,096 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 20 [2019-09-10 01:38:11,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:38:11,097 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2019-09-10 01:38:11,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 01:38:11,097 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2019-09-10 01:38:11,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-10 01:38:11,099 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:38:11,100 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:38:11,100 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:38:11,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:38:11,102 INFO L82 PathProgramCache]: Analyzing trace with hash 856215017, now seen corresponding path program 1 times [2019-09-10 01:38:11,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:38:11,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:11,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:38:11,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:11,108 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:38:11,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:38:11,240 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-10 01:38:11,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:38:11,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 01:38:11,241 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:38:11,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 01:38:11,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 01:38:11,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 01:38:11,245 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand 5 states. [2019-09-10 01:38:11,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:38:11,465 INFO L93 Difference]: Finished difference Result 132 states and 170 transitions. [2019-09-10 01:38:11,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 01:38:11,466 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-09-10 01:38:11,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:38:11,470 INFO L225 Difference]: With dead ends: 132 [2019-09-10 01:38:11,470 INFO L226 Difference]: Without dead ends: 132 [2019-09-10 01:38:11,471 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 01:38:11,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-09-10 01:38:11,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 57. [2019-09-10 01:38:11,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-10 01:38:11,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 73 transitions. [2019-09-10 01:38:11,491 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 73 transitions. Word has length 20 [2019-09-10 01:38:11,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:38:11,492 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 73 transitions. [2019-09-10 01:38:11,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 01:38:11,492 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 73 transitions. [2019-09-10 01:38:11,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-10 01:38:11,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:38:11,496 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:38:11,496 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:38:11,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:38:11,497 INFO L82 PathProgramCache]: Analyzing trace with hash -45230323, now seen corresponding path program 1 times [2019-09-10 01:38:11,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:38:11,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:11,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:38:11,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:11,499 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:38:11,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:38:11,585 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-10 01:38:11,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:38:11,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 01:38:11,587 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:38:11,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 01:38:11,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 01:38:11,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 01:38:11,588 INFO L87 Difference]: Start difference. First operand 57 states and 73 transitions. Second operand 5 states. [2019-09-10 01:38:11,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:38:11,768 INFO L93 Difference]: Finished difference Result 111 states and 140 transitions. [2019-09-10 01:38:11,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 01:38:11,769 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-09-10 01:38:11,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:38:11,771 INFO L225 Difference]: With dead ends: 111 [2019-09-10 01:38:11,771 INFO L226 Difference]: Without dead ends: 111 [2019-09-10 01:38:11,771 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 01:38:11,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-09-10 01:38:11,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 86. [2019-09-10 01:38:11,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-09-10 01:38:11,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 114 transitions. [2019-09-10 01:38:11,788 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 114 transitions. Word has length 21 [2019-09-10 01:38:11,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:38:11,789 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 114 transitions. [2019-09-10 01:38:11,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 01:38:11,790 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 114 transitions. [2019-09-10 01:38:11,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-10 01:38:11,791 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:38:11,791 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:38:11,791 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:38:11,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:38:11,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1888937179, now seen corresponding path program 1 times [2019-09-10 01:38:11,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:38:11,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:11,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:38:11,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:11,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:38:11,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:38:11,852 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-10 01:38:11,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:38:11,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 01:38:11,853 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:38:11,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 01:38:11,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 01:38:11,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 01:38:11,854 INFO L87 Difference]: Start difference. First operand 86 states and 114 transitions. Second operand 5 states. [2019-09-10 01:38:11,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:38:11,985 INFO L93 Difference]: Finished difference Result 147 states and 189 transitions. [2019-09-10 01:38:11,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 01:38:11,986 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-09-10 01:38:11,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:38:11,987 INFO L225 Difference]: With dead ends: 147 [2019-09-10 01:38:11,988 INFO L226 Difference]: Without dead ends: 147 [2019-09-10 01:38:11,988 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 01:38:11,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-09-10 01:38:11,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 116. [2019-09-10 01:38:11,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-09-10 01:38:11,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 154 transitions. [2019-09-10 01:38:11,998 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 154 transitions. Word has length 21 [2019-09-10 01:38:11,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:38:11,999 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 154 transitions. [2019-09-10 01:38:11,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 01:38:11,999 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 154 transitions. [2019-09-10 01:38:12,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-10 01:38:12,000 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:38:12,000 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:38:12,001 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:38:12,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:38:12,001 INFO L82 PathProgramCache]: Analyzing trace with hash 231028353, now seen corresponding path program 1 times [2019-09-10 01:38:12,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:38:12,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:12,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:38:12,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:12,003 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:38:12,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:38:12,068 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-10 01:38:12,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:38:12,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 01:38:12,070 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:38:12,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 01:38:12,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 01:38:12,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 01:38:12,071 INFO L87 Difference]: Start difference. First operand 116 states and 154 transitions. Second operand 6 states. [2019-09-10 01:38:12,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:38:12,239 INFO L93 Difference]: Finished difference Result 223 states and 290 transitions. [2019-09-10 01:38:12,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 01:38:12,239 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-09-10 01:38:12,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:38:12,241 INFO L225 Difference]: With dead ends: 223 [2019-09-10 01:38:12,241 INFO L226 Difference]: Without dead ends: 223 [2019-09-10 01:38:12,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-09-10 01:38:12,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-09-10 01:38:12,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 167. [2019-09-10 01:38:12,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-10 01:38:12,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 227 transitions. [2019-09-10 01:38:12,254 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 227 transitions. Word has length 22 [2019-09-10 01:38:12,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:38:12,254 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 227 transitions. [2019-09-10 01:38:12,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 01:38:12,254 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 227 transitions. [2019-09-10 01:38:12,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-10 01:38:12,255 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:38:12,255 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:38:12,256 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:38:12,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:38:12,256 INFO L82 PathProgramCache]: Analyzing trace with hash -578318273, now seen corresponding path program 1 times [2019-09-10 01:38:12,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:38:12,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:12,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:38:12,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:12,258 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:38:12,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:38:12,294 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-10 01:38:12,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:38:12,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 01:38:12,295 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:38:12,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 01:38:12,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 01:38:12,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 01:38:12,296 INFO L87 Difference]: Start difference. First operand 167 states and 227 transitions. Second operand 4 states. [2019-09-10 01:38:12,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:38:12,351 INFO L93 Difference]: Finished difference Result 277 states and 370 transitions. [2019-09-10 01:38:12,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 01:38:12,352 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-09-10 01:38:12,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:38:12,353 INFO L225 Difference]: With dead ends: 277 [2019-09-10 01:38:12,354 INFO L226 Difference]: Without dead ends: 277 [2019-09-10 01:38:12,354 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 01:38:12,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-09-10 01:38:12,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 200. [2019-09-10 01:38:12,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-10 01:38:12,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 278 transitions. [2019-09-10 01:38:12,365 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 278 transitions. Word has length 22 [2019-09-10 01:38:12,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:38:12,365 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 278 transitions. [2019-09-10 01:38:12,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 01:38:12,365 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 278 transitions. [2019-09-10 01:38:12,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-10 01:38:12,367 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:38:12,368 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:38:12,368 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:38:12,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:38:12,368 INFO L82 PathProgramCache]: Analyzing trace with hash -248584584, now seen corresponding path program 1 times [2019-09-10 01:38:12,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:38:12,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:12,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:38:12,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:12,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:38:12,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:38:12,449 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-10 01:38:12,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:38:12,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 01:38:12,450 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:38:12,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 01:38:12,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 01:38:12,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 01:38:12,451 INFO L87 Difference]: Start difference. First operand 200 states and 278 transitions. Second operand 4 states. [2019-09-10 01:38:12,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:38:12,484 INFO L93 Difference]: Finished difference Result 377 states and 527 transitions. [2019-09-10 01:38:12,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 01:38:12,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-09-10 01:38:12,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:38:12,487 INFO L225 Difference]: With dead ends: 377 [2019-09-10 01:38:12,487 INFO L226 Difference]: Without dead ends: 377 [2019-09-10 01:38:12,488 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 01:38:12,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-09-10 01:38:12,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 202. [2019-09-10 01:38:12,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-09-10 01:38:12,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 277 transitions. [2019-09-10 01:38:12,497 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 277 transitions. Word has length 34 [2019-09-10 01:38:12,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:38:12,498 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 277 transitions. [2019-09-10 01:38:12,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 01:38:12,498 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 277 transitions. [2019-09-10 01:38:12,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-10 01:38:12,500 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:38:12,500 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:38:12,501 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:38:12,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:38:12,501 INFO L82 PathProgramCache]: Analyzing trace with hash 997501762, now seen corresponding path program 1 times [2019-09-10 01:38:12,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:38:12,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:12,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:38:12,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:12,503 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:38:12,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:38:12,527 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-10 01:38:12,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:38:12,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 01:38:12,528 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:38:12,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 01:38:12,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 01:38:12,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:38:12,529 INFO L87 Difference]: Start difference. First operand 202 states and 277 transitions. Second operand 3 states. [2019-09-10 01:38:12,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:38:12,535 INFO L93 Difference]: Finished difference Result 144 states and 169 transitions. [2019-09-10 01:38:12,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 01:38:12,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-09-10 01:38:12,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:38:12,536 INFO L225 Difference]: With dead ends: 144 [2019-09-10 01:38:12,536 INFO L226 Difference]: Without dead ends: 120 [2019-09-10 01:38:12,537 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:38:12,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-09-10 01:38:12,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-09-10 01:38:12,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-10 01:38:12,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 145 transitions. [2019-09-10 01:38:12,541 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 145 transitions. Word has length 34 [2019-09-10 01:38:12,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:38:12,542 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 145 transitions. [2019-09-10 01:38:12,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 01:38:12,542 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 145 transitions. [2019-09-10 01:38:12,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-10 01:38:12,543 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:38:12,543 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:38:12,544 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:38:12,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:38:12,544 INFO L82 PathProgramCache]: Analyzing trace with hash 401680037, now seen corresponding path program 1 times [2019-09-10 01:38:12,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:38:12,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:12,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:38:12,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:12,546 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:38:12,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:38:12,624 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-10 01:38:12,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:38:12,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 01:38:12,624 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:38:12,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 01:38:12,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 01:38:12,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-09-10 01:38:12,626 INFO L87 Difference]: Start difference. First operand 120 states and 145 transitions. Second operand 8 states. [2019-09-10 01:38:13,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:38:13,079 INFO L93 Difference]: Finished difference Result 267 states and 314 transitions. [2019-09-10 01:38:13,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 01:38:13,080 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2019-09-10 01:38:13,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:38:13,082 INFO L225 Difference]: With dead ends: 267 [2019-09-10 01:38:13,082 INFO L226 Difference]: Without dead ends: 267 [2019-09-10 01:38:13,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2019-09-10 01:38:13,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-09-10 01:38:13,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 145. [2019-09-10 01:38:13,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-09-10 01:38:13,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 178 transitions. [2019-09-10 01:38:13,089 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 178 transitions. Word has length 35 [2019-09-10 01:38:13,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:38:13,089 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 178 transitions. [2019-09-10 01:38:13,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 01:38:13,089 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 178 transitions. [2019-09-10 01:38:13,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-10 01:38:13,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:38:13,096 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:38:13,096 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:38:13,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:38:13,097 INFO L82 PathProgramCache]: Analyzing trace with hash 187214602, now seen corresponding path program 1 times [2019-09-10 01:38:13,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:38:13,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:13,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:38:13,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:13,099 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:38:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:38:13,147 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-10 01:38:13,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:38:13,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 01:38:13,147 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:38:13,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 01:38:13,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 01:38:13,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:38:13,148 INFO L87 Difference]: Start difference. First operand 145 states and 178 transitions. Second operand 3 states. [2019-09-10 01:38:13,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:38:13,156 INFO L93 Difference]: Finished difference Result 146 states and 169 transitions. [2019-09-10 01:38:13,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 01:38:13,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-09-10 01:38:13,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:38:13,158 INFO L225 Difference]: With dead ends: 146 [2019-09-10 01:38:13,158 INFO L226 Difference]: Without dead ends: 132 [2019-09-10 01:38:13,159 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:38:13,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-09-10 01:38:13,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 117. [2019-09-10 01:38:13,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-09-10 01:38:13,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 133 transitions. [2019-09-10 01:38:13,163 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 133 transitions. Word has length 35 [2019-09-10 01:38:13,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:38:13,163 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 133 transitions. [2019-09-10 01:38:13,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 01:38:13,164 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 133 transitions. [2019-09-10 01:38:13,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-10 01:38:13,164 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:38:13,165 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:38:13,165 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:38:13,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:38:13,165 INFO L82 PathProgramCache]: Analyzing trace with hash -777363815, now seen corresponding path program 1 times [2019-09-10 01:38:13,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:38:13,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:13,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:38:13,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:13,167 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:38:13,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:38:13,221 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-10 01:38:13,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:38:13,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 01:38:13,222 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:38:13,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 01:38:13,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 01:38:13,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 01:38:13,224 INFO L87 Difference]: Start difference. First operand 117 states and 133 transitions. Second operand 5 states. [2019-09-10 01:38:13,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:38:13,300 INFO L93 Difference]: Finished difference Result 142 states and 159 transitions. [2019-09-10 01:38:13,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 01:38:13,300 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-09-10 01:38:13,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:38:13,301 INFO L225 Difference]: With dead ends: 142 [2019-09-10 01:38:13,302 INFO L226 Difference]: Without dead ends: 142 [2019-09-10 01:38:13,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 01:38:13,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-09-10 01:38:13,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 87. [2019-09-10 01:38:13,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-10 01:38:13,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 101 transitions. [2019-09-10 01:38:13,306 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 101 transitions. Word has length 36 [2019-09-10 01:38:13,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:38:13,306 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 101 transitions. [2019-09-10 01:38:13,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 01:38:13,306 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2019-09-10 01:38:13,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-10 01:38:13,307 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:38:13,307 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:38:13,308 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:38:13,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:38:13,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1050171841, now seen corresponding path program 1 times [2019-09-10 01:38:13,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:38:13,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:13,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:38:13,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:13,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:38:13,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:38:13,344 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-10 01:38:13,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:38:13,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 01:38:13,345 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:38:13,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 01:38:13,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 01:38:13,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 01:38:13,346 INFO L87 Difference]: Start difference. First operand 87 states and 101 transitions. Second operand 5 states. [2019-09-10 01:38:13,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:38:13,402 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2019-09-10 01:38:13,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 01:38:13,402 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-09-10 01:38:13,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:38:13,403 INFO L225 Difference]: With dead ends: 76 [2019-09-10 01:38:13,403 INFO L226 Difference]: Without dead ends: 76 [2019-09-10 01:38:13,404 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 01:38:13,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-10 01:38:13,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 52. [2019-09-10 01:38:13,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-10 01:38:13,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2019-09-10 01:38:13,406 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 36 [2019-09-10 01:38:13,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:38:13,406 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2019-09-10 01:38:13,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 01:38:13,407 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2019-09-10 01:38:13,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-10 01:38:13,407 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:38:13,407 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:38:13,408 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:38:13,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:38:13,408 INFO L82 PathProgramCache]: Analyzing trace with hash -921068267, now seen corresponding path program 1 times [2019-09-10 01:38:13,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:38:13,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:13,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:38:13,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:13,409 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:38:13,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:38:13,469 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-10 01:38:13,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:38:13,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 01:38:13,470 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:38:13,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 01:38:13,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 01:38:13,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-09-10 01:38:13,471 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 8 states. [2019-09-10 01:38:13,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:38:13,612 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2019-09-10 01:38:13,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 01:38:13,612 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2019-09-10 01:38:13,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:38:13,613 INFO L225 Difference]: With dead ends: 97 [2019-09-10 01:38:13,613 INFO L226 Difference]: Without dead ends: 97 [2019-09-10 01:38:13,614 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-09-10 01:38:13,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-09-10 01:38:13,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 72. [2019-09-10 01:38:13,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-10 01:38:13,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2019-09-10 01:38:13,617 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 36 [2019-09-10 01:38:13,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:38:13,617 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2019-09-10 01:38:13,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 01:38:13,617 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2019-09-10 01:38:13,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-10 01:38:13,618 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:38:13,618 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:38:13,618 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:38:13,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:38:13,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1173365191, now seen corresponding path program 1 times [2019-09-10 01:38:13,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:38:13,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:13,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:38:13,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:13,620 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:38:13,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:38:13,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:38:13,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:38:13,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 01:38:13,720 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:38:13,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 01:38:13,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 01:38:13,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-10 01:38:13,721 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand 9 states. [2019-09-10 01:38:13,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:38:13,888 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2019-09-10 01:38:13,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 01:38:13,889 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2019-09-10 01:38:13,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:38:13,890 INFO L225 Difference]: With dead ends: 111 [2019-09-10 01:38:13,890 INFO L226 Difference]: Without dead ends: 111 [2019-09-10 01:38:13,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-09-10 01:38:13,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-09-10 01:38:13,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 86. [2019-09-10 01:38:13,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-09-10 01:38:13,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2019-09-10 01:38:13,894 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 37 [2019-09-10 01:38:13,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:38:13,894 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2019-09-10 01:38:13,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 01:38:13,894 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2019-09-10 01:38:13,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-10 01:38:13,895 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:38:13,895 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:38:13,895 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:38:13,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:38:13,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1316163771, now seen corresponding path program 1 times [2019-09-10 01:38:13,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:38:13,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:13,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:38:13,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:13,898 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:38:13,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:38:13,941 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-10 01:38:13,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:38:13,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 01:38:13,942 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:38:13,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 01:38:13,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 01:38:13,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 01:38:13,943 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand 5 states. [2019-09-10 01:38:14,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:38:14,017 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2019-09-10 01:38:14,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 01:38:14,017 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-09-10 01:38:14,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:38:14,018 INFO L225 Difference]: With dead ends: 85 [2019-09-10 01:38:14,018 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 01:38:14,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 01:38:14,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 01:38:14,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 01:38:14,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 01:38:14,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 01:38:14,019 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2019-09-10 01:38:14,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:38:14,020 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 01:38:14,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 01:38:14,020 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 01:38:14,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 01:38:14,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 01:38:14 BoogieIcfgContainer [2019-09-10 01:38:14,025 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 01:38:14,028 INFO L168 Benchmark]: Toolchain (without parser) took 4353.63 ms. Allocated memory was 140.5 MB in the beginning and 255.9 MB in the end (delta: 115.3 MB). Free memory was 88.7 MB in the beginning and 215.7 MB in the end (delta: -126.9 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-09-10 01:38:14,029 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 140.5 MB. Free memory was 106.9 MB in the beginning and 106.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 01:38:14,030 INFO L168 Benchmark]: CACSL2BoogieTranslator took 433.17 ms. Allocated memory was 140.5 MB in the beginning and 200.8 MB in the end (delta: 60.3 MB). Free memory was 88.5 MB in the beginning and 177.4 MB in the end (delta: -88.9 MB). Peak memory consumption was 20.2 MB. Max. memory is 7.1 GB. [2019-09-10 01:38:14,030 INFO L168 Benchmark]: Boogie Preprocessor took 48.77 ms. Allocated memory is still 200.8 MB. Free memory was 177.4 MB in the beginning and 176.2 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 7.1 GB. [2019-09-10 01:38:14,031 INFO L168 Benchmark]: RCFGBuilder took 416.83 ms. Allocated memory is still 200.8 MB. Free memory was 175.6 MB in the beginning and 156.4 MB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. [2019-09-10 01:38:14,032 INFO L168 Benchmark]: TraceAbstraction took 3450.13 ms. Allocated memory was 200.8 MB in the beginning and 255.9 MB in the end (delta: 55.1 MB). Free memory was 156.4 MB in the beginning and 215.7 MB in the end (delta: -59.2 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-09-10 01:38:14,036 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.22 ms. Allocated memory is still 140.5 MB. Free memory was 106.9 MB in the beginning and 106.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 433.17 ms. Allocated memory was 140.5 MB in the beginning and 200.8 MB in the end (delta: 60.3 MB). Free memory was 88.5 MB in the beginning and 177.4 MB in the end (delta: -88.9 MB). Peak memory consumption was 20.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.77 ms. Allocated memory is still 200.8 MB. Free memory was 177.4 MB in the beginning and 176.2 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 416.83 ms. Allocated memory is still 200.8 MB. Free memory was 175.6 MB in the beginning and 156.4 MB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3450.13 ms. Allocated memory was 200.8 MB in the beginning and 255.9 MB in the end (delta: 55.1 MB). Free memory was 156.4 MB in the beginning and 215.7 MB in the end (delta: -59.2 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 65]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 121]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 49 locations, 2 error locations. SAFE Result, 3.3s OverallTime, 15 OverallIterations, 1 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 842 SDtfs, 1127 SDslu, 1649 SDs, 0 SdLazy, 1085 SolverSat, 112 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=202occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 726 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 446 NumberOfCodeBlocks, 446 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 431 ConstructedInterpolants, 0 QuantifiedInterpolants, 28000 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...