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/reducercommutativity/sum20-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:25:39,500 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:25:39,502 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:25:39,519 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:25:39,520 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:25:39,521 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:25:39,523 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:25:39,535 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:25:39,537 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:25:39,538 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:25:39,539 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:25:39,540 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:25:39,541 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:25:39,544 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:25:39,546 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:25:39,547 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:25:39,549 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:25:39,551 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:25:39,552 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:25:39,558 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:25:39,563 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:25:39,566 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:25:39,569 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:25:39,570 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:25:39,573 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:25:39,573 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:25:39,574 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:25:39,575 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:25:39,577 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:25:39,578 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:25:39,578 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:25:39,580 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:25:39,580 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:25:39,581 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:25:39,582 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:25:39,582 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:25:39,583 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:25:39,583 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:25:39,583 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:25:39,584 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:25:39,585 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:25:39,586 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:25:39,603 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:25:39,604 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:25:39,607 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:25:39,608 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:25:39,608 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:25:39,608 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:25:39,608 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:25:39,608 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:25:39,609 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:25:39,609 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:25:39,610 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:25:39,610 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:25:39,610 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:25:39,611 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:25:39,611 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:25:39,611 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:25:39,611 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:25:39,611 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:25:39,612 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:25:39,613 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:25:39,613 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:25:39,613 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:25:39,614 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:25:39,614 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:25:39,614 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:25:39,614 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:25:39,614 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:25:39,615 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:25:39,615 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:25:39,856 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:25:39,868 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:25:39,872 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:25:39,873 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:25:39,873 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:25:39,874 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/sum20-2.i [2019-10-15 03:25:39,932 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83fa8e10e/ba09718ad3c740a99cd413ad9b17a579/FLAG1a471f863 [2019-10-15 03:25:40,369 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:25:40,370 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/sum20-2.i [2019-10-15 03:25:40,377 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83fa8e10e/ba09718ad3c740a99cd413ad9b17a579/FLAG1a471f863 [2019-10-15 03:25:40,758 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83fa8e10e/ba09718ad3c740a99cd413ad9b17a579 [2019-10-15 03:25:40,768 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:25:40,769 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:25:40,770 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:25:40,770 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:25:40,774 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:25:40,775 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:25:40" (1/1) ... [2019-10-15 03:25:40,778 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35da1448 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:25:40, skipping insertion in model container [2019-10-15 03:25:40,778 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:25:40" (1/1) ... [2019-10-15 03:25:40,785 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:25:40,809 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:25:40,981 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:25:40,990 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:25:41,010 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:25:41,025 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:25:41,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:25:41 WrapperNode [2019-10-15 03:25:41,026 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:25:41,026 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:25:41,026 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:25:41,027 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:25:41,120 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:25:41" (1/1) ... [2019-10-15 03:25:41,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:25:41" (1/1) ... [2019-10-15 03:25:41,130 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:25:41" (1/1) ... [2019-10-15 03:25:41,132 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:25:41" (1/1) ... [2019-10-15 03:25:41,152 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:25:41" (1/1) ... [2019-10-15 03:25:41,160 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:25:41" (1/1) ... [2019-10-15 03:25:41,164 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:25:41" (1/1) ... [2019-10-15 03:25:41,169 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:25:41,170 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:25:41,170 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:25:41,170 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:25:41,171 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:25:41" (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:25:41,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:25:41,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:25:41,219 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2019-10-15 03:25:41,219 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:25:41,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:25:41,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 03:25:41,220 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2019-10-15 03:25:41,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 03:25:41,220 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:25:41,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 03:25:41,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 03:25:41,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 03:25:41,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:25:41,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:25:41,576 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:25:41,577 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-15 03:25:41,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:25:41 BoogieIcfgContainer [2019-10-15 03:25:41,578 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:25:41,579 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:25:41,579 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:25:41,582 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:25:41,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:25:40" (1/3) ... [2019-10-15 03:25:41,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@589ec93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:25:41, skipping insertion in model container [2019-10-15 03:25:41,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:25:41" (2/3) ... [2019-10-15 03:25:41,584 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@589ec93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:25:41, skipping insertion in model container [2019-10-15 03:25:41,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:25:41" (3/3) ... [2019-10-15 03:25:41,585 INFO L109 eAbstractionObserver]: Analyzing ICFG sum20-2.i [2019-10-15 03:25:41,595 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:25:41,602 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 03:25:41,613 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 03:25:41,635 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:25:41,635 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:25:41,635 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:25:41,635 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:25:41,636 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:25:41,636 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:25:41,636 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:25:41,636 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:25:41,652 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-10-15 03:25:41,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-15 03:25:41,658 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:25:41,658 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:25:41,660 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:25:41,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:25:41,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1818423299, now seen corresponding path program 1 times [2019-10-15 03:25:41,672 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:25:41,672 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396954961] [2019-10-15 03:25:41,672 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:25:41,673 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:25:41,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:25:41,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:25:41,854 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-15 03:25:41,855 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396954961] [2019-10-15 03:25:41,856 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:25:41,856 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:25:41,856 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339781380] [2019-10-15 03:25:41,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:25:41,861 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:25:41,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:25:41,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:25:41,878 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2019-10-15 03:25:41,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:25:41,918 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2019-10-15 03:25:41,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:25:41,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-15 03:25:41,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:25:41,933 INFO L225 Difference]: With dead ends: 41 [2019-10-15 03:25:41,934 INFO L226 Difference]: Without dead ends: 20 [2019-10-15 03:25:41,940 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:25:41,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-15 03:25:41,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-15 03:25:41,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-15 03:25:41,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-10-15 03:25:42,000 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 24 [2019-10-15 03:25:42,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:25:42,001 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-10-15 03:25:42,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:25:42,002 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-10-15 03:25:42,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 03:25:42,005 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:25:42,006 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:25:42,007 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:25:42,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:25:42,008 INFO L82 PathProgramCache]: Analyzing trace with hash -2093950433, now seen corresponding path program 1 times [2019-10-15 03:25:42,009 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:25:42,009 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557689754] [2019-10-15 03:25:42,009 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:25:42,010 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:25:42,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:25:42,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:25:42,157 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 03:25:42,158 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557689754] [2019-10-15 03:25:42,161 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152060314] [2019-10-15 03:25:42,162 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:25:42,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:25:42,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 03:25:42,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:25:42,293 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 03:25:42,293 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:25:42,339 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 03:25:42,339 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 03:25:42,339 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2019-10-15 03:25:42,340 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987789185] [2019-10-15 03:25:42,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:25:42,342 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:25:42,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:25:42,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:25:42,343 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 3 states. [2019-10-15 03:25:42,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:25:42,352 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2019-10-15 03:25:42,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:25:42,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-15 03:25:42,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:25:42,354 INFO L225 Difference]: With dead ends: 33 [2019-10-15 03:25:42,354 INFO L226 Difference]: Without dead ends: 21 [2019-10-15 03:25:42,356 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:25:42,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-15 03:25:42,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-15 03:25:42,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-15 03:25:42,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-10-15 03:25:42,362 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 25 [2019-10-15 03:25:42,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:25:42,362 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-10-15 03:25:42,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:25:42,363 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-10-15 03:25:42,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-15 03:25:42,364 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:25:42,364 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:25:42,569 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:25:42,569 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:25:42,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:25:42,570 INFO L82 PathProgramCache]: Analyzing trace with hash 903502258, now seen corresponding path program 1 times [2019-10-15 03:25:42,571 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:25:42,573 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449187164] [2019-10-15 03:25:42,573 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:25:42,574 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:25:42,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:25:42,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:25:42,692 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 03:25:42,693 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449187164] [2019-10-15 03:25:42,693 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:25:42,693 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:25:42,694 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010663008] [2019-10-15 03:25:42,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:25:42,694 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:25:42,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:25:42,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:25:42,695 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 3 states. [2019-10-15 03:25:42,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:25:42,706 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2019-10-15 03:25:42,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:25:42,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-15 03:25:42,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:25:42,708 INFO L225 Difference]: With dead ends: 31 [2019-10-15 03:25:42,708 INFO L226 Difference]: Without dead ends: 22 [2019-10-15 03:25:42,709 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:25:42,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-15 03:25:42,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-15 03:25:42,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-15 03:25:42,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-10-15 03:25:42,715 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 28 [2019-10-15 03:25:42,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:25:42,717 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-10-15 03:25:42,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:25:42,717 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-10-15 03:25:42,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-15 03:25:42,718 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:25:42,718 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:25:42,719 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:25:42,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:25:42,719 INFO L82 PathProgramCache]: Analyzing trace with hash 2130547361, now seen corresponding path program 1 times [2019-10-15 03:25:42,720 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:25:42,720 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136963664] [2019-10-15 03:25:42,720 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:25:42,720 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:25:42,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:25:42,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:25:42,810 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 03:25:42,810 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136963664] [2019-10-15 03:25:42,811 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290557174] [2019-10-15 03:25:42,811 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:25:42,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:25:42,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 03:25:42,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:25:42,905 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 03:25:42,905 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:25:42,936 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 03:25:42,936 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1533080085] [2019-10-15 03:25:42,961 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-15 03:25:42,961 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:25:42,968 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:25:42,975 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:25:42,976 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:25:43,139 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 03:25:45,045 INFO L199 IcfgInterpreter]: Interpreting procedure sum with input of size 1 for LOIs [2019-10-15 03:25:45,085 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 03:25:45,089 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 03:25:45,473 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 03:25:45,473 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-15 03:25:45,474 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508779225] [2019-10-15 03:25:45,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-15 03:25:45,476 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:25:45,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-15 03:25:45,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-10-15 03:25:45,478 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 18 states. [2019-10-15 03:25:46,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:25:46,146 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2019-10-15 03:25:46,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-15 03:25:46,146 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 29 [2019-10-15 03:25:46,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:25:46,147 INFO L225 Difference]: With dead ends: 40 [2019-10-15 03:25:46,147 INFO L226 Difference]: Without dead ends: 25 [2019-10-15 03:25:46,148 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=133, Invalid=737, Unknown=0, NotChecked=0, Total=870 [2019-10-15 03:25:46,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-15 03:25:46,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-10-15 03:25:46,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-15 03:25:46,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-10-15 03:25:46,155 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 29 [2019-10-15 03:25:46,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:25:46,155 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-10-15 03:25:46,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-15 03:25:46,155 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-10-15 03:25:46,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-15 03:25:46,156 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:25:46,157 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:25:46,359 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:25:46,360 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:25:46,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:25:46,360 INFO L82 PathProgramCache]: Analyzing trace with hash 356639231, now seen corresponding path program 2 times [2019-10-15 03:25:46,361 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:25:46,361 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497370825] [2019-10-15 03:25:46,361 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:25:46,361 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:25:46,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:25:46,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:25:46,478 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 03:25:46,478 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497370825] [2019-10-15 03:25:46,478 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346469061] [2019-10-15 03:25:46,478 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:25:46,567 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-15 03:25:46,567 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 03:25:46,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 03:25:46,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:25:46,606 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 03:25:46,606 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:25:46,639 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 03:25:46,639 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [742926669] [2019-10-15 03:25:46,643 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-15 03:25:46,643 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:25:46,644 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:25:46,644 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:25:46,644 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:25:46,676 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 03:25:48,145 INFO L199 IcfgInterpreter]: Interpreting procedure sum with input of size 1 for LOIs [2019-10-15 03:25:48,196 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 03:25:48,202 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 03:25:48,688 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 03:25:48,688 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4, 11] total 21 [2019-10-15 03:25:48,688 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546546931] [2019-10-15 03:25:48,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-15 03:25:48,690 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:25:48,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-15 03:25:48,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2019-10-15 03:25:48,691 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 22 states. [2019-10-15 03:25:49,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:25:49,593 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2019-10-15 03:25:49,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-15 03:25:49,594 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 32 [2019-10-15 03:25:49,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:25:49,595 INFO L225 Difference]: With dead ends: 44 [2019-10-15 03:25:49,595 INFO L226 Difference]: Without dead ends: 29 [2019-10-15 03:25:49,596 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=210, Invalid=1272, Unknown=0, NotChecked=0, Total=1482 [2019-10-15 03:25:49,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-15 03:25:49,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-10-15 03:25:49,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-15 03:25:49,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-10-15 03:25:49,603 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 32 [2019-10-15 03:25:49,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:25:49,603 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-10-15 03:25:49,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-15 03:25:49,604 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-10-15 03:25:49,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-15 03:25:49,605 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:25:49,605 INFO L380 BasicCegarLoop]: trace histogram [12, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:25:49,809 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:25:49,810 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:25:49,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:25:49,811 INFO L82 PathProgramCache]: Analyzing trace with hash 906031436, now seen corresponding path program 3 times [2019-10-15 03:25:49,811 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:25:49,812 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223910230] [2019-10-15 03:25:49,812 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:25:49,812 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:25:49,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:25:49,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:25:49,892 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-15 03:25:49,892 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223910230] [2019-10-15 03:25:49,893 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447244866] [2019-10-15 03:25:49,893 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:25:50,030 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-15 03:25:50,030 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 03:25:50,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-15 03:25:50,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:25:50,044 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-15 03:25:50,045 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:25:50,135 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-15 03:25:50,135 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [142942241] [2019-10-15 03:25:50,137 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-15 03:25:50,137 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:25:50,138 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:25:50,138 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:25:50,138 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:25:50,160 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 03:25:51,586 INFO L199 IcfgInterpreter]: Interpreting procedure sum with input of size 1 for LOIs [2019-10-15 03:25:51,607 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 03:25:51,610 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 03:25:51,952 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 03:25:51,953 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 11] total 25 [2019-10-15 03:25:51,953 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484709329] [2019-10-15 03:25:51,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-15 03:25:51,954 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:25:51,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-15 03:25:51,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2019-10-15 03:25:51,955 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 26 states. [2019-10-15 03:25:53,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:25:53,563 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2019-10-15 03:25:53,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-15 03:25:53,564 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 42 [2019-10-15 03:25:53,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:25:53,565 INFO L225 Difference]: With dead ends: 54 [2019-10-15 03:25:53,565 INFO L226 Difference]: Without dead ends: 36 [2019-10-15 03:25:53,567 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=369, Invalid=1701, Unknown=0, NotChecked=0, Total=2070 [2019-10-15 03:25:53,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-15 03:25:53,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-10-15 03:25:53,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-15 03:25:53,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-10-15 03:25:53,575 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 42 [2019-10-15 03:25:53,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:25:53,575 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-10-15 03:25:53,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-15 03:25:53,575 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-10-15 03:25:53,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-15 03:25:53,577 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:25:53,577 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:25:53,782 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:25:53,783 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:25:53,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:25:53,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1194663378, now seen corresponding path program 4 times [2019-10-15 03:25:53,785 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:25:53,785 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56305958] [2019-10-15 03:25:53,785 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:25:53,786 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:25:53,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:25:53,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:25:53,974 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-15 03:25:53,974 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56305958] [2019-10-15 03:25:53,975 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12895304] [2019-10-15 03:25:53,975 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:25:54,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:25:54,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-15 03:25:54,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:25:54,162 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-15 03:25:54,169 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:25:54,410 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-15 03:25:54,410 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [433598178] [2019-10-15 03:25:54,411 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-15 03:25:54,412 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:25:54,413 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:25:54,414 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:25:54,414 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:25:54,437 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 03:25:55,751 INFO L199 IcfgInterpreter]: Interpreting procedure sum with input of size 1 for LOIs [2019-10-15 03:25:55,771 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 03:25:55,775 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 03:25:56,226 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 03:25:56,228 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 11] total 33 [2019-10-15 03:25:56,228 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183379520] [2019-10-15 03:25:56,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-15 03:25:56,230 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:25:56,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-15 03:25:56,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=840, Unknown=0, NotChecked=0, Total=1122 [2019-10-15 03:25:56,231 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 34 states. [2019-10-15 03:25:59,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:25:59,553 INFO L93 Difference]: Finished difference Result 62 states and 77 transitions. [2019-10-15 03:25:59,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-15 03:25:59,553 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 49 [2019-10-15 03:25:59,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:25:59,555 INFO L225 Difference]: With dead ends: 62 [2019-10-15 03:25:59,555 INFO L226 Difference]: Without dead ends: 44 [2019-10-15 03:25:59,557 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 126 SyntacticMatches, 6 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 977 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=797, Invalid=2985, Unknown=0, NotChecked=0, Total=3782 [2019-10-15 03:25:59,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-15 03:25:59,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-10-15 03:25:59,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-15 03:25:59,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-10-15 03:25:59,565 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 49 [2019-10-15 03:25:59,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:25:59,565 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-10-15 03:25:59,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-15 03:25:59,566 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-10-15 03:25:59,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-15 03:25:59,567 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:25:59,568 INFO L380 BasicCegarLoop]: trace histogram [20, 12, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:25:59,771 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:25:59,772 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:25:59,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:25:59,773 INFO L82 PathProgramCache]: Analyzing trace with hash -716222162, now seen corresponding path program 5 times [2019-10-15 03:25:59,773 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:25:59,774 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427541358] [2019-10-15 03:25:59,774 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:25:59,774 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:25:59,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:25:59,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:25:59,843 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2019-10-15 03:25:59,843 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427541358] [2019-10-15 03:25:59,843 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952598380] [2019-10-15 03:25:59,844 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:26:00,021 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-15 03:26:00,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 03:26:00,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-15 03:26:00,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:26:00,069 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 52 proven. 10 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-10-15 03:26:00,069 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:26:00,142 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 52 proven. 10 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-10-15 03:26:00,142 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1585719366] [2019-10-15 03:26:00,143 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-15 03:26:00,144 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:26:00,144 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:26:00,144 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:26:00,144 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:26:00,165 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 03:26:01,428 INFO L199 IcfgInterpreter]: Interpreting procedure sum with input of size 1 for LOIs [2019-10-15 03:26:01,454 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 03:26:01,457 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 03:26:01,860 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 03:26:01,860 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7, 11] total 24 [2019-10-15 03:26:01,860 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507663366] [2019-10-15 03:26:01,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-15 03:26:01,862 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:01,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-15 03:26:01,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2019-10-15 03:26:01,863 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 25 states. [2019-10-15 03:26:04,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:04,804 INFO L93 Difference]: Finished difference Result 68 states and 84 transitions. [2019-10-15 03:26:04,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-15 03:26:04,804 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 57 [2019-10-15 03:26:04,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:04,806 INFO L225 Difference]: With dead ends: 68 [2019-10-15 03:26:04,806 INFO L226 Difference]: Without dead ends: 51 [2019-10-15 03:26:04,808 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=358, Invalid=1622, Unknown=0, NotChecked=0, Total=1980 [2019-10-15 03:26:04,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-15 03:26:04,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-10-15 03:26:04,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-15 03:26:04,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-10-15 03:26:04,817 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 57 [2019-10-15 03:26:04,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:04,817 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-10-15 03:26:04,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-15 03:26:04,817 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-10-15 03:26:04,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-15 03:26:04,820 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:04,820 INFO L380 BasicCegarLoop]: trace histogram [30, 20, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:05,028 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:26:05,029 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:05,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:05,030 INFO L82 PathProgramCache]: Analyzing trace with hash 696436029, now seen corresponding path program 6 times [2019-10-15 03:26:05,031 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:05,031 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436055237] [2019-10-15 03:26:05,031 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:05,032 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:05,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:05,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:05,226 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 0 proven. 299 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2019-10-15 03:26:05,227 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436055237] [2019-10-15 03:26:05,227 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758830757] [2019-10-15 03:26:05,227 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:26:05,473 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-15 03:26:05,473 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 03:26:05,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-15 03:26:05,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:26:05,516 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 244 proven. 55 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2019-10-15 03:26:05,516 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:26:05,733 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 0 proven. 299 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2019-10-15 03:26:05,734 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [730423253] [2019-10-15 03:26:05,735 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-15 03:26:05,735 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:26:05,736 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:26:05,736 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:26:05,736 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:26:05,762 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 03:26:07,040 INFO L199 IcfgInterpreter]: Interpreting procedure sum with input of size 1 for LOIs [2019-10-15 03:26:07,061 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 03:26:07,064 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 03:26:07,447 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 03:26:07,447 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 11] total 33 [2019-10-15 03:26:07,448 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826336084] [2019-10-15 03:26:07,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-15 03:26:07,449 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:07,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-15 03:26:07,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=839, Unknown=0, NotChecked=0, Total=1122 [2019-10-15 03:26:07,451 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 34 states. [2019-10-15 03:26:09,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:09,081 INFO L93 Difference]: Finished difference Result 85 states and 104 transitions. [2019-10-15 03:26:09,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-15 03:26:09,082 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 76 [2019-10-15 03:26:09,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:09,084 INFO L225 Difference]: With dead ends: 85 [2019-10-15 03:26:09,084 INFO L226 Difference]: Without dead ends: 61 [2019-10-15 03:26:09,086 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 208 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=918, Invalid=2864, Unknown=0, NotChecked=0, Total=3782 [2019-10-15 03:26:09,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-15 03:26:09,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-10-15 03:26:09,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-15 03:26:09,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2019-10-15 03:26:09,096 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 76 [2019-10-15 03:26:09,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:09,097 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2019-10-15 03:26:09,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-15 03:26:09,097 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2019-10-15 03:26:09,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-15 03:26:09,099 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:09,099 INFO L380 BasicCegarLoop]: trace histogram [60, 20, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:09,304 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:26:09,305 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:09,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:09,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1048054237, now seen corresponding path program 7 times [2019-10-15 03:26:09,306 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:09,307 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251921900] [2019-10-15 03:26:09,307 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:09,307 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:09,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:09,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2172 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2019-10-15 03:26:09,417 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251921900] [2019-10-15 03:26:09,417 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24912086] [2019-10-15 03:26:09,418 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:26:09,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:09,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 03:26:09,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:26:09,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2172 backedges. 886 proven. 3 refuted. 0 times theorem prover too weak. 1283 trivial. 0 not checked. [2019-10-15 03:26:09,716 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:26:09,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2172 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2019-10-15 03:26:09,757 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [927519333] [2019-10-15 03:26:09,758 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-15 03:26:09,758 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:26:09,759 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:26:09,759 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:26:09,759 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:26:09,772 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 03:26:10,944 INFO L199 IcfgInterpreter]: Interpreting procedure sum with input of size 1 for LOIs [2019-10-15 03:26:10,970 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 03:26:10,973 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 03:26:11,261 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 03:26:11,261 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 11] total 19 [2019-10-15 03:26:11,261 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645050778] [2019-10-15 03:26:11,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-15 03:26:11,263 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:11,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-15 03:26:11,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2019-10-15 03:26:11,264 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 20 states. [2019-10-15 03:26:12,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:12,002 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2019-10-15 03:26:12,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-15 03:26:12,002 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 106 [2019-10-15 03:26:12,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:12,004 INFO L225 Difference]: With dead ends: 93 [2019-10-15 03:26:12,004 INFO L226 Difference]: Without dead ends: 65 [2019-10-15 03:26:12,005 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=186, Invalid=936, Unknown=0, NotChecked=0, Total=1122 [2019-10-15 03:26:12,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-15 03:26:12,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-10-15 03:26:12,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-15 03:26:12,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-10-15 03:26:12,015 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 106 [2019-10-15 03:26:12,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:12,015 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-10-15 03:26:12,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-15 03:26:12,015 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-10-15 03:26:12,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-15 03:26:12,017 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:12,017 INFO L380 BasicCegarLoop]: trace histogram [60, 20, 6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:12,222 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:26:12,223 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:12,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:12,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1255666147, now seen corresponding path program 8 times [2019-10-15 03:26:12,224 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:12,225 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586735843] [2019-10-15 03:26:12,225 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:12,225 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:12,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:12,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:12,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2190 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2019-10-15 03:26:12,379 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586735843] [2019-10-15 03:26:12,379 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738125008] [2019-10-15 03:26:12,379 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:26:12,702 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-15 03:26:12,703 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 03:26:12,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-15 03:26:12,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:26:12,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2190 backedges. 886 proven. 21 refuted. 0 times theorem prover too weak. 1283 trivial. 0 not checked. [2019-10-15 03:26:12,721 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:26:12,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2190 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2019-10-15 03:26:12,838 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1565195115] [2019-10-15 03:26:12,840 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-15 03:26:12,840 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:26:12,840 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:26:12,841 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:26:12,841 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:26:12,855 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 03:26:14,033 INFO L199 IcfgInterpreter]: Interpreting procedure sum with input of size 1 for LOIs [2019-10-15 03:26:14,051 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 03:26:14,054 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 03:26:14,396 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 03:26:14,396 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 11] total 27 [2019-10-15 03:26:14,396 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220086153] [2019-10-15 03:26:14,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-15 03:26:14,398 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:14,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-15 03:26:14,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2019-10-15 03:26:14,399 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 28 states. [2019-10-15 03:26:15,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:15,516 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2019-10-15 03:26:15,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-15 03:26:15,517 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 110 [2019-10-15 03:26:15,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:15,519 INFO L225 Difference]: With dead ends: 101 [2019-10-15 03:26:15,519 INFO L226 Difference]: Without dead ends: 73 [2019-10-15 03:26:15,520 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=486, Invalid=1964, Unknown=0, NotChecked=0, Total=2450 [2019-10-15 03:26:15,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-10-15 03:26:15,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-10-15 03:26:15,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-15 03:26:15,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2019-10-15 03:26:15,530 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 110 [2019-10-15 03:26:15,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:15,531 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2019-10-15 03:26:15,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-15 03:26:15,531 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2019-10-15 03:26:15,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-15 03:26:15,532 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:15,533 INFO L380 BasicCegarLoop]: trace histogram [60, 20, 14, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:15,737 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:26:15,738 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:15,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:15,738 INFO L82 PathProgramCache]: Analyzing trace with hash 2034480797, now seen corresponding path program 9 times [2019-10-15 03:26:15,739 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:15,739 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722563347] [2019-10-15 03:26:15,739 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:15,739 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:15,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:15,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:16,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2274 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2019-10-15 03:26:16,025 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722563347] [2019-10-15 03:26:16,025 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966559712] [2019-10-15 03:26:16,025 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:26:16,407 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-15 03:26:16,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 03:26:16,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-15 03:26:16,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:26:16,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2274 backedges. 886 proven. 105 refuted. 0 times theorem prover too weak. 1283 trivial. 0 not checked. [2019-10-15 03:26:16,426 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:26:16,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2274 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2019-10-15 03:26:16,669 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [188451115] [2019-10-15 03:26:16,671 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-15 03:26:16,671 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:26:16,671 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:26:16,672 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:26:16,672 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:26:16,692 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 03:26:18,013 INFO L199 IcfgInterpreter]: Interpreting procedure sum with input of size 1 for LOIs [2019-10-15 03:26:18,038 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 03:26:18,041 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 03:26:18,500 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 03:26:18,500 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17, 11] total 32 [2019-10-15 03:26:18,500 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429149899] [2019-10-15 03:26:18,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-15 03:26:18,501 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:18,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-15 03:26:18,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=796, Unknown=0, NotChecked=0, Total=1056 [2019-10-15 03:26:18,503 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 33 states.