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 --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/psyco/psyco_abp_1-3.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:24:14,207 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:24:14,209 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:24:14,223 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:24:14,223 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:24:14,225 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:24:14,227 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:24:14,232 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:24:14,234 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:24:14,235 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:24:14,241 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:24:14,243 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:24:14,244 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:24:14,245 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:24:14,245 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:24:14,248 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:24:14,249 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:24:14,251 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:24:14,254 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:24:14,258 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:24:14,261 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:24:14,263 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:24:14,264 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:24:14,265 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:24:14,269 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:24:14,269 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:24:14,269 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:24:14,271 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:24:14,272 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:24:14,273 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:24:14,273 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:24:14,274 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:24:14,275 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:24:14,275 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:24:14,277 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:24:14,277 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:24:14,278 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:24:14,278 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:24:14,278 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:24:14,279 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:24:14,282 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:24:14,282 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 03:24:14,300 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:24:14,301 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:24:14,302 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:24:14,303 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:24:14,303 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:24:14,303 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:24:14,303 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:24:14,303 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:24:14,304 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:24:14,304 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:24:14,305 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:24:14,305 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:24:14,305 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:24:14,305 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:24:14,306 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:24:14,306 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:24:14,306 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:24:14,306 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:24:14,306 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:24:14,307 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:24:14,307 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:24:14,307 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:24:14,307 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:24:14,307 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:24:14,308 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:24:14,308 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:24:14,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:24:14,308 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:24:14,308 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-15 03:24:14,585 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:24:14,601 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:24:14,604 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:24:14,605 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:24:14,606 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:24:14,606 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/psyco/psyco_abp_1-3.c [2019-10-15 03:24:14,663 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3e88d7cc/7f7cf16ad966437a8009bd047e0bc55a/FLAG93c7c2943 [2019-10-15 03:24:15,144 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:24:15,145 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_abp_1-3.c [2019-10-15 03:24:15,156 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3e88d7cc/7f7cf16ad966437a8009bd047e0bc55a/FLAG93c7c2943 [2019-10-15 03:24:15,480 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3e88d7cc/7f7cf16ad966437a8009bd047e0bc55a [2019-10-15 03:24:15,490 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:24:15,491 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:24:15,492 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:24:15,492 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:24:15,496 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:24:15,497 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:24:15" (1/1) ... [2019-10-15 03:24:15,499 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@487d0c46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:24:15, skipping insertion in model container [2019-10-15 03:24:15,500 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:24:15" (1/1) ... [2019-10-15 03:24:15,507 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:24:15,543 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:24:15,851 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:24:15,861 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:24:16,036 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:24:16,060 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:24:16,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:24:16 WrapperNode [2019-10-15 03:24:16,061 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:24:16,061 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:24:16,061 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:24:16,062 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:24:16,071 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:24:16" (1/1) ... [2019-10-15 03:24:16,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:24:16" (1/1) ... [2019-10-15 03:24:16,083 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:24:16" (1/1) ... [2019-10-15 03:24:16,083 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:24:16" (1/1) ... [2019-10-15 03:24:16,112 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:24:16" (1/1) ... [2019-10-15 03:24:16,125 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:24:16" (1/1) ... [2019-10-15 03:24:16,130 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:24:16" (1/1) ... [2019-10-15 03:24:16,136 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:24:16,136 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:24:16,137 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:24:16,137 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:24:16,138 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:24:16" (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 03:24:16,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:24:16,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:24:16,220 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:24:16,220 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 03:24:16,220 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:24:16,221 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:24:16,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:24:16,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:24:17,185 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:24:17,185 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-15 03:24:17,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:24:17 BoogieIcfgContainer [2019-10-15 03:24:17,187 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:24:17,188 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:24:17,188 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:24:17,191 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:24:17,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:24:15" (1/3) ... [2019-10-15 03:24:17,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11e09f3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:24:17, skipping insertion in model container [2019-10-15 03:24:17,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:24:16" (2/3) ... [2019-10-15 03:24:17,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11e09f3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:24:17, skipping insertion in model container [2019-10-15 03:24:17,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:24:17" (3/3) ... [2019-10-15 03:24:17,195 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_abp_1-3.c [2019-10-15 03:24:17,206 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:24:17,215 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 03:24:17,229 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 03:24:17,259 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:24:17,259 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:24:17,259 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:24:17,260 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:24:17,260 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:24:17,260 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:24:17,261 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:24:17,261 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:24:17,286 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2019-10-15 03:24:17,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-15 03:24:17,292 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:24:17,293 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:24:17,295 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:24:17,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:24:17,301 INFO L82 PathProgramCache]: Analyzing trace with hash 387818493, now seen corresponding path program 1 times [2019-10-15 03:24:17,311 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:24:17,311 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728129948] [2019-10-15 03:24:17,312 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:17,312 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:17,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:24:17,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:24:17,456 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 03:24:17,457 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728129948] [2019-10-15 03:24:17,458 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:24:17,458 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-15 03:24:17,459 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993628937] [2019-10-15 03:24:17,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-15 03:24:17,464 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:24:17,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-15 03:24:17,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-15 03:24:17,484 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 2 states. [2019-10-15 03:24:17,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:24:17,522 INFO L93 Difference]: Finished difference Result 221 states and 421 transitions. [2019-10-15 03:24:17,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-15 03:24:17,523 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-10-15 03:24:17,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:24:17,536 INFO L225 Difference]: With dead ends: 221 [2019-10-15 03:24:17,536 INFO L226 Difference]: Without dead ends: 103 [2019-10-15 03:24:17,540 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-15 03:24:17,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-10-15 03:24:17,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-10-15 03:24:17,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-10-15 03:24:17,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 168 transitions. [2019-10-15 03:24:17,588 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 168 transitions. Word has length 12 [2019-10-15 03:24:17,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:24:17,589 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 168 transitions. [2019-10-15 03:24:17,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-15 03:24:17,590 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 168 transitions. [2019-10-15 03:24:17,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-15 03:24:17,591 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:24:17,591 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:24:17,591 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:24:17,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:24:17,592 INFO L82 PathProgramCache]: Analyzing trace with hash -330041086, now seen corresponding path program 1 times [2019-10-15 03:24:17,592 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:24:17,592 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466615819] [2019-10-15 03:24:17,593 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:17,593 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:17,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:24:17,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:24:17,648 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 03:24:17,649 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466615819] [2019-10-15 03:24:17,649 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:24:17,649 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:24:17,650 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099313736] [2019-10-15 03:24:17,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:24:17,652 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:24:17,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:24:17,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:24:17,652 INFO L87 Difference]: Start difference. First operand 103 states and 168 transitions. Second operand 3 states. [2019-10-15 03:24:17,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:24:17,734 INFO L93 Difference]: Finished difference Result 204 states and 335 transitions. [2019-10-15 03:24:17,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:24:17,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-15 03:24:17,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:24:17,736 INFO L225 Difference]: With dead ends: 204 [2019-10-15 03:24:17,736 INFO L226 Difference]: Without dead ends: 106 [2019-10-15 03:24:17,738 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 03:24:17,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-10-15 03:24:17,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-10-15 03:24:17,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-10-15 03:24:17,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 171 transitions. [2019-10-15 03:24:17,749 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 171 transitions. Word has length 13 [2019-10-15 03:24:17,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:24:17,749 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 171 transitions. [2019-10-15 03:24:17,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:24:17,750 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 171 transitions. [2019-10-15 03:24:17,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-15 03:24:17,751 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:24:17,751 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:24:17,751 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:24:17,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:24:17,752 INFO L82 PathProgramCache]: Analyzing trace with hash 538694592, now seen corresponding path program 1 times [2019-10-15 03:24:17,752 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:24:17,752 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536509287] [2019-10-15 03:24:17,752 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:17,752 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:17,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:24:17,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:24:18,399 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 33 [2019-10-15 03:24:18,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:24:18,406 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536509287] [2019-10-15 03:24:18,409 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:24:18,409 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:24:18,409 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913514932] [2019-10-15 03:24:18,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:24:18,410 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:24:18,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:24:18,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:24:18,411 INFO L87 Difference]: Start difference. First operand 106 states and 171 transitions. Second operand 4 states. [2019-10-15 03:24:18,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:24:18,726 INFO L93 Difference]: Finished difference Result 208 states and 337 transitions. [2019-10-15 03:24:18,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:24:18,727 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-10-15 03:24:18,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:24:18,729 INFO L225 Difference]: With dead ends: 208 [2019-10-15 03:24:18,729 INFO L226 Difference]: Without dead ends: 189 [2019-10-15 03:24:18,730 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:24:18,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-10-15 03:24:18,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 175. [2019-10-15 03:24:18,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-10-15 03:24:18,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 284 transitions. [2019-10-15 03:24:18,746 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 284 transitions. Word has length 18 [2019-10-15 03:24:18,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:24:18,746 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 284 transitions. [2019-10-15 03:24:18,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:24:18,746 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 284 transitions. [2019-10-15 03:24:18,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-15 03:24:18,747 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:24:18,748 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:24:18,748 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:24:18,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:24:18,748 INFO L82 PathProgramCache]: Analyzing trace with hash -2024056833, now seen corresponding path program 1 times [2019-10-15 03:24:18,749 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:24:18,749 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131883534] [2019-10-15 03:24:18,749 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:18,749 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:18,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:24:18,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:24:18,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:24:18,788 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131883534] [2019-10-15 03:24:18,788 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:24:18,789 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:24:18,789 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424219104] [2019-10-15 03:24:18,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:24:18,790 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:24:18,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:24:18,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:24:18,791 INFO L87 Difference]: Start difference. First operand 175 states and 284 transitions. Second operand 3 states. [2019-10-15 03:24:18,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:24:18,827 INFO L93 Difference]: Finished difference Result 296 states and 480 transitions. [2019-10-15 03:24:18,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:24:18,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-15 03:24:18,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:24:18,829 INFO L225 Difference]: With dead ends: 296 [2019-10-15 03:24:18,829 INFO L226 Difference]: Without dead ends: 127 [2019-10-15 03:24:18,831 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 03:24:18,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-10-15 03:24:18,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2019-10-15 03:24:18,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-10-15 03:24:18,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 197 transitions. [2019-10-15 03:24:18,847 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 197 transitions. Word has length 19 [2019-10-15 03:24:18,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:24:18,847 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 197 transitions. [2019-10-15 03:24:18,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:24:18,847 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 197 transitions. [2019-10-15 03:24:18,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-15 03:24:18,849 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:24:18,849 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:24:18,849 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:24:18,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:24:18,850 INFO L82 PathProgramCache]: Analyzing trace with hash -2099649213, now seen corresponding path program 1 times [2019-10-15 03:24:18,850 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:24:18,851 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989809797] [2019-10-15 03:24:18,852 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:18,852 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:18,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:24:18,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:24:18,926 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 03:24:18,926 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989809797] [2019-10-15 03:24:18,927 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:24:18,927 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:24:18,928 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387637614] [2019-10-15 03:24:18,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:24:18,929 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:24:18,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:24:18,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:24:18,930 INFO L87 Difference]: Start difference. First operand 125 states and 197 transitions. Second operand 3 states. [2019-10-15 03:24:18,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:24:18,965 INFO L93 Difference]: Finished difference Result 229 states and 361 transitions. [2019-10-15 03:24:18,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:24:18,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-15 03:24:18,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:24:18,967 INFO L225 Difference]: With dead ends: 229 [2019-10-15 03:24:18,968 INFO L226 Difference]: Without dead ends: 110 [2019-10-15 03:24:18,969 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 03:24:18,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-10-15 03:24:18,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2019-10-15 03:24:18,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-10-15 03:24:18,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 166 transitions. [2019-10-15 03:24:18,985 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 166 transitions. Word has length 24 [2019-10-15 03:24:18,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:24:18,986 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 166 transitions. [2019-10-15 03:24:18,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:24:18,989 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 166 transitions. [2019-10-15 03:24:18,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-15 03:24:18,990 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:24:18,990 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:24:18,990 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:24:18,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:24:18,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1312244828, now seen corresponding path program 1 times [2019-10-15 03:24:18,994 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:24:18,994 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378695173] [2019-10-15 03:24:18,995 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:18,995 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:18,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:24:19,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:24:19,331 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 27 [2019-10-15 03:24:19,338 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:24:19,338 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378695173] [2019-10-15 03:24:19,339 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725467221] [2019-10-15 03:24:19,339 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 03:24:19,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:24:19,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-15 03:24:19,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:24:19,517 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:24:19,518 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:24:19,567 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:24:19,571 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [536255590] [2019-10-15 03:24:19,623 INFO L162 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-10-15 03:24:19,626 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:24:19,636 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:24:19,645 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:24:19,646 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:24:19,817 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 36 for LOIs [2019-10-15 03:24:23,682 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 22 for LOIs [2019-10-15 03:24:23,688 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 03:24:24,397 WARN L191 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 78 [2019-10-15 03:24:24,748 WARN L191 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-10-15 03:24:25,014 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 03:24:25,015 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4, 17] total 25 [2019-10-15 03:24:25,015 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072066623] [2019-10-15 03:24:25,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-15 03:24:25,018 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:24:25,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-15 03:24:25,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2019-10-15 03:24:25,021 INFO L87 Difference]: Start difference. First operand 108 states and 166 transitions. Second operand 25 states. [2019-10-15 03:24:25,433 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-10-15 03:24:26,010 WARN L191 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 95 [2019-10-15 03:24:26,375 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-10-15 03:24:28,931 WARN L191 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2019-10-15 03:24:31,503 WARN L191 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2019-10-15 03:24:32,050 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2019-10-15 03:24:32,668 WARN L191 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-10-15 03:24:34,048 WARN L191 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-10-15 03:24:34,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:24:34,313 INFO L93 Difference]: Finished difference Result 542 states and 825 transitions. [2019-10-15 03:24:34,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-10-15 03:24:34,314 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 26 [2019-10-15 03:24:34,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:24:34,317 INFO L225 Difference]: With dead ends: 542 [2019-10-15 03:24:34,317 INFO L226 Difference]: Without dead ends: 423 [2019-10-15 03:24:34,320 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1473 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=815, Invalid=4441, Unknown=0, NotChecked=0, Total=5256 [2019-10-15 03:24:34,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2019-10-15 03:24:34,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 298. [2019-10-15 03:24:34,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-10-15 03:24:34,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 457 transitions. [2019-10-15 03:24:34,338 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 457 transitions. Word has length 26 [2019-10-15 03:24:34,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:24:34,339 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 457 transitions. [2019-10-15 03:24:34,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-15 03:24:34,339 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 457 transitions. [2019-10-15 03:24:34,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-15 03:24:34,340 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:24:34,340 INFO L380 BasicCegarLoop]: trace histogram [3, 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] [2019-10-15 03:24:34,544 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:24:34,545 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:24:34,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:24:34,546 INFO L82 PathProgramCache]: Analyzing trace with hash 504767526, now seen corresponding path program 1 times [2019-10-15 03:24:34,546 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:24:34,546 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785416202] [2019-10-15 03:24:34,547 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:34,547 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:34,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:24:34,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:24:34,848 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:24:34,848 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785416202] [2019-10-15 03:24:34,848 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316938017] [2019-10-15 03:24:34,849 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 03:24:34,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:24:34,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-15 03:24:34,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:24:34,997 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 03:24:34,997 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:24:35,065 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 03:24:35,066 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 03:24:35,066 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-10-15 03:24:35,066 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785547436] [2019-10-15 03:24:35,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:24:35,067 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:24:35,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:24:35,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:24:35,068 INFO L87 Difference]: Start difference. First operand 298 states and 457 transitions. Second operand 4 states. [2019-10-15 03:24:35,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:24:35,088 INFO L93 Difference]: Finished difference Result 301 states and 459 transitions. [2019-10-15 03:24:35,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:24:35,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-10-15 03:24:35,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:24:35,090 INFO L225 Difference]: With dead ends: 301 [2019-10-15 03:24:35,091 INFO L226 Difference]: Without dead ends: 295 [2019-10-15 03:24:35,091 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:24:35,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-10-15 03:24:35,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 294. [2019-10-15 03:24:35,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-10-15 03:24:35,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 445 transitions. [2019-10-15 03:24:35,105 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 445 transitions. Word has length 30 [2019-10-15 03:24:35,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:24:35,106 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 445 transitions. [2019-10-15 03:24:35,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:24:35,106 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 445 transitions. [2019-10-15 03:24:35,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-15 03:24:35,107 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:24:35,107 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:24:35,311 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:24:35,312 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:24:35,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:24:35,313 INFO L82 PathProgramCache]: Analyzing trace with hash 795118560, now seen corresponding path program 1 times [2019-10-15 03:24:35,314 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:24:35,314 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365167228] [2019-10-15 03:24:35,314 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:35,314 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:35,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:24:35,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:24:35,352 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-15 03:24:35,352 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365167228] [2019-10-15 03:24:35,353 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:24:35,353 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:24:35,353 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120860147] [2019-10-15 03:24:35,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:24:35,354 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:24:35,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:24:35,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:24:35,355 INFO L87 Difference]: Start difference. First operand 294 states and 445 transitions. Second operand 3 states. [2019-10-15 03:24:35,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:24:35,404 INFO L93 Difference]: Finished difference Result 513 states and 778 transitions. [2019-10-15 03:24:35,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:24:35,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-10-15 03:24:35,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:24:35,408 INFO L225 Difference]: With dead ends: 513 [2019-10-15 03:24:35,408 INFO L226 Difference]: Without dead ends: 246 [2019-10-15 03:24:35,409 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 03:24:35,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-10-15 03:24:35,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 244. [2019-10-15 03:24:35,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-10-15 03:24:35,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 364 transitions. [2019-10-15 03:24:35,423 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 364 transitions. Word has length 36 [2019-10-15 03:24:35,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:24:35,424 INFO L462 AbstractCegarLoop]: Abstraction has 244 states and 364 transitions. [2019-10-15 03:24:35,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:24:35,424 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 364 transitions. [2019-10-15 03:24:35,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-15 03:24:35,428 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:24:35,428 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 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] [2019-10-15 03:24:35,429 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:24:35,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:24:35,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1876015697, now seen corresponding path program 1 times [2019-10-15 03:24:35,431 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:24:35,431 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659934682] [2019-10-15 03:24:35,432 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:35,432 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:35,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:24:35,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:24:35,502 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-15 03:24:35,502 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659934682] [2019-10-15 03:24:35,503 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:24:35,503 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:24:35,503 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265831484] [2019-10-15 03:24:35,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:24:35,509 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:24:35,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:24:35,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:24:35,510 INFO L87 Difference]: Start difference. First operand 244 states and 364 transitions. Second operand 3 states. [2019-10-15 03:24:35,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:24:35,557 INFO L93 Difference]: Finished difference Result 427 states and 635 transitions. [2019-10-15 03:24:35,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:24:35,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-10-15 03:24:35,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:24:35,562 INFO L225 Difference]: With dead ends: 427 [2019-10-15 03:24:35,562 INFO L226 Difference]: Without dead ends: 228 [2019-10-15 03:24:35,563 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 03:24:35,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-10-15 03:24:35,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 226. [2019-10-15 03:24:35,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-10-15 03:24:35,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 327 transitions. [2019-10-15 03:24:35,579 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 327 transitions. Word has length 40 [2019-10-15 03:24:35,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:24:35,579 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 327 transitions. [2019-10-15 03:24:35,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:24:35,579 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 327 transitions. [2019-10-15 03:24:35,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-15 03:24:35,581 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:24:35,581 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 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] [2019-10-15 03:24:35,581 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:24:35,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:24:35,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1480767412, now seen corresponding path program 1 times [2019-10-15 03:24:35,582 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:24:35,582 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151255653] [2019-10-15 03:24:35,582 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:35,582 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:35,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:24:35,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:24:35,638 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-15 03:24:35,639 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151255653] [2019-10-15 03:24:35,639 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:24:35,640 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:24:35,640 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488917975] [2019-10-15 03:24:35,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:24:35,641 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:24:35,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:24:35,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:24:35,642 INFO L87 Difference]: Start difference. First operand 226 states and 327 transitions. Second operand 3 states. [2019-10-15 03:24:35,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:24:35,679 INFO L93 Difference]: Finished difference Result 308 states and 445 transitions. [2019-10-15 03:24:35,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:24:35,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-10-15 03:24:35,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:24:35,681 INFO L225 Difference]: With dead ends: 308 [2019-10-15 03:24:35,681 INFO L226 Difference]: Without dead ends: 146 [2019-10-15 03:24:35,682 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 03:24:35,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-10-15 03:24:35,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2019-10-15 03:24:35,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-10-15 03:24:35,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 202 transitions. [2019-10-15 03:24:35,693 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 202 transitions. Word has length 49 [2019-10-15 03:24:35,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:24:35,694 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 202 transitions. [2019-10-15 03:24:35,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:24:35,694 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 202 transitions. [2019-10-15 03:24:35,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-15 03:24:35,695 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:24:35,696 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 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] [2019-10-15 03:24:35,696 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:24:35,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:24:35,697 INFO L82 PathProgramCache]: Analyzing trace with hash 387053742, now seen corresponding path program 1 times [2019-10-15 03:24:35,697 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:24:35,697 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938694487] [2019-10-15 03:24:35,697 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:35,698 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:35,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:24:35,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:24:35,897 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-15 03:24:35,897 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938694487] [2019-10-15 03:24:35,898 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518052717] [2019-10-15 03:24:35,898 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 03:24:36,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:24:36,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-15 03:24:36,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:24:36,101 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:24:36,102 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:24:36,240 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:24:36,241 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [978883952] [2019-10-15 03:24:36,244 INFO L162 IcfgInterpreter]: Started Sifa with 35 locations of interest [2019-10-15 03:24:36,245 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:24:36,246 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:24:36,246 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:24:36,246 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:24:36,328 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 36 for LOIs [2019-10-15 03:24:44,359 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 22 for LOIs [2019-10-15 03:24:44,366 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 03:24:44,885 WARN L191 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 97 [2019-10-15 03:24:45,258 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 33 [2019-10-15 03:24:45,581 WARN L191 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2019-10-15 03:24:45,828 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-10-15 03:24:46,080 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2019-10-15 03:24:46,319 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-10-15 03:24:46,676 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-10-15 03:24:46,919 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2019-10-15 03:24:47,181 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-10-15 03:24:47,614 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 80 [2019-10-15 03:24:47,891 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 80 [2019-10-15 03:24:48,153 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 76