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/systemc/toy2.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:28:43,016 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:28:43,019 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:28:43,039 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:28:43,040 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:28:43,041 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:28:43,044 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:28:43,047 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:28:43,049 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:28:43,051 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:28:43,052 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:28:43,060 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:28:43,060 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:28:43,064 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:28:43,065 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:28:43,066 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:28:43,068 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:28:43,069 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:28:43,073 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:28:43,075 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:28:43,080 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:28:43,081 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:28:43,083 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:28:43,085 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:28:43,087 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:28:43,088 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:28:43,088 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:28:43,091 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:28:43,092 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:28:43,094 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:28:43,094 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:28:43,096 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:28:43,097 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:28:43,098 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:28:43,099 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:28:43,100 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:28:43,100 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:28:43,101 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:28:43,101 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:28:43,103 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:28:43,105 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:28:43,106 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:28:43,137 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:28:43,137 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:28:43,140 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:28:43,140 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:28:43,141 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:28:43,141 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:28:43,141 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:28:43,141 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:28:43,141 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:28:43,142 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:28:43,142 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:28:43,142 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:28:43,142 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:28:43,142 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:28:43,143 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:28:43,143 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:28:43,143 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:28:43,143 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:28:43,143 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:28:43,144 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:28:43,144 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:28:43,144 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:28:43,144 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:28:43,144 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:28:43,145 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:28:43,145 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:28:43,145 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:28:43,145 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:28:43,145 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:28:43,438 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:28:43,452 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:28:43,456 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:28:43,457 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:28:43,458 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:28:43,459 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/toy2.cil.c [2019-10-15 01:28:43,533 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44a8db2ee/6152365536b4470ebd1e335bf2c9f597/FLAGde8d7bbfd [2019-10-15 01:28:44,034 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:28:44,035 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/toy2.cil.c [2019-10-15 01:28:44,045 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44a8db2ee/6152365536b4470ebd1e335bf2c9f597/FLAGde8d7bbfd [2019-10-15 01:28:44,410 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44a8db2ee/6152365536b4470ebd1e335bf2c9f597 [2019-10-15 01:28:44,423 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:28:44,425 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:28:44,428 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:28:44,428 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:28:44,432 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:28:44,433 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:28:44" (1/1) ... [2019-10-15 01:28:44,436 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f2b4d35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:44, skipping insertion in model container [2019-10-15 01:28:44,436 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:28:44" (1/1) ... [2019-10-15 01:28:44,443 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:28:44,504 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:28:44,753 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:28:44,764 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:28:44,907 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:28:44,925 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:28:44,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:44 WrapperNode [2019-10-15 01:28:44,926 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:28:44,927 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:28:44,927 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:28:44,927 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:28:44,937 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:44" (1/1) ... [2019-10-15 01:28:44,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:44" (1/1) ... [2019-10-15 01:28:44,945 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:44" (1/1) ... [2019-10-15 01:28:44,945 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:44" (1/1) ... [2019-10-15 01:28:44,956 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:44" (1/1) ... [2019-10-15 01:28:44,972 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:44" (1/1) ... [2019-10-15 01:28:44,975 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:44" (1/1) ... [2019-10-15 01:28:44,980 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:28:44,981 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:28:44,981 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:28:44,981 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:28:44,982 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:44" (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:28:45,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:28:45,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:28:45,039 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-15 01:28:45,040 INFO L138 BoogieDeclarations]: Found implementation of procedure write_loop [2019-10-15 01:28:45,040 INFO L138 BoogieDeclarations]: Found implementation of procedure compute1 [2019-10-15 01:28:45,040 INFO L138 BoogieDeclarations]: Found implementation of procedure compute2 [2019-10-15 01:28:45,040 INFO L138 BoogieDeclarations]: Found implementation of procedure write_back [2019-10-15 01:28:45,040 INFO L138 BoogieDeclarations]: Found implementation of procedure read [2019-10-15 01:28:45,040 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-15 01:28:45,041 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-15 01:28:45,041 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:28:45,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:28:45,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:28:45,041 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-15 01:28:45,041 INFO L130 BoogieDeclarations]: Found specification of procedure write_loop [2019-10-15 01:28:45,042 INFO L130 BoogieDeclarations]: Found specification of procedure compute1 [2019-10-15 01:28:45,043 INFO L130 BoogieDeclarations]: Found specification of procedure compute2 [2019-10-15 01:28:45,043 INFO L130 BoogieDeclarations]: Found specification of procedure write_back [2019-10-15 01:28:45,043 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 01:28:45,044 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-15 01:28:45,044 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-15 01:28:45,044 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:28:45,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:28:45,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:28:45,770 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:28:45,770 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-15 01:28:45,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:28:45 BoogieIcfgContainer [2019-10-15 01:28:45,772 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:28:45,774 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:28:45,774 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:28:45,778 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:28:45,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:28:44" (1/3) ... [2019-10-15 01:28:45,779 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5174c90f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:28:45, skipping insertion in model container [2019-10-15 01:28:45,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:44" (2/3) ... [2019-10-15 01:28:45,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5174c90f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:28:45, skipping insertion in model container [2019-10-15 01:28:45,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:28:45" (3/3) ... [2019-10-15 01:28:45,786 INFO L109 eAbstractionObserver]: Analyzing ICFG toy2.cil.c [2019-10-15 01:28:45,797 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:28:45,818 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:28:45,831 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:28:45,864 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:28:45,864 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:28:45,865 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:28:45,865 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:28:45,865 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:28:45,865 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:28:45,866 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:28:45,866 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:28:45,890 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states. [2019-10-15 01:28:45,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-15 01:28:45,900 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:45,901 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:28:45,904 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:45,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:45,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1201692838, now seen corresponding path program 1 times [2019-10-15 01:28:45,916 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:45,917 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390335591] [2019-10-15 01:28:45,917 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:45,917 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:45,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:46,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:46,285 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:28:46,285 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390335591] [2019-10-15 01:28:46,288 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:46,289 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:28:46,290 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043156637] [2019-10-15 01:28:46,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:46,300 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:46,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:46,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:46,320 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 4 states. [2019-10-15 01:28:46,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:46,666 INFO L93 Difference]: Finished difference Result 438 states and 756 transitions. [2019-10-15 01:28:46,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:28:46,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-10-15 01:28:46,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:46,685 INFO L225 Difference]: With dead ends: 438 [2019-10-15 01:28:46,685 INFO L226 Difference]: Without dead ends: 283 [2019-10-15 01:28:46,690 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:46,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-10-15 01:28:46,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 276. [2019-10-15 01:28:46,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-10-15 01:28:46,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 452 transitions. [2019-10-15 01:28:46,783 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 452 transitions. Word has length 46 [2019-10-15 01:28:46,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:46,784 INFO L462 AbstractCegarLoop]: Abstraction has 276 states and 452 transitions. [2019-10-15 01:28:46,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:46,784 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 452 transitions. [2019-10-15 01:28:46,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-15 01:28:46,789 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:46,789 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:46,789 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:46,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:46,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1432311450, now seen corresponding path program 1 times [2019-10-15 01:28:46,790 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:46,790 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790042692] [2019-10-15 01:28:46,791 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:46,791 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:46,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:46,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:46,910 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:28:46,911 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790042692] [2019-10-15 01:28:46,911 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:46,911 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:28:46,911 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164376974] [2019-10-15 01:28:46,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:46,915 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:46,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:46,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:46,919 INFO L87 Difference]: Start difference. First operand 276 states and 452 transitions. Second operand 4 states. [2019-10-15 01:28:47,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:47,183 INFO L93 Difference]: Finished difference Result 726 states and 1189 transitions. [2019-10-15 01:28:47,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:47,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-10-15 01:28:47,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:47,189 INFO L225 Difference]: With dead ends: 726 [2019-10-15 01:28:47,190 INFO L226 Difference]: Without dead ends: 476 [2019-10-15 01:28:47,193 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:47,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2019-10-15 01:28:47,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 469. [2019-10-15 01:28:47,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2019-10-15 01:28:47,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 764 transitions. [2019-10-15 01:28:47,257 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 764 transitions. Word has length 46 [2019-10-15 01:28:47,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:47,258 INFO L462 AbstractCegarLoop]: Abstraction has 469 states and 764 transitions. [2019-10-15 01:28:47,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:47,258 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 764 transitions. [2019-10-15 01:28:47,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-15 01:28:47,262 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:47,263 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:28:47,263 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:47,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:47,263 INFO L82 PathProgramCache]: Analyzing trace with hash -730711576, now seen corresponding path program 1 times [2019-10-15 01:28:47,264 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:47,264 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418464824] [2019-10-15 01:28:47,264 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:47,264 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:47,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:47,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:47,375 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:28:47,375 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418464824] [2019-10-15 01:28:47,376 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:47,376 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:28:47,376 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051096397] [2019-10-15 01:28:47,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:47,377 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:47,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:47,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:47,380 INFO L87 Difference]: Start difference. First operand 469 states and 764 transitions. Second operand 4 states. [2019-10-15 01:28:47,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:47,640 INFO L93 Difference]: Finished difference Result 1289 states and 2109 transitions. [2019-10-15 01:28:47,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:47,641 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-10-15 01:28:47,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:47,648 INFO L225 Difference]: With dead ends: 1289 [2019-10-15 01:28:47,649 INFO L226 Difference]: Without dead ends: 848 [2019-10-15 01:28:47,651 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:47,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2019-10-15 01:28:47,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 833. [2019-10-15 01:28:47,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 833 states. [2019-10-15 01:28:47,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1358 transitions. [2019-10-15 01:28:47,719 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1358 transitions. Word has length 46 [2019-10-15 01:28:47,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:47,720 INFO L462 AbstractCegarLoop]: Abstraction has 833 states and 1358 transitions. [2019-10-15 01:28:47,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:47,720 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1358 transitions. [2019-10-15 01:28:47,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-15 01:28:47,725 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:47,725 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:28:47,726 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:47,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:47,726 INFO L82 PathProgramCache]: Analyzing trace with hash -708079322, now seen corresponding path program 1 times [2019-10-15 01:28:47,726 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:47,727 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651393714] [2019-10-15 01:28:47,727 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:47,727 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:47,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:47,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:47,803 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:28:47,804 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651393714] [2019-10-15 01:28:47,804 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:47,804 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:47,805 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480112976] [2019-10-15 01:28:47,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:47,806 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:47,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:47,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:47,806 INFO L87 Difference]: Start difference. First operand 833 states and 1358 transitions. Second operand 3 states. [2019-10-15 01:28:47,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:47,896 INFO L93 Difference]: Finished difference Result 2172 states and 3520 transitions. [2019-10-15 01:28:47,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:47,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-10-15 01:28:47,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:47,906 INFO L225 Difference]: With dead ends: 2172 [2019-10-15 01:28:47,907 INFO L226 Difference]: Without dead ends: 1371 [2019-10-15 01:28:47,910 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:28:47,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2019-10-15 01:28:47,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1360. [2019-10-15 01:28:47,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1360 states. [2019-10-15 01:28:47,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 2189 transitions. [2019-10-15 01:28:47,991 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 2189 transitions. Word has length 46 [2019-10-15 01:28:47,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:47,992 INFO L462 AbstractCegarLoop]: Abstraction has 1360 states and 2189 transitions. [2019-10-15 01:28:47,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:47,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 2189 transitions. [2019-10-15 01:28:47,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-15 01:28:47,995 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:47,995 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:28:47,995 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:47,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:47,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1217552412, now seen corresponding path program 1 times [2019-10-15 01:28:47,996 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:47,996 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568711058] [2019-10-15 01:28:47,996 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:47,997 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:47,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:48,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:48,055 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:28:48,055 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568711058] [2019-10-15 01:28:48,056 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:48,056 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:48,056 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350797518] [2019-10-15 01:28:48,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:48,057 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:48,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:48,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:48,057 INFO L87 Difference]: Start difference. First operand 1360 states and 2189 transitions. Second operand 3 states. [2019-10-15 01:28:48,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:48,208 INFO L93 Difference]: Finished difference Result 3660 states and 6067 transitions. [2019-10-15 01:28:48,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:48,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-10-15 01:28:48,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:48,225 INFO L225 Difference]: With dead ends: 3660 [2019-10-15 01:28:48,225 INFO L226 Difference]: Without dead ends: 2334 [2019-10-15 01:28:48,233 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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:28:48,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2334 states. [2019-10-15 01:28:48,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2334 to 2316. [2019-10-15 01:28:48,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2316 states. [2019-10-15 01:28:48,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2316 states to 2316 states and 3783 transitions. [2019-10-15 01:28:48,403 INFO L78 Accepts]: Start accepts. Automaton has 2316 states and 3783 transitions. Word has length 46 [2019-10-15 01:28:48,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:48,408 INFO L462 AbstractCegarLoop]: Abstraction has 2316 states and 3783 transitions. [2019-10-15 01:28:48,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:48,408 INFO L276 IsEmpty]: Start isEmpty. Operand 2316 states and 3783 transitions. [2019-10-15 01:28:48,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-15 01:28:48,415 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:48,415 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:28:48,416 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:48,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:48,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1587238149, now seen corresponding path program 1 times [2019-10-15 01:28:48,417 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:48,418 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123843306] [2019-10-15 01:28:48,419 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:48,419 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:48,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:48,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:48,512 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:28:48,512 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123843306] [2019-10-15 01:28:48,514 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:48,514 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:28:48,514 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147898002] [2019-10-15 01:28:48,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:48,515 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:48,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:48,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:48,516 INFO L87 Difference]: Start difference. First operand 2316 states and 3783 transitions. Second operand 4 states. [2019-10-15 01:28:48,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:48,758 INFO L93 Difference]: Finished difference Result 4923 states and 8047 transitions. [2019-10-15 01:28:48,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:48,759 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-10-15 01:28:48,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:48,781 INFO L225 Difference]: With dead ends: 4923 [2019-10-15 01:28:48,789 INFO L226 Difference]: Without dead ends: 2660 [2019-10-15 01:28:48,800 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:48,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2660 states. [2019-10-15 01:28:48,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2660 to 2637. [2019-10-15 01:28:48,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2637 states. [2019-10-15 01:28:49,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2637 states to 2637 states and 4281 transitions. [2019-10-15 01:28:49,003 INFO L78 Accepts]: Start accepts. Automaton has 2637 states and 4281 transitions. Word has length 46 [2019-10-15 01:28:49,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:49,004 INFO L462 AbstractCegarLoop]: Abstraction has 2637 states and 4281 transitions. [2019-10-15 01:28:49,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:49,005 INFO L276 IsEmpty]: Start isEmpty. Operand 2637 states and 4281 transitions. [2019-10-15 01:28:49,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-15 01:28:49,007 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:49,008 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:28:49,008 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:49,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:49,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1136286267, now seen corresponding path program 1 times [2019-10-15 01:28:49,008 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:49,009 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132550949] [2019-10-15 01:28:49,009 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:49,009 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:49,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:49,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:49,079 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:28:49,079 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132550949] [2019-10-15 01:28:49,079 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:49,080 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:28:49,080 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360922758] [2019-10-15 01:28:49,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:49,081 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:49,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:49,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:49,082 INFO L87 Difference]: Start difference. First operand 2637 states and 4281 transitions. Second operand 4 states. [2019-10-15 01:28:49,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:49,378 INFO L93 Difference]: Finished difference Result 5259 states and 8657 transitions. [2019-10-15 01:28:49,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:28:49,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-10-15 01:28:49,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:49,396 INFO L225 Difference]: With dead ends: 5259 [2019-10-15 01:28:49,397 INFO L226 Difference]: Without dead ends: 2664 [2019-10-15 01:28:49,412 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:49,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2664 states. [2019-10-15 01:28:49,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2664 to 2641. [2019-10-15 01:28:49,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2641 states. [2019-10-15 01:28:49,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2641 states to 2641 states and 4217 transitions. [2019-10-15 01:28:49,568 INFO L78 Accepts]: Start accepts. Automaton has 2641 states and 4217 transitions. Word has length 46 [2019-10-15 01:28:49,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:49,569 INFO L462 AbstractCegarLoop]: Abstraction has 2641 states and 4217 transitions. [2019-10-15 01:28:49,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:49,570 INFO L276 IsEmpty]: Start isEmpty. Operand 2641 states and 4217 transitions. [2019-10-15 01:28:49,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-15 01:28:49,572 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:49,572 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:28:49,573 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:49,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:49,573 INFO L82 PathProgramCache]: Analyzing trace with hash 318637817, now seen corresponding path program 1 times [2019-10-15 01:28:49,574 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:49,575 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812008245] [2019-10-15 01:28:49,575 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:49,575 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:49,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:49,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:49,646 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:28:49,647 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812008245] [2019-10-15 01:28:49,647 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:49,647 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:28:49,648 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303645286] [2019-10-15 01:28:49,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:49,648 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:49,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:49,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:49,649 INFO L87 Difference]: Start difference. First operand 2641 states and 4217 transitions. Second operand 4 states. [2019-10-15 01:28:50,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:50,059 INFO L93 Difference]: Finished difference Result 5905 states and 9437 transitions. [2019-10-15 01:28:50,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:28:50,060 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-10-15 01:28:50,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:50,082 INFO L225 Difference]: With dead ends: 5905 [2019-10-15 01:28:50,082 INFO L226 Difference]: Without dead ends: 3314 [2019-10-15 01:28:50,097 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:50,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3314 states. [2019-10-15 01:28:50,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3314 to 3275. [2019-10-15 01:28:50,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3275 states. [2019-10-15 01:28:50,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3275 states to 3275 states and 5203 transitions. [2019-10-15 01:28:50,278 INFO L78 Accepts]: Start accepts. Automaton has 3275 states and 5203 transitions. Word has length 46 [2019-10-15 01:28:50,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:50,279 INFO L462 AbstractCegarLoop]: Abstraction has 3275 states and 5203 transitions. [2019-10-15 01:28:50,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:50,280 INFO L276 IsEmpty]: Start isEmpty. Operand 3275 states and 5203 transitions. [2019-10-15 01:28:50,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-15 01:28:50,281 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:50,281 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:28:50,281 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:50,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:50,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1370305925, now seen corresponding path program 1 times [2019-10-15 01:28:50,282 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:50,282 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572395940] [2019-10-15 01:28:50,282 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:50,283 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:50,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:50,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:50,352 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:28:50,353 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572395940] [2019-10-15 01:28:50,355 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:50,355 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:50,355 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853938950] [2019-10-15 01:28:50,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:50,356 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:50,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:50,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:50,357 INFO L87 Difference]: Start difference. First operand 3275 states and 5203 transitions. Second operand 3 states. [2019-10-15 01:28:50,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:50,579 INFO L93 Difference]: Finished difference Result 6799 states and 10944 transitions. [2019-10-15 01:28:50,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:50,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-10-15 01:28:50,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:50,603 INFO L225 Difference]: With dead ends: 6799 [2019-10-15 01:28:50,603 INFO L226 Difference]: Without dead ends: 3590 [2019-10-15 01:28:50,624 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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:28:50,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3590 states. [2019-10-15 01:28:50,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3590 to 3590. [2019-10-15 01:28:50,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3590 states. [2019-10-15 01:28:50,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3590 states to 3590 states and 5596 transitions. [2019-10-15 01:28:50,838 INFO L78 Accepts]: Start accepts. Automaton has 3590 states and 5596 transitions. Word has length 46 [2019-10-15 01:28:50,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:50,838 INFO L462 AbstractCegarLoop]: Abstraction has 3590 states and 5596 transitions. [2019-10-15 01:28:50,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:50,840 INFO L276 IsEmpty]: Start isEmpty. Operand 3590 states and 5596 transitions. [2019-10-15 01:28:50,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-15 01:28:50,842 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:50,842 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:28:50,842 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:50,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:50,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1336313469, now seen corresponding path program 1 times [2019-10-15 01:28:50,843 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:50,843 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879717385] [2019-10-15 01:28:50,843 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:50,843 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:50,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:50,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:50,889 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:28:50,890 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879717385] [2019-10-15 01:28:50,890 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:50,891 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:50,891 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809568359] [2019-10-15 01:28:50,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:50,893 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:50,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:50,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:50,893 INFO L87 Difference]: Start difference. First operand 3590 states and 5596 transitions. Second operand 3 states. [2019-10-15 01:28:51,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:51,111 INFO L93 Difference]: Finished difference Result 7722 states and 12319 transitions. [2019-10-15 01:28:51,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:51,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-10-15 01:28:51,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:51,143 INFO L225 Difference]: With dead ends: 7722 [2019-10-15 01:28:51,143 INFO L226 Difference]: Without dead ends: 4168 [2019-10-15 01:28:51,174 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:28:51,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4168 states. [2019-10-15 01:28:51,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4168 to 4076. [2019-10-15 01:28:51,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4076 states. [2019-10-15 01:28:51,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4076 states to 4076 states and 6283 transitions. [2019-10-15 01:28:51,459 INFO L78 Accepts]: Start accepts. Automaton has 4076 states and 6283 transitions. Word has length 46 [2019-10-15 01:28:51,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:51,459 INFO L462 AbstractCegarLoop]: Abstraction has 4076 states and 6283 transitions. [2019-10-15 01:28:51,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:51,460 INFO L276 IsEmpty]: Start isEmpty. Operand 4076 states and 6283 transitions. [2019-10-15 01:28:51,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-15 01:28:51,469 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:51,469 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-10-15 01:28:51,469 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:51,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:51,470 INFO L82 PathProgramCache]: Analyzing trace with hash 168007946, now seen corresponding path program 1 times [2019-10-15 01:28:51,470 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:51,470 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092508363] [2019-10-15 01:28:51,471 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:51,471 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:51,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:51,551 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:28:51,552 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092508363] [2019-10-15 01:28:51,552 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660958695] [2019-10-15 01:28:51,552 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:28:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:51,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:28:51,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:51,787 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:28:51,788 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:51,854 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-15 01:28:51,855 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:28:51,855 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7, 3] total 9 [2019-10-15 01:28:51,855 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996869154] [2019-10-15 01:28:51,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:51,856 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:51,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:51,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:28:51,858 INFO L87 Difference]: Start difference. First operand 4076 states and 6283 transitions. Second operand 3 states. [2019-10-15 01:28:52,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:52,236 INFO L93 Difference]: Finished difference Result 8977 states and 14142 transitions. [2019-10-15 01:28:52,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:52,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-10-15 01:28:52,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:52,262 INFO L225 Difference]: With dead ends: 8977 [2019-10-15 01:28:52,262 INFO L226 Difference]: Without dead ends: 2873 [2019-10-15 01:28:52,293 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:28:52,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2873 states. [2019-10-15 01:28:52,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2873 to 2873. [2019-10-15 01:28:52,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2873 states. [2019-10-15 01:28:52,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2873 states to 2873 states and 4294 transitions. [2019-10-15 01:28:52,498 INFO L78 Accepts]: Start accepts. Automaton has 2873 states and 4294 transitions. Word has length 80 [2019-10-15 01:28:52,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:52,498 INFO L462 AbstractCegarLoop]: Abstraction has 2873 states and 4294 transitions. [2019-10-15 01:28:52,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:52,498 INFO L276 IsEmpty]: Start isEmpty. Operand 2873 states and 4294 transitions. [2019-10-15 01:28:52,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-15 01:28:52,513 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:52,513 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:52,717 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:52,718 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:52,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:52,718 INFO L82 PathProgramCache]: Analyzing trace with hash 342871604, now seen corresponding path program 1 times [2019-10-15 01:28:52,718 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:52,719 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454592479] [2019-10-15 01:28:52,719 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:52,719 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:52,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:52,812 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:28:52,813 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454592479] [2019-10-15 01:28:52,813 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:52,813 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:52,814 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130212239] [2019-10-15 01:28:52,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:52,814 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:52,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:52,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:52,815 INFO L87 Difference]: Start difference. First operand 2873 states and 4294 transitions. Second operand 3 states. [2019-10-15 01:28:53,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:53,045 INFO L93 Difference]: Finished difference Result 6661 states and 10213 transitions. [2019-10-15 01:28:53,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:53,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-10-15 01:28:53,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:53,066 INFO L225 Difference]: With dead ends: 6661 [2019-10-15 01:28:53,067 INFO L226 Difference]: Without dead ends: 3828 [2019-10-15 01:28:53,080 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:28:53,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3828 states. [2019-10-15 01:28:53,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3828 to 3825. [2019-10-15 01:28:53,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3825 states. [2019-10-15 01:28:53,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3825 states to 3825 states and 5650 transitions. [2019-10-15 01:28:53,414 INFO L78 Accepts]: Start accepts. Automaton has 3825 states and 5650 transitions. Word has length 121 [2019-10-15 01:28:53,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:53,414 INFO L462 AbstractCegarLoop]: Abstraction has 3825 states and 5650 transitions. [2019-10-15 01:28:53,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:53,415 INFO L276 IsEmpty]: Start isEmpty. Operand 3825 states and 5650 transitions. [2019-10-15 01:28:53,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-15 01:28:53,436 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:53,436 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:53,437 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:53,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:53,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1214473221, now seen corresponding path program 1 times [2019-10-15 01:28:53,437 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:53,438 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414992242] [2019-10-15 01:28:53,438 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:53,438 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:53,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:53,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:53,555 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-15 01:28:53,555 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414992242] [2019-10-15 01:28:53,555 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:53,556 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:28:53,556 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170824574] [2019-10-15 01:28:53,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:53,557 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:53,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:53,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:53,558 INFO L87 Difference]: Start difference. First operand 3825 states and 5650 transitions. Second operand 4 states. [2019-10-15 01:28:54,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:54,186 INFO L93 Difference]: Finished difference Result 11136 states and 16615 transitions. [2019-10-15 01:28:54,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:54,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-10-15 01:28:54,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:54,232 INFO L225 Difference]: With dead ends: 11136 [2019-10-15 01:28:54,232 INFO L226 Difference]: Without dead ends: 7320 [2019-10-15 01:28:54,245 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:54,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7320 states. [2019-10-15 01:28:54,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7320 to 6543. [2019-10-15 01:28:54,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6543 states. [2019-10-15 01:28:54,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6543 states to 6543 states and 9789 transitions. [2019-10-15 01:28:54,794 INFO L78 Accepts]: Start accepts. Automaton has 6543 states and 9789 transitions. Word has length 123 [2019-10-15 01:28:54,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:54,795 INFO L462 AbstractCegarLoop]: Abstraction has 6543 states and 9789 transitions. [2019-10-15 01:28:54,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:54,795 INFO L276 IsEmpty]: Start isEmpty. Operand 6543 states and 9789 transitions. [2019-10-15 01:28:54,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-15 01:28:54,825 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:54,825 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:54,825 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:54,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:54,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1544152971, now seen corresponding path program 1 times [2019-10-15 01:28:54,826 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:54,826 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351255489] [2019-10-15 01:28:54,826 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:54,826 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:54,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:54,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:54,884 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-15 01:28:54,885 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351255489] [2019-10-15 01:28:54,885 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:54,885 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:54,886 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500377183] [2019-10-15 01:28:54,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:54,886 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:54,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:54,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:54,887 INFO L87 Difference]: Start difference. First operand 6543 states and 9789 transitions. Second operand 3 states. [2019-10-15 01:28:55,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:55,193 INFO L93 Difference]: Finished difference Result 11156 states and 16740 transitions. [2019-10-15 01:28:55,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:55,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-10-15 01:28:55,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:55,219 INFO L225 Difference]: With dead ends: 11156 [2019-10-15 01:28:55,219 INFO L226 Difference]: Without dead ends: 4646 [2019-10-15 01:28:55,237 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:28:55,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4646 states. [2019-10-15 01:28:55,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4646 to 4646. [2019-10-15 01:28:55,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4646 states. [2019-10-15 01:28:55,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4646 states to 4646 states and 6990 transitions. [2019-10-15 01:28:55,701 INFO L78 Accepts]: Start accepts. Automaton has 4646 states and 6990 transitions. Word has length 139 [2019-10-15 01:28:55,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:55,702 INFO L462 AbstractCegarLoop]: Abstraction has 4646 states and 6990 transitions. [2019-10-15 01:28:55,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:55,702 INFO L276 IsEmpty]: Start isEmpty. Operand 4646 states and 6990 transitions. [2019-10-15 01:28:55,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-15 01:28:55,726 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:55,726 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:55,727 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:55,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:55,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1390782380, now seen corresponding path program 1 times [2019-10-15 01:28:55,727 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:55,728 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233863235] [2019-10-15 01:28:55,728 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:55,728 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:55,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:55,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:55,822 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-15 01:28:55,823 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233863235] [2019-10-15 01:28:55,823 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197650565] [2019-10-15 01:28:55,823 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:28:56,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:56,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 948 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:56,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:56,066 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 01:28:56,066 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:56,155 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-15 01:28:56,156 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:28:56,156 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 6 [2019-10-15 01:28:56,161 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620206392] [2019-10-15 01:28:56,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:56,165 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:56,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:56,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:56,166 INFO L87 Difference]: Start difference. First operand 4646 states and 6990 transitions. Second operand 3 states. [2019-10-15 01:28:56,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:56,566 INFO L93 Difference]: Finished difference Result 10311 states and 16231 transitions. [2019-10-15 01:28:56,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:56,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-10-15 01:28:56,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:56,597 INFO L225 Difference]: With dead ends: 10311 [2019-10-15 01:28:56,597 INFO L226 Difference]: Without dead ends: 5698 [2019-10-15 01:28:56,622 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:56,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5698 states. [2019-10-15 01:28:57,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5698 to 5587. [2019-10-15 01:28:57,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5587 states. [2019-10-15 01:28:57,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5587 states to 5587 states and 8376 transitions. [2019-10-15 01:28:57,109 INFO L78 Accepts]: Start accepts. Automaton has 5587 states and 8376 transitions. Word has length 132 [2019-10-15 01:28:57,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:57,110 INFO L462 AbstractCegarLoop]: Abstraction has 5587 states and 8376 transitions. [2019-10-15 01:28:57,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:57,110 INFO L276 IsEmpty]: Start isEmpty. Operand 5587 states and 8376 transitions. [2019-10-15 01:28:57,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-15 01:28:57,141 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:57,141 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:57,354 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:57,355 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:57,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:57,355 INFO L82 PathProgramCache]: Analyzing trace with hash -2076413091, now seen corresponding path program 1 times [2019-10-15 01:28:57,356 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:57,356 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959425997] [2019-10-15 01:28:57,356 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:57,356 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:57,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:57,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:57,499 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-15 01:28:57,500 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959425997] [2019-10-15 01:28:57,500 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923424182] [2019-10-15 01:28:57,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:57,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 950 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:57,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:57,811 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-15 01:28:57,811 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:57,876 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-15 01:28:57,877 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:28:57,878 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 6 [2019-10-15 01:28:57,878 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897630485] [2019-10-15 01:28:57,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:57,880 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:57,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:57,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:57,881 INFO L87 Difference]: Start difference. First operand 5587 states and 8376 transitions. Second operand 3 states. [2019-10-15 01:28:58,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:58,193 INFO L93 Difference]: Finished difference Result 8900 states and 13353 transitions. [2019-10-15 01:28:58,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:58,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-10-15 01:28:58,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:58,223 INFO L225 Difference]: With dead ends: 8900 [2019-10-15 01:28:58,223 INFO L226 Difference]: Without dead ends: 5671 [2019-10-15 01:28:58,234 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:58,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5671 states. [2019-10-15 01:28:58,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5671 to 5671. [2019-10-15 01:28:58,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5671 states. [2019-10-15 01:28:58,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5671 states to 5671 states and 8460 transitions. [2019-10-15 01:28:58,591 INFO L78 Accepts]: Start accepts. Automaton has 5671 states and 8460 transitions. Word has length 133 [2019-10-15 01:28:58,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:58,592 INFO L462 AbstractCegarLoop]: Abstraction has 5671 states and 8460 transitions. [2019-10-15 01:28:58,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:58,592 INFO L276 IsEmpty]: Start isEmpty. Operand 5671 states and 8460 transitions. [2019-10-15 01:28:58,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-15 01:28:58,621 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:58,621 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:58,827 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:58,827 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:58,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:58,828 INFO L82 PathProgramCache]: Analyzing trace with hash 2016730271, now seen corresponding path program 1 times [2019-10-15 01:28:58,828 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:58,828 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134168856] [2019-10-15 01:28:58,829 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:58,829 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:58,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:59,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:59,345 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-15 01:28:59,345 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134168856] [2019-10-15 01:28:59,346 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465592491] [2019-10-15 01:28:59,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:59,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:59,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 953 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:59,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:59,574 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-15 01:28:59,574 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:59,614 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-15 01:28:59,615 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:28:59,615 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 6 [2019-10-15 01:28:59,616 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981383961] [2019-10-15 01:28:59,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:59,616 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:59,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:59,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:59,617 INFO L87 Difference]: Start difference. First operand 5671 states and 8460 transitions. Second operand 3 states. [2019-10-15 01:28:59,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:59,857 INFO L93 Difference]: Finished difference Result 9909 states and 14850 transitions. [2019-10-15 01:28:59,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:59,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-10-15 01:28:59,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:59,888 INFO L225 Difference]: With dead ends: 9909 [2019-10-15 01:28:59,888 INFO L226 Difference]: Without dead ends: 5865 [2019-10-15 01:28:59,900 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:59,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5865 states. [2019-10-15 01:29:00,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5865 to 5865. [2019-10-15 01:29:00,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5865 states. [2019-10-15 01:29:00,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5865 states to 5865 states and 8689 transitions. [2019-10-15 01:29:00,229 INFO L78 Accepts]: Start accepts. Automaton has 5865 states and 8689 transitions. Word has length 133 [2019-10-15 01:29:00,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:00,230 INFO L462 AbstractCegarLoop]: Abstraction has 5865 states and 8689 transitions. [2019-10-15 01:29:00,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:29:00,230 INFO L276 IsEmpty]: Start isEmpty. Operand 5865 states and 8689 transitions. [2019-10-15 01:29:00,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-15 01:29:00,252 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:00,252 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:00,457 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:00,457 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:00,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:00,458 INFO L82 PathProgramCache]: Analyzing trace with hash 77568225, now seen corresponding path program 1 times [2019-10-15 01:29:00,458 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:00,458 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142342821] [2019-10-15 01:29:00,458 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:00,458 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:00,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:00,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:00,547 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-15 01:29:00,548 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142342821] [2019-10-15 01:29:00,548 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248135143] [2019-10-15 01:29:00,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:00,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:00,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 956 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-15 01:29:00,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:29:00,806 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-15 01:29:00,807 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:00,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:29:00,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:29:00,954 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-15 01:29:00,954 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:29:00,955 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [5] total 8 [2019-10-15 01:29:00,955 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340339922] [2019-10-15 01:29:00,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:29:00,956 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:00,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:29:00,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:29:00,957 INFO L87 Difference]: Start difference. First operand 5865 states and 8689 transitions. Second operand 5 states. [2019-10-15 01:29:01,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:01,425 INFO L93 Difference]: Finished difference Result 9238 states and 13902 transitions. [2019-10-15 01:29:01,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:29:01,425 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-10-15 01:29:01,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:01,453 INFO L225 Difference]: With dead ends: 9238 [2019-10-15 01:29:01,453 INFO L226 Difference]: Without dead ends: 6398 [2019-10-15 01:29:01,462 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 264 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:29:01,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6398 states. [2019-10-15 01:29:01,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6398 to 6282. [2019-10-15 01:29:01,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6282 states. [2019-10-15 01:29:01,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6282 states to 6282 states and 9437 transitions. [2019-10-15 01:29:01,783 INFO L78 Accepts]: Start accepts. Automaton has 6282 states and 9437 transitions. Word has length 133 [2019-10-15 01:29:01,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:01,783 INFO L462 AbstractCegarLoop]: Abstraction has 6282 states and 9437 transitions. [2019-10-15 01:29:01,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:29:01,783 INFO L276 IsEmpty]: Start isEmpty. Operand 6282 states and 9437 transitions. [2019-10-15 01:29:01,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-15 01:29:01,798 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:01,798 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:02,004 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:02,004 INFO L410 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:02,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:02,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1951017885, now seen corresponding path program 1 times [2019-10-15 01:29:02,005 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:02,006 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703291784] [2019-10-15 01:29:02,006 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:02,006 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:02,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:02,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:02,081 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-15 01:29:02,082 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703291784] [2019-10-15 01:29:02,082 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940356091] [2019-10-15 01:29:02,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:02,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:02,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 953 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-15 01:29:02,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:29:02,296 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 01:29:02,297 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:02,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:29:02,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:29:02,431 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-15 01:29:02,432 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:29:02,432 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2019-10-15 01:29:02,432 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638868730] [2019-10-15 01:29:02,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:29:02,433 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:02,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:29:02,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:29:02,434 INFO L87 Difference]: Start difference. First operand 6282 states and 9437 transitions. Second operand 5 states. [2019-10-15 01:29:03,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:03,158 INFO L93 Difference]: Finished difference Result 12792 states and 19640 transitions. [2019-10-15 01:29:03,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:29:03,159 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-10-15 01:29:03,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:03,193 INFO L225 Difference]: With dead ends: 12792 [2019-10-15 01:29:03,194 INFO L226 Difference]: Without dead ends: 8022 [2019-10-15 01:29:03,206 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 261 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:29:03,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8022 states. [2019-10-15 01:29:03,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8022 to 7893. [2019-10-15 01:29:03,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7893 states. [2019-10-15 01:29:03,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7893 states to 7893 states and 12089 transitions. [2019-10-15 01:29:03,623 INFO L78 Accepts]: Start accepts. Automaton has 7893 states and 12089 transitions. Word has length 133 [2019-10-15 01:29:03,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:03,623 INFO L462 AbstractCegarLoop]: Abstraction has 7893 states and 12089 transitions. [2019-10-15 01:29:03,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:29:03,623 INFO L276 IsEmpty]: Start isEmpty. Operand 7893 states and 12089 transitions. [2019-10-15 01:29:03,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-15 01:29:03,636 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:03,636 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:03,840 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:03,841 INFO L410 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:03,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:03,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1590862074, now seen corresponding path program 1 times [2019-10-15 01:29:03,842 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:03,842 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493850004] [2019-10-15 01:29:03,843 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:03,843 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:03,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:03,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:03,896 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-15 01:29:03,896 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493850004] [2019-10-15 01:29:03,897 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:03,897 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:29:03,897 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996598665] [2019-10-15 01:29:03,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:29:03,898 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:03,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:29:03,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:29:03,899 INFO L87 Difference]: Start difference. First operand 7893 states and 12089 transitions. Second operand 3 states. [2019-10-15 01:29:04,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:04,239 INFO L93 Difference]: Finished difference Result 13107 states and 20170 transitions. [2019-10-15 01:29:04,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:04,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-10-15 01:29:04,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:04,265 INFO L225 Difference]: With dead ends: 13107 [2019-10-15 01:29:04,265 INFO L226 Difference]: Without dead ends: 5246 [2019-10-15 01:29:04,287 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:29:04,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5246 states. [2019-10-15 01:29:04,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5246 to 5150. [2019-10-15 01:29:04,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5150 states. [2019-10-15 01:29:04,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5150 states to 5150 states and 7557 transitions. [2019-10-15 01:29:04,712 INFO L78 Accepts]: Start accepts. Automaton has 5150 states and 7557 transitions. Word has length 147 [2019-10-15 01:29:04,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:04,713 INFO L462 AbstractCegarLoop]: Abstraction has 5150 states and 7557 transitions. [2019-10-15 01:29:04,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:29:04,714 INFO L276 IsEmpty]: Start isEmpty. Operand 5150 states and 7557 transitions. [2019-10-15 01:29:04,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-15 01:29:04,731 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:04,732 INFO L380 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:04,732 INFO L410 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:04,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:04,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1656891545, now seen corresponding path program 1 times [2019-10-15 01:29:04,733 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:04,733 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669922785] [2019-10-15 01:29:04,734 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:04,734 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:04,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:04,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:04,827 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-15 01:29:04,827 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669922785] [2019-10-15 01:29:04,828 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:04,828 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:29:04,828 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013107840] [2019-10-15 01:29:04,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:29:04,830 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:04,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:29:04,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:29:04,831 INFO L87 Difference]: Start difference. First operand 5150 states and 7557 transitions. Second operand 3 states. [2019-10-15 01:29:05,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:05,267 INFO L93 Difference]: Finished difference Result 10863 states and 16058 transitions. [2019-10-15 01:29:05,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:05,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-10-15 01:29:05,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:05,302 INFO L225 Difference]: With dead ends: 10863 [2019-10-15 01:29:05,302 INFO L226 Difference]: Without dead ends: 5749 [2019-10-15 01:29:05,320 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:29:05,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5749 states. [2019-10-15 01:29:05,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5749 to 5730. [2019-10-15 01:29:05,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5730 states. [2019-10-15 01:29:05,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5730 states to 5730 states and 8154 transitions. [2019-10-15 01:29:05,631 INFO L78 Accepts]: Start accepts. Automaton has 5730 states and 8154 transitions. Word has length 148 [2019-10-15 01:29:05,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:05,631 INFO L462 AbstractCegarLoop]: Abstraction has 5730 states and 8154 transitions. [2019-10-15 01:29:05,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:29:05,631 INFO L276 IsEmpty]: Start isEmpty. Operand 5730 states and 8154 transitions. [2019-10-15 01:29:05,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-15 01:29:05,644 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:05,644 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:05,645 INFO L410 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:05,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:05,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1162809651, now seen corresponding path program 1 times [2019-10-15 01:29:05,645 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:05,645 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19566969] [2019-10-15 01:29:05,646 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:05,646 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:05,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:05,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:05,781 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 43 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 01:29:05,782 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19566969] [2019-10-15 01:29:05,782 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688425196] [2019-10-15 01:29:05,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:05,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:05,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 1006 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:29:05,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:29:05,968 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-15 01:29:05,968 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:06,030 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-15 01:29:06,030 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:29:06,030 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9, 3] total 11 [2019-10-15 01:29:06,031 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212460035] [2019-10-15 01:29:06,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:29:06,031 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:06,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:29:06,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:29:06,032 INFO L87 Difference]: Start difference. First operand 5730 states and 8154 transitions. Second operand 3 states. [2019-10-15 01:29:06,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:06,477 INFO L93 Difference]: Finished difference Result 14164 states and 20540 transitions. [2019-10-15 01:29:06,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:06,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-10-15 01:29:06,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:06,515 INFO L225 Difference]: With dead ends: 14164 [2019-10-15 01:29:06,515 INFO L226 Difference]: Without dead ends: 8489 [2019-10-15 01:29:06,533 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:29:06,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8489 states. [2019-10-15 01:29:07,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8489 to 7321. [2019-10-15 01:29:07,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7321 states. [2019-10-15 01:29:07,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7321 states to 7321 states and 10399 transitions. [2019-10-15 01:29:07,044 INFO L78 Accepts]: Start accepts. Automaton has 7321 states and 10399 transitions. Word has length 148 [2019-10-15 01:29:07,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:07,045 INFO L462 AbstractCegarLoop]: Abstraction has 7321 states and 10399 transitions. [2019-10-15 01:29:07,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:29:07,045 INFO L276 IsEmpty]: Start isEmpty. Operand 7321 states and 10399 transitions. [2019-10-15 01:29:07,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-15 01:29:07,052 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:07,053 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:07,257 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:07,257 INFO L410 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:07,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:07,258 INFO L82 PathProgramCache]: Analyzing trace with hash 2135959180, now seen corresponding path program 1 times [2019-10-15 01:29:07,258 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:07,258 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578261263] [2019-10-15 01:29:07,258 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:07,258 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:07,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:07,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:07,310 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-15 01:29:07,311 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578261263] [2019-10-15 01:29:07,311 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:07,311 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:29:07,311 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531374348] [2019-10-15 01:29:07,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:29:07,312 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:07,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:29:07,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:29:07,313 INFO L87 Difference]: Start difference. First operand 7321 states and 10399 transitions. Second operand 3 states. [2019-10-15 01:29:07,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:07,664 INFO L93 Difference]: Finished difference Result 13283 states and 19002 transitions. [2019-10-15 01:29:07,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:07,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-10-15 01:29:07,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:07,692 INFO L225 Difference]: With dead ends: 13283 [2019-10-15 01:29:07,692 INFO L226 Difference]: Without dead ends: 6422 [2019-10-15 01:29:07,706 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:29:07,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6422 states. [2019-10-15 01:29:08,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6422 to 6422. [2019-10-15 01:29:08,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6422 states. [2019-10-15 01:29:08,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6422 states to 6422 states and 9224 transitions. [2019-10-15 01:29:08,038 INFO L78 Accepts]: Start accepts. Automaton has 6422 states and 9224 transitions. Word has length 160 [2019-10-15 01:29:08,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:08,038 INFO L462 AbstractCegarLoop]: Abstraction has 6422 states and 9224 transitions. [2019-10-15 01:29:08,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:29:08,038 INFO L276 IsEmpty]: Start isEmpty. Operand 6422 states and 9224 transitions. [2019-10-15 01:29:08,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-15 01:29:08,047 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:08,047 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:08,047 INFO L410 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:08,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:08,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1235840690, now seen corresponding path program 1 times [2019-10-15 01:29:08,048 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:08,048 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171407138] [2019-10-15 01:29:08,048 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:08,048 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:08,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:08,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:08,113 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 47 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-15 01:29:08,114 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171407138] [2019-10-15 01:29:08,114 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899997092] [2019-10-15 01:29:08,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:08,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:08,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 1059 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:29:08,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:29:08,403 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-15 01:29:08,403 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:08,475 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-15 01:29:08,476 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:29:08,476 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-15 01:29:08,477 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125598067] [2019-10-15 01:29:08,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:29:08,480 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:08,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:29:08,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:08,481 INFO L87 Difference]: Start difference. First operand 6422 states and 9224 transitions. Second operand 3 states. [2019-10-15 01:29:09,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:09,052 INFO L93 Difference]: Finished difference Result 16708 states and 24954 transitions. [2019-10-15 01:29:09,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:09,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-10-15 01:29:09,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:09,104 INFO L225 Difference]: With dead ends: 16708 [2019-10-15 01:29:09,105 INFO L226 Difference]: Without dead ends: 10322 [2019-10-15 01:29:09,139 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:09,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10322 states. [2019-10-15 01:29:09,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10322 to 10155. [2019-10-15 01:29:09,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10155 states. [2019-10-15 01:29:09,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10155 states to 10155 states and 14566 transitions. [2019-10-15 01:29:09,728 INFO L78 Accepts]: Start accepts. Automaton has 10155 states and 14566 transitions. Word has length 160 [2019-10-15 01:29:09,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:09,729 INFO L462 AbstractCegarLoop]: Abstraction has 10155 states and 14566 transitions. [2019-10-15 01:29:09,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:29:09,729 INFO L276 IsEmpty]: Start isEmpty. Operand 10155 states and 14566 transitions. [2019-10-15 01:29:09,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-15 01:29:09,739 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:09,739 INFO L380 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:09,944 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:09,945 INFO L410 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:09,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:09,946 INFO L82 PathProgramCache]: Analyzing trace with hash -48554010, now seen corresponding path program 1 times [2019-10-15 01:29:09,946 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:09,946 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909997073] [2019-10-15 01:29:09,947 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:09,947 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:09,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:09,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:10,020 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 37 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-15 01:29:10,020 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909997073] [2019-10-15 01:29:10,021 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378642842] [2019-10-15 01:29:10,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:10,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:10,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 1060 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:29:10,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:29:10,222 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-15 01:29:10,222 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:10,294 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-15 01:29:10,295 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:29:10,295 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 6 [2019-10-15 01:29:10,295 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532614706] [2019-10-15 01:29:10,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:29:10,296 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:10,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:29:10,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:29:10,297 INFO L87 Difference]: Start difference. First operand 10155 states and 14566 transitions. Second operand 3 states. [2019-10-15 01:29:10,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:10,927 INFO L93 Difference]: Finished difference Result 25699 states and 37706 transitions. [2019-10-15 01:29:10,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:10,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-10-15 01:29:10,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:10,996 INFO L225 Difference]: With dead ends: 25699 [2019-10-15 01:29:10,996 INFO L226 Difference]: Without dead ends: 16170 [2019-10-15 01:29:11,029 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:29:11,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16170 states. [2019-10-15 01:29:11,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16170 to 16139. [2019-10-15 01:29:11,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16139 states. [2019-10-15 01:29:11,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16139 states to 16139 states and 23130 transitions. [2019-10-15 01:29:11,773 INFO L78 Accepts]: Start accepts. Automaton has 16139 states and 23130 transitions. Word has length 161 [2019-10-15 01:29:11,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:11,774 INFO L462 AbstractCegarLoop]: Abstraction has 16139 states and 23130 transitions. [2019-10-15 01:29:11,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:29:11,774 INFO L276 IsEmpty]: Start isEmpty. Operand 16139 states and 23130 transitions. [2019-10-15 01:29:11,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-15 01:29:11,897 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:11,897 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:12,101 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:12,102 INFO L410 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:12,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:12,103 INFO L82 PathProgramCache]: Analyzing trace with hash -792184835, now seen corresponding path program 1 times [2019-10-15 01:29:12,103 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:12,103 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961259818] [2019-10-15 01:29:12,104 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:12,104 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:12,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:12,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:12,165 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-15 01:29:12,166 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961259818] [2019-10-15 01:29:12,166 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:12,166 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:29:12,166 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579958380] [2019-10-15 01:29:12,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:29:12,167 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:12,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:29:12,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:29:12,168 INFO L87 Difference]: Start difference. First operand 16139 states and 23130 transitions. Second operand 3 states. [2019-10-15 01:29:12,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:12,783 INFO L93 Difference]: Finished difference Result 27433 states and 39320 transitions. [2019-10-15 01:29:12,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:12,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-10-15 01:29:12,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:12,844 INFO L225 Difference]: With dead ends: 27433 [2019-10-15 01:29:12,844 INFO L226 Difference]: Without dead ends: 16338 [2019-10-15 01:29:12,879 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:29:12,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16338 states. [2019-10-15 01:29:13,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16338 to 16111. [2019-10-15 01:29:13,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16111 states. [2019-10-15 01:29:13,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16111 states to 16111 states and 22672 transitions. [2019-10-15 01:29:13,669 INFO L78 Accepts]: Start accepts. Automaton has 16111 states and 22672 transitions. Word has length 163 [2019-10-15 01:29:13,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:13,669 INFO L462 AbstractCegarLoop]: Abstraction has 16111 states and 22672 transitions. [2019-10-15 01:29:13,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:29:13,669 INFO L276 IsEmpty]: Start isEmpty. Operand 16111 states and 22672 transitions. [2019-10-15 01:29:13,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-15 01:29:13,685 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:13,685 INFO L380 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:13,685 INFO L410 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:13,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:13,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1352507109, now seen corresponding path program 1 times [2019-10-15 01:29:13,686 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:13,686 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825703082] [2019-10-15 01:29:13,686 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:13,686 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:13,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:13,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:13,761 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-15 01:29:13,762 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825703082] [2019-10-15 01:29:13,762 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:13,762 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:29:13,762 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216098290] [2019-10-15 01:29:13,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:29:13,763 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:13,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:29:13,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:29:13,764 INFO L87 Difference]: Start difference. First operand 16111 states and 22672 transitions. Second operand 3 states. [2019-10-15 01:29:14,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:14,358 INFO L93 Difference]: Finished difference Result 25242 states and 35352 transitions. [2019-10-15 01:29:14,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:14,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-10-15 01:29:14,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:14,410 INFO L225 Difference]: With dead ends: 25242 [2019-10-15 01:29:14,410 INFO L226 Difference]: Without dead ends: 15168 [2019-10-15 01:29:14,440 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:29:14,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15168 states.