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/loop-lit/mcmillan2006.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:03:01,453 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:03:01,456 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:03:01,475 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:03:01,476 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:03:01,477 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:03:01,479 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:03:01,490 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:03:01,496 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:03:01,499 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:03:01,500 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:03:01,502 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:03:01,502 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:03:01,504 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:03:01,507 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:03:01,508 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:03:01,510 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:03:01,511 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:03:01,513 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:03:01,518 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:03:01,523 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:03:01,526 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:03:01,530 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:03:01,531 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:03:01,535 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:03:01,536 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:03:01,536 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:03:01,538 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:03:01,539 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:03:01,540 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:03:01,541 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:03:01,542 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:03:01,543 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:03:01,544 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:03:01,545 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:03:01,546 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:03:01,546 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:03:01,547 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:03:01,547 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:03:01,548 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:03:01,549 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:03:01,550 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 03:03:01,586 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:03:01,586 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:03:01,588 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:03:01,588 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:03:01,588 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:03:01,589 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:03:01,589 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:03:01,589 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:03:01,589 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:03:01,589 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:03:01,590 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:03:01,590 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:03:01,590 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:03:01,590 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:03:01,591 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:03:01,591 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:03:01,591 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:03:01,591 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:03:01,591 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:03:01,592 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:03:01,592 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:03:01,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:03:01,592 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:03:01,593 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:03:01,593 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:03:01,593 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:03:01,593 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:03:01,594 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:03:01,594 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-15 03:03:01,922 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:03:01,936 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:03:01,940 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:03:01,941 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:03:01,941 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:03:01,942 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/mcmillan2006.i [2019-10-15 03:03:02,011 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e105ca3f7/40ad1f2042eb46b5a6cdc048a910b3f9/FLAGb24dc3c1d [2019-10-15 03:03:02,570 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:03:02,570 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/mcmillan2006.i [2019-10-15 03:03:02,577 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e105ca3f7/40ad1f2042eb46b5a6cdc048a910b3f9/FLAGb24dc3c1d [2019-10-15 03:03:02,978 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e105ca3f7/40ad1f2042eb46b5a6cdc048a910b3f9 [2019-10-15 03:03:02,989 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:03:02,991 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:03:02,992 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:03:02,992 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:03:02,996 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:03:02,997 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:03:02" (1/1) ... [2019-10-15 03:03:03,001 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26a7327f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:03:02, skipping insertion in model container [2019-10-15 03:03:03,001 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:03:02" (1/1) ... [2019-10-15 03:03:03,011 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:03:03,036 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:03:03,224 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:03:03,247 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:03:03,263 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:03:03,278 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:03:03,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:03:03 WrapperNode [2019-10-15 03:03:03,279 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:03:03,279 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:03:03,279 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:03:03,280 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:03:03,378 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:03:03" (1/1) ... [2019-10-15 03:03:03,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:03:03" (1/1) ... [2019-10-15 03:03:03,385 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:03:03" (1/1) ... [2019-10-15 03:03:03,388 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:03:03" (1/1) ... [2019-10-15 03:03:03,409 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:03:03" (1/1) ... [2019-10-15 03:03:03,415 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:03:03" (1/1) ... [2019-10-15 03:03:03,420 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:03:03" (1/1) ... [2019-10-15 03:03:03,422 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:03:03,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:03:03,428 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:03:03,428 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:03:03,429 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:03:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:03:03,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:03:03,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:03:03,516 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-15 03:03:03,516 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:03:03,516 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 03:03:03,517 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:03:03,517 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 03:03:03,517 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-15 03:03:03,517 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 03:03:03,517 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:03:03,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 03:03:03,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 03:03:03,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 03:03:03,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:03:03,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:03:03,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 03:03:03,961 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:03:03,962 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-15 03:03:03,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:03:03 BoogieIcfgContainer [2019-10-15 03:03:03,964 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:03:03,965 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:03:03,966 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:03:03,970 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:03:03,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:03:02" (1/3) ... [2019-10-15 03:03:03,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73d4bafb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:03:03, skipping insertion in model container [2019-10-15 03:03:03,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:03:03" (2/3) ... [2019-10-15 03:03:03,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73d4bafb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:03:03, skipping insertion in model container [2019-10-15 03:03:03,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:03:03" (3/3) ... [2019-10-15 03:03:03,978 INFO L109 eAbstractionObserver]: Analyzing ICFG mcmillan2006.i [2019-10-15 03:03:03,989 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:03:03,999 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 03:03:04,012 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 03:03:04,060 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:03:04,060 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:03:04,060 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:03:04,061 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:03:04,061 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:03:04,061 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:03:04,061 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:03:04,061 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:03:04,089 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-10-15 03:03:04,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-15 03:03:04,110 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:03:04,112 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:03:04,115 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:03:04,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:03:04,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1720712542, now seen corresponding path program 1 times [2019-10-15 03:03:04,133 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:03:04,134 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564708575] [2019-10-15 03:03:04,135 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:03:04,135 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:03:04,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:03:04,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:03:04,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:03:04,440 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564708575] [2019-10-15 03:03:04,440 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:03:04,441 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:03:04,441 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564341615] [2019-10-15 03:03:04,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:03:04,445 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:03:04,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:03:04,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:03:04,460 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 4 states. [2019-10-15 03:03:04,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:03:04,551 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2019-10-15 03:03:04,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:03:04,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-15 03:03:04,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:03:04,561 INFO L225 Difference]: With dead ends: 37 [2019-10-15 03:03:04,562 INFO L226 Difference]: Without dead ends: 17 [2019-10-15 03:03:04,567 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:03:04,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-10-15 03:03:04,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-10-15 03:03:04,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-15 03:03:04,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-10-15 03:03:04,620 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 12 [2019-10-15 03:03:04,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:03:04,620 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-10-15 03:03:04,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:03:04,621 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-10-15 03:03:04,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-15 03:03:04,622 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:03:04,622 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:03:04,622 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:03:04,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:03:04,623 INFO L82 PathProgramCache]: Analyzing trace with hash -825415550, now seen corresponding path program 1 times [2019-10-15 03:03:04,623 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:03:04,624 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109615698] [2019-10-15 03:03:04,624 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:03:04,624 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:03:04,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:03:04,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:03:05,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:03:05,007 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109615698] [2019-10-15 03:03:05,008 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800837491] [2019-10-15 03:03:05,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:03:05,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:03:05,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-15 03:03:05,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:03:05,216 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-15 03:03:05,217 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 03:03:05,223 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 03:03:05,223 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-15 03:03:05,224 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-10-15 03:03:05,311 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-15 03:03:05,312 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 03:03:05,319 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 03:03:05,320 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-15 03:03:05,320 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-10-15 03:03:05,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:03:05,369 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:03:05,405 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2019-10-15 03:03:05,415 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2019-10-15 03:03:05,416 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 03:03:05,422 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 03:03:05,422 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-15 03:03:05,428 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 03:03:05,429 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-15 03:03:05,429 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:14, output treesize:7 [2019-10-15 03:03:05,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:03:05,469 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [294656272] [2019-10-15 03:03:05,495 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-15 03:03:05,495 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:03:05,503 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:03:05,511 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:03:05,511 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:03:05,704 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 03:03:06,160 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-15 03:03:06,173 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 03:03:06,182 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 03:03:06,958 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 03:03:06,958 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 11] total 25 [2019-10-15 03:03:06,961 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336387950] [2019-10-15 03:03:06,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-15 03:03:06,966 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:03:06,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-15 03:03:06,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2019-10-15 03:03:06,968 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 25 states. [2019-10-15 03:03:07,716 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2019-10-15 03:03:07,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:03:07,940 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2019-10-15 03:03:07,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-15 03:03:07,943 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 13 [2019-10-15 03:03:07,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:03:07,945 INFO L225 Difference]: With dead ends: 26 [2019-10-15 03:03:07,945 INFO L226 Difference]: Without dead ends: 24 [2019-10-15 03:03:07,946 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=150, Invalid=972, Unknown=0, NotChecked=0, Total=1122 [2019-10-15 03:03:07,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-15 03:03:07,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-10-15 03:03:07,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-15 03:03:07,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-10-15 03:03:07,954 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 13 [2019-10-15 03:03:07,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:03:07,955 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-10-15 03:03:07,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-15 03:03:07,955 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-10-15 03:03:07,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-15 03:03:07,956 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:03:07,956 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:03:08,174 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:03:08,175 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:03:08,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:03:08,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1785378702, now seen corresponding path program 1 times [2019-10-15 03:03:08,176 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:03:08,176 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034357145] [2019-10-15 03:03:08,177 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:03:08,177 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:03:08,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:03:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:03:08,270 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:03:08,271 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034357145] [2019-10-15 03:03:08,271 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586454084] [2019-10-15 03:03:08,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:03:08,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:03:08,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-15 03:03:08,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:03:08,351 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:03:08,351 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:03:08,379 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:03:08,379 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [186370660] [2019-10-15 03:03:08,381 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-15 03:03:08,381 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:03:08,381 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:03:08,382 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:03:08,382 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:03:08,427 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 03:03:09,119 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 15 for LOIs [2019-10-15 03:03:09,175 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 03:03:09,195 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 03:03:09,345 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 14 [2019-10-15 03:03:09,799 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 20 [2019-10-15 03:03:09,979 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 26 [2019-10-15 03:03:10,213 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 14 [2019-10-15 03:03:10,538 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 03:03:10,538 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 13] total 23 [2019-10-15 03:03:10,538 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6159698] [2019-10-15 03:03:10,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-15 03:03:10,540 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:03:10,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-15 03:03:10,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2019-10-15 03:03:10,541 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 23 states. [2019-10-15 03:03:11,159 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2019-10-15 03:03:11,299 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 30 [2019-10-15 03:03:11,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:03:11,944 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-10-15 03:03:11,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-15 03:03:11,944 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 20 [2019-10-15 03:03:11,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:03:11,948 INFO L225 Difference]: With dead ends: 37 [2019-10-15 03:03:11,948 INFO L226 Difference]: Without dead ends: 24 [2019-10-15 03:03:11,949 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=203, Invalid=1129, Unknown=0, NotChecked=0, Total=1332 [2019-10-15 03:03:11,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-15 03:03:11,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-10-15 03:03:11,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-15 03:03:11,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-10-15 03:03:11,959 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 20 [2019-10-15 03:03:11,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:03:11,960 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-10-15 03:03:11,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-15 03:03:11,960 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-10-15 03:03:11,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-15 03:03:11,961 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:03:11,961 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:03:12,172 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:03:12,173 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:03:12,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:03:12,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1645445454, now seen corresponding path program 2 times [2019-10-15 03:03:12,174 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:03:12,174 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280769448] [2019-10-15 03:03:12,174 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:03:12,174 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:03:12,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:03:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:03:12,449 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:03:12,450 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280769448] [2019-10-15 03:03:12,450 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731653950] [2019-10-15 03:03:12,450 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:03:12,520 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-15 03:03:12,521 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 03:03:12,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-15 03:03:12,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:03:14,808 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:03:14,809 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:03:15,529 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:03:15,529 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1441718347] [2019-10-15 03:03:15,531 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-15 03:03:15,531 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:03:15,532 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:03:15,532 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:03:15,532 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:03:15,559 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 03:03:16,015 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 15 for LOIs [2019-10-15 03:03:16,050 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 03:03:16,054 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 03:03:16,647 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 26 [2019-10-15 03:03:17,123 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 03:03:17,124 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 10, 13] total 30 [2019-10-15 03:03:17,124 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904602707] [2019-10-15 03:03:17,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-15 03:03:17,126 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:03:17,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-15 03:03:17,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=778, Unknown=2, NotChecked=0, Total=870 [2019-10-15 03:03:17,127 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 30 states. [2019-10-15 03:03:17,812 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-10-15 03:03:17,953 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-10-15 03:03:18,498 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2019-10-15 03:03:18,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:03:18,939 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2019-10-15 03:03:18,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-15 03:03:18,940 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 21 [2019-10-15 03:03:18,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:03:18,943 INFO L225 Difference]: With dead ends: 32 [2019-10-15 03:03:18,943 INFO L226 Difference]: Without dead ends: 30 [2019-10-15 03:03:18,946 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=266, Invalid=1802, Unknown=2, NotChecked=0, Total=2070 [2019-10-15 03:03:18,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-15 03:03:18,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-10-15 03:03:18,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-15 03:03:18,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-10-15 03:03:18,964 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 21 [2019-10-15 03:03:18,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:03:18,964 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-10-15 03:03:18,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-15 03:03:18,964 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2019-10-15 03:03:18,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-15 03:03:18,969 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:03:18,969 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:03:19,173 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:03:19,174 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:03:19,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:03:19,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1236732766, now seen corresponding path program 3 times [2019-10-15 03:03:19,175 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:03:19,176 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819115496] [2019-10-15 03:03:19,176 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:03:19,176 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:03:19,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:03:19,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:03:19,243 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 03:03:19,243 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819115496] [2019-10-15 03:03:19,243 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753028591] [2019-10-15 03:03:19,243 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 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 03:03:19,309 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-15 03:03:19,309 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 03:03:19,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-15 03:03:19,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:03:19,428 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 03:03:19,428 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:03:19,505 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 03:03:19,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1931672343] [2019-10-15 03:03:19,507 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-15 03:03:19,508 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:03:19,508 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:03:19,508 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:03:19,508 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:03:19,543 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 03:03:19,842 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 15 for LOIs [2019-10-15 03:03:19,872 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 03:03:19,876 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 03:03:20,384 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 26 [2019-10-15 03:03:20,889 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 03:03:20,890 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 13] total 26 [2019-10-15 03:03:20,890 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904888193] [2019-10-15 03:03:20,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-15 03:03:20,892 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:03:20,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-15 03:03:20,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2019-10-15 03:03:20,893 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 26 states. [2019-10-15 03:03:22,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:03:22,206 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2019-10-15 03:03:22,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-15 03:03:22,207 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 28 [2019-10-15 03:03:22,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:03:22,208 INFO L225 Difference]: With dead ends: 46 [2019-10-15 03:03:22,209 INFO L226 Difference]: Without dead ends: 30 [2019-10-15 03:03:22,210 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 64 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=263, Invalid=1543, Unknown=0, NotChecked=0, Total=1806 [2019-10-15 03:03:22,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-15 03:03:22,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-10-15 03:03:22,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-15 03:03:22,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-10-15 03:03:22,218 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 28 [2019-10-15 03:03:22,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:03:22,218 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-10-15 03:03:22,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-15 03:03:22,218 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-10-15 03:03:22,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-15 03:03:22,219 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:03:22,219 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:03:22,422 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:03:22,423 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:03:22,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:03:22,424 INFO L82 PathProgramCache]: Analyzing trace with hash 2015456898, now seen corresponding path program 4 times [2019-10-15 03:03:22,424 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:03:22,424 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533119406] [2019-10-15 03:03:22,424 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:03:22,425 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:03:22,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:03:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:03:22,552 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 03:03:22,552 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533119406] [2019-10-15 03:03:22,553 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721772338] [2019-10-15 03:03:22,553 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 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 03:03:22,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:03:22,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-15 03:03:22,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:03:28,010 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 03:03:28,010 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:03:28,666 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 03:03:28,666 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1893395406] [2019-10-15 03:03:28,668 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-15 03:03:28,668 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:03:28,668 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:03:28,668 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:03:28,669 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:03:28,692 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 03:03:29,035 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 15 for LOIs [2019-10-15 03:03:29,069 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 03:03:29,078 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 03:03:30,135 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 03:03:30,135 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12, 13] total 31 [2019-10-15 03:03:30,136 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913826065] [2019-10-15 03:03:30,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-15 03:03:30,137 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:03:30,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-15 03:03:30,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=835, Unknown=3, NotChecked=0, Total=930 [2019-10-15 03:03:30,138 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 31 states. [2019-10-15 03:03:31,159 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-10-15 03:03:32,058 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-10-15 03:03:32,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:03:32,446 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2019-10-15 03:03:32,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-15 03:03:32,446 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 29 [2019-10-15 03:03:32,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:03:32,447 INFO L225 Difference]: With dead ends: 38 [2019-10-15 03:03:32,447 INFO L226 Difference]: Without dead ends: 36 [2019-10-15 03:03:32,449 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 63 SyntacticMatches, 7 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=297, Invalid=2150, Unknown=3, NotChecked=0, Total=2450 [2019-10-15 03:03:32,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-15 03:03:32,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2019-10-15 03:03:32,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-15 03:03:32,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2019-10-15 03:03:32,458 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 29 [2019-10-15 03:03:32,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:03:32,459 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2019-10-15 03:03:32,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-15 03:03:32,459 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2019-10-15 03:03:32,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-15 03:03:32,460 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:03:32,460 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:03:32,664 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:03:32,664 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:03:32,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:03:32,665 INFO L82 PathProgramCache]: Analyzing trace with hash -321146482, now seen corresponding path program 5 times [2019-10-15 03:03:32,665 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:03:32,665 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303831212] [2019-10-15 03:03:32,666 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:03:32,666 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:03:32,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:03:32,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:03:32,794 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 03:03:32,794 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303831212] [2019-10-15 03:03:32,795 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989157887] [2019-10-15 03:03:32,795 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 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 03:03:32,896 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-15 03:03:32,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 03:03:32,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-15 03:03:32,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:03:32,962 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 03:03:32,963 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:03:33,024 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 03:03:33,024 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2073968035] [2019-10-15 03:03:33,025 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-15 03:03:33,025 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:03:33,026 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:03:33,026 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:03:33,026 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:03:33,042 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 03:03:33,302 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 15 for LOIs [2019-10-15 03:03:33,332 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 03:03:33,334 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 03:03:33,941 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 26 [2019-10-15 03:03:34,396 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 03:03:34,396 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10, 13] total 29 [2019-10-15 03:03:34,397 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064093552] [2019-10-15 03:03:34,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-15 03:03:34,399 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:03:34,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-15 03:03:34,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=707, Unknown=0, NotChecked=0, Total=812 [2019-10-15 03:03:34,400 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 29 states. [2019-10-15 03:03:35,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:03:35,999 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2019-10-15 03:03:35,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-15 03:03:35,999 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 36 [2019-10-15 03:03:35,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:03:36,000 INFO L225 Difference]: With dead ends: 53 [2019-10-15 03:03:36,000 INFO L226 Difference]: Without dead ends: 34 [2019-10-15 03:03:36,001 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 85 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=336, Invalid=2016, Unknown=0, NotChecked=0, Total=2352 [2019-10-15 03:03:36,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-15 03:03:36,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-10-15 03:03:36,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-15 03:03:36,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2019-10-15 03:03:36,009 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 36 [2019-10-15 03:03:36,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:03:36,009 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2019-10-15 03:03:36,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-15 03:03:36,010 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2019-10-15 03:03:36,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-15 03:03:36,011 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:03:36,011 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:03:36,217 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:03:36,218 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:03:36,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:03:36,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1641197746, now seen corresponding path program 6 times [2019-10-15 03:03:36,219 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:03:36,219 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146086013] [2019-10-15 03:03:36,219 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:03:36,220 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:03:36,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:03:36,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:03:36,397 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 03:03:36,398 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146086013] [2019-10-15 03:03:36,398 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426111996] [2019-10-15 03:03:36,398 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 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 03:03:36,493 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-15 03:03:36,493 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 03:03:36,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-15 03:03:36,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:03:37,080 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 03:03:37,080 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:03:37,144 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 03:03:37,145 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1432459262] [2019-10-15 03:03:37,146 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-15 03:03:37,146 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:03:37,146 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:03:37,147 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:03:37,147 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:03:37,174 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 03:03:37,479 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 15 for LOIs [2019-10-15 03:03:37,504 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 03:03:37,507 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 03:03:38,177 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 26 [2019-10-15 03:03:38,710 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 03:03:38,710 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14, 13] total 40 [2019-10-15 03:03:38,710 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297368898] [2019-10-15 03:03:38,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-15 03:03:38,712 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:03:38,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-15 03:03:38,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1435, Unknown=0, NotChecked=0, Total=1560 [2019-10-15 03:03:38,713 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 40 states. [2019-10-15 03:03:39,736 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-10-15 03:03:41,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:03:41,359 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-10-15 03:03:41,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-15 03:03:41,359 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 37 [2019-10-15 03:03:41,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:03:41,361 INFO L225 Difference]: With dead ends: 42 [2019-10-15 03:03:41,361 INFO L226 Difference]: Without dead ends: 40 [2019-10-15 03:03:41,363 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 80 SyntacticMatches, 7 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 896 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=378, Invalid=3404, Unknown=0, NotChecked=0, Total=3782 [2019-10-15 03:03:41,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-15 03:03:41,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2019-10-15 03:03:41,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-15 03:03:41,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-10-15 03:03:41,372 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 37 [2019-10-15 03:03:41,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:03:41,372 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-10-15 03:03:41,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-15 03:03:41,372 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-10-15 03:03:41,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-15 03:03:41,374 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:03:41,374 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:03:41,579 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:03:41,580 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:03:41,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:03:41,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1909758302, now seen corresponding path program 7 times [2019-10-15 03:03:41,582 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:03:41,582 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137417092] [2019-10-15 03:03:41,582 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:03:41,583 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:03:41,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:03:41,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:03:41,719 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 24 proven. 20 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-15 03:03:41,720 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137417092] [2019-10-15 03:03:41,720 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598785450] [2019-10-15 03:03:41,720 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 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 03:03:41,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:03:41,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-15 03:03:41,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:03:41,962 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 34 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-15 03:03:41,962 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:03:42,037 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 34 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-15 03:03:42,037 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [60417587] [2019-10-15 03:03:42,039 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-15 03:03:42,039 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:03:42,039 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:03:42,040 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:03:42,040 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:03:42,055 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 03:03:42,399 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 15 for LOIs [2019-10-15 03:03:42,426 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 03:03:42,429 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 03:03:43,159 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 26 [2019-10-15 03:03:43,603 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 03:03:43,603 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12, 13] total 32 [2019-10-15 03:03:43,604 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894660060] [2019-10-15 03:03:43,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-15 03:03:43,605 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:03:43,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-15 03:03:43,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=863, Unknown=0, NotChecked=0, Total=992 [2019-10-15 03:03:43,606 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 32 states. [2019-10-15 03:03:45,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:03:45,428 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2019-10-15 03:03:45,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-15 03:03:45,429 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 44 [2019-10-15 03:03:45,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:03:45,430 INFO L225 Difference]: With dead ends: 60 [2019-10-15 03:03:45,430 INFO L226 Difference]: Without dead ends: 38 [2019-10-15 03:03:45,432 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 106 SyntacticMatches, 8 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 846 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=422, Invalid=2548, Unknown=0, NotChecked=0, Total=2970 [2019-10-15 03:03:45,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-15 03:03:45,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-10-15 03:03:45,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-15 03:03:45,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-10-15 03:03:45,440 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 44 [2019-10-15 03:03:45,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:03:45,440 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-10-15 03:03:45,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-15 03:03:45,441 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-10-15 03:03:45,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-15 03:03:45,442 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:03:45,442 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:03:45,648 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:03:45,649 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:03:45,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:03:45,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1795410814, now seen corresponding path program 8 times [2019-10-15 03:03:45,650 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:03:45,650 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390062393] [2019-10-15 03:03:45,650 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:03:45,651 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:03:45,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:03:45,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:03:45,875 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 8 proven. 41 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-15 03:03:45,875 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390062393] [2019-10-15 03:03:45,876 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132051906] [2019-10-15 03:03:45,876 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 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 03:03:46,010 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-15 03:03:46,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 03:03:46,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-15 03:03:46,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:03:47,180 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-15 03:03:47,181 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:03:47,682 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 26 proven. 23 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-15 03:03:47,683 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1088824611] [2019-10-15 03:03:47,684 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-15 03:03:47,684 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:03:47,685 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:03:47,685 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:03:47,685 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:03:47,710 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 03:03:48,143 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 15 for LOIs [2019-10-15 03:03:48,172 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 03:03:48,176 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 03:03:48,988 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 26 [2019-10-15 03:03:49,646 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 03:03:49,647 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 16, 13] total 49 [2019-10-15 03:03:49,647 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140004593] [2019-10-15 03:03:49,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-10-15 03:03:49,648 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:03:49,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-10-15 03:03:49,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=2153, Unknown=0, NotChecked=0, Total=2352 [2019-10-15 03:03:49,649 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 49 states.