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+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 01:38:00,800 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 01:38:00,802 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 01:38:00,819 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 01:38:00,820 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 01:38:00,821 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 01:38:00,822 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 01:38:00,824 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 01:38:00,827 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 01:38:00,829 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 01:38:00,831 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 01:38:00,832 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 01:38:00,833 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 01:38:00,841 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 01:38:00,843 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 01:38:00,844 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 01:38:00,847 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 01:38:00,847 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 01:38:00,849 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 01:38:00,852 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 01:38:00,854 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 01:38:00,859 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 01:38:00,860 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 01:38:00,861 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 01:38:00,864 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 01:38:00,865 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 01:38:00,865 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 01:38:00,868 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 01:38:00,869 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 01:38:00,869 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 01:38:00,870 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 01:38:00,872 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 01:38:00,873 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 01:38:00,874 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 01:38:00,878 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 01:38:00,878 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 01:38:00,879 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 01:38:00,879 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 01:38:00,879 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 01:38:00,881 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 01:38:00,882 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 01:38:00,884 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:00,910 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 01:38:00,910 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 01:38:00,911 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 01:38:00,911 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 01:38:00,912 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 01:38:00,912 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 01:38:00,912 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 01:38:00,913 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 01:38:00,913 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 01:38:00,913 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 01:38:00,915 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 01:38:00,915 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 01:38:00,915 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 01:38:00,915 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 01:38:00,915 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 01:38:00,916 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 01:38:00,916 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 01:38:00,916 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 01:38:00,916 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 01:38:00,916 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 01:38:00,917 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 01:38:00,917 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 01:38:00,917 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 01:38:00,917 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 01:38:00,917 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 01:38:00,918 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 01:38:00,918 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 01:38:00,918 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 01:38:00,918 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 01:38:00,918 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 01:38:00,962 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 01:38:00,974 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 01:38:00,977 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 01:38:00,978 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 01:38:00,979 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 01:38:00,979 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+lhb-reducer.c [2019-09-10 01:38:01,054 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34d8e405d/c36e8fdc46eb443d81240c979a9d67ca/FLAG45ddc2116 [2019-09-10 01:38:01,536 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 01:38:01,538 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/rlim_invariant.c.v+lhb-reducer.c [2019-09-10 01:38:01,548 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34d8e405d/c36e8fdc46eb443d81240c979a9d67ca/FLAG45ddc2116 [2019-09-10 01:38:01,895 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34d8e405d/c36e8fdc46eb443d81240c979a9d67ca [2019-09-10 01:38:01,911 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 01:38:01,914 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 01:38:01,917 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 01:38:01,917 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 01:38:01,920 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 01:38:01,921 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:38:01" (1/1) ... [2019-09-10 01:38:01,924 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10617abd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:38:01, skipping insertion in model container [2019-09-10 01:38:01,925 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:38:01" (1/1) ... [2019-09-10 01:38:01,932 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 01:38:01,955 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 01:38:02,134 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:38:02,140 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 01:38:02,258 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:38:02,274 INFO L192 MainTranslator]: Completed translation [2019-09-10 01:38:02,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:38:02 WrapperNode [2019-09-10 01:38:02,275 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 01:38:02,275 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 01:38:02,275 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 01:38:02,276 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 01:38:02,289 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:02" (1/1) ... [2019-09-10 01:38:02,290 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:02" (1/1) ... [2019-09-10 01:38:02,297 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:02" (1/1) ... [2019-09-10 01:38:02,297 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:02" (1/1) ... [2019-09-10 01:38:02,304 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:02" (1/1) ... [2019-09-10 01:38:02,309 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:02" (1/1) ... [2019-09-10 01:38:02,310 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:02" (1/1) ... [2019-09-10 01:38:02,312 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 01:38:02,313 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 01:38:02,313 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 01:38:02,313 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 01:38:02,314 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:38:02" (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:02,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 01:38:02,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 01:38:02,366 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 01:38:02,366 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 01:38:02,366 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2019-09-10 01:38:02,366 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 01:38:02,366 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-10 01:38:02,367 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 01:38:02,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 01:38:02,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 01:38:02,716 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 01:38:02,716 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 01:38:02,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:38:02 BoogieIcfgContainer [2019-09-10 01:38:02,718 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 01:38:02,719 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 01:38:02,719 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 01:38:02,722 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 01:38:02,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 01:38:01" (1/3) ... [2019-09-10 01:38:02,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@959b0ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:38:02, skipping insertion in model container [2019-09-10 01:38:02,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:38:02" (2/3) ... [2019-09-10 01:38:02,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@959b0ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:38:02, skipping insertion in model container [2019-09-10 01:38:02,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:38:02" (3/3) ... [2019-09-10 01:38:02,726 INFO L109 eAbstractionObserver]: Analyzing ICFG rlim_invariant.c.v+lhb-reducer.c [2019-09-10 01:38:02,739 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 01:38:02,747 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-09-10 01:38:02,762 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-09-10 01:38:02,789 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 01:38:02,789 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 01:38:02,789 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 01:38:02,790 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 01:38:02,790 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 01:38:02,790 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 01:38:02,790 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 01:38:02,790 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 01:38:02,807 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-09-10 01:38:02,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-10 01:38:02,819 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:38:02,820 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:02,821 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:38:02,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:38:02,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1836001814, now seen corresponding path program 1 times [2019-09-10 01:38:02,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:38:02,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:02,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:38:02,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:02,866 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:38:02,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:38:03,003 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:03,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:38:03,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 01:38:03,006 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:38:03,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 01:38:03,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 01:38:03,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 01:38:03,025 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 4 states. [2019-09-10 01:38:03,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:38:03,109 INFO L93 Difference]: Finished difference Result 72 states and 104 transitions. [2019-09-10 01:38:03,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 01:38:03,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-09-10 01:38:03,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:38:03,120 INFO L225 Difference]: With dead ends: 72 [2019-09-10 01:38:03,120 INFO L226 Difference]: Without dead ends: 66 [2019-09-10 01:38:03,122 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:03,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-10 01:38:03,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 45. [2019-09-10 01:38:03,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-10 01:38:03,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2019-09-10 01:38:03,163 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 20 [2019-09-10 01:38:03,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:38:03,164 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2019-09-10 01:38:03,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 01:38:03,164 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2019-09-10 01:38:03,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-10 01:38:03,166 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:38:03,167 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:03,167 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:38:03,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:38:03,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1751306001, now seen corresponding path program 1 times [2019-09-10 01:38:03,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:38:03,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:03,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:38:03,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:03,174 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:38:03,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:38:03,259 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:03,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:38:03,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 01:38:03,260 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:38:03,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 01:38:03,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 01:38:03,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 01:38:03,262 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand 5 states. [2019-09-10 01:38:03,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:38:03,470 INFO L93 Difference]: Finished difference Result 132 states and 170 transitions. [2019-09-10 01:38:03,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 01:38:03,471 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-09-10 01:38:03,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:38:03,475 INFO L225 Difference]: With dead ends: 132 [2019-09-10 01:38:03,475 INFO L226 Difference]: Without dead ends: 132 [2019-09-10 01:38:03,476 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:03,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-09-10 01:38:03,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 57. [2019-09-10 01:38:03,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-10 01:38:03,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 73 transitions. [2019-09-10 01:38:03,486 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 73 transitions. Word has length 20 [2019-09-10 01:38:03,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:38:03,487 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 73 transitions. [2019-09-10 01:38:03,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 01:38:03,487 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 73 transitions. [2019-09-10 01:38:03,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-10 01:38:03,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:38:03,488 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:38:03,488 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:38:03,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:38:03,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1003312673, now seen corresponding path program 1 times [2019-09-10 01:38:03,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:38:03,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:03,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:38:03,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:03,491 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:38:03,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:38:03,558 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:03,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:38:03,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 01:38:03,559 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:38:03,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 01:38:03,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 01:38:03,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 01:38:03,560 INFO L87 Difference]: Start difference. First operand 57 states and 73 transitions. Second operand 5 states. [2019-09-10 01:38:03,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:38:03,710 INFO L93 Difference]: Finished difference Result 120 states and 149 transitions. [2019-09-10 01:38:03,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 01:38:03,711 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-09-10 01:38:03,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:38:03,713 INFO L225 Difference]: With dead ends: 120 [2019-09-10 01:38:03,713 INFO L226 Difference]: Without dead ends: 120 [2019-09-10 01:38:03,714 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:03,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-09-10 01:38:03,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 91. [2019-09-10 01:38:03,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-10 01:38:03,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 118 transitions. [2019-09-10 01:38:03,725 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 118 transitions. Word has length 21 [2019-09-10 01:38:03,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:38:03,726 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 118 transitions. [2019-09-10 01:38:03,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 01:38:03,726 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 118 transitions. [2019-09-10 01:38:03,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-10 01:38:03,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:38:03,727 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:03,728 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:38:03,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:38:03,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1090927289, now seen corresponding path program 1 times [2019-09-10 01:38:03,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:38:03,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:03,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:38:03,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:03,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:38:03,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:38:03,817 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:03,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:38:03,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 01:38:03,818 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:38:03,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 01:38:03,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 01:38:03,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 01:38:03,820 INFO L87 Difference]: Start difference. First operand 91 states and 118 transitions. Second operand 5 states. [2019-09-10 01:38:03,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:38:03,979 INFO L93 Difference]: Finished difference Result 145 states and 185 transitions. [2019-09-10 01:38:03,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 01:38:03,980 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-09-10 01:38:03,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:38:03,982 INFO L225 Difference]: With dead ends: 145 [2019-09-10 01:38:03,982 INFO L226 Difference]: Without dead ends: 145 [2019-09-10 01:38:03,982 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:03,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-09-10 01:38:03,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 116. [2019-09-10 01:38:03,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-09-10 01:38:03,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 154 transitions. [2019-09-10 01:38:03,992 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 154 transitions. Word has length 21 [2019-09-10 01:38:03,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:38:03,993 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 154 transitions. [2019-09-10 01:38:03,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 01:38:03,993 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 154 transitions. [2019-09-10 01:38:03,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-10 01:38:03,994 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:38:03,994 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:03,995 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:38:03,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:38:03,995 INFO L82 PathProgramCache]: Analyzing trace with hash -2006409081, now seen corresponding path program 1 times [2019-09-10 01:38:03,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:38:03,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:03,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:38:03,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:03,997 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:38:04,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:38:04,094 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:04,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:38:04,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 01:38:04,095 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:38:04,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 01:38:04,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 01:38:04,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 01:38:04,097 INFO L87 Difference]: Start difference. First operand 116 states and 154 transitions. Second operand 6 states. [2019-09-10 01:38:04,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:38:04,294 INFO L93 Difference]: Finished difference Result 223 states and 290 transitions. [2019-09-10 01:38:04,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 01:38:04,295 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-09-10 01:38:04,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:38:04,299 INFO L225 Difference]: With dead ends: 223 [2019-09-10 01:38:04,299 INFO L226 Difference]: Without dead ends: 223 [2019-09-10 01:38:04,299 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:04,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-09-10 01:38:04,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 167. [2019-09-10 01:38:04,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-10 01:38:04,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 227 transitions. [2019-09-10 01:38:04,325 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 227 transitions. Word has length 22 [2019-09-10 01:38:04,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:38:04,326 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 227 transitions. [2019-09-10 01:38:04,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 01:38:04,326 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 227 transitions. [2019-09-10 01:38:04,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-10 01:38:04,327 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:38:04,327 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:04,328 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:38:04,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:38:04,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1479211589, now seen corresponding path program 1 times [2019-09-10 01:38:04,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:38:04,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:04,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:38:04,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:04,331 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:38:04,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:38:04,389 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:04,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:38:04,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 01:38:04,390 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:38:04,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 01:38:04,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 01:38:04,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 01:38:04,391 INFO L87 Difference]: Start difference. First operand 167 states and 227 transitions. Second operand 4 states. [2019-09-10 01:38:04,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:38:04,446 INFO L93 Difference]: Finished difference Result 277 states and 370 transitions. [2019-09-10 01:38:04,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 01:38:04,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-09-10 01:38:04,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:38:04,449 INFO L225 Difference]: With dead ends: 277 [2019-09-10 01:38:04,449 INFO L226 Difference]: Without dead ends: 277 [2019-09-10 01:38:04,450 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:04,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-09-10 01:38:04,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 200. [2019-09-10 01:38:04,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-10 01:38:04,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 278 transitions. [2019-09-10 01:38:04,460 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 278 transitions. Word has length 22 [2019-09-10 01:38:04,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:38:04,461 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 278 transitions. [2019-09-10 01:38:04,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 01:38:04,461 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 278 transitions. [2019-09-10 01:38:04,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-10 01:38:04,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:38:04,463 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:04,464 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:38:04,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:38:04,464 INFO L82 PathProgramCache]: Analyzing trace with hash 362136190, now seen corresponding path program 1 times [2019-09-10 01:38:04,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:38:04,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:04,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:38:04,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:04,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:38:04,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:38:04,517 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:04,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:38:04,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 01:38:04,518 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:38:04,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 01:38:04,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 01:38:04,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:38:04,525 INFO L87 Difference]: Start difference. First operand 200 states and 278 transitions. Second operand 3 states. [2019-09-10 01:38:04,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:38:04,537 INFO L93 Difference]: Finished difference Result 142 states and 170 transitions. [2019-09-10 01:38:04,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 01:38:04,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-09-10 01:38:04,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:38:04,539 INFO L225 Difference]: With dead ends: 142 [2019-09-10 01:38:04,539 INFO L226 Difference]: Without dead ends: 118 [2019-09-10 01:38:04,540 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:04,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-10 01:38:04,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-09-10 01:38:04,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-09-10 01:38:04,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 146 transitions. [2019-09-10 01:38:04,553 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 146 transitions. Word has length 34 [2019-09-10 01:38:04,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:38:04,554 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 146 transitions. [2019-09-10 01:38:04,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 01:38:04,555 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 146 transitions. [2019-09-10 01:38:04,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-10 01:38:04,557 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:38:04,557 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:04,559 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:38:04,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:38:04,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1525173959, now seen corresponding path program 1 times [2019-09-10 01:38:04,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:38:04,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:04,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:38:04,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:04,561 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:38:04,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:38:04,611 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:04,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:38:04,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 01:38:04,612 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:38:04,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 01:38:04,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 01:38:04,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:38:04,613 INFO L87 Difference]: Start difference. First operand 118 states and 146 transitions. Second operand 3 states. [2019-09-10 01:38:04,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:38:04,621 INFO L93 Difference]: Finished difference Result 120 states and 143 transitions. [2019-09-10 01:38:04,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 01:38:04,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-09-10 01:38:04,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:38:04,623 INFO L225 Difference]: With dead ends: 120 [2019-09-10 01:38:04,623 INFO L226 Difference]: Without dead ends: 112 [2019-09-10 01:38:04,623 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:04,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-09-10 01:38:04,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 97. [2019-09-10 01:38:04,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-09-10 01:38:04,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 113 transitions. [2019-09-10 01:38:04,630 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 113 transitions. Word has length 34 [2019-09-10 01:38:04,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:38:04,630 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 113 transitions. [2019-09-10 01:38:04,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 01:38:04,630 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 113 transitions. [2019-09-10 01:38:04,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-10 01:38:04,634 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:38:04,634 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:04,634 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:38:04,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:38:04,635 INFO L82 PathProgramCache]: Analyzing trace with hash 15701630, now seen corresponding path program 1 times [2019-09-10 01:38:04,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:38:04,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:04,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:38:04,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:04,639 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:38:04,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:38:04,700 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:04,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:38:04,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 01:38:04,701 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:38:04,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 01:38:04,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 01:38:04,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 01:38:04,702 INFO L87 Difference]: Start difference. First operand 97 states and 113 transitions. Second operand 4 states. [2019-09-10 01:38:04,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:38:04,725 INFO L93 Difference]: Finished difference Result 163 states and 187 transitions. [2019-09-10 01:38:04,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 01:38:04,725 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-09-10 01:38:04,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:38:04,727 INFO L225 Difference]: With dead ends: 163 [2019-09-10 01:38:04,727 INFO L226 Difference]: Without dead ends: 163 [2019-09-10 01:38:04,727 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:04,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-09-10 01:38:04,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 99. [2019-09-10 01:38:04,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-09-10 01:38:04,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2019-09-10 01:38:04,732 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 34 [2019-09-10 01:38:04,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:38:04,732 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2019-09-10 01:38:04,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 01:38:04,732 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2019-09-10 01:38:04,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-10 01:38:04,733 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:38:04,733 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:04,734 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:38:04,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:38:04,734 INFO L82 PathProgramCache]: Analyzing trace with hash 4618079, now seen corresponding path program 1 times [2019-09-10 01:38:04,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:38:04,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:04,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:38:04,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:04,736 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:38:04,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:38:04,809 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:04,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:38:04,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 01:38:04,810 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:38:04,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 01:38:04,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 01:38:04,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-09-10 01:38:04,811 INFO L87 Difference]: Start difference. First operand 99 states and 113 transitions. Second operand 8 states. [2019-09-10 01:38:05,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:38:05,122 INFO L93 Difference]: Finished difference Result 194 states and 216 transitions. [2019-09-10 01:38:05,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 01:38:05,123 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2019-09-10 01:38:05,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:38:05,124 INFO L225 Difference]: With dead ends: 194 [2019-09-10 01:38:05,124 INFO L226 Difference]: Without dead ends: 194 [2019-09-10 01:38:05,125 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2019-09-10 01:38:05,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-09-10 01:38:05,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 117. [2019-09-10 01:38:05,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-09-10 01:38:05,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 133 transitions. [2019-09-10 01:38:05,130 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 133 transitions. Word has length 35 [2019-09-10 01:38:05,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:38:05,131 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 133 transitions. [2019-09-10 01:38:05,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 01:38:05,131 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 133 transitions. [2019-09-10 01:38:05,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-10 01:38:05,132 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:38:05,132 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:05,132 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:38:05,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:38:05,133 INFO L82 PathProgramCache]: Analyzing trace with hash -345087077, now seen corresponding path program 1 times [2019-09-10 01:38:05,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:38:05,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:05,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:38:05,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:05,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:38:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:38:05,204 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:05,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:38:05,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 01:38:05,205 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:38:05,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 01:38:05,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 01:38:05,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-09-10 01:38:05,206 INFO L87 Difference]: Start difference. First operand 117 states and 133 transitions. Second operand 8 states. [2019-09-10 01:38:05,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:38:05,387 INFO L93 Difference]: Finished difference Result 162 states and 180 transitions. [2019-09-10 01:38:05,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 01:38:05,387 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2019-09-10 01:38:05,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:38:05,388 INFO L225 Difference]: With dead ends: 162 [2019-09-10 01:38:05,388 INFO L226 Difference]: Without dead ends: 162 [2019-09-10 01:38:05,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-09-10 01:38:05,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-10 01:38:05,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 112. [2019-09-10 01:38:05,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-10 01:38:05,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 128 transitions. [2019-09-10 01:38:05,394 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 128 transitions. Word has length 36 [2019-09-10 01:38:05,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:38:05,394 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 128 transitions. [2019-09-10 01:38:05,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 01:38:05,395 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 128 transitions. [2019-09-10 01:38:05,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-10 01:38:05,395 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:38:05,395 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:05,396 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:38:05,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:38:05,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1323182689, now seen corresponding path program 1 times [2019-09-10 01:38:05,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:38:05,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:05,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:38:05,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:05,397 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:38:05,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:38:05,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:05,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:38:05,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 01:38:05,450 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:38:05,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 01:38:05,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 01:38:05,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 01:38:05,451 INFO L87 Difference]: Start difference. First operand 112 states and 128 transitions. Second operand 5 states. [2019-09-10 01:38:05,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:38:05,535 INFO L93 Difference]: Finished difference Result 137 states and 154 transitions. [2019-09-10 01:38:05,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 01:38:05,535 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-09-10 01:38:05,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:38:05,536 INFO L225 Difference]: With dead ends: 137 [2019-09-10 01:38:05,536 INFO L226 Difference]: Without dead ends: 137 [2019-09-10 01:38:05,537 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:05,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-09-10 01:38:05,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 110. [2019-09-10 01:38:05,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-10 01:38:05,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 126 transitions. [2019-09-10 01:38:05,541 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 126 transitions. Word has length 36 [2019-09-10 01:38:05,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:38:05,542 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 126 transitions. [2019-09-10 01:38:05,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 01:38:05,542 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 126 transitions. [2019-09-10 01:38:05,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-10 01:38:05,542 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:38:05,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, 1] [2019-09-10 01:38:05,543 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:38:05,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:38:05,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1595990715, now seen corresponding path program 1 times [2019-09-10 01:38:05,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:38:05,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:05,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:38:05,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:05,546 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:38:05,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:38:05,584 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:05,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:38:05,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 01:38:05,585 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:38:05,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 01:38:05,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 01:38:05,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 01:38:05,586 INFO L87 Difference]: Start difference. First operand 110 states and 126 transitions. Second operand 5 states. [2019-09-10 01:38:05,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:38:05,655 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2019-09-10 01:38:05,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 01:38:05,656 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-09-10 01:38:05,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:38:05,657 INFO L225 Difference]: With dead ends: 109 [2019-09-10 01:38:05,657 INFO L226 Difference]: Without dead ends: 109 [2019-09-10 01:38:05,658 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:05,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-09-10 01:38:05,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 72. [2019-09-10 01:38:05,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-10 01:38:05,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2019-09-10 01:38:05,662 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 36 [2019-09-10 01:38:05,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:38:05,662 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2019-09-10 01:38:05,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 01:38:05,662 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2019-09-10 01:38:05,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-10 01:38:05,663 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:38:05,663 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:05,663 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:38:05,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:38:05,664 INFO L82 PathProgramCache]: Analyzing trace with hash -913881101, now seen corresponding path program 1 times [2019-09-10 01:38:05,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:38:05,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:05,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:38:05,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:05,665 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:38:05,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:38:05,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:38:05,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:38:05,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 01:38:05,727 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:38:05,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 01:38:05,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 01:38:05,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-10 01:38:05,729 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand 9 states. [2019-09-10 01:38:06,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:38:06,025 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2019-09-10 01:38:06,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 01:38:06,026 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2019-09-10 01:38:06,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:38:06,027 INFO L225 Difference]: With dead ends: 111 [2019-09-10 01:38:06,027 INFO L226 Difference]: Without dead ends: 111 [2019-09-10 01:38:06,027 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:06,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-09-10 01:38:06,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 86. [2019-09-10 01:38:06,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-09-10 01:38:06,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2019-09-10 01:38:06,031 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 37 [2019-09-10 01:38:06,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:38:06,032 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2019-09-10 01:38:06,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 01:38:06,032 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2019-09-10 01:38:06,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-10 01:38:06,032 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:38:06,032 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:06,033 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:38:06,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:38:06,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1575647861, now seen corresponding path program 1 times [2019-09-10 01:38:06,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:38:06,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:06,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:38:06,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:38:06,035 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:38:06,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:38:06,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-10 01:38:06,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:38:06,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 01:38:06,077 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:38:06,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 01:38:06,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 01:38:06,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 01:38:06,078 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand 5 states. [2019-09-10 01:38:06,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:38:06,148 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2019-09-10 01:38:06,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 01:38:06,149 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-09-10 01:38:06,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:38:06,150 INFO L225 Difference]: With dead ends: 85 [2019-09-10 01:38:06,150 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 01:38:06,151 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:06,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 01:38:06,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 01:38:06,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 01:38:06,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 01:38:06,152 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2019-09-10 01:38:06,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:38:06,153 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 01:38:06,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 01:38:06,153 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 01:38:06,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 01:38:06,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 01:38:06 BoogieIcfgContainer [2019-09-10 01:38:06,159 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 01:38:06,161 INFO L168 Benchmark]: Toolchain (without parser) took 4248.10 ms. Allocated memory was 133.7 MB in the beginning and 258.5 MB in the end (delta: 124.8 MB). Free memory was 89.5 MB in the beginning and 90.3 MB in the end (delta: -861.6 kB). Peak memory consumption was 123.9 MB. Max. memory is 7.1 GB. [2019-09-10 01:38:06,162 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 133.7 MB. Free memory was 108.1 MB in the beginning and 107.9 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:06,163 INFO L168 Benchmark]: CACSL2BoogieTranslator took 358.27 ms. Allocated memory was 133.7 MB in the beginning and 199.8 MB in the end (delta: 66.1 MB). Free memory was 89.3 MB in the beginning and 175.8 MB in the end (delta: -86.5 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. [2019-09-10 01:38:06,164 INFO L168 Benchmark]: Boogie Preprocessor took 37.05 ms. Allocated memory is still 199.8 MB. Free memory was 175.8 MB in the beginning and 173.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-09-10 01:38:06,164 INFO L168 Benchmark]: RCFGBuilder took 405.25 ms. Allocated memory is still 199.8 MB. Free memory was 173.9 MB in the beginning and 155.0 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB. [2019-09-10 01:38:06,165 INFO L168 Benchmark]: TraceAbstraction took 3439.88 ms. Allocated memory was 199.8 MB in the beginning and 258.5 MB in the end (delta: 58.7 MB). Free memory was 155.0 MB in the beginning and 90.3 MB in the end (delta: 64.6 MB). Peak memory consumption was 123.3 MB. Max. memory is 7.1 GB. [2019-09-10 01:38:06,169 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.17 ms. Allocated memory is still 133.7 MB. Free memory was 108.1 MB in the beginning and 107.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 358.27 ms. Allocated memory was 133.7 MB in the beginning and 199.8 MB in the end (delta: 66.1 MB). Free memory was 89.3 MB in the beginning and 175.8 MB in the end (delta: -86.5 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.05 ms. Allocated memory is still 199.8 MB. Free memory was 175.8 MB in the beginning and 173.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 405.25 ms. Allocated memory is still 199.8 MB. Free memory was 173.9 MB in the beginning and 155.0 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3439.88 ms. Allocated memory was 199.8 MB in the beginning and 258.5 MB in the end (delta: 58.7 MB). Free memory was 155.0 MB in the beginning and 90.3 MB in the end (delta: 64.6 MB). Peak memory consumption was 123.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 62]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 118]: 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, 47 locations, 2 error locations. SAFE Result, 3.3s OverallTime, 15 OverallIterations, 1 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 846 SDtfs, 1086 SDslu, 1672 SDs, 0 SdLazy, 1056 SolverSat, 113 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=200occurred in iteration=6, 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, 582 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 445 NumberOfCodeBlocks, 445 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 430 ConstructedInterpolants, 0 QuantifiedInterpolants, 27931 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...