/usr/bin/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-fb55353 [2019-11-07 04:40:27,427 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 04:40:27,430 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 04:40:27,449 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 04:40:27,449 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 04:40:27,451 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 04:40:27,453 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 04:40:27,463 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 04:40:27,464 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 04:40:27,466 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 04:40:27,468 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 04:40:27,469 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 04:40:27,469 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 04:40:27,470 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 04:40:27,471 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 04:40:27,472 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 04:40:27,473 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 04:40:27,475 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 04:40:27,476 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 04:40:27,478 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 04:40:27,479 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 04:40:27,481 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 04:40:27,482 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 04:40:27,482 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 04:40:27,484 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 04:40:27,485 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 04:40:27,485 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 04:40:27,486 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 04:40:27,486 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 04:40:27,488 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 04:40:27,489 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 04:40:27,489 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 04:40:27,492 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 04:40:27,493 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 04:40:27,494 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 04:40:27,494 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 04:40:27,500 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 04:40:27,500 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 04:40:27,500 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 04:40:27,502 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 04:40:27,502 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 04:40:27,506 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-11-07 04:40:27,529 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 04:40:27,530 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 04:40:27,534 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 04:40:27,534 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 04:40:27,535 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 04:40:27,535 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 04:40:27,535 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 04:40:27,535 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 04:40:27,536 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 04:40:27,537 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 04:40:27,537 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 04:40:27,537 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 04:40:27,537 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 04:40:27,538 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 04:40:27,538 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 04:40:27,538 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 04:40:27,538 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 04:40:27,539 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 04:40:27,540 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 04:40:27,540 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 04:40:27,540 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 04:40:27,541 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 04:40:27,541 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 04:40:27,541 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 04:40:27,541 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 04:40:27,541 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 04:40:27,542 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 04:40:27,543 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 04:40:27,543 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-11-07 04:40:27,842 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 04:40:27,855 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 04:40:27,859 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 04:40:27,861 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 04:40:27,862 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 04:40:27,862 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/sum20-2.i [2019-11-07 04:40:27,945 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0121d69a5/d80d74a9754e477ea5bb4cbc19eef26b/FLAG4822443b7 [2019-11-07 04:40:28,430 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 04:40:28,431 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/sum20-2.i [2019-11-07 04:40:28,437 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0121d69a5/d80d74a9754e477ea5bb4cbc19eef26b/FLAG4822443b7 [2019-11-07 04:40:28,874 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0121d69a5/d80d74a9754e477ea5bb4cbc19eef26b [2019-11-07 04:40:28,885 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 04:40:28,887 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 04:40:28,896 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 04:40:28,897 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 04:40:28,901 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 04:40:28,903 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:40:28" (1/1) ... [2019-11-07 04:40:28,906 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a38a9be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:40:28, skipping insertion in model container [2019-11-07 04:40:28,907 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:40:28" (1/1) ... [2019-11-07 04:40:28,920 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 04:40:28,953 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 04:40:29,178 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:40:29,188 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 04:40:29,209 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:40:29,310 INFO L192 MainTranslator]: Completed translation [2019-11-07 04:40:29,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:40:29 WrapperNode [2019-11-07 04:40:29,311 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 04:40:29,312 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 04:40:29,312 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 04:40:29,312 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 04:40:29,324 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:40:29" (1/1) ... [2019-11-07 04:40:29,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:40:29" (1/1) ... [2019-11-07 04:40:29,331 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:40:29" (1/1) ... [2019-11-07 04:40:29,332 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:40:29" (1/1) ... [2019-11-07 04:40:29,340 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:40:29" (1/1) ... [2019-11-07 04:40:29,346 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:40:29" (1/1) ... [2019-11-07 04:40:29,347 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:40:29" (1/1) ... [2019-11-07 04:40:29,349 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 04:40:29,350 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 04:40:29,350 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 04:40:29,350 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 04:40:29,351 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:40:29" (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-11-07 04:40:29,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 04:40:29,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 04:40:29,420 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2019-11-07 04:40:29,421 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 04:40:29,421 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 04:40:29,421 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 04:40:29,421 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2019-11-07 04:40:29,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-07 04:40:29,422 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 04:40:29,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-07 04:40:29,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-07 04:40:29,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-07 04:40:29,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 04:40:29,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 04:40:29,770 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 04:40:29,771 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-07 04:40:29,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:40:29 BoogieIcfgContainer [2019-11-07 04:40:29,772 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 04:40:29,773 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 04:40:29,774 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 04:40:29,777 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 04:40:29,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:40:28" (1/3) ... [2019-11-07 04:40:29,778 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6766bbf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:40:29, skipping insertion in model container [2019-11-07 04:40:29,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:40:29" (2/3) ... [2019-11-07 04:40:29,778 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6766bbf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:40:29, skipping insertion in model container [2019-11-07 04:40:29,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:40:29" (3/3) ... [2019-11-07 04:40:29,780 INFO L109 eAbstractionObserver]: Analyzing ICFG sum20-2.i [2019-11-07 04:40:29,795 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 04:40:29,805 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 04:40:29,817 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 04:40:29,841 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 04:40:29,841 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 04:40:29,841 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 04:40:29,841 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 04:40:29,842 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 04:40:29,842 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 04:40:29,842 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 04:40:29,842 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 04:40:29,858 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-11-07 04:40:29,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-07 04:40:29,864 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:40:29,864 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:40:29,866 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:40:29,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:40:29,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1818423299, now seen corresponding path program 1 times [2019-11-07 04:40:29,879 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:40:29,879 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81885754] [2019-11-07 04:40:29,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:40:29,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:40:30,071 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-07 04:40:30,072 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81885754] [2019-11-07 04:40:30,073 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:40:30,074 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:40:30,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057185269] [2019-11-07 04:40:30,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:40:30,081 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:40:30,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:40:30,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:40:30,099 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2019-11-07 04:40:30,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:40:30,133 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2019-11-07 04:40:30,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:40:30,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-07 04:40:30,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:40:30,144 INFO L225 Difference]: With dead ends: 41 [2019-11-07 04:40:30,144 INFO L226 Difference]: Without dead ends: 20 [2019-11-07 04:40:30,148 INFO L630 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-11-07 04:40:30,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-11-07 04:40:30,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-07 04:40:30,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-07 04:40:30,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-11-07 04:40:30,202 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 24 [2019-11-07 04:40:30,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:40:30,203 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-11-07 04:40:30,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:40:30,203 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-11-07 04:40:30,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-07 04:40:30,206 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:40:30,206 INFO L410 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-11-07 04:40:30,206 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:40:30,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:40:30,207 INFO L82 PathProgramCache]: Analyzing trace with hash -2093950433, now seen corresponding path program 1 times [2019-11-07 04:40:30,207 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:40:30,208 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011353665] [2019-11-07 04:40:30,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:40:30,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:40:30,321 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-07 04:40:30,321 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011353665] [2019-11-07 04:40:30,322 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810448466] [2019-11-07 04:40:30,322 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-11-07 04:40:30,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:40:30,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-07 04:40:30,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 04:40:30,450 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-07 04:40:30,450 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 04:40:30,507 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-07 04:40:30,507 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-07 04:40:30,507 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2019-11-07 04:40:30,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918252281] [2019-11-07 04:40:30,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:40:30,510 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:40:30,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:40:30,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:40:30,511 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 3 states. [2019-11-07 04:40:30,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:40:30,523 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2019-11-07 04:40:30,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:40:30,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-07 04:40:30,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:40:30,525 INFO L225 Difference]: With dead ends: 33 [2019-11-07 04:40:30,525 INFO L226 Difference]: Without dead ends: 21 [2019-11-07 04:40:30,526 INFO L630 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-11-07 04:40:30,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-07 04:40:30,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-07 04:40:30,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-07 04:40:30,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-11-07 04:40:30,532 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 25 [2019-11-07 04:40:30,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:40:30,533 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-11-07 04:40:30,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:40:30,533 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-11-07 04:40:30,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-07 04:40:30,534 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:40:30,534 INFO L410 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-11-07 04:40:30,738 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:40:30,739 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:40:30,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:40:30,740 INFO L82 PathProgramCache]: Analyzing trace with hash 903502258, now seen corresponding path program 1 times [2019-11-07 04:40:30,740 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:40:30,741 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685145662] [2019-11-07 04:40:30,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:40:30,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:40:30,861 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-07 04:40:30,861 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685145662] [2019-11-07 04:40:30,862 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:40:30,862 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:40:30,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263784257] [2019-11-07 04:40:30,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:40:30,863 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:40:30,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:40:30,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:40:30,864 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 3 states. [2019-11-07 04:40:30,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:40:30,885 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2019-11-07 04:40:30,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:40:30,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-07 04:40:30,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:40:30,886 INFO L225 Difference]: With dead ends: 31 [2019-11-07 04:40:30,887 INFO L226 Difference]: Without dead ends: 22 [2019-11-07 04:40:30,887 INFO L630 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-11-07 04:40:30,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-11-07 04:40:30,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-11-07 04:40:30,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-07 04:40:30,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-11-07 04:40:30,896 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 28 [2019-11-07 04:40:30,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:40:30,899 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-11-07 04:40:30,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:40:30,899 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-11-07 04:40:30,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-07 04:40:30,902 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:40:30,902 INFO L410 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-11-07 04:40:30,902 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:40:30,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:40:30,903 INFO L82 PathProgramCache]: Analyzing trace with hash 2130547361, now seen corresponding path program 1 times [2019-11-07 04:40:30,903 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:40:30,903 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670561991] [2019-11-07 04:40:30,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:40:30,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:40:31,019 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-07 04:40:31,019 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670561991] [2019-11-07 04:40:31,019 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917989341] [2019-11-07 04:40:31,020 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-11-07 04:40:31,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:40:31,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-07 04:40:31,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 04:40:31,117 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-07 04:40:31,117 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 04:40:31,161 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-07 04:40:31,161 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1257684088] [2019-11-07 04:40:31,195 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-11-07 04:40:31,195 INFO L166 IcfgInterpreter]: Building call graph [2019-11-07 04:40:31,205 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-07 04:40:31,218 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-07 04:40:31,219 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-07 04:40:31,359 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-11-07 04:40:31,898 INFO L197 IcfgInterpreter]: Interpreting procedure sum with input of size 1 for LOIs [2019-11-07 04:40:31,923 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-11-07 04:40:31,924 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-07 04:40:32,687 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-07 04:40:32,688 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 15] total 21 [2019-11-07 04:40:32,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868661278] [2019-11-07 04:40:32,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-07 04:40:32,690 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:40:32,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-07 04:40:32,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2019-11-07 04:40:32,692 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 21 states. [2019-11-07 04:40:33,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:40:33,643 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2019-11-07 04:40:33,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-07 04:40:33,644 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 29 [2019-11-07 04:40:33,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:40:33,645 INFO L225 Difference]: With dead ends: 40 [2019-11-07 04:40:33,645 INFO L226 Difference]: Without dead ends: 25 [2019-11-07 04:40:33,647 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=170, Invalid=1090, Unknown=0, NotChecked=0, Total=1260 [2019-11-07 04:40:33,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-07 04:40:33,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-11-07 04:40:33,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-07 04:40:33,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-11-07 04:40:33,654 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 29 [2019-11-07 04:40:33,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:40:33,655 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-11-07 04:40:33,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-07 04:40:33,655 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-11-07 04:40:33,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-07 04:40:33,656 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:40:33,657 INFO L410 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-11-07 04:40:33,860 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:40:33,860 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:40:33,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:40:33,861 INFO L82 PathProgramCache]: Analyzing trace with hash 356639231, now seen corresponding path program 2 times [2019-11-07 04:40:33,862 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:40:33,862 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731297561] [2019-11-07 04:40:33,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:40:33,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:40:34,029 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-07 04:40:34,029 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731297561] [2019-11-07 04:40:34,029 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526726389] [2019-11-07 04:40:34,030 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-11-07 04:40:34,090 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-07 04:40:34,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-07 04:40:34,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-07 04:40:34,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 04:40:34,113 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-07 04:40:34,113 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 04:40:34,150 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-07 04:40:34,151 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [577879628] [2019-11-07 04:40:34,152 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-11-07 04:40:34,153 INFO L166 IcfgInterpreter]: Building call graph [2019-11-07 04:40:34,153 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-07 04:40:34,153 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-07 04:40:34,153 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-07 04:40:34,183 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-11-07 04:40:34,560 INFO L197 IcfgInterpreter]: Interpreting procedure sum with input of size 1 for LOIs [2019-11-07 04:40:34,582 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-11-07 04:40:34,584 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-07 04:40:35,259 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-07 04:40:35,259 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4, 15] total 25 [2019-11-07 04:40:35,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77482944] [2019-11-07 04:40:35,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-07 04:40:35,261 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:40:35,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-07 04:40:35,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2019-11-07 04:40:35,263 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 25 states. [2019-11-07 04:40:38,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:40:38,539 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2019-11-07 04:40:38,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-07 04:40:38,539 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 32 [2019-11-07 04:40:38,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:40:38,540 INFO L225 Difference]: With dead ends: 44 [2019-11-07 04:40:38,540 INFO L226 Difference]: Without dead ends: 29 [2019-11-07 04:40:38,542 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=247, Invalid=1733, Unknown=0, NotChecked=0, Total=1980 [2019-11-07 04:40:38,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-07 04:40:38,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-07 04:40:38,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-07 04:40:38,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-11-07 04:40:38,550 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 32 [2019-11-07 04:40:38,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:40:38,550 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-11-07 04:40:38,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-07 04:40:38,551 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-11-07 04:40:38,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-07 04:40:38,552 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:40:38,552 INFO L410 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-11-07 04:40:38,761 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:40:38,762 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:40:38,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:40:38,763 INFO L82 PathProgramCache]: Analyzing trace with hash 906031436, now seen corresponding path program 3 times [2019-11-07 04:40:38,763 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:40:38,763 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876912956] [2019-11-07 04:40:38,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:40:38,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:40:38,950 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-11-07 04:40:38,950 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876912956] [2019-11-07 04:40:38,951 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292966166] [2019-11-07 04:40:38,951 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-11-07 04:40:39,037 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-07 04:40:39,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-07 04:40:39,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-07 04:40:39,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 04:40:39,060 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-11-07 04:40:39,061 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 04:40:39,170 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-11-07 04:40:39,170 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1515084367] [2019-11-07 04:40:39,172 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-11-07 04:40:39,173 INFO L166 IcfgInterpreter]: Building call graph [2019-11-07 04:40:39,173 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-07 04:40:39,173 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-07 04:40:39,174 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-07 04:40:39,193 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-11-07 04:40:39,460 INFO L197 IcfgInterpreter]: Interpreting procedure sum with input of size 1 for LOIs [2019-11-07 04:40:39,487 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-11-07 04:40:39,490 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-07 04:40:40,175 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-07 04:40:40,176 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 15] total 29 [2019-11-07 04:40:40,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574442560] [2019-11-07 04:40:40,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-07 04:40:40,177 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:40:40,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-07 04:40:40,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=667, Unknown=0, NotChecked=0, Total=812 [2019-11-07 04:40:40,178 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 29 states. [2019-11-07 04:40:43,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:40:43,533 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2019-11-07 04:40:43,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-07 04:40:43,534 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 42 [2019-11-07 04:40:43,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:40:43,535 INFO L225 Difference]: With dead ends: 54 [2019-11-07 04:40:43,536 INFO L226 Difference]: Without dead ends: 36 [2019-11-07 04:40:43,538 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 761 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=406, Invalid=2245, Unknown=1, NotChecked=0, Total=2652 [2019-11-07 04:40:43,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-07 04:40:43,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-07 04:40:43,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-07 04:40:43,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-11-07 04:40:43,546 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 42 [2019-11-07 04:40:43,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:40:43,546 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-11-07 04:40:43,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-07 04:40:43,547 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-11-07 04:40:43,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-07 04:40:43,548 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:40:43,548 INFO L410 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-11-07 04:40:43,752 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:40:43,753 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:40:43,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:40:43,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1194663378, now seen corresponding path program 4 times [2019-11-07 04:40:43,753 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:40:43,753 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610002000] [2019-11-07 04:40:43,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:40:43,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:40:43,918 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-11-07 04:40:43,918 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610002000] [2019-11-07 04:40:43,918 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669767610] [2019-11-07 04:40:43,919 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-11-07 04:40:43,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:40:43,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-07 04:40:43,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 04:40:44,012 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-11-07 04:40:44,012 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 04:40:44,225 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-11-07 04:40:44,226 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [420835676] [2019-11-07 04:40:44,228 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-11-07 04:40:44,228 INFO L166 IcfgInterpreter]: Building call graph [2019-11-07 04:40:44,229 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-07 04:40:44,229 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-07 04:40:44,229 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-07 04:40:44,256 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-11-07 04:40:44,504 INFO L197 IcfgInterpreter]: Interpreting procedure sum with input of size 1 for LOIs [2019-11-07 04:40:44,530 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-11-07 04:40:44,532 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-07 04:40:45,704 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-07 04:40:45,704 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 15] total 37 [2019-11-07 04:40:45,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334998590] [2019-11-07 04:40:45,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-11-07 04:40:45,707 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:40:45,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-11-07 04:40:45,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=1039, Unknown=0, NotChecked=0, Total=1332 [2019-11-07 04:40:45,709 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 37 states. [2019-11-07 04:40:49,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:40:49,282 INFO L93 Difference]: Finished difference Result 62 states and 77 transitions. [2019-11-07 04:40:49,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-11-07 04:40:49,282 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 49 [2019-11-07 04:40:49,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:40:49,284 INFO L225 Difference]: With dead ends: 62 [2019-11-07 04:40:49,284 INFO L226 Difference]: Without dead ends: 44 [2019-11-07 04:40:49,287 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 121 SyntacticMatches, 6 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1265 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=834, Invalid=3721, Unknown=1, NotChecked=0, Total=4556 [2019-11-07 04:40:49,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-07 04:40:49,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-11-07 04:40:49,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-07 04:40:49,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-11-07 04:40:49,297 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 49 [2019-11-07 04:40:49,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:40:49,297 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-11-07 04:40:49,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-11-07 04:40:49,297 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-11-07 04:40:49,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-07 04:40:49,299 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:40:49,299 INFO L410 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-11-07 04:40:49,510 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:40:49,511 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:40:49,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:40:49,511 INFO L82 PathProgramCache]: Analyzing trace with hash -716222162, now seen corresponding path program 5 times [2019-11-07 04:40:49,511 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:40:49,511 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862896477] [2019-11-07 04:40:49,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:40:49,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:40:49,610 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2019-11-07 04:40:49,611 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862896477] [2019-11-07 04:40:49,611 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397469893] [2019-11-07 04:40:49,611 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-11-07 04:40:49,705 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-07 04:40:49,705 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-07 04:40:49,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-07 04:40:49,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 04:40:49,810 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 52 proven. 10 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-11-07 04:40:49,811 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 04:40:49,903 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 52 proven. 10 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-11-07 04:40:49,903 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [419237650] [2019-11-07 04:40:49,907 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-11-07 04:40:49,907 INFO L166 IcfgInterpreter]: Building call graph [2019-11-07 04:40:49,908 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-07 04:40:49,908 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-07 04:40:49,908 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-07 04:40:49,932 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-11-07 04:40:50,217 INFO L197 IcfgInterpreter]: Interpreting procedure sum with input of size 1 for LOIs [2019-11-07 04:40:50,234 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-11-07 04:40:50,237 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-07 04:40:50,925 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-07 04:40:50,925 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7, 15] total 28 [2019-11-07 04:40:50,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280463415] [2019-11-07 04:40:50,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-07 04:40:50,928 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:40:50,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-07 04:40:50,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=645, Unknown=0, NotChecked=0, Total=756 [2019-11-07 04:40:50,930 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 28 states. [2019-11-07 04:40:52,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:40:52,313 INFO L93 Difference]: Finished difference Result 68 states and 84 transitions. [2019-11-07 04:40:52,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-07 04:40:52,316 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 57 [2019-11-07 04:40:52,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:40:52,317 INFO L225 Difference]: With dead ends: 68 [2019-11-07 04:40:52,317 INFO L226 Difference]: Without dead ends: 51 [2019-11-07 04:40:52,320 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=395, Invalid=2155, Unknown=0, NotChecked=0, Total=2550 [2019-11-07 04:40:52,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-07 04:40:52,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-11-07 04:40:52,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-07 04:40:52,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-11-07 04:40:52,330 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 57 [2019-11-07 04:40:52,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:40:52,330 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-11-07 04:40:52,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-07 04:40:52,330 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-11-07 04:40:52,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-07 04:40:52,332 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:40:52,332 INFO L410 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-11-07 04:40:52,535 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:40:52,536 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:40:52,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:40:52,537 INFO L82 PathProgramCache]: Analyzing trace with hash 696436029, now seen corresponding path program 6 times [2019-11-07 04:40:52,537 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:40:52,537 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849424141] [2019-11-07 04:40:52,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:40:52,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:40:52,756 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 0 proven. 299 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2019-11-07 04:40:52,756 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849424141] [2019-11-07 04:40:52,756 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499846176] [2019-11-07 04:40:52,756 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-11-07 04:40:52,890 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-07 04:40:52,890 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-07 04:40:52,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-07 04:40:52,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 04:40:52,929 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 244 proven. 55 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2019-11-07 04:40:52,929 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 04:40:53,148 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 0 proven. 299 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2019-11-07 04:40:53,149 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [712235825] [2019-11-07 04:40:53,151 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-11-07 04:40:53,151 INFO L166 IcfgInterpreter]: Building call graph [2019-11-07 04:40:53,152 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-07 04:40:53,152 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-07 04:40:53,152 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-07 04:40:53,171 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-11-07 04:40:53,418 INFO L197 IcfgInterpreter]: Interpreting procedure sum with input of size 1 for LOIs [2019-11-07 04:40:53,443 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-11-07 04:40:53,445 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-07 04:40:54,060 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-07 04:40:54,061 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 15] total 37 [2019-11-07 04:40:54,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672065497] [2019-11-07 04:40:54,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-11-07 04:40:54,063 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:40:54,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-11-07 04:40:54,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=1038, Unknown=0, NotChecked=0, Total=1332 [2019-11-07 04:40:54,064 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 37 states. [2019-11-07 04:40:56,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:40:56,224 INFO L93 Difference]: Finished difference Result 85 states and 104 transitions. [2019-11-07 04:40:56,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-11-07 04:40:56,224 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 76 [2019-11-07 04:40:56,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:40:56,225 INFO L225 Difference]: With dead ends: 85 [2019-11-07 04:40:56,225 INFO L226 Difference]: Without dead ends: 61 [2019-11-07 04:40:56,227 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 203 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1227 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=955, Invalid=3601, Unknown=0, NotChecked=0, Total=4556 [2019-11-07 04:40:56,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-07 04:40:56,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-11-07 04:40:56,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-07 04:40:56,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2019-11-07 04:40:56,237 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 76 [2019-11-07 04:40:56,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:40:56,238 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2019-11-07 04:40:56,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-11-07 04:40:56,238 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2019-11-07 04:40:56,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-07 04:40:56,240 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:40:56,240 INFO L410 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-11-07 04:40:56,444 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:40:56,444 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:40:56,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:40:56,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1048054237, now seen corresponding path program 7 times [2019-11-07 04:40:56,445 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:40:56,445 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253517926] [2019-11-07 04:40:56,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:40:56,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:40:56,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2172 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2019-11-07 04:40:56,674 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253517926] [2019-11-07 04:40:56,674 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743270445] [2019-11-07 04:40:56,674 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-11-07 04:40:56,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:40:56,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-07 04:40:56,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 04:40:56,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2172 backedges. 886 proven. 3 refuted. 0 times theorem prover too weak. 1283 trivial. 0 not checked. [2019-11-07 04:40:56,912 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 04:40:56,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2172 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2019-11-07 04:40:56,947 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1134753784] [2019-11-07 04:40:56,950 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-11-07 04:40:56,950 INFO L166 IcfgInterpreter]: Building call graph [2019-11-07 04:40:56,951 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-07 04:40:56,951 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-07 04:40:56,951 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-07 04:40:56,966 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-11-07 04:40:57,180 INFO L197 IcfgInterpreter]: Interpreting procedure sum with input of size 1 for LOIs [2019-11-07 04:40:57,194 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-11-07 04:40:57,195 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-07 04:40:57,751 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-07 04:40:57,751 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 15] total 23 [2019-11-07 04:40:57,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44503159] [2019-11-07 04:40:57,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-07 04:40:57,753 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:40:57,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-07 04:40:57,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2019-11-07 04:40:57,753 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 23 states. [2019-11-07 04:40:58,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:40:58,622 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2019-11-07 04:40:58,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-07 04:40:58,623 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 106 [2019-11-07 04:40:58,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:40:58,624 INFO L225 Difference]: With dead ends: 93 [2019-11-07 04:40:58,624 INFO L226 Difference]: Without dead ends: 65 [2019-11-07 04:40:58,627 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=223, Invalid=1337, Unknown=0, NotChecked=0, Total=1560 [2019-11-07 04:40:58,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-07 04:40:58,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-11-07 04:40:58,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-07 04:40:58,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-11-07 04:40:58,645 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 106 [2019-11-07 04:40:58,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:40:58,647 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-11-07 04:40:58,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-07 04:40:58,647 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-11-07 04:40:58,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-07 04:40:58,650 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:40:58,651 INFO L410 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-11-07 04:40:58,867 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:40:58,868 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:40:58,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:40:58,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1255666147, now seen corresponding path program 8 times [2019-11-07 04:40:58,868 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:40:58,869 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006327542] [2019-11-07 04:40:58,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:40:58,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:40:59,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2190 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2019-11-07 04:40:59,114 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006327542] [2019-11-07 04:40:59,114 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368133435] [2019-11-07 04:40:59,114 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-11-07 04:40:59,323 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-07 04:40:59,323 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-07 04:40:59,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-07 04:40:59,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 04:40:59,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2190 backedges. 886 proven. 21 refuted. 0 times theorem prover too weak. 1283 trivial. 0 not checked. [2019-11-07 04:40:59,345 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 04:40:59,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2190 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2019-11-07 04:40:59,444 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1529658749] [2019-11-07 04:40:59,447 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-11-07 04:40:59,447 INFO L166 IcfgInterpreter]: Building call graph [2019-11-07 04:40:59,447 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-07 04:40:59,447 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-07 04:40:59,448 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-07 04:40:59,460 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-11-07 04:40:59,655 INFO L197 IcfgInterpreter]: Interpreting procedure sum with input of size 1 for LOIs [2019-11-07 04:40:59,669 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-11-07 04:40:59,670 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-07 04:41:00,307 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-07 04:41:00,307 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 15] total 31 [2019-11-07 04:41:00,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604153547] [2019-11-07 04:41:00,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-07 04:41:00,310 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:41:00,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-07 04:41:00,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=754, Unknown=0, NotChecked=0, Total=930 [2019-11-07 04:41:00,313 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 31 states. [2019-11-07 04:41:01,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:41:01,724 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2019-11-07 04:41:01,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-07 04:41:01,724 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 110 [2019-11-07 04:41:01,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:41:01,726 INFO L225 Difference]: With dead ends: 101 [2019-11-07 04:41:01,726 INFO L226 Difference]: Without dead ends: 73 [2019-11-07 04:41:01,728 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 845 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=523, Invalid=2557, Unknown=0, NotChecked=0, Total=3080 [2019-11-07 04:41:01,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-07 04:41:01,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-11-07 04:41:01,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-07 04:41:01,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2019-11-07 04:41:01,739 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 110 [2019-11-07 04:41:01,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:41:01,739 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2019-11-07 04:41:01,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-07 04:41:01,739 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2019-11-07 04:41:01,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-07 04:41:01,741 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:41:01,741 INFO L410 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-11-07 04:41:01,945 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:41:01,946 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:41:01,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:41:01,947 INFO L82 PathProgramCache]: Analyzing trace with hash 2034480797, now seen corresponding path program 9 times [2019-11-07 04:41:01,947 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:41:01,947 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103722964] [2019-11-07 04:41:01,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:41:02,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:41:02,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2274 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2019-11-07 04:41:02,307 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103722964] [2019-11-07 04:41:02,307 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610462110] [2019-11-07 04:41:02,307 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-11-07 04:41:02,481 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-07 04:41:02,481 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-07 04:41:02,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-07 04:41:02,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 04:41:02,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2274 backedges. 886 proven. 105 refuted. 0 times theorem prover too weak. 1283 trivial. 0 not checked. [2019-11-07 04:41:02,528 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 04:41:02,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2274 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2019-11-07 04:41:02,738 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1029575608] [2019-11-07 04:41:02,743 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-11-07 04:41:02,743 INFO L166 IcfgInterpreter]: Building call graph [2019-11-07 04:41:02,744 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-07 04:41:02,745 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-07 04:41:02,745 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-07 04:41:02,761 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-11-07 04:41:02,980 INFO L197 IcfgInterpreter]: Interpreting procedure sum with input of size 1 for LOIs [2019-11-07 04:41:02,999 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-11-07 04:41:03,000 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-07 04:41:03,666 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-07 04:41:03,666 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17, 15] total 36 [2019-11-07 04:41:03,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474485294] [2019-11-07 04:41:03,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-11-07 04:41:03,667 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:41:03,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-11-07 04:41:03,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=989, Unknown=0, NotChecked=0, Total=1260 [2019-11-07 04:41:03,669 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 36 states. [2019-11-07 04:41:05,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:41:05,324 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2019-11-07 04:41:05,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-07 04:41:05,325 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 118 [2019-11-07 04:41:05,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:41:05,327 INFO L225 Difference]: With dead ends: 106 [2019-11-07 04:41:05,327 INFO L226 Difference]: Without dead ends: 78 [2019-11-07 04:41:05,329 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 325 SyntacticMatches, 11 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1119 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=808, Invalid=3482, Unknown=0, NotChecked=0, Total=4290 [2019-11-07 04:41:05,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-07 04:41:05,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-11-07 04:41:05,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-07 04:41:05,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2019-11-07 04:41:05,340 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 118 [2019-11-07 04:41:05,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:41:05,341 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2019-11-07 04:41:05,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-11-07 04:41:05,341 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2019-11-07 04:41:05,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-07 04:41:05,342 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:41:05,342 INFO L410 BasicCegarLoop]: trace histogram [60, 20, 19, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:41:05,547 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:41:05,547 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:41:05,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:41:05,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1761197326, now seen corresponding path program 10 times [2019-11-07 04:41:05,548 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:41:05,548 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011535503] [2019-11-07 04:41:05,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY