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/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:23:12,583 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:23:12,585 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:23:12,597 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:23:12,598 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:23:12,599 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:23:12,600 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:23:12,602 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:23:12,604 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:23:12,605 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:23:12,605 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:23:12,607 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:23:12,607 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:23:12,608 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:23:12,609 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:23:12,610 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:23:12,611 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:23:12,612 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:23:12,614 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:23:12,616 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:23:12,618 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:23:12,619 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:23:12,620 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:23:12,621 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:23:12,624 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:23:12,624 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:23:12,625 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:23:12,626 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:23:12,626 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:23:12,627 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:23:12,628 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:23:12,628 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:23:12,629 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:23:12,630 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:23:12,632 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:23:12,632 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:23:12,633 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:23:12,633 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:23:12,633 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:23:12,634 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:23:12,635 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:23:12,636 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:23:12,658 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:23:12,659 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:23:12,660 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:23:12,660 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:23:12,661 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:23:12,661 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:23:12,661 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:23:12,662 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:23:12,662 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:23:12,662 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:23:12,662 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:23:12,663 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:23:12,663 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:23:12,663 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:23:12,663 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:23:12,663 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:23:12,664 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:23:12,664 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:23:12,664 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:23:12,665 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:23:12,666 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:23:12,666 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:23:12,667 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:23:12,667 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:23:12,668 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:23:12,668 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:23:12,668 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:23:12,668 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:23:12,668 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:23:12,942 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:23:12,960 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:23:12,964 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:23:12,966 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:23:12,966 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:23:12,967 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-10-15 01:23:13,034 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/690a2b57d/edfde7124f544e98a635856d68733f6b/FLAG56fd38af4 [2019-10-15 01:23:13,580 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:23:13,582 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-10-15 01:23:13,594 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/690a2b57d/edfde7124f544e98a635856d68733f6b/FLAG56fd38af4 [2019-10-15 01:23:13,897 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/690a2b57d/edfde7124f544e98a635856d68733f6b [2019-10-15 01:23:13,907 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:23:13,909 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:23:13,910 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:23:13,910 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:23:13,913 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:23:13,914 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:23:13" (1/1) ... [2019-10-15 01:23:13,916 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bb305d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:13, skipping insertion in model container [2019-10-15 01:23:13,917 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:23:13" (1/1) ... [2019-10-15 01:23:13,923 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:23:13,961 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:23:14,200 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:23:14,296 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:23:14,344 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:23:14,365 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:23:14,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:14 WrapperNode [2019-10-15 01:23:14,366 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:23:14,366 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:23:14,367 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:23:14,367 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:23:14,379 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:14" (1/1) ... [2019-10-15 01:23:14,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:14" (1/1) ... [2019-10-15 01:23:14,387 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:14" (1/1) ... [2019-10-15 01:23:14,388 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:14" (1/1) ... [2019-10-15 01:23:14,398 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:14" (1/1) ... [2019-10-15 01:23:14,405 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:14" (1/1) ... [2019-10-15 01:23:14,408 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:14" (1/1) ... [2019-10-15 01:23:14,412 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:23:14,413 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:23:14,413 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:23:14,413 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:23:14,414 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:14" (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:23:14,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:23:14,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:23:14,475 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:23:14,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:23:14,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 01:23:14,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:23:14,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-15 01:23:14,476 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 01:23:14,476 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:23:14,476 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 01:23:14,476 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 01:23:14,476 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-15 01:23:14,476 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-15 01:23:14,477 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-15 01:23:14,477 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 01:23:14,477 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 01:23:14,477 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:23:14,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:23:14,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:23:15,043 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:23:15,044 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 01:23:15,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:23:15 BoogieIcfgContainer [2019-10-15 01:23:15,046 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:23:15,047 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:23:15,047 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:23:15,051 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:23:15,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:23:13" (1/3) ... [2019-10-15 01:23:15,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f197d96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:23:15, skipping insertion in model container [2019-10-15 01:23:15,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:14" (2/3) ... [2019-10-15 01:23:15,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f197d96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:23:15, skipping insertion in model container [2019-10-15 01:23:15,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:23:15" (3/3) ... [2019-10-15 01:23:15,055 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-10-15 01:23:15,068 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:23:15,077 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:23:15,090 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:23:15,119 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:23:15,119 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:23:15,119 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:23:15,120 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:23:15,120 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:23:15,120 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:23:15,120 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:23:15,121 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:23:15,144 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2019-10-15 01:23:15,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-15 01:23:15,154 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:15,156 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:15,158 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:15,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:15,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1555775493, now seen corresponding path program 1 times [2019-10-15 01:23:15,176 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:15,177 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649646195] [2019-10-15 01:23:15,177 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:15,177 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:15,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:15,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:15,517 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649646195] [2019-10-15 01:23:15,518 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:15,519 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:15,519 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834595745] [2019-10-15 01:23:15,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:15,526 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:15,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:15,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:15,545 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 3 states. [2019-10-15 01:23:15,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:15,629 INFO L93 Difference]: Finished difference Result 197 states and 307 transitions. [2019-10-15 01:23:15,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:15,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-10-15 01:23:15,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:15,648 INFO L225 Difference]: With dead ends: 197 [2019-10-15 01:23:15,649 INFO L226 Difference]: Without dead ends: 126 [2019-10-15 01:23:15,653 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:23:15,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-10-15 01:23:15,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2019-10-15 01:23:15,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-10-15 01:23:15,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 182 transitions. [2019-10-15 01:23:15,760 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 182 transitions. Word has length 41 [2019-10-15 01:23:15,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:15,763 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 182 transitions. [2019-10-15 01:23:15,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:15,764 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 182 transitions. [2019-10-15 01:23:15,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-15 01:23:15,769 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:15,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, 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:23:15,770 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:15,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:15,771 INFO L82 PathProgramCache]: Analyzing trace with hash 477079428, now seen corresponding path program 1 times [2019-10-15 01:23:15,772 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:15,772 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849578381] [2019-10-15 01:23:15,772 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:15,773 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:15,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:15,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:15,960 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849578381] [2019-10-15 01:23:15,960 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:15,960 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:15,961 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876254136] [2019-10-15 01:23:15,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:15,963 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:15,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:15,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:15,964 INFO L87 Difference]: Start difference. First operand 124 states and 182 transitions. Second operand 3 states. [2019-10-15 01:23:16,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:16,005 INFO L93 Difference]: Finished difference Result 292 states and 446 transitions. [2019-10-15 01:23:16,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:16,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-10-15 01:23:16,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:16,009 INFO L225 Difference]: With dead ends: 292 [2019-10-15 01:23:16,009 INFO L226 Difference]: Without dead ends: 192 [2019-10-15 01:23:16,011 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:23:16,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-10-15 01:23:16,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 190. [2019-10-15 01:23:16,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-10-15 01:23:16,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 285 transitions. [2019-10-15 01:23:16,057 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 285 transitions. Word has length 42 [2019-10-15 01:23:16,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:16,058 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 285 transitions. [2019-10-15 01:23:16,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:16,058 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 285 transitions. [2019-10-15 01:23:16,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-15 01:23:16,060 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:16,061 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:16,062 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:16,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:16,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1738555772, now seen corresponding path program 1 times [2019-10-15 01:23:16,063 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:16,063 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011708021] [2019-10-15 01:23:16,063 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:16,064 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:16,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:16,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:16,244 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:23:16,245 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011708021] [2019-10-15 01:23:16,245 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:16,245 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:23:16,245 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361218660] [2019-10-15 01:23:16,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:23:16,246 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:16,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:23:16,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:16,247 INFO L87 Difference]: Start difference. First operand 190 states and 285 transitions. Second operand 5 states. [2019-10-15 01:23:16,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:16,431 INFO L93 Difference]: Finished difference Result 854 states and 1329 transitions. [2019-10-15 01:23:16,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:23:16,432 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-10-15 01:23:16,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:16,438 INFO L225 Difference]: With dead ends: 854 [2019-10-15 01:23:16,438 INFO L226 Difference]: Without dead ends: 688 [2019-10-15 01:23:16,440 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:23:16,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2019-10-15 01:23:16,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 354. [2019-10-15 01:23:16,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2019-10-15 01:23:16,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 537 transitions. [2019-10-15 01:23:16,482 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 537 transitions. Word has length 43 [2019-10-15 01:23:16,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:16,483 INFO L462 AbstractCegarLoop]: Abstraction has 354 states and 537 transitions. [2019-10-15 01:23:16,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:23:16,483 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 537 transitions. [2019-10-15 01:23:16,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-15 01:23:16,486 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:16,488 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:16,488 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:16,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:16,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1920813121, now seen corresponding path program 1 times [2019-10-15 01:23:16,489 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:16,489 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875861820] [2019-10-15 01:23:16,490 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:16,490 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:16,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:16,627 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:23:16,628 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875861820] [2019-10-15 01:23:16,628 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:16,628 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:23:16,629 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914442017] [2019-10-15 01:23:16,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:23:16,630 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:16,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:23:16,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:16,631 INFO L87 Difference]: Start difference. First operand 354 states and 537 transitions. Second operand 5 states. [2019-10-15 01:23:16,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:16,766 INFO L93 Difference]: Finished difference Result 1232 states and 1892 transitions. [2019-10-15 01:23:16,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:23:16,767 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-10-15 01:23:16,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:16,776 INFO L225 Difference]: With dead ends: 1232 [2019-10-15 01:23:16,777 INFO L226 Difference]: Without dead ends: 902 [2019-10-15 01:23:16,780 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:16,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2019-10-15 01:23:16,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 898. [2019-10-15 01:23:16,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 898 states. [2019-10-15 01:23:16,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1369 transitions. [2019-10-15 01:23:16,848 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1369 transitions. Word has length 44 [2019-10-15 01:23:16,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:16,849 INFO L462 AbstractCegarLoop]: Abstraction has 898 states and 1369 transitions. [2019-10-15 01:23:16,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:23:16,849 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1369 transitions. [2019-10-15 01:23:16,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-15 01:23:16,857 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:16,858 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:16,858 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:16,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:16,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1112409250, now seen corresponding path program 1 times [2019-10-15 01:23:16,859 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:16,859 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098405680] [2019-10-15 01:23:16,859 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:16,859 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:16,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:16,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:16,908 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:23:16,908 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098405680] [2019-10-15 01:23:16,909 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:16,909 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:16,909 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807887308] [2019-10-15 01:23:16,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:16,910 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:16,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:16,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:16,911 INFO L87 Difference]: Start difference. First operand 898 states and 1369 transitions. Second operand 3 states. [2019-10-15 01:23:17,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:17,046 INFO L93 Difference]: Finished difference Result 2334 states and 3555 transitions. [2019-10-15 01:23:17,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:17,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-10-15 01:23:17,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:17,058 INFO L225 Difference]: With dead ends: 2334 [2019-10-15 01:23:17,058 INFO L226 Difference]: Without dead ends: 1460 [2019-10-15 01:23:17,060 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:23:17,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2019-10-15 01:23:17,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1458. [2019-10-15 01:23:17,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1458 states. [2019-10-15 01:23:17,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 2185 transitions. [2019-10-15 01:23:17,160 INFO L78 Accepts]: Start accepts. Automaton has 1458 states and 2185 transitions. Word has length 46 [2019-10-15 01:23:17,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:17,161 INFO L462 AbstractCegarLoop]: Abstraction has 1458 states and 2185 transitions. [2019-10-15 01:23:17,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:17,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 2185 transitions. [2019-10-15 01:23:17,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-15 01:23:17,164 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:17,164 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:17,164 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:17,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:17,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1926406488, now seen corresponding path program 1 times [2019-10-15 01:23:17,165 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:17,165 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078088387] [2019-10-15 01:23:17,166 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:17,166 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:17,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:17,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:17,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:17,306 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078088387] [2019-10-15 01:23:17,307 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:17,307 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:23:17,307 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302161555] [2019-10-15 01:23:17,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:23:17,308 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:17,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:23:17,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:23:17,309 INFO L87 Difference]: Start difference. First operand 1458 states and 2185 transitions. Second operand 6 states. [2019-10-15 01:23:17,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:17,889 INFO L93 Difference]: Finished difference Result 5648 states and 8476 transitions. [2019-10-15 01:23:17,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:23:17,890 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-10-15 01:23:17,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:17,917 INFO L225 Difference]: With dead ends: 5648 [2019-10-15 01:23:17,918 INFO L226 Difference]: Without dead ends: 4214 [2019-10-15 01:23:17,922 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:23:17,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4214 states. [2019-10-15 01:23:18,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4214 to 4210. [2019-10-15 01:23:18,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4210 states. [2019-10-15 01:23:18,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4210 states to 4210 states and 6281 transitions. [2019-10-15 01:23:18,235 INFO L78 Accepts]: Start accepts. Automaton has 4210 states and 6281 transitions. Word has length 46 [2019-10-15 01:23:18,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:18,237 INFO L462 AbstractCegarLoop]: Abstraction has 4210 states and 6281 transitions. [2019-10-15 01:23:18,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:23:18,237 INFO L276 IsEmpty]: Start isEmpty. Operand 4210 states and 6281 transitions. [2019-10-15 01:23:18,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-15 01:23:18,239 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:18,239 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:18,239 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:18,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:18,240 INFO L82 PathProgramCache]: Analyzing trace with hash -742396141, now seen corresponding path program 1 times [2019-10-15 01:23:18,240 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:18,240 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149386349] [2019-10-15 01:23:18,240 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:18,240 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:18,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:18,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:18,372 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:23:18,372 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149386349] [2019-10-15 01:23:18,373 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:18,373 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:23:18,373 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216814974] [2019-10-15 01:23:18,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:23:18,374 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:18,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:23:18,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:18,375 INFO L87 Difference]: Start difference. First operand 4210 states and 6281 transitions. Second operand 5 states. [2019-10-15 01:23:19,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:19,013 INFO L93 Difference]: Finished difference Result 8684 states and 12826 transitions. [2019-10-15 01:23:19,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:23:19,014 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-10-15 01:23:19,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:19,059 INFO L225 Difference]: With dead ends: 8684 [2019-10-15 01:23:19,059 INFO L226 Difference]: Without dead ends: 8682 [2019-10-15 01:23:19,066 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:23:19,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8682 states. [2019-10-15 01:23:19,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8682 to 4498. [2019-10-15 01:23:19,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4498 states. [2019-10-15 01:23:19,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4498 states to 4498 states and 6569 transitions. [2019-10-15 01:23:19,473 INFO L78 Accepts]: Start accepts. Automaton has 4498 states and 6569 transitions. Word has length 46 [2019-10-15 01:23:19,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:19,473 INFO L462 AbstractCegarLoop]: Abstraction has 4498 states and 6569 transitions. [2019-10-15 01:23:19,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:23:19,474 INFO L276 IsEmpty]: Start isEmpty. Operand 4498 states and 6569 transitions. [2019-10-15 01:23:19,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-15 01:23:19,474 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:19,475 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:23:19,475 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:19,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:19,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1529824191, now seen corresponding path program 1 times [2019-10-15 01:23:19,476 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:19,476 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632800774] [2019-10-15 01:23:19,476 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:19,477 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:19,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:19,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:19,523 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:23:19,523 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632800774] [2019-10-15 01:23:19,524 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:19,524 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:19,524 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180841777] [2019-10-15 01:23:19,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:19,525 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:19,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:19,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:19,526 INFO L87 Difference]: Start difference. First operand 4498 states and 6569 transitions. Second operand 3 states. [2019-10-15 01:23:19,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:19,936 INFO L93 Difference]: Finished difference Result 10814 states and 15783 transitions. [2019-10-15 01:23:19,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:19,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-10-15 01:23:19,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:19,969 INFO L225 Difference]: With dead ends: 10814 [2019-10-15 01:23:19,969 INFO L226 Difference]: Without dead ends: 6340 [2019-10-15 01:23:19,980 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:23:19,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6340 states. [2019-10-15 01:23:20,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6340 to 6278. [2019-10-15 01:23:20,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6278 states. [2019-10-15 01:23:20,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6278 states to 6278 states and 9057 transitions. [2019-10-15 01:23:20,566 INFO L78 Accepts]: Start accepts. Automaton has 6278 states and 9057 transitions. Word has length 47 [2019-10-15 01:23:20,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:20,568 INFO L462 AbstractCegarLoop]: Abstraction has 6278 states and 9057 transitions. [2019-10-15 01:23:20,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:20,568 INFO L276 IsEmpty]: Start isEmpty. Operand 6278 states and 9057 transitions. [2019-10-15 01:23:20,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-15 01:23:20,571 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:20,572 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:20,572 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:20,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:20,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1418257868, now seen corresponding path program 1 times [2019-10-15 01:23:20,573 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:20,573 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996446238] [2019-10-15 01:23:20,573 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:20,574 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:20,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:20,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:20,687 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:20,687 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996446238] [2019-10-15 01:23:20,688 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297367972] [2019-10-15 01:23:20,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:23:20,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:20,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-15 01:23:20,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:23:20,936 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:20,937 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:23:21,009 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:21,010 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1545240477] [2019-10-15 01:23:21,022 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 66 [2019-10-15 01:23:21,117 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:23:21,118 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:23:21,263 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-15 01:23:21,442 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-15 01:23:21,445 INFO L272 AbstractInterpreter]: Visited 52 different actions 90 times. Merged at 25 different actions 32 times. Never widened. Performed 377 root evaluator evaluations with a maximum evaluation depth of 5. Performed 377 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 3 fixpoints after 2 different actions. Largest state had 94 variables. [2019-10-15 01:23:21,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:21,450 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-15 01:23:21,670 INFO L227 lantSequenceWeakener]: Weakened 39 states. On average, predicates are now at 83.19% of their original sizes. [2019-10-15 01:23:21,672 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-10-15 01:23:23,103 INFO L553 sIntCurrentIteration]: We unified 64 AI predicates to 64 [2019-10-15 01:23:23,103 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-15 01:23:23,104 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:23:23,104 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [7, 7, 7] total 45 [2019-10-15 01:23:23,105 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139377123] [2019-10-15 01:23:23,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-15 01:23:23,107 INFO L137 tionRefinementEngine]: Using predicate unifier AbsIntPredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:23,107 INFO L124 tionRefinementEngine]: Using hoare triple checker CachingHoareTripleCheckerMap provided by strategy [2019-10-15 01:23:23,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-15 01:23:23,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1094, Unknown=0, NotChecked=0, Total=1260 [2019-10-15 01:23:23,108 INFO L87 Difference]: Start difference. First operand 6278 states and 9057 transitions. Second operand 36 states. [2019-10-15 01:23:44,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:44,407 INFO L93 Difference]: Finished difference Result 26238 states and 37525 transitions. [2019-10-15 01:23:44,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2019-10-15 01:23:44,407 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 65 [2019-10-15 01:23:44,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:44,478 INFO L225 Difference]: With dead ends: 26238 [2019-10-15 01:23:44,479 INFO L226 Difference]: Without dead ends: 19986 [2019-10-15 01:23:44,510 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21986 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=6908, Invalid=43942, Unknown=0, NotChecked=0, Total=50850 [2019-10-15 01:23:44,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19986 states. [2019-10-15 01:23:45,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19986 to 9849. [2019-10-15 01:23:45,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9849 states. [2019-10-15 01:23:45,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9849 states to 9849 states and 13963 transitions. [2019-10-15 01:23:45,470 INFO L78 Accepts]: Start accepts. Automaton has 9849 states and 13963 transitions. Word has length 65 [2019-10-15 01:23:45,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:45,470 INFO L462 AbstractCegarLoop]: Abstraction has 9849 states and 13963 transitions. [2019-10-15 01:23:45,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-15 01:23:45,470 INFO L276 IsEmpty]: Start isEmpty. Operand 9849 states and 13963 transitions. [2019-10-15 01:23:45,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-15 01:23:45,475 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:45,475 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:45,681 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:23:45,682 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:45,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:45,682 INFO L82 PathProgramCache]: Analyzing trace with hash 929561592, now seen corresponding path program 1 times [2019-10-15 01:23:45,683 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:45,683 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881316450] [2019-10-15 01:23:45,684 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:45,684 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:45,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:45,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:45,732 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:45,733 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881316450] [2019-10-15 01:23:45,733 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:45,733 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:45,733 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159870384] [2019-10-15 01:23:45,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:45,734 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:45,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:45,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:45,735 INFO L87 Difference]: Start difference. First operand 9849 states and 13963 transitions. Second operand 3 states. [2019-10-15 01:23:46,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:46,868 INFO L93 Difference]: Finished difference Result 19895 states and 28085 transitions. [2019-10-15 01:23:46,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:46,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-10-15 01:23:46,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:46,897 INFO L225 Difference]: With dead ends: 19895 [2019-10-15 01:23:46,897 INFO L226 Difference]: Without dead ends: 12267 [2019-10-15 01:23:46,914 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:23:46,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12267 states. [2019-10-15 01:23:47,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12267 to 11384. [2019-10-15 01:23:47,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11384 states. [2019-10-15 01:23:47,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11384 states to 11384 states and 15890 transitions. [2019-10-15 01:23:47,638 INFO L78 Accepts]: Start accepts. Automaton has 11384 states and 15890 transitions. Word has length 65 [2019-10-15 01:23:47,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:47,639 INFO L462 AbstractCegarLoop]: Abstraction has 11384 states and 15890 transitions. [2019-10-15 01:23:47,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:47,639 INFO L276 IsEmpty]: Start isEmpty. Operand 11384 states and 15890 transitions. [2019-10-15 01:23:47,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-15 01:23:47,643 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:47,644 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:47,644 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:47,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:47,644 INFO L82 PathProgramCache]: Analyzing trace with hash 442725761, now seen corresponding path program 1 times [2019-10-15 01:23:47,645 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:47,645 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356180121] [2019-10-15 01:23:47,645 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:47,645 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:47,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:47,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:47,728 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:47,728 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356180121] [2019-10-15 01:23:47,729 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536491333] [2019-10-15 01:23:47,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:23:47,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:47,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-15 01:23:47,844 INFO L279 TraceCheckSpWp]: Computing forward predicates...