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/array-crafted/zero_sum_const1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:30:45,287 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:30:45,291 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:30:45,305 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:30:45,305 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:30:45,306 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:30:45,307 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:30:45,309 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:30:45,311 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:30:45,312 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:30:45,313 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:30:45,314 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:30:45,314 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:30:45,315 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:30:45,316 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:30:45,317 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:30:45,318 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:30:45,319 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:30:45,321 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:30:45,323 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:30:45,324 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:30:45,325 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:30:45,327 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:30:45,327 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:30:45,330 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:30:45,330 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:30:45,330 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:30:45,331 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:30:45,332 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:30:45,333 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:30:45,333 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:30:45,334 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:30:45,335 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:30:45,335 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:30:45,336 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:30:45,336 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:30:45,337 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:30:45,337 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:30:45,338 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:30:45,338 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:30:45,339 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:30:45,340 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:30:45,357 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:30:45,359 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:30:45,360 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:30:45,361 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:30:45,361 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:30:45,362 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:30:45,362 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:30:45,363 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:30:45,363 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:30:45,363 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:30:45,363 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:30:45,363 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:30:45,363 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:30:45,364 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:30:45,364 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:30:45,364 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:30:45,365 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:30:45,366 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:30:45,366 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:30:45,366 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:30:45,366 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:30:45,366 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:30:45,367 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:30:45,367 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:30:45,367 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:30:45,367 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:30:45,368 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:30:45,368 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:30:45,368 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 01:30:45,642 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:30:45,658 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:30:45,662 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:30:45,664 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:30:45,665 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:30:45,665 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/zero_sum_const1.c [2019-10-15 01:30:45,744 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40204e5df/5e1a430f87944fbd84989c878f441f18/FLAGf931d8102 [2019-10-15 01:30:46,233 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:30:46,234 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/zero_sum_const1.c [2019-10-15 01:30:46,240 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40204e5df/5e1a430f87944fbd84989c878f441f18/FLAGf931d8102 [2019-10-15 01:30:46,607 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40204e5df/5e1a430f87944fbd84989c878f441f18 [2019-10-15 01:30:46,621 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:30:46,623 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:30:46,624 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:30:46,625 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:30:46,628 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:30:46,629 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:30:46" (1/1) ... [2019-10-15 01:30:46,633 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5420840d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:30:46, skipping insertion in model container [2019-10-15 01:30:46,633 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:30:46" (1/1) ... [2019-10-15 01:30:46,643 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:30:46,662 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:30:46,865 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:30:46,881 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:30:46,907 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:30:46,921 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:30:46,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:30:46 WrapperNode [2019-10-15 01:30:46,922 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:30:46,922 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:30:46,922 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:30:46,922 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:30:47,014 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:30:46" (1/1) ... [2019-10-15 01:30:47,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:30:46" (1/1) ... [2019-10-15 01:30:47,023 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:30:46" (1/1) ... [2019-10-15 01:30:47,024 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:30:46" (1/1) ... [2019-10-15 01:30:47,038 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:30:46" (1/1) ... [2019-10-15 01:30:47,043 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:30:46" (1/1) ... [2019-10-15 01:30:47,044 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:30:46" (1/1) ... [2019-10-15 01:30:47,046 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:30:47,046 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:30:47,047 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:30:47,047 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:30:47,048 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:30:46" (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:30:47,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:30:47,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:30:47,101 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-15 01:30:47,102 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:30:47,102 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:30:47,102 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:30:47,102 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-15 01:30:47,103 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-15 01:30:47,103 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 01:30:47,103 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:30:47,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 01:30:47,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 01:30:47,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 01:30:47,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:30:47,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:30:47,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:30:47,460 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:30:47,461 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-15 01:30:47,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:30:47 BoogieIcfgContainer [2019-10-15 01:30:47,462 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:30:47,464 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:30:47,464 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:30:47,467 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:30:47,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:30:46" (1/3) ... [2019-10-15 01:30:47,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e6323f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:30:47, skipping insertion in model container [2019-10-15 01:30:47,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:30:46" (2/3) ... [2019-10-15 01:30:47,469 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e6323f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:30:47, skipping insertion in model container [2019-10-15 01:30:47,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:30:47" (3/3) ... [2019-10-15 01:30:47,471 INFO L109 eAbstractionObserver]: Analyzing ICFG zero_sum_const1.c [2019-10-15 01:30:47,480 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:30:47,488 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:30:47,499 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:30:47,525 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:30:47,525 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:30:47,525 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:30:47,525 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:30:47,525 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:30:47,525 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:30:47,526 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:30:47,526 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:30:47,541 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-10-15 01:30:47,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-15 01:30:47,546 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:47,547 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:30:47,549 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:47,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:47,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1764921194, now seen corresponding path program 1 times [2019-10-15 01:30:47,561 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:47,561 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446773851] [2019-10-15 01:30:47,562 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:47,562 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:47,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:47,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:47,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:30:47,775 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446773851] [2019-10-15 01:30:47,776 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:30:47,776 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:30:47,777 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062612512] [2019-10-15 01:30:47,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:30:47,782 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:47,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:30:47,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:30:47,800 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2019-10-15 01:30:47,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:47,896 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2019-10-15 01:30:47,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:30:47,899 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-10-15 01:30:47,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:47,909 INFO L225 Difference]: With dead ends: 37 [2019-10-15 01:30:47,910 INFO L226 Difference]: Without dead ends: 16 [2019-10-15 01:30:47,913 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:30:47,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-10-15 01:30:47,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-10-15 01:30:47,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-10-15 01:30:47,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2019-10-15 01:30:47,947 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 13 [2019-10-15 01:30:47,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:47,947 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-10-15 01:30:47,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:30:47,948 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2019-10-15 01:30:47,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-15 01:30:47,949 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:47,949 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:30:47,950 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:47,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:47,950 INFO L82 PathProgramCache]: Analyzing trace with hash 985780707, now seen corresponding path program 1 times [2019-10-15 01:30:47,951 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:47,951 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964492004] [2019-10-15 01:30:47,951 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:47,952 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:47,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:47,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:48,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 01:30:48,007 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964492004] [2019-10-15 01:30:48,007 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:30:48,009 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:30:48,009 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273194530] [2019-10-15 01:30:48,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:30:48,011 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:48,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:30:48,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:30:48,014 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand 3 states. [2019-10-15 01:30:48,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:48,037 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2019-10-15 01:30:48,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:30:48,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-15 01:30:48,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:48,039 INFO L225 Difference]: With dead ends: 26 [2019-10-15 01:30:48,039 INFO L226 Difference]: Without dead ends: 17 [2019-10-15 01:30:48,041 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:30:48,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-10-15 01:30:48,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-10-15 01:30:48,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-15 01:30:48,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-10-15 01:30:48,046 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 14 [2019-10-15 01:30:48,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:48,047 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-10-15 01:30:48,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:30:48,047 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2019-10-15 01:30:48,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-15 01:30:48,048 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:48,048 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:30:48,049 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:48,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:48,049 INFO L82 PathProgramCache]: Analyzing trace with hash -573769547, now seen corresponding path program 1 times [2019-10-15 01:30:48,049 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:48,050 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591951248] [2019-10-15 01:30:48,050 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:48,050 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:48,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:48,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:48,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 01:30:48,118 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591951248] [2019-10-15 01:30:48,118 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:30:48,118 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:30:48,123 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674873442] [2019-10-15 01:30:48,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:30:48,124 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:48,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:30:48,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:30:48,125 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 4 states. [2019-10-15 01:30:48,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:48,179 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2019-10-15 01:30:48,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:30:48,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-15 01:30:48,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:48,181 INFO L225 Difference]: With dead ends: 24 [2019-10-15 01:30:48,181 INFO L226 Difference]: Without dead ends: 17 [2019-10-15 01:30:48,182 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:30:48,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-10-15 01:30:48,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-10-15 01:30:48,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-15 01:30:48,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-10-15 01:30:48,187 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 15 [2019-10-15 01:30:48,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:48,188 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-10-15 01:30:48,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:30:48,189 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-10-15 01:30:48,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-15 01:30:48,189 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:48,189 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:30:48,190 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:48,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:48,190 INFO L82 PathProgramCache]: Analyzing trace with hash -692592847, now seen corresponding path program 1 times [2019-10-15 01:30:48,190 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:48,190 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127978671] [2019-10-15 01:30:48,191 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:48,191 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:48,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:48,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:48,251 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 01:30:48,251 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127978671] [2019-10-15 01:30:48,251 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207479534] [2019-10-15 01:30:48,252 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:30:48,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:48,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:30:48,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:30:48,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 01:30:48,382 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:30:48,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 01:30:48,411 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1084012281] [2019-10-15 01:30:48,437 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-15 01:30:48,438 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:30:48,445 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:30:48,454 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:30:48,454 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:30:48,721 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 30 for LOIs [2019-10-15 01:30:49,698 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-15 01:30:49,778 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-15 01:30:49,790 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:30:50,320 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 27 [2019-10-15 01:30:50,764 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-10-15 01:30:50,767 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:30:50,767 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 18 [2019-10-15 01:30:50,767 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671186291] [2019-10-15 01:30:50,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-15 01:30:50,770 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:50,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-15 01:30:50,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-10-15 01:30:50,772 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 18 states. [2019-10-15 01:30:51,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:51,406 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2019-10-15 01:30:51,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-15 01:30:51,407 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 16 [2019-10-15 01:30:51,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:51,408 INFO L225 Difference]: With dead ends: 27 [2019-10-15 01:30:51,408 INFO L226 Difference]: Without dead ends: 18 [2019-10-15 01:30:51,410 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2019-10-15 01:30:51,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-10-15 01:30:51,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-15 01:30:51,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-15 01:30:51,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-10-15 01:30:51,420 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 16 [2019-10-15 01:30:51,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:51,420 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-10-15 01:30:51,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-15 01:30:51,421 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-10-15 01:30:51,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-15 01:30:51,421 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:51,421 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:30:51,627 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:51,627 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:51,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:51,628 INFO L82 PathProgramCache]: Analyzing trace with hash -476800637, now seen corresponding path program 2 times [2019-10-15 01:30:51,629 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:51,629 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995365978] [2019-10-15 01:30:51,629 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:51,629 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:51,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:51,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:51,708 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 01:30:51,708 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995365978] [2019-10-15 01:30:51,709 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028113268] [2019-10-15 01:30:51,709 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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:30:51,767 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-15 01:30:51,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:30:51,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:30:51,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:30:51,798 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 01:30:51,798 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:30:51,818 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 01:30:51,818 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1022378638] [2019-10-15 01:30:51,820 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-15 01:30:51,820 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:30:51,820 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:30:51,821 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:30:51,821 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:30:51,855 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 30 for LOIs [2019-10-15 01:30:52,366 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-15 01:30:52,406 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-15 01:30:52,411 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:30:53,195 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:30:53,195 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 11] total 19 [2019-10-15 01:30:53,196 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257986616] [2019-10-15 01:30:53,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-15 01:30:53,197 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:53,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-15 01:30:53,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2019-10-15 01:30:53,198 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 19 states. [2019-10-15 01:30:54,032 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2019-10-15 01:30:54,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:54,102 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2019-10-15 01:30:54,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-15 01:30:54,102 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 17 [2019-10-15 01:30:54,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:54,103 INFO L225 Difference]: With dead ends: 27 [2019-10-15 01:30:54,103 INFO L226 Difference]: Without dead ends: 20 [2019-10-15 01:30:54,104 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=143, Invalid=727, Unknown=0, NotChecked=0, Total=870 [2019-10-15 01:30:54,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-15 01:30:54,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-15 01:30:54,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-15 01:30:54,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-10-15 01:30:54,110 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 17 [2019-10-15 01:30:54,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:54,111 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-10-15 01:30:54,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-15 01:30:54,111 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2019-10-15 01:30:54,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-15 01:30:54,112 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:54,112 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:30:54,323 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:54,324 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:54,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:54,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1433936906, now seen corresponding path program 3 times [2019-10-15 01:30:54,324 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:54,325 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517669251] [2019-10-15 01:30:54,325 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:54,325 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:54,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:54,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:54,875 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:30:54,876 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517669251] [2019-10-15 01:30:54,876 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066259270] [2019-10-15 01:30:54,876 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST 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:30:54,931 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-15 01:30:54,931 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:30:54,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-15 01:30:54,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:30:55,193 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:30:55,194 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:30:55,368 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:30:55,368 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1782093438] [2019-10-15 01:30:55,370 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-15 01:30:55,370 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:30:55,372 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:30:55,373 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:30:55,373 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:30:55,418 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 30 for LOIs [2019-10-15 01:30:55,850 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-15 01:30:55,884 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-15 01:30:55,890 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:30:56,928 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:30:56,929 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 10, 11] total 39 [2019-10-15 01:30:56,929 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463855653] [2019-10-15 01:30:56,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-15 01:30:56,930 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:56,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-15 01:30:56,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1356, Unknown=0, NotChecked=0, Total=1482 [2019-10-15 01:30:56,931 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 39 states. [2019-10-15 01:30:58,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:58,509 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2019-10-15 01:30:58,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-15 01:30:58,512 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 19 [2019-10-15 01:30:58,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:58,513 INFO L225 Difference]: With dead ends: 29 [2019-10-15 01:30:58,513 INFO L226 Difference]: Without dead ends: 24 [2019-10-15 01:30:58,514 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=240, Invalid=2516, Unknown=0, NotChecked=0, Total=2756 [2019-10-15 01:30:58,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-15 01:30:58,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-10-15 01:30:58,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-15 01:30:58,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-10-15 01:30:58,521 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 19 [2019-10-15 01:30:58,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:58,521 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-10-15 01:30:58,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-15 01:30:58,521 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-10-15 01:30:58,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-15 01:30:58,522 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:58,522 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:30:58,727 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:58,727 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:58,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:58,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1638608253, now seen corresponding path program 4 times [2019-10-15 01:30:58,728 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:58,729 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380782463] [2019-10-15 01:30:58,729 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:58,729 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:58,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:58,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:58,829 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:30:58,829 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380782463] [2019-10-15 01:30:58,830 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80253549] [2019-10-15 01:30:58,830 INFO L92 rtionOrderModulation]: Changing assertion order to 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:30:58,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:58,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-15 01:30:58,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:30:58,937 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:30:58,937 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:30:58,982 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:30:58,983 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1021061094] [2019-10-15 01:30:58,984 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-15 01:30:58,984 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:30:58,985 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:30:58,985 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:30:58,985 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:30:59,012 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 32 for LOIs [2019-10-15 01:30:59,412 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-15 01:30:59,461 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-15 01:30:59,468 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:30:59,948 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 26 [2019-10-15 01:31:00,312 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-10-15 01:31:00,312 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:31:00,313 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 11] total 25 [2019-10-15 01:31:00,313 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688974935] [2019-10-15 01:31:00,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-15 01:31:00,315 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:31:00,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-15 01:31:00,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2019-10-15 01:31:00,316 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 25 states. [2019-10-15 01:31:01,370 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2019-10-15 01:31:01,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:31:01,564 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2019-10-15 01:31:01,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-15 01:31:01,565 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 20 [2019-10-15 01:31:01,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:31:01,567 INFO L225 Difference]: With dead ends: 43 [2019-10-15 01:31:01,567 INFO L226 Difference]: Without dead ends: 28 [2019-10-15 01:31:01,568 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=261, Invalid=1545, Unknown=0, NotChecked=0, Total=1806 [2019-10-15 01:31:01,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-15 01:31:01,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2019-10-15 01:31:01,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-15 01:31:01,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-10-15 01:31:01,574 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 20 [2019-10-15 01:31:01,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:31:01,574 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-10-15 01:31:01,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-15 01:31:01,574 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-10-15 01:31:01,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-15 01:31:01,575 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:31:01,575 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:31:01,779 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:31:01,779 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:31:01,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:31:01,780 INFO L82 PathProgramCache]: Analyzing trace with hash 2085991400, now seen corresponding path program 5 times [2019-10-15 01:31:01,780 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:31:01,780 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089969948] [2019-10-15 01:31:01,781 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:01,781 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:01,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:31:01,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:31:01,852 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:31:01,853 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089969948] [2019-10-15 01:31:01,853 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714646271] [2019-10-15 01:31:01,853 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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:31:01,923 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-15 01:31:01,923 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:31:01,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-15 01:31:01,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:31:01,976 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:31:01,977 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:31:02,040 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:31:02,041 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1899900503] [2019-10-15 01:31:02,042 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-15 01:31:02,042 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:31:02,042 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:31:02,042 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:31:02,043 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:31:02,067 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 30 for LOIs [2019-10-15 01:31:02,433 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-15 01:31:02,457 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-15 01:31:02,460 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:31:02,925 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 25 [2019-10-15 01:31:03,305 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:31:03,305 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 11] total 25 [2019-10-15 01:31:03,306 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494771757] [2019-10-15 01:31:03,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-15 01:31:03,307 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:31:03,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-15 01:31:03,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2019-10-15 01:31:03,308 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 25 states. [2019-10-15 01:31:04,360 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2019-10-15 01:31:04,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:31:04,435 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2019-10-15 01:31:04,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-15 01:31:04,435 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 21 [2019-10-15 01:31:04,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:31:04,436 INFO L225 Difference]: With dead ends: 28 [2019-10-15 01:31:04,437 INFO L226 Difference]: Without dead ends: 23 [2019-10-15 01:31:04,438 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 42 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=213, Invalid=1269, Unknown=0, NotChecked=0, Total=1482 [2019-10-15 01:31:04,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-10-15 01:31:04,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-10-15 01:31:04,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-15 01:31:04,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-10-15 01:31:04,445 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 21 [2019-10-15 01:31:04,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:31:04,445 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-10-15 01:31:04,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-15 01:31:04,445 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-10-15 01:31:04,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-15 01:31:04,446 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:31:04,446 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:31:04,650 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:31:04,651 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:31:04,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:31:04,651 INFO L82 PathProgramCache]: Analyzing trace with hash 104986833, now seen corresponding path program 6 times [2019-10-15 01:31:04,652 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:31:04,652 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017303246] [2019-10-15 01:31:04,652 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:04,652 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:04,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:31:04,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:31:05,424 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:31:05,424 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017303246] [2019-10-15 01:31:05,424 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717652202] [2019-10-15 01:31:05,425 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST 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:31:05,505 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-15 01:31:05,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:31:05,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-15 01:31:05,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:31:05,876 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:31:05,877 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:31:06,137 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:31:06,137 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [455556865] [2019-10-15 01:31:06,138 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-15 01:31:06,138 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:31:06,139 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:31:06,139 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:31:06,139 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:31:06,169 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 32 for LOIs [2019-10-15 01:31:06,510 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-15 01:31:06,541 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-15 01:31:06,545 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:31:07,241 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 25 [2019-10-15 01:31:07,776 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:31:07,776 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 12, 11] total 48 [2019-10-15 01:31:07,776 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487642923] [2019-10-15 01:31:07,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-15 01:31:07,778 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:31:07,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-15 01:31:07,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2103, Unknown=0, NotChecked=0, Total=2256 [2019-10-15 01:31:07,779 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 48 states. [2019-10-15 01:31:09,029 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 48 [2019-10-15 01:31:09,228 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-10-15 01:31:09,834 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-10-15 01:31:10,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:31:10,929 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2019-10-15 01:31:10,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-15 01:31:10,930 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 22 [2019-10-15 01:31:10,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:31:10,934 INFO L225 Difference]: With dead ends: 35 [2019-10-15 01:31:10,934 INFO L226 Difference]: Without dead ends: 30 [2019-10-15 01:31:10,935 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1246 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=363, Invalid=4467, Unknown=0, NotChecked=0, Total=4830 [2019-10-15 01:31:10,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-15 01:31:10,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2019-10-15 01:31:10,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-15 01:31:10,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-10-15 01:31:10,943 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 22 [2019-10-15 01:31:10,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:31:10,943 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-10-15 01:31:10,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-15 01:31:10,944 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-10-15 01:31:10,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-15 01:31:10,944 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:31:10,945 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:31:11,148 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:31:11,148 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:31:11,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:31:11,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1176612600, now seen corresponding path program 7 times [2019-10-15 01:31:11,149 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:31:11,149 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748015126] [2019-10-15 01:31:11,149 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:11,149 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:11,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:31:11,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:31:11,226 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:31:11,227 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748015126] [2019-10-15 01:31:11,227 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419826865] [2019-10-15 01:31:11,227 INFO L92 rtionOrderModulation]: Changing assertion order to 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:31:11,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:31:11,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-15 01:31:11,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:31:11,400 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:31:11,401 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:31:11,445 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:31:11,445 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1640655475] [2019-10-15 01:31:11,447 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-15 01:31:11,447 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:31:11,447 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:31:11,448 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:31:11,448 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:31:11,469 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 32 for LOIs [2019-10-15 01:31:11,753 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-15 01:31:11,777 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-15 01:31:11,781 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:31:12,618 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-10-15 01:31:12,619 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:31:12,619 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11] total 28 [2019-10-15 01:31:12,619 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039951604] [2019-10-15 01:31:12,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-15 01:31:12,620 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:31:12,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-15 01:31:12,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=643, Unknown=0, NotChecked=0, Total=756 [2019-10-15 01:31:12,621 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 28 states. [2019-10-15 01:31:13,822 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2019-10-15 01:31:14,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:31:14,011 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2019-10-15 01:31:14,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-15 01:31:14,012 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 23 [2019-10-15 01:31:14,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:31:14,013 INFO L225 Difference]: With dead ends: 49 [2019-10-15 01:31:14,013 INFO L226 Difference]: Without dead ends: 31 [2019-10-15 01:31:14,015 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 46 SyntacticMatches, 7 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=333, Invalid=2019, Unknown=0, NotChecked=0, Total=2352 [2019-10-15 01:31:14,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-15 01:31:14,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2019-10-15 01:31:14,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-15 01:31:14,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-10-15 01:31:14,022 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 23 [2019-10-15 01:31:14,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:31:14,022 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-10-15 01:31:14,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-15 01:31:14,022 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-10-15 01:31:14,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-15 01:31:14,023 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:31:14,023 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:31:14,224 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:31:14,225 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:31:14,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:31:14,225 INFO L82 PathProgramCache]: Analyzing trace with hash -228386621, now seen corresponding path program 8 times [2019-10-15 01:31:14,226 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:31:14,226 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056586009] [2019-10-15 01:31:14,226 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:14,227 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:14,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:31:14,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:31:14,314 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-15 01:31:14,314 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056586009] [2019-10-15 01:31:14,314 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148260796] [2019-10-15 01:31:14,314 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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:31:14,416 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-15 01:31:14,417 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:31:14,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-15 01:31:14,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:31:14,475 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-15 01:31:14,475 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:31:14,540 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-15 01:31:14,541 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [962806087] [2019-10-15 01:31:14,542 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-15 01:31:14,542 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:31:14,543 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:31:14,543 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:31:14,543 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:31:14,573 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 32 for LOIs [2019-10-15 01:31:14,880 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-15 01:31:14,909 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-15 01:31:14,913 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:31:15,715 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:31:15,715 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11] total 28 [2019-10-15 01:31:15,716 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195830171] [2019-10-15 01:31:15,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-15 01:31:15,717 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:31:15,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-15 01:31:15,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=646, Unknown=0, NotChecked=0, Total=756 [2019-10-15 01:31:15,718 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 28 states. [2019-10-15 01:31:16,886 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2019-10-15 01:31:16,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:31:16,962 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2019-10-15 01:31:16,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-15 01:31:16,963 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 24 [2019-10-15 01:31:16,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:31:16,964 INFO L225 Difference]: With dead ends: 31 [2019-10-15 01:31:16,964 INFO L226 Difference]: Without dead ends: 26 [2019-10-15 01:31:16,966 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 48 SyntacticMatches, 8 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=266, Invalid=1626, Unknown=0, NotChecked=0, Total=1892 [2019-10-15 01:31:16,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-15 01:31:16,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-15 01:31:16,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-15 01:31:16,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-10-15 01:31:16,972 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 24 [2019-10-15 01:31:16,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:31:16,973 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-10-15 01:31:16,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-15 01:31:16,973 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-10-15 01:31:16,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 01:31:16,974 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:31:16,974 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:31:17,175 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:31:17,176 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:31:17,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:31:17,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1373712214, now seen corresponding path program 9 times [2019-10-15 01:31:17,177 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:31:17,177 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31245920] [2019-10-15 01:31:17,178 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:17,178 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:17,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:31:17,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:31:18,280 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:31:18,281 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31245920] [2019-10-15 01:31:18,281 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803772392] [2019-10-15 01:31:18,281 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST 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:31:18,386 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-15 01:31:18,386 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:31:18,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 49 conjunts are in the unsatisfiable core [2019-10-15 01:31:18,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:31:18,833 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:31:18,833 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:31:19,232 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-15 01:31:19,233 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [24527624] [2019-10-15 01:31:19,234 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-15 01:31:19,234 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:31:19,234 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:31:19,234 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:31:19,234 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:31:19,254 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 32 for LOIs [2019-10-15 01:31:19,720 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-15 01:31:19,795 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-15 01:31:19,801 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:31:21,114 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:31:21,114 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 14, 11] total 56 [2019-10-15 01:31:21,114 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406135416] [2019-10-15 01:31:21,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-10-15 01:31:21,116 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:31:21,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-10-15 01:31:21,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=2892, Unknown=0, NotChecked=0, Total=3080 [2019-10-15 01:31:21,117 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 56 states. [2019-10-15 01:31:22,711 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 52 [2019-10-15 01:31:22,936 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 63 [2019-10-15 01:31:23,568 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-10-15 01:31:24,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:31:24,871 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2019-10-15 01:31:24,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-15 01:31:24,872 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 25 [2019-10-15 01:31:24,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:31:24,873 INFO L225 Difference]: With dead ends: 39 [2019-10-15 01:31:24,875 INFO L226 Difference]: Without dead ends: 34 [2019-10-15 01:31:24,877 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1757 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=441, Invalid=6039, Unknown=0, NotChecked=0, Total=6480 [2019-10-15 01:31:24,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-15 01:31:24,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2019-10-15 01:31:24,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-15 01:31:24,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2019-10-15 01:31:24,892 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 25 [2019-10-15 01:31:24,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:31:24,893 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-10-15 01:31:24,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-10-15 01:31:24,893 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2019-10-15 01:31:24,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-15 01:31:24,894 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:31:24,894 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:31:25,103 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:31:25,104 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:31:25,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:31:25,104 INFO L82 PathProgramCache]: Analyzing trace with hash -500831453, now seen corresponding path program 10 times [2019-10-15 01:31:25,104 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:31:25,104 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064052539] [2019-10-15 01:31:25,105 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:25,105 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:25,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:31:25,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:31:25,206 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-15 01:31:25,206 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064052539] [2019-10-15 01:31:25,206 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911101458] [2019-10-15 01:31:25,206 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:31:25,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:31:25,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-15 01:31:25,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:31:25,460 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-15 01:31:25,460 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:31:25,521 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-15 01:31:25,521 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1600858165] [2019-10-15 01:31:25,522 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-15 01:31:25,523 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:31:25,523 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:31:25,523 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:31:25,523 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:31:25,547 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 30 for LOIs [2019-10-15 01:31:25,818 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-15 01:31:25,850 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-15 01:31:25,854 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:31:26,660 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:31:26,661 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 11] total 31 [2019-10-15 01:31:26,661 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343425997] [2019-10-15 01:31:26,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-15 01:31:26,662 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:31:26,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-15 01:31:26,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=790, Unknown=0, NotChecked=0, Total=930 [2019-10-15 01:31:26,663 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 31 states.