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_9.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:04:20,145 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:04:20,147 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:04:20,161 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:04:20,162 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:04:20,164 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:04:20,166 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:04:20,175 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:04:20,177 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:04:20,179 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:04:20,180 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:04:20,182 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:04:20,182 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:04:20,185 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:04:20,186 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:04:20,187 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:04:20,189 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:04:20,192 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:04:20,193 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:04:20,199 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:04:20,203 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:04:20,204 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:04:20,207 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:04:20,208 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:04:20,210 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:04:20,211 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:04:20,211 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:04:20,213 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:04:20,215 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:04:20,216 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:04:20,216 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:04:20,217 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:04:20,217 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:04:20,218 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:04:20,219 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:04:20,219 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:04:20,220 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:04:20,220 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:04:20,220 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:04:20,221 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:04:20,222 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:04:20,222 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:20,239 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:04:20,239 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:04:20,241 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:04:20,242 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:04:20,242 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:04:20,242 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:04:20,242 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:04:20,243 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:04:20,243 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:04:20,243 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:04:20,244 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:04:20,244 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:04:20,245 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:04:20,245 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:04:20,245 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:04:20,245 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:04:20,246 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:04:20,246 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:04:20,246 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:04:20,246 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:04:20,247 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:04:20,247 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:04:20,247 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:04:20,247 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:04:20,247 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:04:20,248 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:04:20,248 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:04:20,248 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:04:20,248 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:20,537 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:04:20,552 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:04:20,557 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:04:20,558 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:04:20,558 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:04:20,559 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_9.c [2019-10-15 01:04:20,624 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4938917c7/8088fa0018bc4bf79ac6fffcf98e4293/FLAG854ebf857 [2019-10-15 01:04:21,098 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:04:21,099 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_9.c [2019-10-15 01:04:21,109 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4938917c7/8088fa0018bc4bf79ac6fffcf98e4293/FLAG854ebf857 [2019-10-15 01:04:21,470 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4938917c7/8088fa0018bc4bf79ac6fffcf98e4293 [2019-10-15 01:04:21,480 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:04:21,482 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:04:21,483 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:04:21,483 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:04:21,487 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:04:21,488 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:04:21" (1/1) ... [2019-10-15 01:04:21,491 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20e56ca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:21, skipping insertion in model container [2019-10-15 01:04:21,491 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:04:21" (1/1) ... [2019-10-15 01:04:21,499 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:04:21,532 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:04:21,738 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:04:21,743 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:04:21,778 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:04:21,792 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:04:21,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:21 WrapperNode [2019-10-15 01:04:21,792 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:04:21,793 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:04:21,793 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:04:21,793 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:04:21,883 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:21" (1/1) ... [2019-10-15 01:04:21,883 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:21" (1/1) ... [2019-10-15 01:04:21,888 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:21" (1/1) ... [2019-10-15 01:04:21,889 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:21" (1/1) ... [2019-10-15 01:04:21,894 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:21" (1/1) ... [2019-10-15 01:04:21,901 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:21" (1/1) ... [2019-10-15 01:04:21,907 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:21" (1/1) ... [2019-10-15 01:04:21,909 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:04:21,910 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:04:21,910 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:04:21,910 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:04:21,915 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:21" (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:21,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:04:21,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:04:21,969 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:04:21,969 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:04:21,969 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:04:21,970 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:04:21,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:04:21,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:04:22,299 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:04:22,300 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 01:04:22,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:04:22 BoogieIcfgContainer [2019-10-15 01:04:22,301 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:04:22,302 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:04:22,303 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:04:22,320 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:04:22,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:04:21" (1/3) ... [2019-10-15 01:04:22,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61588e45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:04:22, skipping insertion in model container [2019-10-15 01:04:22,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:21" (2/3) ... [2019-10-15 01:04:22,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61588e45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:04:22, skipping insertion in model container [2019-10-15 01:04:22,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:04:22" (3/3) ... [2019-10-15 01:04:22,326 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_9.c [2019-10-15 01:04:22,336 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:04:22,343 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:04:22,353 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:04:22,378 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:04:22,378 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:04:22,378 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:04:22,378 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:04:22,378 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:04:22,379 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:04:22,379 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:04:22,379 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:04:22,398 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2019-10-15 01:04:22,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-15 01:04:22,404 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:22,405 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,407 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:22,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:22,413 INFO L82 PathProgramCache]: Analyzing trace with hash 691982780, now seen corresponding path program 1 times [2019-10-15 01:04:22,421 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:22,422 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454852791] [2019-10-15 01:04:22,422 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:22,422 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:22,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:22,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:22,603 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,604 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454852791] [2019-10-15 01:04:22,605 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:22,606 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:22,606 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504088951] [2019-10-15 01:04:22,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:22,612 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:22,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:22,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:22,630 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 3 states. [2019-10-15 01:04:22,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:22,697 INFO L93 Difference]: Finished difference Result 81 states and 138 transitions. [2019-10-15 01:04:22,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:22,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-15 01:04:22,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:22,713 INFO L225 Difference]: With dead ends: 81 [2019-10-15 01:04:22,713 INFO L226 Difference]: Without dead ends: 66 [2019-10-15 01:04:22,717 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,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-15 01:04:22,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-10-15 01:04:22,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-15 01:04:22,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 81 transitions. [2019-10-15 01:04:22,766 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 81 transitions. Word has length 19 [2019-10-15 01:04:22,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:22,767 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 81 transitions. [2019-10-15 01:04:22,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:22,767 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 81 transitions. [2019-10-15 01:04:22,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-15 01:04:22,768 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:22,769 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,769 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:22,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:22,770 INFO L82 PathProgramCache]: Analyzing trace with hash 950148218, now seen corresponding path program 1 times [2019-10-15 01:04:22,770 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:22,771 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479809905] [2019-10-15 01:04:22,771 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:22,771 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:22,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:22,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:22,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:22,855 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479809905] [2019-10-15 01:04:22,855 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:22,855 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:22,856 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88408401] [2019-10-15 01:04:22,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:22,858 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:22,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:22,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:22,859 INFO L87 Difference]: Start difference. First operand 46 states and 81 transitions. Second operand 3 states. [2019-10-15 01:04:22,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:22,898 INFO L93 Difference]: Finished difference Result 107 states and 192 transitions. [2019-10-15 01:04:22,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:22,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-15 01:04:22,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:22,901 INFO L225 Difference]: With dead ends: 107 [2019-10-15 01:04:22,901 INFO L226 Difference]: Without dead ends: 66 [2019-10-15 01:04:22,902 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,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-15 01:04:22,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-10-15 01:04:22,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-15 01:04:22,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 113 transitions. [2019-10-15 01:04:22,914 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 113 transitions. Word has length 19 [2019-10-15 01:04:22,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:22,915 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 113 transitions. [2019-10-15 01:04:22,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:22,915 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 113 transitions. [2019-10-15 01:04:22,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-15 01:04:22,916 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:22,916 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,917 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:22,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:22,917 INFO L82 PathProgramCache]: Analyzing trace with hash -23156596, now seen corresponding path program 1 times [2019-10-15 01:04:22,918 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:22,918 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722677448] [2019-10-15 01:04:22,918 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:22,918 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:22,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:22,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:22,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:22,994 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722677448] [2019-10-15 01:04:22,994 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:22,995 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:22,995 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246582565] [2019-10-15 01:04:22,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:22,998 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:22,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:22,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:22,999 INFO L87 Difference]: Start difference. First operand 64 states and 113 transitions. Second operand 3 states. [2019-10-15 01:04:23,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:23,046 INFO L93 Difference]: Finished difference Result 99 states and 171 transitions. [2019-10-15 01:04:23,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:23,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-15 01:04:23,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:23,049 INFO L225 Difference]: With dead ends: 99 [2019-10-15 01:04:23,050 INFO L226 Difference]: Without dead ends: 69 [2019-10-15 01:04:23,050 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,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-15 01:04:23,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2019-10-15 01:04:23,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-15 01:04:23,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 115 transitions. [2019-10-15 01:04:23,062 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 115 transitions. Word has length 20 [2019-10-15 01:04:23,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:23,063 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 115 transitions. [2019-10-15 01:04:23,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:23,063 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 115 transitions. [2019-10-15 01:04:23,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-15 01:04:23,064 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:23,065 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:23,065 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:23,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:23,065 INFO L82 PathProgramCache]: Analyzing trace with hash -609962610, now seen corresponding path program 1 times [2019-10-15 01:04:23,066 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:23,066 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893980537] [2019-10-15 01:04:23,066 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:23,067 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:23,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:23,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:23,116 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,117 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893980537] [2019-10-15 01:04:23,117 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:23,117 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:23,118 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439274365] [2019-10-15 01:04:23,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:23,118 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:23,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:23,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:23,119 INFO L87 Difference]: Start difference. First operand 67 states and 115 transitions. Second operand 3 states. [2019-10-15 01:04:23,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:23,145 INFO L93 Difference]: Finished difference Result 124 states and 216 transitions. [2019-10-15 01:04:23,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:23,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-15 01:04:23,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:23,148 INFO L225 Difference]: With dead ends: 124 [2019-10-15 01:04:23,148 INFO L226 Difference]: Without dead ends: 122 [2019-10-15 01:04:23,149 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,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-10-15 01:04:23,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 88. [2019-10-15 01:04:23,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-15 01:04:23,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 152 transitions. [2019-10-15 01:04:23,164 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 152 transitions. Word has length 20 [2019-10-15 01:04:23,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:23,165 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 152 transitions. [2019-10-15 01:04:23,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:23,167 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 152 transitions. [2019-10-15 01:04:23,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-15 01:04:23,169 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:23,169 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:23,169 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:23,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:23,169 INFO L82 PathProgramCache]: Analyzing trace with hash -351797172, now seen corresponding path program 1 times [2019-10-15 01:04:23,170 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:23,170 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623061520] [2019-10-15 01:04:23,171 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:23,171 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:23,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:23,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:23,216 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,216 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623061520] [2019-10-15 01:04:23,217 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:23,217 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:23,217 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761522090] [2019-10-15 01:04:23,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:23,218 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:23,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:23,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:23,219 INFO L87 Difference]: Start difference. First operand 88 states and 152 transitions. Second operand 3 states. [2019-10-15 01:04:23,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:23,243 INFO L93 Difference]: Finished difference Result 204 states and 358 transitions. [2019-10-15 01:04:23,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:23,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-15 01:04:23,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:23,247 INFO L225 Difference]: With dead ends: 204 [2019-10-15 01:04:23,247 INFO L226 Difference]: Without dead ends: 124 [2019-10-15 01:04:23,248 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,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-10-15 01:04:23,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2019-10-15 01:04:23,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-10-15 01:04:23,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 210 transitions. [2019-10-15 01:04:23,266 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 210 transitions. Word has length 20 [2019-10-15 01:04:23,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:23,267 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 210 transitions. [2019-10-15 01:04:23,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:23,267 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 210 transitions. [2019-10-15 01:04:23,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-15 01:04:23,268 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:23,268 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,269 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:23,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:23,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1728757681, now seen corresponding path program 1 times [2019-10-15 01:04:23,269 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:23,270 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197405332] [2019-10-15 01:04:23,270 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:23,270 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:23,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:23,320 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,321 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197405332] [2019-10-15 01:04:23,321 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:23,321 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:23,322 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254442454] [2019-10-15 01:04:23,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:23,322 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:23,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:23,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:23,324 INFO L87 Difference]: Start difference. First operand 122 states and 210 transitions. Second operand 3 states. [2019-10-15 01:04:23,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:23,355 INFO L93 Difference]: Finished difference Result 183 states and 313 transitions. [2019-10-15 01:04:23,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:23,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-15 01:04:23,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:23,358 INFO L225 Difference]: With dead ends: 183 [2019-10-15 01:04:23,359 INFO L226 Difference]: Without dead ends: 126 [2019-10-15 01:04:23,359 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,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-10-15 01:04:23,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2019-10-15 01:04:23,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-10-15 01:04:23,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 210 transitions. [2019-10-15 01:04:23,384 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 210 transitions. Word has length 21 [2019-10-15 01:04:23,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:23,387 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 210 transitions. [2019-10-15 01:04:23,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:23,387 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 210 transitions. [2019-10-15 01:04:23,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-15 01:04:23,388 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:23,388 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,389 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:23,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:23,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1979403601, now seen corresponding path program 1 times [2019-10-15 01:04:23,390 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:23,390 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511648257] [2019-10-15 01:04:23,390 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:23,390 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:23,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:23,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:23,461 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,462 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511648257] [2019-10-15 01:04:23,462 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:23,463 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:23,463 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011379299] [2019-10-15 01:04:23,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:23,464 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:23,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:23,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:23,465 INFO L87 Difference]: Start difference. First operand 124 states and 210 transitions. Second operand 3 states. [2019-10-15 01:04:23,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:23,494 INFO L93 Difference]: Finished difference Result 228 states and 392 transitions. [2019-10-15 01:04:23,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:23,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-15 01:04:23,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:23,498 INFO L225 Difference]: With dead ends: 228 [2019-10-15 01:04:23,498 INFO L226 Difference]: Without dead ends: 226 [2019-10-15 01:04:23,499 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,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-10-15 01:04:23,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 168. [2019-10-15 01:04:23,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-10-15 01:04:23,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 282 transitions. [2019-10-15 01:04:23,523 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 282 transitions. Word has length 21 [2019-10-15 01:04:23,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:23,524 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 282 transitions. [2019-10-15 01:04:23,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:23,524 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 282 transitions. [2019-10-15 01:04:23,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-15 01:04:23,528 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:23,528 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,530 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:23,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:23,531 INFO L82 PathProgramCache]: Analyzing trace with hash -2057398257, now seen corresponding path program 1 times [2019-10-15 01:04:23,531 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:23,531 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904764048] [2019-10-15 01:04:23,531 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:23,532 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:23,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:23,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:23,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:23,610 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904764048] [2019-10-15 01:04:23,610 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:23,611 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:23,611 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672494828] [2019-10-15 01:04:23,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:23,612 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:23,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:23,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:23,613 INFO L87 Difference]: Start difference. First operand 168 states and 282 transitions. Second operand 3 states. [2019-10-15 01:04:23,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:23,659 INFO L93 Difference]: Finished difference Result 392 states and 664 transitions. [2019-10-15 01:04:23,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:23,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-15 01:04:23,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:23,662 INFO L225 Difference]: With dead ends: 392 [2019-10-15 01:04:23,662 INFO L226 Difference]: Without dead ends: 234 [2019-10-15 01:04:23,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:23,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-10-15 01:04:23,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 232. [2019-10-15 01:04:23,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-15 01:04:23,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 386 transitions. [2019-10-15 01:04:23,689 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 386 transitions. Word has length 21 [2019-10-15 01:04:23,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:23,689 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 386 transitions. [2019-10-15 01:04:23,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:23,690 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 386 transitions. [2019-10-15 01:04:23,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-15 01:04:23,691 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:23,692 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,692 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:23,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:23,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1232183873, now seen corresponding path program 1 times [2019-10-15 01:04:23,693 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:23,693 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535082877] [2019-10-15 01:04:23,695 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:23,695 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:23,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:23,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:23,753 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,753 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535082877] [2019-10-15 01:04:23,754 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:23,754 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:23,754 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129833019] [2019-10-15 01:04:23,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:23,755 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:23,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:23,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:23,755 INFO L87 Difference]: Start difference. First operand 232 states and 386 transitions. Second operand 3 states. [2019-10-15 01:04:23,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:23,773 INFO L93 Difference]: Finished difference Result 348 states and 576 transitions. [2019-10-15 01:04:23,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:23,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-15 01:04:23,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:23,775 INFO L225 Difference]: With dead ends: 348 [2019-10-15 01:04:23,776 INFO L226 Difference]: Without dead ends: 238 [2019-10-15 01:04:23,777 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,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-10-15 01:04:23,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2019-10-15 01:04:23,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-10-15 01:04:23,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 386 transitions. [2019-10-15 01:04:23,786 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 386 transitions. Word has length 22 [2019-10-15 01:04:23,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:23,787 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 386 transitions. [2019-10-15 01:04:23,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:23,787 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 386 transitions. [2019-10-15 01:04:23,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-15 01:04:23,788 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:23,788 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,788 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:23,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:23,789 INFO L82 PathProgramCache]: Analyzing trace with hash 645377859, now seen corresponding path program 1 times [2019-10-15 01:04:23,789 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:23,789 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607571059] [2019-10-15 01:04:23,789 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:23,790 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:23,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:23,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:23,814 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,814 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607571059] [2019-10-15 01:04:23,815 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:23,815 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:23,817 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652416751] [2019-10-15 01:04:23,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:23,818 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:23,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:23,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:23,821 INFO L87 Difference]: Start difference. First operand 236 states and 386 transitions. Second operand 3 states. [2019-10-15 01:04:23,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:23,864 INFO L93 Difference]: Finished difference Result 428 states and 712 transitions. [2019-10-15 01:04:23,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:23,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-15 01:04:23,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:23,868 INFO L225 Difference]: With dead ends: 428 [2019-10-15 01:04:23,868 INFO L226 Difference]: Without dead ends: 426 [2019-10-15 01:04:23,869 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,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2019-10-15 01:04:23,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 328. [2019-10-15 01:04:23,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-10-15 01:04:23,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 526 transitions. [2019-10-15 01:04:23,885 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 526 transitions. Word has length 22 [2019-10-15 01:04:23,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:23,887 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 526 transitions. [2019-10-15 01:04:23,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:23,887 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 526 transitions. [2019-10-15 01:04:23,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-15 01:04:23,891 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:23,891 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,891 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:23,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:23,892 INFO L82 PathProgramCache]: Analyzing trace with hash 903543297, now seen corresponding path program 1 times [2019-10-15 01:04:23,892 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:23,892 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180906321] [2019-10-15 01:04:23,893 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:23,893 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:23,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:23,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:23,922 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,922 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180906321] [2019-10-15 01:04:23,922 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:23,922 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:23,923 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243045113] [2019-10-15 01:04:23,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:23,924 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:23,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:23,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:23,925 INFO L87 Difference]: Start difference. First operand 328 states and 526 transitions. Second operand 3 states. [2019-10-15 01:04:23,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:23,961 INFO L93 Difference]: Finished difference Result 764 states and 1232 transitions. [2019-10-15 01:04:23,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:23,961 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-15 01:04:23,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:23,964 INFO L225 Difference]: With dead ends: 764 [2019-10-15 01:04:23,964 INFO L226 Difference]: Without dead ends: 450 [2019-10-15 01:04:23,966 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,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-10-15 01:04:23,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 448. [2019-10-15 01:04:23,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-10-15 01:04:23,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 710 transitions. [2019-10-15 01:04:23,987 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 710 transitions. Word has length 22 [2019-10-15 01:04:23,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:23,987 INFO L462 AbstractCegarLoop]: Abstraction has 448 states and 710 transitions. [2019-10-15 01:04:23,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:23,987 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 710 transitions. [2019-10-15 01:04:23,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-15 01:04:23,988 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:23,989 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,989 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:23,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:23,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1467908124, now seen corresponding path program 1 times [2019-10-15 01:04:23,989 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:23,990 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251321977] [2019-10-15 01:04:23,990 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:23,990 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:23,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:23,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:24,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:24,021 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251321977] [2019-10-15 01:04:24,021 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:24,022 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:24,022 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359628307] [2019-10-15 01:04:24,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:24,023 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:24,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:24,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:24,024 INFO L87 Difference]: Start difference. First operand 448 states and 710 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 672 states and 1060 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,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:24,054 INFO L225 Difference]: With dead ends: 672 [2019-10-15 01:04:24,055 INFO L226 Difference]: Without dead ends: 458 [2019-10-15 01:04:24,056 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,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-10-15 01:04:24,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 456. [2019-10-15 01:04:24,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-10-15 01:04:24,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 710 transitions. [2019-10-15 01:04:24,075 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 710 transitions. Word has length 23 [2019-10-15 01:04:24,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:24,075 INFO L462 AbstractCegarLoop]: Abstraction has 456 states and 710 transitions. [2019-10-15 01:04:24,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:24,075 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 710 transitions. [2019-10-15 01:04:24,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-15 01:04:24,077 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:24,077 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:24,078 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:24,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:24,078 INFO L82 PathProgramCache]: Analyzing trace with hash -2054714138, now seen corresponding path program 1 times [2019-10-15 01:04:24,078 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:24,079 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749018708] [2019-10-15 01:04:24,079 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:24,079 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:24,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:24,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:24,121 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:24,121 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749018708] [2019-10-15 01:04:24,122 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:24,122 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:24,124 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030864379] [2019-10-15 01:04:24,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:24,124 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:24,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:24,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:24,128 INFO L87 Difference]: Start difference. First operand 456 states and 710 transitions. Second operand 3 states. [2019-10-15 01:04:24,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:24,155 INFO L93 Difference]: Finished difference Result 812 states and 1288 transitions. [2019-10-15 01:04:24,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:24,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-15 01:04:24,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:24,164 INFO L225 Difference]: With dead ends: 812 [2019-10-15 01:04:24,165 INFO L226 Difference]: Without dead ends: 810 [2019-10-15 01:04:24,165 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,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2019-10-15 01:04:24,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 648. [2019-10-15 01:04:24,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-10-15 01:04:24,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 982 transitions. [2019-10-15 01:04:24,186 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 982 transitions. Word has length 23 [2019-10-15 01:04:24,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:24,186 INFO L462 AbstractCegarLoop]: Abstraction has 648 states and 982 transitions. [2019-10-15 01:04:24,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:24,186 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 982 transitions. [2019-10-15 01:04:24,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-15 01:04:24,188 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:24,188 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:24,188 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:24,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:24,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1796548700, now seen corresponding path program 1 times [2019-10-15 01:04:24,189 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:24,189 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657068878] [2019-10-15 01:04:24,189 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:24,189 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:24,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:24,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:24,218 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:24,219 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657068878] [2019-10-15 01:04:24,219 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:24,219 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:24,219 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060697057] [2019-10-15 01:04:24,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:24,220 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:24,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:24,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:24,221 INFO L87 Difference]: Start difference. First operand 648 states and 982 transitions. Second operand 3 states. [2019-10-15 01:04:24,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:24,247 INFO L93 Difference]: Finished difference Result 1500 states and 2280 transitions. [2019-10-15 01:04:24,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:24,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-15 01:04:24,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:24,251 INFO L225 Difference]: With dead ends: 1500 [2019-10-15 01:04:24,252 INFO L226 Difference]: Without dead ends: 874 [2019-10-15 01:04:24,253 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,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2019-10-15 01:04:24,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 872. [2019-10-15 01:04:24,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2019-10-15 01:04:24,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1302 transitions. [2019-10-15 01:04:24,282 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1302 transitions. Word has length 23 [2019-10-15 01:04:24,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:24,283 INFO L462 AbstractCegarLoop]: Abstraction has 872 states and 1302 transitions. [2019-10-15 01:04:24,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:24,283 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1302 transitions. [2019-10-15 01:04:24,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-15 01:04:24,285 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:24,285 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:24,285 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:24,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:24,286 INFO L82 PathProgramCache]: Analyzing trace with hash 728586230, now seen corresponding path program 1 times [2019-10-15 01:04:24,286 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:24,286 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524358061] [2019-10-15 01:04:24,286 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:24,286 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:24,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:24,302 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:24,302 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524358061] [2019-10-15 01:04:24,302 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:24,303 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:24,303 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005714780] [2019-10-15 01:04:24,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:24,304 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:24,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:24,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:24,304 INFO L87 Difference]: Start difference. First operand 872 states and 1302 transitions. Second operand 3 states. [2019-10-15 01:04:24,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:24,333 INFO L93 Difference]: Finished difference Result 1308 states and 1944 transitions. [2019-10-15 01:04:24,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:24,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-15 01:04:24,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:24,339 INFO L225 Difference]: With dead ends: 1308 [2019-10-15 01:04:24,339 INFO L226 Difference]: Without dead ends: 890 [2019-10-15 01:04:24,340 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,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2019-10-15 01:04:24,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 888. [2019-10-15 01:04:24,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2019-10-15 01:04:24,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1302 transitions. [2019-10-15 01:04:24,375 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1302 transitions. Word has length 24 [2019-10-15 01:04:24,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:24,376 INFO L462 AbstractCegarLoop]: Abstraction has 888 states and 1302 transitions. [2019-10-15 01:04:24,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:24,376 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1302 transitions. [2019-10-15 01:04:24,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-15 01:04:24,379 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:24,379 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:24,379 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:24,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:24,380 INFO L82 PathProgramCache]: Analyzing trace with hash 141780216, now seen corresponding path program 1 times [2019-10-15 01:04:24,380 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:24,381 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46582126] [2019-10-15 01:04:24,381 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:24,381 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:24,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:24,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:24,411 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:24,411 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46582126] [2019-10-15 01:04:24,411 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:24,412 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:24,412 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399940245] [2019-10-15 01:04:24,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:24,413 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:24,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:24,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:24,414 INFO L87 Difference]: Start difference. First operand 888 states and 1302 transitions. Second operand 3 states. [2019-10-15 01:04:24,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:24,465 INFO L93 Difference]: Finished difference Result 1548 states and 2312 transitions. [2019-10-15 01:04:24,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:24,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-15 01:04:24,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:24,476 INFO L225 Difference]: With dead ends: 1548 [2019-10-15 01:04:24,476 INFO L226 Difference]: Without dead ends: 1546 [2019-10-15 01:04:24,477 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,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2019-10-15 01:04:24,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1288. [2019-10-15 01:04:24,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1288 states. [2019-10-15 01:04:24,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1830 transitions. [2019-10-15 01:04:24,561 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1830 transitions. Word has length 24 [2019-10-15 01:04:24,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:24,562 INFO L462 AbstractCegarLoop]: Abstraction has 1288 states and 1830 transitions. [2019-10-15 01:04:24,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:24,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1830 transitions. [2019-10-15 01:04:24,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-15 01:04:24,566 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:24,567 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:24,567 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:24,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:24,568 INFO L82 PathProgramCache]: Analyzing trace with hash 399945654, now seen corresponding path program 1 times [2019-10-15 01:04:24,568 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:24,568 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892652619] [2019-10-15 01:04:24,569 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:24,569 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:24,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:24,607 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:24,608 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892652619] [2019-10-15 01:04:24,608 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:24,608 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:24,609 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943296461] [2019-10-15 01:04:24,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:24,610 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:24,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:24,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:24,611 INFO L87 Difference]: Start difference. First operand 1288 states and 1830 transitions. Second operand 3 states. [2019-10-15 01:04:24,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:24,672 INFO L93 Difference]: Finished difference Result 2956 states and 4200 transitions. [2019-10-15 01:04:24,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:24,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-15 01:04:24,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:24,681 INFO L225 Difference]: With dead ends: 2956 [2019-10-15 01:04:24,681 INFO L226 Difference]: Without dead ends: 1706 [2019-10-15 01:04:24,684 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,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2019-10-15 01:04:24,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1704. [2019-10-15 01:04:24,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1704 states. [2019-10-15 01:04:24,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 2374 transitions. [2019-10-15 01:04:24,743 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 2374 transitions. Word has length 24 [2019-10-15 01:04:24,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:24,744 INFO L462 AbstractCegarLoop]: Abstraction has 1704 states and 2374 transitions. [2019-10-15 01:04:24,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:24,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 2374 transitions. [2019-10-15 01:04:24,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 01:04:24,747 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:24,747 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:24,747 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:24,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:24,748 INFO L82 PathProgramCache]: Analyzing trace with hash 100434809, now seen corresponding path program 1 times [2019-10-15 01:04:24,748 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:24,749 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007449860] [2019-10-15 01:04:24,749 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:24,749 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:24,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:24,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:24,774 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:24,775 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007449860] [2019-10-15 01:04:24,775 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:24,775 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:24,775 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750494427] [2019-10-15 01:04:24,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:24,776 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:24,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:24,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:24,780 INFO L87 Difference]: Start difference. First operand 1704 states and 2374 transitions. Second operand 3 states. [2019-10-15 01:04:24,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:24,821 INFO L93 Difference]: Finished difference Result 2556 states and 3544 transitions. [2019-10-15 01:04:24,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:24,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-15 01:04:24,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:24,831 INFO L225 Difference]: With dead ends: 2556 [2019-10-15 01:04:24,831 INFO L226 Difference]: Without dead ends: 1738 [2019-10-15 01:04:24,834 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,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2019-10-15 01:04:24,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1736. [2019-10-15 01:04:24,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1736 states. [2019-10-15 01:04:24,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1736 states and 2374 transitions. [2019-10-15 01:04:24,891 INFO L78 Accepts]: Start accepts. Automaton has 1736 states and 2374 transitions. Word has length 25 [2019-10-15 01:04:24,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:24,891 INFO L462 AbstractCegarLoop]: Abstraction has 1736 states and 2374 transitions. [2019-10-15 01:04:24,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:24,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1736 states and 2374 transitions. [2019-10-15 01:04:24,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 01:04:24,895 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:24,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, 1, 1, 1, 1] [2019-10-15 01:04:24,895 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:24,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:24,896 INFO L82 PathProgramCache]: Analyzing trace with hash -486371205, now seen corresponding path program 1 times [2019-10-15 01:04:24,896 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:24,896 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420462290] [2019-10-15 01:04:24,896 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:24,896 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:24,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:24,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:24,918 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:24,918 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420462290] [2019-10-15 01:04:24,918 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:24,919 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:24,919 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530073133] [2019-10-15 01:04:24,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:24,921 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:24,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:24,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:24,922 INFO L87 Difference]: Start difference. First operand 1736 states and 2374 transitions. Second operand 3 states. [2019-10-15 01:04:24,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:24,979 INFO L93 Difference]: Finished difference Result 2956 states and 4104 transitions. [2019-10-15 01:04:24,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:24,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-15 01:04:24,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:24,994 INFO L225 Difference]: With dead ends: 2956 [2019-10-15 01:04:24,995 INFO L226 Difference]: Without dead ends: 2954 [2019-10-15 01:04:24,996 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:25,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2019-10-15 01:04:25,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2568. [2019-10-15 01:04:25,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2568 states. [2019-10-15 01:04:25,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2568 states and 3398 transitions. [2019-10-15 01:04:25,074 INFO L78 Accepts]: Start accepts. Automaton has 2568 states and 3398 transitions. Word has length 25 [2019-10-15 01:04:25,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:25,075 INFO L462 AbstractCegarLoop]: Abstraction has 2568 states and 3398 transitions. [2019-10-15 01:04:25,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:25,075 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 3398 transitions. [2019-10-15 01:04:25,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 01:04:25,080 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:25,080 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:25,081 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:25,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:25,081 INFO L82 PathProgramCache]: Analyzing trace with hash -228205767, now seen corresponding path program 1 times [2019-10-15 01:04:25,082 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:25,082 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639941565] [2019-10-15 01:04:25,082 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:25,082 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:25,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:25,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:25,104 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:25,104 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639941565] [2019-10-15 01:04:25,105 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:25,105 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:25,105 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671940575] [2019-10-15 01:04:25,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:25,106 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:25,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:25,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:25,107 INFO L87 Difference]: Start difference. First operand 2568 states and 3398 transitions. Second operand 3 states. [2019-10-15 01:04:25,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:25,206 INFO L93 Difference]: Finished difference Result 5836 states and 7688 transitions. [2019-10-15 01:04:25,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:25,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-15 01:04:25,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:25,222 INFO L225 Difference]: With dead ends: 5836 [2019-10-15 01:04:25,222 INFO L226 Difference]: Without dead ends: 3338 [2019-10-15 01:04:25,227 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:25,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2019-10-15 01:04:25,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 3336. [2019-10-15 01:04:25,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3336 states. [2019-10-15 01:04:25,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4294 transitions. [2019-10-15 01:04:25,326 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4294 transitions. Word has length 25 [2019-10-15 01:04:25,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:25,326 INFO L462 AbstractCegarLoop]: Abstraction has 3336 states and 4294 transitions. [2019-10-15 01:04:25,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:25,326 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4294 transitions. [2019-10-15 01:04:25,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-15 01:04:25,333 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:25,333 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:25,333 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:25,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:25,334 INFO L82 PathProgramCache]: Analyzing trace with hash 2102577579, now seen corresponding path program 1 times [2019-10-15 01:04:25,334 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:25,334 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156098491] [2019-10-15 01:04:25,334 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:25,334 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:25,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:25,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:25,351 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:25,351 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156098491] [2019-10-15 01:04:25,352 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:25,352 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:25,352 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288942316] [2019-10-15 01:04:25,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:25,353 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:25,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:25,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:25,354 INFO L87 Difference]: Start difference. First operand 3336 states and 4294 transitions. Second operand 3 states. [2019-10-15 01:04:25,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:25,421 INFO L93 Difference]: Finished difference Result 5004 states and 6408 transitions. [2019-10-15 01:04:25,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:25,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-15 01:04:25,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:25,436 INFO L225 Difference]: With dead ends: 5004 [2019-10-15 01:04:25,436 INFO L226 Difference]: Without dead ends: 3402 [2019-10-15 01:04:25,440 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:25,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3402 states. [2019-10-15 01:04:25,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3402 to 3400. [2019-10-15 01:04:25,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3400 states. [2019-10-15 01:04:25,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3400 states to 3400 states and 4294 transitions. [2019-10-15 01:04:25,535 INFO L78 Accepts]: Start accepts. Automaton has 3400 states and 4294 transitions. Word has length 26 [2019-10-15 01:04:25,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:25,536 INFO L462 AbstractCegarLoop]: Abstraction has 3400 states and 4294 transitions. [2019-10-15 01:04:25,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:25,536 INFO L276 IsEmpty]: Start isEmpty. Operand 3400 states and 4294 transitions. [2019-10-15 01:04:25,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-15 01:04:25,540 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:25,541 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:25,541 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:25,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:25,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1515771565, now seen corresponding path program 1 times [2019-10-15 01:04:25,541 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:25,542 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470128133] [2019-10-15 01:04:25,542 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:25,542 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:25,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:25,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:25,567 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:25,568 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470128133] [2019-10-15 01:04:25,568 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:25,568 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:25,568 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127862414] [2019-10-15 01:04:25,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:25,569 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:25,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:25,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:25,570 INFO L87 Difference]: Start difference. First operand 3400 states and 4294 transitions. Second operand 3 states. [2019-10-15 01:04:25,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:25,695 INFO L93 Difference]: Finished difference Result 9804 states and 12104 transitions. [2019-10-15 01:04:25,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:25,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-15 01:04:25,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:25,745 INFO L225 Difference]: With dead ends: 9804 [2019-10-15 01:04:25,745 INFO L226 Difference]: Without dead ends: 6538 [2019-10-15 01:04:25,753 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:25,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6538 states. [2019-10-15 01:04:26,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6538 to 6536. [2019-10-15 01:04:26,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6536 states. [2019-10-15 01:04:26,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 7814 transitions. [2019-10-15 01:04:26,042 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 7814 transitions. Word has length 26 [2019-10-15 01:04:26,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:26,042 INFO L462 AbstractCegarLoop]: Abstraction has 6536 states and 7814 transitions. [2019-10-15 01:04:26,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:26,043 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 7814 transitions. [2019-10-15 01:04:26,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-15 01:04:26,056 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:26,056 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:26,057 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:26,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:26,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1257606127, now seen corresponding path program 1 times [2019-10-15 01:04:26,058 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:26,058 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369922529] [2019-10-15 01:04:26,059 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:26,059 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:26,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:26,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:26,084 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:26,084 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369922529] [2019-10-15 01:04:26,085 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:26,085 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:26,085 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267715617] [2019-10-15 01:04:26,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:26,086 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:26,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:26,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:26,087 INFO L87 Difference]: Start difference. First operand 6536 states and 7814 transitions. Second operand 3 states. [2019-10-15 01:04:26,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:26,288 INFO L93 Difference]: Finished difference Result 7052 states and 8584 transitions. [2019-10-15 01:04:26,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:26,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-15 01:04:26,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:26,312 INFO L225 Difference]: With dead ends: 7052 [2019-10-15 01:04:26,312 INFO L226 Difference]: Without dead ends: 7050 [2019-10-15 01:04:26,317 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:26,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7050 states. [2019-10-15 01:04:26,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7050 to 6536. [2019-10-15 01:04:26,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6536 states. [2019-10-15 01:04:26,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 7686 transitions. [2019-10-15 01:04:26,693 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 7686 transitions. Word has length 26 [2019-10-15 01:04:26,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:26,693 INFO L462 AbstractCegarLoop]: Abstraction has 6536 states and 7686 transitions. [2019-10-15 01:04:26,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:26,694 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 7686 transitions. [2019-10-15 01:04:26,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-15 01:04:26,708 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:26,709 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:26,709 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:26,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:26,710 INFO L82 PathProgramCache]: Analyzing trace with hash -255505650, now seen corresponding path program 1 times [2019-10-15 01:04:26,710 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:26,710 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65684761] [2019-10-15 01:04:26,710 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:26,711 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:26,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:26,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:26,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:26,739 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65684761] [2019-10-15 01:04:26,739 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:26,740 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:26,740 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403989257] [2019-10-15 01:04:26,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:26,740 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:26,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:26,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:26,741 INFO L87 Difference]: Start difference. First operand 6536 states and 7686 transitions. Second operand 3 states. [2019-10-15 01:04:27,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:27,017 INFO L93 Difference]: Finished difference Result 10634 states and 12423 transitions. [2019-10-15 01:04:27,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:27,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-15 01:04:27,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:27,051 INFO L225 Difference]: With dead ends: 10634 [2019-10-15 01:04:27,051 INFO L226 Difference]: Without dead ends: 10632 [2019-10-15 01:04:27,058 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:27,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10632 states. [2019-10-15 01:04:27,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10632 to 10120. [2019-10-15 01:04:27,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10120 states. [2019-10-15 01:04:27,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10120 states to 10120 states and 11654 transitions. [2019-10-15 01:04:27,349 INFO L78 Accepts]: Start accepts. Automaton has 10120 states and 11654 transitions. Word has length 27 [2019-10-15 01:04:27,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:27,349 INFO L462 AbstractCegarLoop]: Abstraction has 10120 states and 11654 transitions. [2019-10-15 01:04:27,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:27,349 INFO L276 IsEmpty]: Start isEmpty. Operand 10120 states and 11654 transitions. [2019-10-15 01:04:27,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-15 01:04:27,453 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:27,453 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:27,454 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:27,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:27,454 INFO L82 PathProgramCache]: Analyzing trace with hash 2659788, now seen corresponding path program 1 times [2019-10-15 01:04:27,454 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:27,454 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725962476] [2019-10-15 01:04:27,455 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:27,455 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:27,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:27,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:27,473 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:27,474 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725962476] [2019-10-15 01:04:27,474 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:27,474 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:27,474 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092313634] [2019-10-15 01:04:27,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:27,475 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:27,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:27,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:27,476 INFO L87 Difference]: Start difference. First operand 10120 states and 11654 transitions. Second operand 3 states. [2019-10-15 01:04:27,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:27,668 INFO L93 Difference]: Finished difference Result 22664 states and 25734 transitions. [2019-10-15 01:04:27,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:27,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-15 01:04:27,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:27,669 INFO L225 Difference]: With dead ends: 22664 [2019-10-15 01:04:27,669 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 01:04:27,704 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:27,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 01:04:27,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 01:04:27,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 01:04:27,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 01:04:27,705 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2019-10-15 01:04:27,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:27,705 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 01:04:27,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:27,705 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 01:04:27,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 01:04:27,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 01:04:27,736 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-15 01:04:27,737 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:04:27,737 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:04:27,737 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-15 01:04:27,737 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 01:04:27,737 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 01:04:27,738 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 36 144) no Hoare annotation was computed. [2019-10-15 01:04:27,738 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 149) no Hoare annotation was computed. [2019-10-15 01:04:27,738 INFO L443 ceAbstractionStarter]: For program point L85-1(lines 36 144) no Hoare annotation was computed. [2019-10-15 01:04:27,738 INFO L443 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2019-10-15 01:04:27,738 INFO L443 ceAbstractionStarter]: For program point L77-1(lines 36 144) no Hoare annotation was computed. [2019-10-15 01:04:27,738 INFO L443 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-10-15 01:04:27,738 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 36 144) no Hoare annotation was computed. [2019-10-15 01:04:27,738 INFO L443 ceAbstractionStarter]: For program point L61(lines 61 63) no Hoare annotation was computed. [2019-10-15 01:04:27,739 INFO L443 ceAbstractionStarter]: For program point L61-2(lines 36 144) no Hoare annotation was computed. [2019-10-15 01:04:27,740 INFO L443 ceAbstractionStarter]: For program point L119-1(lines 36 144) no Hoare annotation was computed. [2019-10-15 01:04:27,740 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 147) no Hoare annotation was computed. [2019-10-15 01:04:27,740 INFO L443 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-10-15 01:04:27,740 INFO L446 ceAbstractionStarter]: At program point L145(lines 5 149) the Hoare annotation is: true [2019-10-15 01:04:27,741 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 149) no Hoare annotation was computed. [2019-10-15 01:04:27,741 INFO L443 ceAbstractionStarter]: For program point L104-1(lines 36 144) no Hoare annotation was computed. [2019-10-15 01:04:27,741 INFO L443 ceAbstractionStarter]: For program point L38(lines 38 40) no Hoare annotation was computed. [2019-10-15 01:04:27,741 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 36 144) no Hoare annotation was computed. [2019-10-15 01:04:27,741 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 149) the Hoare annotation is: true [2019-10-15 01:04:27,741 INFO L443 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-10-15 01:04:27,741 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-10-15 01:04:27,741 INFO L443 ceAbstractionStarter]: For program point L89-1(lines 36 144) no Hoare annotation was computed. [2019-10-15 01:04:27,742 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 36 144) no Hoare annotation was computed. [2019-10-15 01:04:27,742 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 36 144) no Hoare annotation was computed. [2019-10-15 01:04:27,742 INFO L446 ceAbstractionStarter]: At program point L139-1(lines 36 144) the Hoare annotation is: true [2019-10-15 01:04:27,742 INFO L443 ceAbstractionStarter]: For program point L73-1(lines 36 144) no Hoare annotation was computed. [2019-10-15 01:04:27,742 INFO L443 ceAbstractionStarter]: For program point L65-1(lines 36 144) no Hoare annotation was computed. [2019-10-15 01:04:27,742 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-10-15 01:04:27,742 INFO L443 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2019-10-15 01:04:27,743 INFO L439 ceAbstractionStarter]: At program point L140-1(lines 5 149) the Hoare annotation is: false [2019-10-15 01:04:27,743 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 36 144) no Hoare annotation was computed. [2019-10-15 01:04:27,743 INFO L443 ceAbstractionStarter]: For program point L124-1(lines 36 144) no Hoare annotation was computed. [2019-10-15 01:04:27,743 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-10-15 01:04:27,743 INFO L443 ceAbstractionStarter]: For program point L125(line 125) no Hoare annotation was computed. [2019-10-15 01:04:27,743 INFO L443 ceAbstractionStarter]: For program point L109-1(lines 36 144) no Hoare annotation was computed. [2019-10-15 01:04:27,743 INFO L443 ceAbstractionStarter]: For program point L134-1(lines 36 144) no Hoare annotation was computed. [2019-10-15 01:04:27,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:04:27 BoogieIcfgContainer [2019-10-15 01:04:27,755 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 01:04:27,761 INFO L168 Benchmark]: Toolchain (without parser) took 6275.04 ms. Allocated memory was 137.4 MB in the beginning and 363.3 MB in the end (delta: 226.0 MB). Free memory was 102.2 MB in the beginning and 199.5 MB in the end (delta: -97.4 MB). Peak memory consumption was 128.6 MB. Max. memory is 7.1 GB. [2019-10-15 01:04:27,764 INFO L168 Benchmark]: CDTParser took 0.20 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:27,771 INFO L168 Benchmark]: CACSL2BoogieTranslator took 309.59 ms. Allocated memory is still 137.4 MB. Free memory was 101.8 MB in the beginning and 91.5 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2019-10-15 01:04:27,772 INFO L168 Benchmark]: Boogie Preprocessor took 116.56 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.5 MB in the beginning and 177.9 MB in the end (delta: -86.3 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2019-10-15 01:04:27,775 INFO L168 Benchmark]: RCFGBuilder took 391.50 ms. Allocated memory is still 200.3 MB. Free memory was 177.9 MB in the beginning and 160.3 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 7.1 GB. [2019-10-15 01:04:27,778 INFO L168 Benchmark]: TraceAbstraction took 5452.62 ms. Allocated memory was 200.3 MB in the beginning and 363.3 MB in the end (delta: 163.1 MB). Free memory was 159.6 MB in the beginning and 199.5 MB in the end (delta: -39.9 MB). Peak memory consumption was 123.1 MB. Max. memory is 7.1 GB. [2019-10-15 01:04:27,785 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 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 309.59 ms. Allocated memory is still 137.4 MB. Free memory was 101.8 MB in the beginning and 91.5 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 116.56 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.5 MB in the beginning and 177.9 MB in the end (delta: -86.3 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 391.50 ms. Allocated memory is still 200.3 MB. Free memory was 177.9 MB in the beginning and 160.3 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5452.62 ms. Allocated memory was 200.3 MB in the beginning and 363.3 MB in the end (delta: 163.1 MB). Free memory was 159.6 MB in the beginning and 199.5 MB in the end (delta: -39.9 MB). Peak memory consumption was 123.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 147]: 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: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 41 locations, 1 error locations. Result: SAFE, OverallTime: 5.3s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1937 SDtfs, 926 SDslu, 1314 SDs, 0 SdLazy, 133 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10120occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 25 MinimizatonAttempts, 2072 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 522 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.6s InterpolantComputationTime, 575 NumberOfCodeBlocks, 575 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 550 ConstructedInterpolants, 0 QuantifiedInterpolants, 23930 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...