java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/locks/test_locks_7.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:04:19,168 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:04:19,170 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:04:19,183 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:04:19,183 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:04:19,185 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:04:19,186 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:04:19,188 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:04:19,190 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:04:19,191 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:04:19,192 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:04:19,193 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:04:19,193 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:04:19,194 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:04:19,195 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:04:19,196 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:04:19,197 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:04:19,198 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:04:19,200 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:04:19,202 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:04:19,203 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:04:19,204 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:04:19,205 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:04:19,206 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:04:19,208 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:04:19,209 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:04:19,209 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:04:19,210 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:04:19,210 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:04:19,211 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:04:19,211 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:04:19,213 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:04:19,214 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:04:19,215 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:04:19,216 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:04:19,216 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:04:19,217 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:04:19,217 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:04:19,217 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:04:19,218 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:04:19,219 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:04:19,220 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:04:19,234 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:04:19,235 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:04:19,236 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:04:19,236 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:04:19,236 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:04:19,237 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:04:19,237 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:04:19,237 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:04:19,237 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:04:19,237 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:04:19,238 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:04:19,238 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:04:19,238 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:04:19,238 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:04:19,238 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:04:19,239 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:04:19,239 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:04:19,239 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:04:19,239 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:04:19,239 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:04:19,240 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:04:19,240 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:04:19,240 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:04:19,240 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:04:19,241 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:04:19,241 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:04:19,241 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:04:19,241 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:04:19,241 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:04:19,551 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:04:19,572 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:04:19,577 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:04:19,578 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:04:19,579 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:04:19,580 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_7.c [2019-10-15 01:04:19,656 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e6a0aea9/9234e3ebb5c24b24906338b013e62b50/FLAGc1752b6dd [2019-10-15 01:04:20,135 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:04:20,136 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c [2019-10-15 01:04:20,148 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e6a0aea9/9234e3ebb5c24b24906338b013e62b50/FLAGc1752b6dd [2019-10-15 01:04:20,499 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e6a0aea9/9234e3ebb5c24b24906338b013e62b50 [2019-10-15 01:04:20,511 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:04:20,513 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:04:20,514 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:04:20,514 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:04:20,519 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:04:20,520 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:04:20" (1/1) ... [2019-10-15 01:04:20,523 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6332a30e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:20, skipping insertion in model container [2019-10-15 01:04:20,524 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:04:20" (1/1) ... [2019-10-15 01:04:20,531 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:04:20,560 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:04:20,764 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:04:20,768 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:04:20,790 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:04:20,803 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:04:20,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:20 WrapperNode [2019-10-15 01:04:20,803 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:04:20,804 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:04:20,804 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:04:20,804 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:04:20,902 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:20" (1/1) ... [2019-10-15 01:04:20,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:20" (1/1) ... [2019-10-15 01:04:20,908 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:20" (1/1) ... [2019-10-15 01:04:20,908 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:20" (1/1) ... [2019-10-15 01:04:20,913 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:20" (1/1) ... [2019-10-15 01:04:20,920 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:20" (1/1) ... [2019-10-15 01:04:20,921 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:20" (1/1) ... [2019-10-15 01:04:20,925 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:04:20,925 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:04:20,926 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:04:20,926 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:04:20,927 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:04:20,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:04:20,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:04:20,982 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:04:20,982 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:04:20,982 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:04:20,982 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:04:20,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:04:20,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:04:21,265 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:04:21,266 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 01:04:21,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:04:21 BoogieIcfgContainer [2019-10-15 01:04:21,270 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:04:21,271 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:04:21,272 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:04:21,281 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:04:21,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:04:20" (1/3) ... [2019-10-15 01:04:21,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10d12a9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:04:21, skipping insertion in model container [2019-10-15 01:04:21,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:20" (2/3) ... [2019-10-15 01:04:21,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10d12a9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:04:21, skipping insertion in model container [2019-10-15 01:04:21,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:04:21" (3/3) ... [2019-10-15 01:04:21,288 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2019-10-15 01:04:21,304 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:04:21,319 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:04:21,336 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:04:21,357 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:04:21,357 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:04:21,357 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:04:21,357 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:04:21,358 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:04:21,358 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:04:21,358 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:04:21,358 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:04:21,375 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-10-15 01:04:21,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-15 01:04:21,381 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:21,382 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:21,384 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:21,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:21,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1819770524, now seen corresponding path program 1 times [2019-10-15 01:04:21,396 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:21,396 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476531214] [2019-10-15 01:04:21,396 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:21,396 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:21,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:21,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:21,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:21,563 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476531214] [2019-10-15 01:04:21,565 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:21,565 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:21,565 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255029500] [2019-10-15 01:04:21,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:21,572 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:21,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:21,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:21,589 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2019-10-15 01:04:21,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:21,646 INFO L93 Difference]: Finished difference Result 69 states and 114 transitions. [2019-10-15 01:04:21,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:21,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-15 01:04:21,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:21,659 INFO L225 Difference]: With dead ends: 69 [2019-10-15 01:04:21,660 INFO L226 Difference]: Without dead ends: 54 [2019-10-15 01:04:21,663 INFO L600 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-10-15 01:04:21,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-15 01:04:21,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2019-10-15 01:04:21,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-15 01:04:21,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 65 transitions. [2019-10-15 01:04:21,705 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 65 transitions. Word has length 17 [2019-10-15 01:04:21,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:21,706 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 65 transitions. [2019-10-15 01:04:21,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:21,706 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 65 transitions. [2019-10-15 01:04:21,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-15 01:04:21,708 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:21,708 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:21,708 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:21,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:21,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1426743514, now seen corresponding path program 1 times [2019-10-15 01:04:21,709 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:21,710 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860917678] [2019-10-15 01:04:21,710 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:21,710 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:21,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:21,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:21,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:21,778 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860917678] [2019-10-15 01:04:21,778 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:21,780 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:21,781 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730647838] [2019-10-15 01:04:21,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:21,783 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:21,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:21,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:21,786 INFO L87 Difference]: Start difference. First operand 38 states and 65 transitions. Second operand 3 states. [2019-10-15 01:04:21,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:21,832 INFO L93 Difference]: Finished difference Result 87 states and 152 transitions. [2019-10-15 01:04:21,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:21,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-15 01:04:21,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:21,835 INFO L225 Difference]: With dead ends: 87 [2019-10-15 01:04:21,835 INFO L226 Difference]: Without dead ends: 54 [2019-10-15 01:04:21,837 INFO L600 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-10-15 01:04:21,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-15 01:04:21,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2019-10-15 01:04:21,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-15 01:04:21,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 89 transitions. [2019-10-15 01:04:21,850 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 89 transitions. Word has length 17 [2019-10-15 01:04:21,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:21,850 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 89 transitions. [2019-10-15 01:04:21,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:21,851 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 89 transitions. [2019-10-15 01:04:21,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-15 01:04:21,853 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:21,854 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:21,854 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:21,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:21,855 INFO L82 PathProgramCache]: Analyzing trace with hash 578525748, now seen corresponding path program 1 times [2019-10-15 01:04:21,855 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:21,855 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575911764] [2019-10-15 01:04:21,856 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:21,856 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:21,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:21,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:21,929 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575911764] [2019-10-15 01:04:21,929 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:21,930 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:21,930 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915722777] [2019-10-15 01:04:21,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:21,931 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:21,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:21,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:21,932 INFO L87 Difference]: Start difference. First operand 52 states and 89 transitions. Second operand 3 states. [2019-10-15 01:04:21,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:21,972 INFO L93 Difference]: Finished difference Result 81 states and 135 transitions. [2019-10-15 01:04:21,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:21,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-15 01:04:21,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:21,975 INFO L225 Difference]: With dead ends: 81 [2019-10-15 01:04:21,976 INFO L226 Difference]: Without dead ends: 57 [2019-10-15 01:04:21,979 INFO L600 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-10-15 01:04:21,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-15 01:04:21,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2019-10-15 01:04:21,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-15 01:04:21,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 91 transitions. [2019-10-15 01:04:21,998 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 91 transitions. Word has length 18 [2019-10-15 01:04:21,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:21,999 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 91 transitions. [2019-10-15 01:04:22,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:22,002 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 91 transitions. [2019-10-15 01:04:22,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-15 01:04:22,003 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:22,003 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:22,003 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:22,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:22,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1279590326, now seen corresponding path program 1 times [2019-10-15 01:04:22,005 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:22,006 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431452902] [2019-10-15 01:04:22,006 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:22,006 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:22,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:22,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:22,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:22,073 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431452902] [2019-10-15 01:04:22,073 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:22,073 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:22,074 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737116039] [2019-10-15 01:04:22,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:22,075 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:22,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:22,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:22,076 INFO L87 Difference]: Start difference. First operand 55 states and 91 transitions. Second operand 3 states. [2019-10-15 01:04:22,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:22,116 INFO L93 Difference]: Finished difference Result 100 states and 168 transitions. [2019-10-15 01:04:22,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:22,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-15 01:04:22,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:22,119 INFO L225 Difference]: With dead ends: 100 [2019-10-15 01:04:22,119 INFO L226 Difference]: Without dead ends: 98 [2019-10-15 01:04:22,120 INFO L600 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-10-15 01:04:22,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-10-15 01:04:22,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 72. [2019-10-15 01:04:22,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-15 01:04:22,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 120 transitions. [2019-10-15 01:04:22,130 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 120 transitions. Word has length 18 [2019-10-15 01:04:22,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:22,131 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 120 transitions. [2019-10-15 01:04:22,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:22,131 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 120 transitions. [2019-10-15 01:04:22,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-15 01:04:22,132 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:22,132 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:22,133 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:22,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:22,133 INFO L82 PathProgramCache]: Analyzing trace with hash 886563316, now seen corresponding path program 1 times [2019-10-15 01:04:22,133 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:22,134 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679277884] [2019-10-15 01:04:22,134 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:22,134 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:22,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:22,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:22,181 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679277884] [2019-10-15 01:04:22,182 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:22,182 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:22,183 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781144957] [2019-10-15 01:04:22,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:22,184 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:22,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:22,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:22,186 INFO L87 Difference]: Start difference. First operand 72 states and 120 transitions. Second operand 3 states. [2019-10-15 01:04:22,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:22,213 INFO L93 Difference]: Finished difference Result 164 states and 278 transitions. [2019-10-15 01:04:22,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:22,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-15 01:04:22,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:22,215 INFO L225 Difference]: With dead ends: 164 [2019-10-15 01:04:22,215 INFO L226 Difference]: Without dead ends: 100 [2019-10-15 01:04:22,216 INFO L600 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-10-15 01:04:22,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-10-15 01:04:22,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2019-10-15 01:04:22,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-10-15 01:04:22,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 162 transitions. [2019-10-15 01:04:22,227 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 162 transitions. Word has length 18 [2019-10-15 01:04:22,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:22,227 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 162 transitions. [2019-10-15 01:04:22,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:22,228 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 162 transitions. [2019-10-15 01:04:22,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-15 01:04:22,229 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:22,229 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:22,229 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:22,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:22,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1012809135, now seen corresponding path program 1 times [2019-10-15 01:04:22,230 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:22,230 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685946800] [2019-10-15 01:04:22,230 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:22,231 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:22,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:22,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:22,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:22,259 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685946800] [2019-10-15 01:04:22,260 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:22,260 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:22,260 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364398568] [2019-10-15 01:04:22,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:22,261 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:22,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:22,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:22,263 INFO L87 Difference]: Start difference. First operand 98 states and 162 transitions. Second operand 3 states. [2019-10-15 01:04:22,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:22,291 INFO L93 Difference]: Finished difference Result 147 states and 241 transitions. [2019-10-15 01:04:22,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:22,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-15 01:04:22,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:22,293 INFO L225 Difference]: With dead ends: 147 [2019-10-15 01:04:22,293 INFO L226 Difference]: Without dead ends: 102 [2019-10-15 01:04:22,294 INFO L600 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-10-15 01:04:22,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-10-15 01:04:22,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2019-10-15 01:04:22,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-10-15 01:04:22,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 162 transitions. [2019-10-15 01:04:22,304 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 162 transitions. Word has length 19 [2019-10-15 01:04:22,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:22,305 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 162 transitions. [2019-10-15 01:04:22,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:22,305 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 162 transitions. [2019-10-15 01:04:22,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-15 01:04:22,306 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:22,307 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:22,307 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:22,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:22,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1713873713, now seen corresponding path program 1 times [2019-10-15 01:04:22,308 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:22,308 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995626301] [2019-10-15 01:04:22,308 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:22,308 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:22,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:22,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:22,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:22,337 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995626301] [2019-10-15 01:04:22,337 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:22,337 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:22,337 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220032788] [2019-10-15 01:04:22,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:22,338 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:22,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:22,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:22,339 INFO L87 Difference]: Start difference. First operand 100 states and 162 transitions. Second operand 3 states. [2019-10-15 01:04:22,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:22,361 INFO L93 Difference]: Finished difference Result 180 states and 296 transitions. [2019-10-15 01:04:22,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:22,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-15 01:04:22,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:22,364 INFO L225 Difference]: With dead ends: 180 [2019-10-15 01:04:22,364 INFO L226 Difference]: Without dead ends: 178 [2019-10-15 01:04:22,365 INFO L600 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-10-15 01:04:22,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-10-15 01:04:22,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 136. [2019-10-15 01:04:22,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-10-15 01:04:22,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 218 transitions. [2019-10-15 01:04:22,388 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 218 transitions. Word has length 19 [2019-10-15 01:04:22,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:22,389 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 218 transitions. [2019-10-15 01:04:22,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:22,389 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 218 transitions. [2019-10-15 01:04:22,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-15 01:04:22,391 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:22,391 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:22,391 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:22,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:22,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1320846703, now seen corresponding path program 1 times [2019-10-15 01:04:22,392 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:22,393 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451348969] [2019-10-15 01:04:22,393 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:22,393 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:22,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:22,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:22,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:22,429 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451348969] [2019-10-15 01:04:22,430 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:22,430 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:22,430 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431452620] [2019-10-15 01:04:22,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:22,431 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:22,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:22,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:22,432 INFO L87 Difference]: Start difference. First operand 136 states and 218 transitions. Second operand 3 states. [2019-10-15 01:04:22,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:22,469 INFO L93 Difference]: Finished difference Result 312 states and 504 transitions. [2019-10-15 01:04:22,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:22,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-15 01:04:22,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:22,474 INFO L225 Difference]: With dead ends: 312 [2019-10-15 01:04:22,474 INFO L226 Difference]: Without dead ends: 186 [2019-10-15 01:04:22,476 INFO L600 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-10-15 01:04:22,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-10-15 01:04:22,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2019-10-15 01:04:22,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-10-15 01:04:22,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 290 transitions. [2019-10-15 01:04:22,490 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 290 transitions. Word has length 19 [2019-10-15 01:04:22,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:22,493 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 290 transitions. [2019-10-15 01:04:22,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:22,494 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 290 transitions. [2019-10-15 01:04:22,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-15 01:04:22,510 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:22,510 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:22,510 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:22,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:22,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1590692585, now seen corresponding path program 1 times [2019-10-15 01:04:22,511 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:22,511 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9949763] [2019-10-15 01:04:22,512 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:22,512 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:22,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:22,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:22,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:22,566 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9949763] [2019-10-15 01:04:22,566 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:22,566 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:22,566 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870344513] [2019-10-15 01:04:22,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:22,567 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:22,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:22,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:22,568 INFO L87 Difference]: Start difference. First operand 184 states and 290 transitions. Second operand 3 states. [2019-10-15 01:04:22,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:22,584 INFO L93 Difference]: Finished difference Result 276 states and 432 transitions. [2019-10-15 01:04:22,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:22,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-15 01:04:22,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:22,586 INFO L225 Difference]: With dead ends: 276 [2019-10-15 01:04:22,586 INFO L226 Difference]: Without dead ends: 190 [2019-10-15 01:04:22,587 INFO L600 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-10-15 01:04:22,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-10-15 01:04:22,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2019-10-15 01:04:22,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-10-15 01:04:22,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 290 transitions. [2019-10-15 01:04:22,598 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 290 transitions. Word has length 20 [2019-10-15 01:04:22,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:22,598 INFO L462 AbstractCegarLoop]: Abstraction has 188 states and 290 transitions. [2019-10-15 01:04:22,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:22,598 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 290 transitions. [2019-10-15 01:04:22,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-15 01:04:22,600 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:22,600 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:22,600 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:22,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:22,601 INFO L82 PathProgramCache]: Analyzing trace with hash -2003210133, now seen corresponding path program 1 times [2019-10-15 01:04:22,601 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:22,601 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449924345] [2019-10-15 01:04:22,601 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:22,601 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:22,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:22,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:22,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:22,634 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449924345] [2019-10-15 01:04:22,634 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:22,634 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:22,635 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816798007] [2019-10-15 01:04:22,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:22,635 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:22,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:22,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:22,636 INFO L87 Difference]: Start difference. First operand 188 states and 290 transitions. Second operand 3 states. [2019-10-15 01:04:22,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:22,660 INFO L93 Difference]: Finished difference Result 332 states and 520 transitions. [2019-10-15 01:04:22,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:22,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-15 01:04:22,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:22,663 INFO L225 Difference]: With dead ends: 332 [2019-10-15 01:04:22,663 INFO L226 Difference]: Without dead ends: 330 [2019-10-15 01:04:22,664 INFO L600 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-10-15 01:04:22,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-10-15 01:04:22,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 264. [2019-10-15 01:04:22,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-10-15 01:04:22,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 398 transitions. [2019-10-15 01:04:22,675 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 398 transitions. Word has length 20 [2019-10-15 01:04:22,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:22,676 INFO L462 AbstractCegarLoop]: Abstraction has 264 states and 398 transitions. [2019-10-15 01:04:22,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:22,676 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 398 transitions. [2019-10-15 01:04:22,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-15 01:04:22,677 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:22,678 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:22,678 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:22,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:22,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1898730153, now seen corresponding path program 1 times [2019-10-15 01:04:22,678 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:22,679 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756684027] [2019-10-15 01:04:22,679 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:22,679 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:22,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:22,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:22,732 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756684027] [2019-10-15 01:04:22,733 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:22,733 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:22,733 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951495456] [2019-10-15 01:04:22,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:22,735 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:22,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:22,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:22,735 INFO L87 Difference]: Start difference. First operand 264 states and 398 transitions. Second operand 3 states. [2019-10-15 01:04:22,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:22,768 INFO L93 Difference]: Finished difference Result 604 states and 912 transitions. [2019-10-15 01:04:22,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:22,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-15 01:04:22,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:22,771 INFO L225 Difference]: With dead ends: 604 [2019-10-15 01:04:22,772 INFO L226 Difference]: Without dead ends: 354 [2019-10-15 01:04:22,773 INFO L600 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-10-15 01:04:22,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-10-15 01:04:22,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 352. [2019-10-15 01:04:22,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-10-15 01:04:22,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 518 transitions. [2019-10-15 01:04:22,787 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 518 transitions. Word has length 20 [2019-10-15 01:04:22,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:22,787 INFO L462 AbstractCegarLoop]: Abstraction has 352 states and 518 transitions. [2019-10-15 01:04:22,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:22,787 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 518 transitions. [2019-10-15 01:04:22,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-15 01:04:22,789 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:22,789 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:22,790 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:22,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:22,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1969756604, now seen corresponding path program 1 times [2019-10-15 01:04:22,791 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:22,791 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246472696] [2019-10-15 01:04:22,791 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:22,791 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:22,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:22,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:22,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:22,841 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246472696] [2019-10-15 01:04:22,841 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:22,842 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:22,842 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465507116] [2019-10-15 01:04:22,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:22,843 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:22,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:22,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:22,843 INFO L87 Difference]: Start difference. First operand 352 states and 518 transitions. Second operand 3 states. [2019-10-15 01:04:22,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:22,871 INFO L93 Difference]: Finished difference Result 528 states and 772 transitions. [2019-10-15 01:04:22,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:22,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-15 01:04:22,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:22,874 INFO L225 Difference]: With dead ends: 528 [2019-10-15 01:04:22,874 INFO L226 Difference]: Without dead ends: 362 [2019-10-15 01:04:22,875 INFO L600 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-10-15 01:04:22,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-10-15 01:04:22,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 360. [2019-10-15 01:04:22,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-10-15 01:04:22,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 518 transitions. [2019-10-15 01:04:22,889 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 518 transitions. Word has length 21 [2019-10-15 01:04:22,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:22,892 INFO L462 AbstractCegarLoop]: Abstraction has 360 states and 518 transitions. [2019-10-15 01:04:22,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:22,892 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 518 transitions. [2019-10-15 01:04:22,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-15 01:04:22,895 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:22,895 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:22,895 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:22,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:22,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1268692026, now seen corresponding path program 1 times [2019-10-15 01:04:22,896 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:22,897 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874105998] [2019-10-15 01:04:22,897 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:22,898 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:22,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:22,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:22,940 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874105998] [2019-10-15 01:04:22,940 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:22,940 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:22,941 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133495567] [2019-10-15 01:04:22,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:22,942 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:22,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:22,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:22,943 INFO L87 Difference]: Start difference. First operand 360 states and 518 transitions. Second operand 3 states. [2019-10-15 01:04:22,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:22,976 INFO L93 Difference]: Finished difference Result 620 states and 904 transitions. [2019-10-15 01:04:22,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:22,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-15 01:04:22,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:22,982 INFO L225 Difference]: With dead ends: 620 [2019-10-15 01:04:22,982 INFO L226 Difference]: Without dead ends: 618 [2019-10-15 01:04:22,982 INFO L600 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-10-15 01:04:22,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-10-15 01:04:22,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 520. [2019-10-15 01:04:22,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2019-10-15 01:04:23,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 726 transitions. [2019-10-15 01:04:23,001 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 726 transitions. Word has length 21 [2019-10-15 01:04:23,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:23,001 INFO L462 AbstractCegarLoop]: Abstraction has 520 states and 726 transitions. [2019-10-15 01:04:23,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:23,001 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 726 transitions. [2019-10-15 01:04:23,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-15 01:04:23,003 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:23,003 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:23,003 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:23,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:23,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1661719036, now seen corresponding path program 1 times [2019-10-15 01:04:23,004 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:23,004 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042386682] [2019-10-15 01:04:23,004 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:23,005 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:23,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:23,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:23,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:23,021 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042386682] [2019-10-15 01:04:23,021 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:23,021 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:23,022 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351724614] [2019-10-15 01:04:23,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:23,022 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:23,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:23,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:23,023 INFO L87 Difference]: Start difference. First operand 520 states and 726 transitions. Second operand 3 states. [2019-10-15 01:04:23,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:23,048 INFO L93 Difference]: Finished difference Result 1180 states and 1640 transitions. [2019-10-15 01:04:23,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:23,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-15 01:04:23,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:23,052 INFO L225 Difference]: With dead ends: 1180 [2019-10-15 01:04:23,052 INFO L226 Difference]: Without dead ends: 682 [2019-10-15 01:04:23,054 INFO L600 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-10-15 01:04:23,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2019-10-15 01:04:23,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 680. [2019-10-15 01:04:23,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2019-10-15 01:04:23,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 918 transitions. [2019-10-15 01:04:23,077 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 918 transitions. Word has length 21 [2019-10-15 01:04:23,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:23,077 INFO L462 AbstractCegarLoop]: Abstraction has 680 states and 918 transitions. [2019-10-15 01:04:23,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:23,077 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 918 transitions. [2019-10-15 01:04:23,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-15 01:04:23,079 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:23,079 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:23,079 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:23,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:23,080 INFO L82 PathProgramCache]: Analyzing trace with hash -674531426, now seen corresponding path program 1 times [2019-10-15 01:04:23,080 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:23,080 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180906321] [2019-10-15 01:04:23,080 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:23,081 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:23,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:23,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:23,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:23,104 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180906321] [2019-10-15 01:04:23,104 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:23,104 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:23,104 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243045113] [2019-10-15 01:04:23,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:23,105 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:23,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:23,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:23,106 INFO L87 Difference]: Start difference. First operand 680 states and 918 transitions. Second operand 3 states. [2019-10-15 01:04:23,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:23,148 INFO L93 Difference]: Finished difference Result 1020 states and 1368 transitions. [2019-10-15 01:04:23,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:23,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-15 01:04:23,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:23,154 INFO L225 Difference]: With dead ends: 1020 [2019-10-15 01:04:23,154 INFO L226 Difference]: Without dead ends: 698 [2019-10-15 01:04:23,158 INFO L600 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-10-15 01:04:23,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2019-10-15 01:04:23,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 696. [2019-10-15 01:04:23,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2019-10-15 01:04:23,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 918 transitions. [2019-10-15 01:04:23,186 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 918 transitions. Word has length 22 [2019-10-15 01:04:23,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:23,187 INFO L462 AbstractCegarLoop]: Abstraction has 696 states and 918 transitions. [2019-10-15 01:04:23,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:23,187 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 918 transitions. [2019-10-15 01:04:23,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-15 01:04:23,189 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:23,189 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:23,189 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:23,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:23,190 INFO L82 PathProgramCache]: Analyzing trace with hash 26533152, now seen corresponding path program 1 times [2019-10-15 01:04:23,190 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:23,190 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279017691] [2019-10-15 01:04:23,191 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:23,191 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:23,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:23,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-10-15 01:04:23,222 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279017691] [2019-10-15 01:04:23,222 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:23,222 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:23,222 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053960391] [2019-10-15 01:04:23,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:23,225 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:23,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:23,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:23,226 INFO L87 Difference]: Start difference. First operand 696 states and 918 transitions. Second operand 3 states. [2019-10-15 01:04:23,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:23,272 INFO L93 Difference]: Finished difference Result 1164 states and 1544 transitions. [2019-10-15 01:04:23,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:23,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-15 01:04:23,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:23,281 INFO L225 Difference]: With dead ends: 1164 [2019-10-15 01:04:23,282 INFO L226 Difference]: Without dead ends: 1162 [2019-10-15 01:04:23,283 INFO L600 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-10-15 01:04:23,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2019-10-15 01:04:23,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1032. [2019-10-15 01:04:23,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1032 states. [2019-10-15 01:04:23,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1318 transitions. [2019-10-15 01:04:23,345 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1318 transitions. Word has length 22 [2019-10-15 01:04:23,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:23,345 INFO L462 AbstractCegarLoop]: Abstraction has 1032 states and 1318 transitions. [2019-10-15 01:04:23,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:23,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1318 transitions. [2019-10-15 01:04:23,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-15 01:04:23,354 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:23,354 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:23,355 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:23,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:23,356 INFO L82 PathProgramCache]: Analyzing trace with hash -366493858, now seen corresponding path program 1 times [2019-10-15 01:04:23,356 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:23,356 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749018708] [2019-10-15 01:04:23,356 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:23,357 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:23,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:23,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:23,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:23,392 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749018708] [2019-10-15 01:04:23,392 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:23,393 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:23,393 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030864379] [2019-10-15 01:04:23,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:23,395 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:23,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:23,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:23,396 INFO L87 Difference]: Start difference. First operand 1032 states and 1318 transitions. Second operand 3 states. [2019-10-15 01:04:23,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:23,463 INFO L93 Difference]: Finished difference Result 2316 states and 2920 transitions. [2019-10-15 01:04:23,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:23,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-15 01:04:23,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:23,473 INFO L225 Difference]: With dead ends: 2316 [2019-10-15 01:04:23,474 INFO L226 Difference]: Without dead ends: 1322 [2019-10-15 01:04:23,478 INFO L600 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-10-15 01:04:23,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2019-10-15 01:04:23,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1320. [2019-10-15 01:04:23,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1320 states. [2019-10-15 01:04:23,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1606 transitions. [2019-10-15 01:04:23,574 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1606 transitions. Word has length 22 [2019-10-15 01:04:23,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:23,574 INFO L462 AbstractCegarLoop]: Abstraction has 1320 states and 1606 transitions. [2019-10-15 01:04:23,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:23,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1606 transitions. [2019-10-15 01:04:23,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-15 01:04:23,577 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:23,577 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:23,578 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:23,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:23,578 INFO L82 PathProgramCache]: Analyzing trace with hash 822743769, now seen corresponding path program 1 times [2019-10-15 01:04:23,579 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:23,579 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557448948] [2019-10-15 01:04:23,579 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:23,580 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:23,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:23,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:23,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:23,613 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557448948] [2019-10-15 01:04:23,613 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:23,614 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:23,614 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490617455] [2019-10-15 01:04:23,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:23,615 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:23,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:23,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:23,616 INFO L87 Difference]: Start difference. First operand 1320 states and 1606 transitions. Second operand 3 states. [2019-10-15 01:04:23,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:23,672 INFO L93 Difference]: Finished difference Result 1980 states and 2392 transitions. [2019-10-15 01:04:23,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:23,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-15 01:04:23,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:23,680 INFO L225 Difference]: With dead ends: 1980 [2019-10-15 01:04:23,681 INFO L226 Difference]: Without dead ends: 1354 [2019-10-15 01:04:23,683 INFO L600 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-10-15 01:04:23,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2019-10-15 01:04:23,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1352. [2019-10-15 01:04:23,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2019-10-15 01:04:23,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1606 transitions. [2019-10-15 01:04:23,749 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1606 transitions. Word has length 23 [2019-10-15 01:04:23,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:23,751 INFO L462 AbstractCegarLoop]: Abstraction has 1352 states and 1606 transitions. [2019-10-15 01:04:23,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:23,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1606 transitions. [2019-10-15 01:04:23,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-15 01:04:23,756 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:23,756 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:23,756 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:23,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:23,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1523808347, now seen corresponding path program 1 times [2019-10-15 01:04:23,757 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:23,758 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489650409] [2019-10-15 01:04:23,758 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:23,758 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:23,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:23,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:23,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:23,794 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489650409] [2019-10-15 01:04:23,794 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:23,795 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:23,795 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369528440] [2019-10-15 01:04:23,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:23,796 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:23,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:23,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:23,797 INFO L87 Difference]: Start difference. First operand 1352 states and 1606 transitions. Second operand 3 states. [2019-10-15 01:04:23,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:23,861 INFO L93 Difference]: Finished difference Result 2186 states and 2567 transitions. [2019-10-15 01:04:23,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:23,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-15 01:04:23,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:23,872 INFO L225 Difference]: With dead ends: 2186 [2019-10-15 01:04:23,873 INFO L226 Difference]: Without dead ends: 2184 [2019-10-15 01:04:23,874 INFO L600 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-10-15 01:04:23,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2184 states. [2019-10-15 01:04:23,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2184 to 2056. [2019-10-15 01:04:23,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2019-10-15 01:04:23,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 2374 transitions. [2019-10-15 01:04:23,949 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 2374 transitions. Word has length 23 [2019-10-15 01:04:23,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:23,950 INFO L462 AbstractCegarLoop]: Abstraction has 2056 states and 2374 transitions. [2019-10-15 01:04:23,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:23,950 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2374 transitions. [2019-10-15 01:04:23,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-15 01:04:23,955 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:23,955 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:23,955 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:23,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:23,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1130781337, now seen corresponding path program 1 times [2019-10-15 01:04:23,956 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:23,956 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271996744] [2019-10-15 01:04:23,956 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:23,956 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:23,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:23,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:23,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:23,980 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271996744] [2019-10-15 01:04:23,980 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:23,980 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:23,980 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363050842] [2019-10-15 01:04:23,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:23,981 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:23,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:23,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:23,981 INFO L87 Difference]: Start difference. First operand 2056 states and 2374 transitions. Second operand 3 states. [2019-10-15 01:04:24,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:24,050 INFO L93 Difference]: Finished difference Result 4552 states and 5126 transitions. [2019-10-15 01:04:24,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:24,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-15 01:04:24,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:24,052 INFO L225 Difference]: With dead ends: 4552 [2019-10-15 01:04:24,052 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 01:04:24,059 INFO L600 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-10-15 01:04:24,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 01:04:24,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 01:04:24,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 01:04:24,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 01:04:24,060 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-10-15 01:04:24,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:24,060 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 01:04:24,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:24,061 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 01:04:24,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 01:04:24,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 01:04:24,085 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-15 01:04:24,085 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:04:24,085 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:04:24,085 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-15 01:04:24,085 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 01:04:24,085 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 01:04:24,085 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 121) no Hoare annotation was computed. [2019-10-15 01:04:24,086 INFO L443 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-10-15 01:04:24,086 INFO L443 ceAbstractionStarter]: For program point L86-1(lines 30 116) no Hoare annotation was computed. [2019-10-15 01:04:24,086 INFO L446 ceAbstractionStarter]: At program point L111-1(lines 30 116) the Hoare annotation is: true [2019-10-15 01:04:24,086 INFO L443 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-10-15 01:04:24,086 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-10-15 01:04:24,086 INFO L439 ceAbstractionStarter]: At program point L112-1(lines 5 121) the Hoare annotation is: false [2019-10-15 01:04:24,086 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 121) no Hoare annotation was computed. [2019-10-15 01:04:24,086 INFO L443 ceAbstractionStarter]: For program point L71-1(lines 30 116) no Hoare annotation was computed. [2019-10-15 01:04:24,087 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 30 116) no Hoare annotation was computed. [2019-10-15 01:04:24,087 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 30 116) no Hoare annotation was computed. [2019-10-15 01:04:24,087 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 121) the Hoare annotation is: true [2019-10-15 01:04:24,087 INFO L443 ceAbstractionStarter]: For program point L55-1(lines 30 116) no Hoare annotation was computed. [2019-10-15 01:04:24,087 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 119) no Hoare annotation was computed. [2019-10-15 01:04:24,087 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-10-15 01:04:24,087 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 30 116) no Hoare annotation was computed. [2019-10-15 01:04:24,088 INFO L443 ceAbstractionStarter]: For program point L106-1(lines 30 116) no Hoare annotation was computed. [2019-10-15 01:04:24,088 INFO L443 ceAbstractionStarter]: For program point L32(lines 32 34) no Hoare annotation was computed. [2019-10-15 01:04:24,088 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-10-15 01:04:24,089 INFO L443 ceAbstractionStarter]: For program point L107(line 107) no Hoare annotation was computed. [2019-10-15 01:04:24,089 INFO L443 ceAbstractionStarter]: For program point L91-1(lines 30 116) no Hoare annotation was computed. [2019-10-15 01:04:24,090 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 30 116) no Hoare annotation was computed. [2019-10-15 01:04:24,090 INFO L443 ceAbstractionStarter]: For program point L67-1(lines 30 116) no Hoare annotation was computed. [2019-10-15 01:04:24,090 INFO L443 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2019-10-15 01:04:24,090 INFO L443 ceAbstractionStarter]: For program point L59-1(lines 30 116) no Hoare annotation was computed. [2019-10-15 01:04:24,090 INFO L446 ceAbstractionStarter]: At program point L117(lines 5 121) the Hoare annotation is: true [2019-10-15 01:04:24,090 INFO L443 ceAbstractionStarter]: For program point L51(lines 51 53) no Hoare annotation was computed. [2019-10-15 01:04:24,091 INFO L443 ceAbstractionStarter]: For program point L51-2(lines 30 116) no Hoare annotation was computed. [2019-10-15 01:04:24,091 INFO L443 ceAbstractionStarter]: For program point L101-1(lines 30 116) no Hoare annotation was computed. [2019-10-15 01:04:24,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:04:24 BoogieIcfgContainer [2019-10-15 01:04:24,101 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 01:04:24,108 INFO L168 Benchmark]: Toolchain (without parser) took 3590.65 ms. Allocated memory was 137.4 MB in the beginning and 246.9 MB in the end (delta: 109.6 MB). Free memory was 102.0 MB in the beginning and 111.2 MB in the end (delta: -9.3 MB). Peak memory consumption was 100.3 MB. Max. memory is 7.1 GB. [2019-10-15 01:04:24,110 INFO L168 Benchmark]: CDTParser took 1.37 ms. Allocated memory is still 137.4 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-15 01:04:24,111 INFO L168 Benchmark]: CACSL2BoogieTranslator took 289.60 ms. Allocated memory is still 137.4 MB. Free memory was 101.8 MB in the beginning and 91.6 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2019-10-15 01:04:24,112 INFO L168 Benchmark]: Boogie Preprocessor took 121.04 ms. Allocated memory was 137.4 MB in the beginning and 200.3 MB in the end (delta: 62.9 MB). Free memory was 91.6 MB in the beginning and 178.0 MB in the end (delta: -86.4 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2019-10-15 01:04:24,117 INFO L168 Benchmark]: RCFGBuilder took 344.86 ms. Allocated memory is still 200.3 MB. Free memory was 178.0 MB in the beginning and 161.6 MB in the end (delta: 16.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 7.1 GB. [2019-10-15 01:04:24,121 INFO L168 Benchmark]: TraceAbstraction took 2829.68 ms. Allocated memory was 200.3 MB in the beginning and 246.9 MB in the end (delta: 46.7 MB). Free memory was 160.9 MB in the beginning and 111.2 MB in the end (delta: 49.7 MB). Peak memory consumption was 96.3 MB. Max. memory is 7.1 GB. [2019-10-15 01:04:24,130 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.37 ms. Allocated memory is still 137.4 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 289.60 ms. Allocated memory is still 137.4 MB. Free memory was 101.8 MB in the beginning and 91.6 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 121.04 ms. Allocated memory was 137.4 MB in the beginning and 200.3 MB in the end (delta: 62.9 MB). Free memory was 91.6 MB in the beginning and 178.0 MB in the end (delta: -86.4 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 344.86 ms. Allocated memory is still 200.3 MB. Free memory was 178.0 MB in the beginning and 161.6 MB in the end (delta: 16.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2829.68 ms. Allocated memory was 200.3 MB in the beginning and 246.9 MB in the end (delta: 46.7 MB). Free memory was 160.9 MB in the beginning and 111.2 MB in the end (delta: 49.7 MB). Peak memory consumption was 96.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 119]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 35 locations, 1 error locations. Result: SAFE, OverallTime: 2.7s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1238 SDtfs, 574 SDslu, 829 SDs, 0 SdLazy, 107 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2056occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 530 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 138 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 403 NumberOfCodeBlocks, 403 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 383 ConstructedInterpolants, 0 QuantifiedInterpolants, 13856 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...