java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/loop-invgen/nested6.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 13:41:24,943 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 13:41:24,946 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 13:41:24,958 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 13:41:24,958 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 13:41:24,959 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 13:41:24,961 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 13:41:24,963 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 13:41:24,965 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 13:41:24,966 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 13:41:24,967 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 13:41:24,968 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 13:41:24,971 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 13:41:24,972 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 13:41:24,975 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 13:41:24,977 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 13:41:24,978 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 13:41:24,981 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 13:41:24,984 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 13:41:24,988 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 13:41:24,991 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 13:41:24,992 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 13:41:24,993 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 13:41:24,995 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 13:41:25,000 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 13:41:25,000 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 13:41:25,000 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 13:41:25,002 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 13:41:25,003 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 13:41:25,006 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 13:41:25,006 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 13:41:25,007 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 13:41:25,008 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 13:41:25,009 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 13:41:25,013 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 13:41:25,013 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 13:41:25,014 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 13:41:25,014 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 13:41:25,014 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 13:41:25,016 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 13:41:25,019 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 13:41:25,020 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 13:41:25,043 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 13:41:25,043 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 13:41:25,045 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 13:41:25,045 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 13:41:25,045 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 13:41:25,046 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 13:41:25,046 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 13:41:25,046 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 13:41:25,046 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 13:41:25,046 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 13:41:25,048 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 13:41:25,048 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 13:41:25,048 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 13:41:25,048 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 13:41:25,049 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 13:41:25,049 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 13:41:25,049 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 13:41:25,049 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 13:41:25,049 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 13:41:25,050 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 13:41:25,050 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 13:41:25,050 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:41:25,050 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 13:41:25,050 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 13:41:25,051 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 13:41:25,051 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 13:41:25,051 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 13:41:25,051 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 13:41:25,051 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 13:41:25,349 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 13:41:25,363 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 13:41:25,371 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 13:41:25,373 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 13:41:25,374 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 13:41:25,375 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/nested6.i [2019-10-07 13:41:25,445 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c79ba0bf/6c9bc98ad6c54dd98eb0bdc5c380e5bc/FLAG6951c44ab [2019-10-07 13:41:25,950 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 13:41:25,950 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested6.i [2019-10-07 13:41:25,958 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c79ba0bf/6c9bc98ad6c54dd98eb0bdc5c380e5bc/FLAG6951c44ab [2019-10-07 13:41:26,276 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c79ba0bf/6c9bc98ad6c54dd98eb0bdc5c380e5bc [2019-10-07 13:41:26,287 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 13:41:26,288 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 13:41:26,290 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 13:41:26,290 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 13:41:26,293 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 13:41:26,294 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:41:26" (1/1) ... [2019-10-07 13:41:26,297 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fe0b11d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:41:26, skipping insertion in model container [2019-10-07 13:41:26,297 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:41:26" (1/1) ... [2019-10-07 13:41:26,303 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 13:41:26,325 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 13:41:26,505 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:41:26,511 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 13:41:26,536 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:41:26,549 INFO L192 MainTranslator]: Completed translation [2019-10-07 13:41:26,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:41:26 WrapperNode [2019-10-07 13:41:26,549 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 13:41:26,550 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 13:41:26,550 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 13:41:26,550 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 13:41:26,560 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:41:26" (1/1) ... [2019-10-07 13:41:26,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:41:26" (1/1) ... [2019-10-07 13:41:26,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:41:26" (1/1) ... [2019-10-07 13:41:26,567 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:41:26" (1/1) ... [2019-10-07 13:41:26,571 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:41:26" (1/1) ... [2019-10-07 13:41:26,668 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:41:26" (1/1) ... [2019-10-07 13:41:26,669 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:41:26" (1/1) ... [2019-10-07 13:41:26,673 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 13:41:26,673 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 13:41:26,673 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 13:41:26,674 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 13:41:26,675 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:41:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:41:26,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 13:41:26,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 13:41:26,736 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-07 13:41:26,736 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 13:41:26,737 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 13:41:26,737 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-07 13:41:26,737 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 13:41:26,737 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 13:41:26,737 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 13:41:26,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 13:41:26,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 13:41:26,963 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 13:41:26,964 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-07 13:41:26,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:41:26 BoogieIcfgContainer [2019-10-07 13:41:26,966 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 13:41:26,967 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 13:41:26,967 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 13:41:26,971 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 13:41:26,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 01:41:26" (1/3) ... [2019-10-07 13:41:26,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@107a92ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:41:26, skipping insertion in model container [2019-10-07 13:41:26,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:41:26" (2/3) ... [2019-10-07 13:41:26,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@107a92ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:41:26, skipping insertion in model container [2019-10-07 13:41:26,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:41:26" (3/3) ... [2019-10-07 13:41:26,975 INFO L109 eAbstractionObserver]: Analyzing ICFG nested6.i [2019-10-07 13:41:26,987 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 13:41:26,996 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 13:41:27,008 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 13:41:27,051 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 13:41:27,052 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 13:41:27,052 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 13:41:27,052 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 13:41:27,053 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 13:41:27,053 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 13:41:27,053 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 13:41:27,053 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 13:41:27,079 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-10-07 13:41:27,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-07 13:41:27,087 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:41:27,089 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:41:27,091 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:41:27,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:41:27,099 INFO L82 PathProgramCache]: Analyzing trace with hash -2132448607, now seen corresponding path program 1 times [2019-10-07 13:41:27,109 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:41:27,109 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:41:27,109 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:41:27,110 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:41:27,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:41:27,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:41:27,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:41:27,321 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:41:27,322 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:41:27,322 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:41:27,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:41:27,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:41:27,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:41:27,345 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 5 states. [2019-10-07 13:41:27,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:41:27,462 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2019-10-07 13:41:27,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:41:27,464 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-10-07 13:41:27,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:41:27,474 INFO L225 Difference]: With dead ends: 54 [2019-10-07 13:41:27,475 INFO L226 Difference]: Without dead ends: 26 [2019-10-07 13:41:27,479 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:41:27,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-07 13:41:27,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-07 13:41:27,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-07 13:41:27,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-10-07 13:41:27,521 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 14 [2019-10-07 13:41:27,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:41:27,521 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-10-07 13:41:27,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:41:27,522 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-10-07 13:41:27,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-07 13:41:27,523 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:41:27,523 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:41:27,524 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:41:27,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:41:27,524 INFO L82 PathProgramCache]: Analyzing trace with hash 2119930173, now seen corresponding path program 1 times [2019-10-07 13:41:27,525 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:41:27,525 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:41:27,525 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:41:27,525 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:41:27,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:41:27,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:41:27,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:41:27,597 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:41:27,598 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:41:27,598 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 13:41:27,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 13:41:27,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 13:41:27,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:41:27,601 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 6 states. [2019-10-07 13:41:27,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:41:27,779 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2019-10-07 13:41:27,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 13:41:27,781 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-10-07 13:41:27,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:41:27,782 INFO L225 Difference]: With dead ends: 37 [2019-10-07 13:41:27,783 INFO L226 Difference]: Without dead ends: 35 [2019-10-07 13:41:27,784 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-07 13:41:27,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-07 13:41:27,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2019-10-07 13:41:27,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-07 13:41:27,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-10-07 13:41:27,801 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 15 [2019-10-07 13:41:27,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:41:27,801 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-10-07 13:41:27,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 13:41:27,802 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-10-07 13:41:27,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-07 13:41:27,803 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:41:27,804 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:41:27,804 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:41:27,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:41:27,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1348120608, now seen corresponding path program 1 times [2019-10-07 13:41:27,806 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:41:27,806 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:41:27,806 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:41:27,806 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:41:27,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:41:27,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:41:27,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:41:27,892 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:41:27,893 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:41:27,893 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:41:27,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:41:27,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:41:27,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:41:27,894 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 5 states. [2019-10-07 13:41:27,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:41:27,969 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2019-10-07 13:41:27,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:41:27,970 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-10-07 13:41:27,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:41:27,971 INFO L225 Difference]: With dead ends: 42 [2019-10-07 13:41:27,972 INFO L226 Difference]: Without dead ends: 40 [2019-10-07 13:41:27,972 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:41:27,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-07 13:41:27,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-10-07 13:41:27,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-07 13:41:27,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2019-10-07 13:41:27,984 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 19 [2019-10-07 13:41:27,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:41:27,984 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2019-10-07 13:41:27,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:41:27,985 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2019-10-07 13:41:27,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-07 13:41:27,986 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:41:27,986 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:41:27,987 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:41:27,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:41:27,987 INFO L82 PathProgramCache]: Analyzing trace with hash 177302015, now seen corresponding path program 1 times [2019-10-07 13:41:27,988 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:41:27,990 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:41:27,991 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:41:27,991 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:41:27,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:41:28,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:41:28,085 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:41:28,086 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:41:28,086 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:41:28,086 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-07 13:41:28,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 13:41:28,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 13:41:28,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:41:28,088 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 7 states. [2019-10-07 13:41:28,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:41:28,267 INFO L93 Difference]: Finished difference Result 63 states and 79 transitions. [2019-10-07 13:41:28,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-07 13:41:28,267 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-10-07 13:41:28,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:41:28,270 INFO L225 Difference]: With dead ends: 63 [2019-10-07 13:41:28,270 INFO L226 Difference]: Without dead ends: 61 [2019-10-07 13:41:28,271 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-07 13:41:28,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-07 13:41:28,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 43. [2019-10-07 13:41:28,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-07 13:41:28,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2019-10-07 13:41:28,284 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 23 [2019-10-07 13:41:28,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:41:28,284 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2019-10-07 13:41:28,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 13:41:28,285 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2019-10-07 13:41:28,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-07 13:41:28,286 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:41:28,286 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:41:28,286 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:41:28,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:41:28,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1604066593, now seen corresponding path program 1 times [2019-10-07 13:41:28,287 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:41:28,287 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:41:28,287 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:41:28,288 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:41:28,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:41:28,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:41:28,398 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:41:28,399 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:41:28,399 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:41:28,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:41:28,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:41:28,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-07 13:41:28,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:41:28,564 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-07 13:41:28,564 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:41:28,645 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 13:41:28,646 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 13:41:28,646 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [9] total 13 [2019-10-07 13:41:28,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 13:41:28,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 13:41:28,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-07 13:41:28,647 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand 7 states. [2019-10-07 13:41:31,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:41:31,292 INFO L93 Difference]: Finished difference Result 104 states and 138 transitions. [2019-10-07 13:41:31,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-07 13:41:31,293 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-10-07 13:41:31,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:41:31,295 INFO L225 Difference]: With dead ends: 104 [2019-10-07 13:41:31,295 INFO L226 Difference]: Without dead ends: 68 [2019-10-07 13:41:31,296 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2019-10-07 13:41:31,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-07 13:41:31,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 43. [2019-10-07 13:41:31,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-07 13:41:31,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2019-10-07 13:41:31,309 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 25 [2019-10-07 13:41:31,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:41:31,309 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2019-10-07 13:41:31,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 13:41:31,309 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2019-10-07 13:41:31,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-07 13:41:31,311 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:41:31,311 INFO L385 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:41:31,525 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:41:31,526 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:41:31,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:41:31,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1654338469, now seen corresponding path program 1 times [2019-10-07 13:41:31,527 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:41:31,527 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:41:31,528 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:41:31,528 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:41:31,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:41:31,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:41:31,613 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 13:41:31,613 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:41:31,614 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:41:31,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:41:31,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:41:31,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-07 13:41:31,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:41:31,698 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 13:41:31,699 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:41:31,731 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 13:41:31,732 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:41:31,756 INFO L162 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-10-07 13:41:31,757 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:41:31,763 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:41:31,771 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:41:31,772 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:41:31,830 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-07 13:41:32,707 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 9 for LOIs [2019-10-07 13:41:32,741 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-07 13:41:32,744 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:41:32,744 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:41:32,745 INFO L193 IcfgInterpreter]: Reachable states at location L4-2 satisfy 398#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (<= 0 |__VERIFIER_assert_#in~cond|) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (<= 0 |__VERIFIER_assert_#in~cond|) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-07 13:41:32,745 INFO L193 IcfgInterpreter]: Reachable states at location L23-1 satisfy 343#(and (<= 0 main_~j~0) (<= 0 main_~n~0) (< main_~k~0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= main_~k~0 1000000) (<= (* 2 main_~i~0) main_~k~0) (<= main_~n~0 1000000) (<= main_~i~0 0) (= main_~i~0 0)) [2019-10-07 13:41:32,745 INFO L193 IcfgInterpreter]: Reachable states at location L23 satisfy 330#(and (<= 0 main_~j~0) (<= 0 main_~n~0) (< main_~k~0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= main_~k~0 1000000) (<= main_~n~0 1000000) (<= main_~i~0 0) (= main_~i~0 0)) [2019-10-07 13:41:32,746 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 393#(and (<= __VERIFIER_assert_~cond 0) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:41:32,746 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 407#true [2019-10-07 13:41:32,746 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 403#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (<= 0 |__VERIFIER_assert_#in~cond|) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (<= 0 |__VERIFIER_assert_#in~cond|) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-07 13:41:32,747 INFO L193 IcfgInterpreter]: Reachable states at location L14 satisfy 38#(and (<= main_~k~0 2147483647) (<= main_~n~0 2147483647) (<= 0 (+ main_~k~0 2147483648)) (<= 0 (+ main_~n~0 2147483648))) [2019-10-07 13:41:32,747 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 383#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (or (and (<= __VERIFIER_assert_~cond 0) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1)))) [2019-10-07 13:41:32,747 INFO L193 IcfgInterpreter]: Reachable states at location L15 satisfy 43#(and (<= main_~k~0 2147483647) (<= main_~n~0 2147483647) (<= 0 (+ main_~k~0 2147483648)) (< main_~n~0 1000000) (<= 0 (+ main_~n~0 2147483648)) (<= main_~n~0 1000000)) [2019-10-07 13:41:32,748 INFO L193 IcfgInterpreter]: Reachable states at location L27-1 satisfy 360#(and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= main_~n~0 1000000) (<= main_~i~0 0) (<= main_~n~0 main_~k~0) (= main_~i~0 0)) [2019-10-07 13:41:32,748 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 48#(and (= main_~n~0 main_~k~0) (<= main_~k~0 2147483647) (<= main_~n~0 2147483647) (<= 0 (+ main_~k~0 2147483648)) (<= 0 main_~i~0) (< main_~n~0 1000000) (<= main_~k~0 1000000) (<= 0 (+ main_~n~0 2147483648)) (<= main_~n~0 1000000) (<= main_~i~0 0) (= main_~i~0 0)) [2019-10-07 13:41:32,748 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-07 13:41:32,748 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-07 13:41:32,749 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 348#(and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= main_~n~0 1000000) (<= main_~i~0 0) (= main_~i~0 0)) [2019-10-07 13:41:32,749 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 412#true [2019-10-07 13:41:32,749 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:41:32,749 INFO L193 IcfgInterpreter]: Reachable states at location L28 satisfy 320#(and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= main_~n~0 1000000) (not (< main_~k~0 main_~n~0)) (<= main_~i~0 0) (= main_~i~0 0)) [2019-10-07 13:41:32,750 INFO L193 IcfgInterpreter]: Reachable states at location L20-2 satisfy 325#(and (or (and (= main_~n~0 main_~k~0) (<= main_~k~0 2147483647) (<= 0 main_~j~0) (<= main_~n~0 2147483647) (<= 0 (+ main_~n~0 2147483648)) (<= 0 (+ main_~k~0 2147483648)) (< main_~n~0 1000000) (< main_~i~0 main_~n~0) (<= main_~k~0 1000000) (= main_~j~0 (* 2 main_~i~0)) (<= main_~j~0 0) (= main_~i~0 0)) (and (<= 1 main_~j~0) (not (< main_~k~0 main_~n~0)) (= main_~i~0 0))) (and (<= 0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= main_~n~0 1000000) (<= main_~i~0 0))) [2019-10-07 13:41:32,750 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 388#(and (<= __VERIFIER_assert_~cond 0) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:41:32,750 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 378#(and (or (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)))) [2019-10-07 13:41:32,750 INFO L193 IcfgInterpreter]: Reachable states at location L22-2 satisfy 315#(and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= main_~n~0 1000000) (<= main_~i~0 0) (= main_~i~0 0)) [2019-10-07 13:41:32,751 INFO L193 IcfgInterpreter]: Reachable states at location L21 satisfy 252#(and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= 0 (+ |main_#t~nondet5| 2147483648)) (<= |main_#t~nondet5| 2147483647) (<= main_~n~0 1000000) (<= main_~i~0 0) (= main_~i~0 0)) [2019-10-07 13:41:33,392 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:41:33,393 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6, 13] total 21 [2019-10-07 13:41:33,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-07 13:41:33,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-07 13:41:33,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2019-10-07 13:41:33,397 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 21 states. [2019-10-07 13:41:34,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:41:34,611 INFO L93 Difference]: Finished difference Result 111 states and 142 transitions. [2019-10-07 13:41:34,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-07 13:41:34,611 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2019-10-07 13:41:34,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:41:34,613 INFO L225 Difference]: With dead ends: 111 [2019-10-07 13:41:34,613 INFO L226 Difference]: Without dead ends: 87 [2019-10-07 13:41:34,614 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 75 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=239, Invalid=1483, Unknown=0, NotChecked=0, Total=1722 [2019-10-07 13:41:34,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-10-07 13:41:34,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 48. [2019-10-07 13:41:34,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-07 13:41:34,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2019-10-07 13:41:34,628 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 30 [2019-10-07 13:41:34,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:41:34,628 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2019-10-07 13:41:34,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-07 13:41:34,629 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2019-10-07 13:41:34,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-07 13:41:34,630 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:41:34,630 INFO L385 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:41:34,842 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:41:34,843 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:41:34,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:41:34,843 INFO L82 PathProgramCache]: Analyzing trace with hash 488758021, now seen corresponding path program 1 times [2019-10-07 13:41:34,843 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:41:34,843 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:41:34,844 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:41:34,844 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:41:34,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:41:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:41:34,963 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 13:41:34,964 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:41:34,964 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:41:34,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:41:35,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:41:35,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-07 13:41:35,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:41:35,138 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 13:41:35,141 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:41:35,205 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 13:41:35,205 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:41:35,208 INFO L162 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-10-07 13:41:35,208 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:41:35,209 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:41:35,209 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:41:35,209 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:41:35,220 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-07 13:41:35,884 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 9 for LOIs [2019-10-07 13:41:35,906 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-07 13:41:35,908 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:41:35,908 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:41:35,909 INFO L193 IcfgInterpreter]: Reachable states at location L4-2 satisfy 463#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (<= 0 |__VERIFIER_assert_#in~cond|) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (<= 0 |__VERIFIER_assert_#in~cond|) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-07 13:41:35,909 INFO L193 IcfgInterpreter]: Reachable states at location L23-1 satisfy 408#(and (<= 0 main_~j~0) (<= 0 main_~n~0) (< main_~k~0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= main_~k~0 1000000) (<= main_~n~0 1000000) (<= (* 2 main_~i~0) main_~k~0)) [2019-10-07 13:41:35,910 INFO L193 IcfgInterpreter]: Reachable states at location L23 satisfy 395#(and (<= 0 main_~j~0) (<= 0 main_~n~0) (< main_~k~0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= main_~k~0 1000000) (<= main_~n~0 1000000)) [2019-10-07 13:41:35,911 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 458#(and (<= __VERIFIER_assert_~cond 0) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:41:35,911 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 472#true [2019-10-07 13:41:35,911 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 468#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (<= 0 |__VERIFIER_assert_#in~cond|) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (<= 0 |__VERIFIER_assert_#in~cond|) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-07 13:41:35,912 INFO L193 IcfgInterpreter]: Reachable states at location L14 satisfy 38#(and (<= main_~k~0 2147483647) (<= main_~n~0 2147483647) (<= 0 (+ main_~k~0 2147483648)) (<= 0 (+ main_~n~0 2147483648))) [2019-10-07 13:41:35,912 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 448#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (or (and (<= __VERIFIER_assert_~cond 0) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1)))) [2019-10-07 13:41:35,912 INFO L193 IcfgInterpreter]: Reachable states at location L15 satisfy 43#(and (<= main_~k~0 2147483647) (<= main_~n~0 2147483647) (<= 0 (+ main_~k~0 2147483648)) (< main_~n~0 1000000) (<= 0 (+ main_~n~0 2147483648)) (<= main_~n~0 1000000)) [2019-10-07 13:41:35,912 INFO L193 IcfgInterpreter]: Reachable states at location L27-1 satisfy 425#(and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= main_~n~0 1000000) (<= main_~n~0 main_~k~0)) [2019-10-07 13:41:35,913 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 390#(and (<= 0 main_~i~0) (<= 0 (+ main_~k~0 2147483648)) (<= 0 (+ main_~n~0 2147483648)) (<= main_~n~0 1000000)) [2019-10-07 13:41:35,913 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-07 13:41:35,913 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-07 13:41:35,914 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 413#(and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= main_~n~0 1000000)) [2019-10-07 13:41:35,914 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 477#true [2019-10-07 13:41:35,915 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:41:35,915 INFO L193 IcfgInterpreter]: Reachable states at location L28 satisfy 361#(and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= main_~n~0 1000000) (not (< main_~k~0 main_~n~0))) [2019-10-07 13:41:35,915 INFO L193 IcfgInterpreter]: Reachable states at location L20-2 satisfy 376#(and (<= 0 main_~j~0) (or (and (<= 0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= 1 main_~j~0) (not (< main_~k~0 main_~n~0))) (and (<= 0 main_~n~0) (= main_~n~0 main_~k~0) (<= main_~k~0 2147483647) (<= main_~n~0 2147483647) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= 0 (+ main_~n~0 2147483648)) (<= main_~i~0 0) (<= 0 (+ main_~k~0 2147483648)) (< main_~n~0 1000000) (< main_~i~0 main_~n~0) (<= main_~k~0 1000000) (= main_~j~0 (* 2 main_~i~0)) (<= main_~j~0 0) (= main_~i~0 0))) (<= main_~n~0 1000000)) [2019-10-07 13:41:35,915 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 453#(and (<= __VERIFIER_assert_~cond 0) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:41:35,916 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 443#(and (or (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)))) [2019-10-07 13:41:35,916 INFO L193 IcfgInterpreter]: Reachable states at location L22-2 satisfy 356#(and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= main_~n~0 1000000)) [2019-10-07 13:41:35,916 INFO L193 IcfgInterpreter]: Reachable states at location L21 satisfy 293#(and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= 0 (+ |main_#t~nondet5| 2147483648)) (<= |main_#t~nondet5| 2147483647) (<= main_~n~0 1000000)) [2019-10-07 13:41:36,517 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:41:36,517 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8, 14] total 29 [2019-10-07 13:41:36,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-07 13:41:36,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-07 13:41:36,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=718, Unknown=0, NotChecked=0, Total=812 [2019-10-07 13:41:36,520 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand 29 states. [2019-10-07 13:41:38,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:41:38,783 INFO L93 Difference]: Finished difference Result 130 states and 171 transitions. [2019-10-07 13:41:38,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-07 13:41:38,783 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 32 [2019-10-07 13:41:38,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:41:38,785 INFO L225 Difference]: With dead ends: 130 [2019-10-07 13:41:38,785 INFO L226 Difference]: Without dead ends: 98 [2019-10-07 13:41:38,787 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 75 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=498, Invalid=2582, Unknown=0, NotChecked=0, Total=3080 [2019-10-07 13:41:38,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-10-07 13:41:38,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 53. [2019-10-07 13:41:38,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-07 13:41:38,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2019-10-07 13:41:38,801 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 32 [2019-10-07 13:41:38,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:41:38,802 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2019-10-07 13:41:38,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-07 13:41:38,802 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2019-10-07 13:41:38,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-07 13:41:38,803 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:41:38,803 INFO L385 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:41:39,007 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:41:39,008 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:41:39,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:41:39,009 INFO L82 PathProgramCache]: Analyzing trace with hash -961518785, now seen corresponding path program 2 times [2019-10-07 13:41:39,009 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:41:39,010 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:41:39,010 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:41:39,010 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:41:39,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:41:39,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:41:39,107 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-07 13:41:39,108 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:41:39,108 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:41:39,108 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:41:39,180 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-07 13:41:39,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:41:39,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-07 13:41:39,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:41:39,240 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-07 13:41:39,241 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:41:39,278 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-07 13:41:39,279 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:41:39,280 INFO L162 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-10-07 13:41:39,281 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:41:39,282 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:41:39,282 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:41:39,283 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:41:39,294 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-07 13:41:39,641 WARN L222 IntervalDomain]: Interval conversion did not stabilize in 6 iterations. Over-approximation may be very coarse. [2019-10-07 13:41:39,791 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 9 for LOIs [2019-10-07 13:41:39,815 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-07 13:41:39,817 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:41:39,817 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:41:39,818 INFO L193 IcfgInterpreter]: Reachable states at location L4-2 satisfy 397#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (<= 0 |__VERIFIER_assert_#in~cond|) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (<= 0 |__VERIFIER_assert_#in~cond|) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-07 13:41:39,822 INFO L193 IcfgInterpreter]: Reachable states at location L23-1 satisfy 342#(and (<= 0 main_~j~0) (<= 0 main_~n~0) (< main_~k~0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= main_~k~0 1000000) (<= main_~n~0 1000000) (<= (* 2 main_~i~0) main_~k~0) (<= main_~i~0 0) (= main_~i~0 0)) [2019-10-07 13:41:39,822 INFO L193 IcfgInterpreter]: Reachable states at location L23 satisfy 329#(and (<= 0 main_~j~0) (<= 0 main_~n~0) (< main_~k~0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= main_~k~0 1000000) (<= main_~n~0 1000000) (<= main_~i~0 0) (= main_~i~0 0)) [2019-10-07 13:41:39,823 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 392#(and (<= __VERIFIER_assert_~cond 0) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:41:39,823 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 406#true [2019-10-07 13:41:39,823 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 402#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (<= 0 |__VERIFIER_assert_#in~cond|) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (<= 0 |__VERIFIER_assert_#in~cond|) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-07 13:41:39,823 INFO L193 IcfgInterpreter]: Reachable states at location L14 satisfy 38#(and (<= main_~k~0 2147483647) (<= main_~n~0 2147483647) (<= 0 (+ main_~k~0 2147483648)) (<= 0 (+ main_~n~0 2147483648))) [2019-10-07 13:41:39,824 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 382#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (or (and (<= __VERIFIER_assert_~cond 0) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1)))) [2019-10-07 13:41:39,824 INFO L193 IcfgInterpreter]: Reachable states at location L15 satisfy 43#(and (<= main_~k~0 2147483647) (<= main_~n~0 2147483647) (<= 0 (+ main_~k~0 2147483648)) (< main_~n~0 1000000) (<= 0 (+ main_~n~0 2147483648)) (<= main_~n~0 1000000)) [2019-10-07 13:41:39,824 INFO L193 IcfgInterpreter]: Reachable states at location L27-1 satisfy 359#(and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= main_~n~0 1000000) (<= main_~i~0 0) (<= main_~n~0 main_~k~0) (= main_~i~0 0)) [2019-10-07 13:41:39,824 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 48#(and (= main_~n~0 main_~k~0) (<= main_~k~0 2147483647) (<= main_~n~0 2147483647) (<= 0 (+ main_~k~0 2147483648)) (<= 0 main_~i~0) (< main_~n~0 1000000) (<= main_~k~0 1000000) (<= 0 (+ main_~n~0 2147483648)) (<= main_~n~0 1000000) (<= main_~i~0 0) (= main_~i~0 0)) [2019-10-07 13:41:39,825 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-07 13:41:39,825 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-07 13:41:39,825 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 347#(and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= main_~n~0 1000000) (<= main_~i~0 0) (= main_~i~0 0)) [2019-10-07 13:41:39,825 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 411#true [2019-10-07 13:41:39,826 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:41:39,826 INFO L193 IcfgInterpreter]: Reachable states at location L28 satisfy 319#(and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= main_~n~0 1000000) (not (< main_~k~0 main_~n~0)) (<= main_~i~0 0) (= main_~i~0 0)) [2019-10-07 13:41:39,826 INFO L193 IcfgInterpreter]: Reachable states at location L20-2 satisfy 324#(and (or (and (= main_~n~0 main_~k~0) (<= main_~k~0 2147483647) (<= 0 main_~j~0) (<= main_~n~0 2147483647) (<= 0 (+ main_~n~0 2147483648)) (<= 0 (+ main_~k~0 2147483648)) (< main_~n~0 1000000) (< main_~i~0 main_~n~0) (<= main_~k~0 1000000) (= main_~j~0 (* 2 main_~i~0)) (<= main_~j~0 0) (= main_~i~0 0)) (and (<= 1 main_~j~0) (not (< main_~k~0 main_~n~0)) (= main_~i~0 0))) (and (<= 0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= main_~n~0 1000000) (<= main_~i~0 0))) [2019-10-07 13:41:39,827 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 387#(and (<= __VERIFIER_assert_~cond 0) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:41:39,827 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 377#(and (or (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)))) [2019-10-07 13:41:39,827 INFO L193 IcfgInterpreter]: Reachable states at location L22-2 satisfy 314#(and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= main_~n~0 1000000) (<= main_~i~0 0) (= main_~i~0 0)) [2019-10-07 13:41:39,827 INFO L193 IcfgInterpreter]: Reachable states at location L21 satisfy 251#(and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= 0 (+ |main_#t~nondet5| 2147483648)) (<= |main_#t~nondet5| 2147483647) (<= main_~n~0 1000000) (<= main_~i~0 0) (= main_~i~0 0)) [2019-10-07 13:41:40,357 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:41:40,357 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8, 13] total 25 [2019-10-07 13:41:40,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-07 13:41:40,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-07 13:41:40,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2019-10-07 13:41:40,359 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 25 states. [2019-10-07 13:41:42,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:41:42,406 INFO L93 Difference]: Finished difference Result 149 states and 204 transitions. [2019-10-07 13:41:42,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-07 13:41:42,407 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 37 [2019-10-07 13:41:42,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:41:42,411 INFO L225 Difference]: With dead ends: 149 [2019-10-07 13:41:42,411 INFO L226 Difference]: Without dead ends: 120 [2019-10-07 13:41:42,413 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 95 SyntacticMatches, 7 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=487, Invalid=2375, Unknown=0, NotChecked=0, Total=2862 [2019-10-07 13:41:42,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-10-07 13:41:42,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 93. [2019-10-07 13:41:42,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-07 13:41:42,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 128 transitions. [2019-10-07 13:41:42,437 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 128 transitions. Word has length 37 [2019-10-07 13:41:42,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:41:42,437 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 128 transitions. [2019-10-07 13:41:42,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-07 13:41:42,438 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 128 transitions. [2019-10-07 13:41:42,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-07 13:41:42,440 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:41:42,441 INFO L385 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:41:42,644 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:41:42,645 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:41:42,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:41:42,646 INFO L82 PathProgramCache]: Analyzing trace with hash 953205258, now seen corresponding path program 1 times [2019-10-07 13:41:42,646 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:41:42,646 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:41:42,647 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:41:42,647 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:41:42,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:41:42,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:41:42,788 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-07 13:41:42,789 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:41:42,789 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:41:42,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:41:42,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:41:42,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-07 13:41:42,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:41:42,940 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 33 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-07 13:41:42,941 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:41:43,004 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-07 13:41:43,005 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:41:43,006 INFO L162 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-10-07 13:41:43,007 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:41:43,007 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:41:43,007 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:41:43,007 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:41:43,016 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-07 13:41:43,772 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 9 for LOIs [2019-10-07 13:41:43,788 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-07 13:41:43,789 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:41:43,790 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:41:43,790 INFO L193 IcfgInterpreter]: Reachable states at location L4-2 satisfy 751#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (<= 0 |__VERIFIER_assert_#in~cond|) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (<= 0 |__VERIFIER_assert_#in~cond|) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-07 13:41:43,790 INFO L193 IcfgInterpreter]: Reachable states at location L23-1 satisfy 593#(and (<= 0 main_~j~0) (<= 0 main_~n~0) (< main_~k~0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= main_~k~0 1000000) (<= (* 2 main_~i~0) main_~k~0) (<= main_~n~0 1000000)) [2019-10-07 13:41:43,790 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 746#(and (<= __VERIFIER_assert_~cond 0) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:41:43,791 INFO L193 IcfgInterpreter]: Reachable states at location L23 satisfy 580#(and (<= 0 main_~j~0) (<= 0 main_~n~0) (< main_~k~0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= main_~k~0 1000000) (<= main_~n~0 1000000)) [2019-10-07 13:41:43,791 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 760#true [2019-10-07 13:41:43,792 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 756#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (<= 0 |__VERIFIER_assert_#in~cond|) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (<= 0 |__VERIFIER_assert_#in~cond|) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-07 13:41:43,792 INFO L193 IcfgInterpreter]: Reachable states at location L14 satisfy 38#(and (<= main_~k~0 2147483647) (<= main_~n~0 2147483647) (<= 0 (+ main_~k~0 2147483648)) (<= 0 (+ main_~n~0 2147483648))) [2019-10-07 13:41:43,792 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 736#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (or (and (<= __VERIFIER_assert_~cond 0) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1)))) [2019-10-07 13:41:43,793 INFO L193 IcfgInterpreter]: Reachable states at location L15 satisfy 43#(and (<= main_~k~0 2147483647) (<= main_~n~0 2147483647) (<= 0 (+ main_~k~0 2147483648)) (< main_~n~0 1000000) (<= 0 (+ main_~n~0 2147483648)) (<= main_~n~0 1000000)) [2019-10-07 13:41:43,793 INFO L193 IcfgInterpreter]: Reachable states at location L27-1 satisfy 610#(and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= main_~n~0 1000000) (<= main_~n~0 main_~k~0)) [2019-10-07 13:41:43,793 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 679#(and (or (and (= main_~n~0 main_~k~0) (<= main_~k~0 2147483647) (<= main_~n~0 2147483647) (<= 0 (+ main_~k~0 2147483648)) (<= 0 main_~i~0) (< main_~n~0 1000000) (<= main_~k~0 1000000) (<= 0 (+ main_~n~0 2147483648)) (<= main_~i~0 0) (= main_~i~0 0)) (and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 1 main_~i~0) (<= 0 main_~k~0) (not (< main_~j~0 main_~n~0)))) (<= main_~n~0 1000000)) [2019-10-07 13:41:43,793 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-07 13:41:43,793 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-07 13:41:43,794 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 598#(and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= main_~n~0 1000000)) [2019-10-07 13:41:43,794 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 765#true [2019-10-07 13:41:43,794 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:41:43,794 INFO L193 IcfgInterpreter]: Reachable states at location L28 satisfy 722#(and (or (and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0)) (and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (not (< main_~k~0 main_~n~0)))) (<= main_~n~0 1000000)) [2019-10-07 13:41:43,794 INFO L193 IcfgInterpreter]: Reachable states at location L20-2 satisfy 710#(or (and (<= 0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= main_~k~0 1000000) (<= 1 main_~j~0) (<= main_~n~0 1000000) (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0)) (and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= main_~n~0 1000000))) [2019-10-07 13:41:43,795 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 741#(and (<= __VERIFIER_assert_~cond 0) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:41:43,795 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 731#(and (or (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)))) [2019-10-07 13:41:43,795 INFO L193 IcfgInterpreter]: Reachable states at location L22-2 satisfy 551#(and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= main_~n~0 1000000)) [2019-10-07 13:41:43,795 INFO L193 IcfgInterpreter]: Reachable states at location L21 satisfy 488#(and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= 0 (+ |main_#t~nondet5| 2147483648)) (<= |main_#t~nondet5| 2147483647) (<= main_~n~0 1000000)) [2019-10-07 13:41:44,380 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:41:44,380 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6, 13] total 30 [2019-10-07 13:41:44,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-07 13:41:44,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-07 13:41:44,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870 [2019-10-07 13:41:44,383 INFO L87 Difference]: Start difference. First operand 93 states and 128 transitions. Second operand 30 states. [2019-10-07 13:41:47,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:41:47,105 INFO L93 Difference]: Finished difference Result 214 states and 304 transitions. [2019-10-07 13:41:47,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-07 13:41:47,105 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 47 [2019-10-07 13:41:47,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:41:47,108 INFO L225 Difference]: With dead ends: 214 [2019-10-07 13:41:47,109 INFO L226 Difference]: Without dead ends: 160 [2019-10-07 13:41:47,111 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 123 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 962 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=609, Invalid=3297, Unknown=0, NotChecked=0, Total=3906 [2019-10-07 13:41:47,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-10-07 13:41:47,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 107. [2019-10-07 13:41:47,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-10-07 13:41:47,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 148 transitions. [2019-10-07 13:41:47,133 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 148 transitions. Word has length 47 [2019-10-07 13:41:47,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:41:47,133 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 148 transitions. [2019-10-07 13:41:47,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-07 13:41:47,133 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 148 transitions. [2019-10-07 13:41:47,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-07 13:41:47,136 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:41:47,136 INFO L385 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:41:47,343 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:41:47,344 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:41:47,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:41:47,344 INFO L82 PathProgramCache]: Analyzing trace with hash 164211579, now seen corresponding path program 2 times [2019-10-07 13:41:47,344 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:41:47,344 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:41:47,344 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:41:47,344 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:41:47,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:41:47,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:41:47,492 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 13 proven. 34 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-07 13:41:47,492 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:41:47,492 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:41:47,492 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:41:47,602 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-07 13:41:47,602 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:41:47,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-07 13:41:47,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:41:47,715 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 45 proven. 3 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-07 13:41:47,715 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:41:47,787 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 34 proven. 2 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-10-07 13:41:47,787 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:41:47,788 INFO L162 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-10-07 13:41:47,789 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:41:47,789 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:41:47,789 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:41:47,789 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:41:47,802 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-07 13:41:48,808 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 9 for LOIs [2019-10-07 13:41:48,825 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-07 13:41:48,826 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:41:48,827 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:41:48,827 INFO L193 IcfgInterpreter]: Reachable states at location L4-2 satisfy 650#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (<= 0 |__VERIFIER_assert_#in~cond|) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (<= 0 |__VERIFIER_assert_#in~cond|) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-07 13:41:48,827 INFO L193 IcfgInterpreter]: Reachable states at location L23-1 satisfy 456#(and (<= 0 main_~j~0) (<= 0 main_~n~0) (< main_~k~0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= main_~k~0 1000000) (<= (* 2 main_~i~0) main_~k~0) (<= main_~n~0 1000000)) [2019-10-07 13:41:48,827 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 645#(and (<= __VERIFIER_assert_~cond 0) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:41:48,827 INFO L193 IcfgInterpreter]: Reachable states at location L23 satisfy 443#(and (<= 0 main_~j~0) (<= 0 main_~n~0) (< main_~k~0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= main_~k~0 1000000) (<= main_~n~0 1000000)) [2019-10-07 13:41:48,828 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 659#true [2019-10-07 13:41:48,828 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 655#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (<= 0 |__VERIFIER_assert_#in~cond|) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (<= 0 |__VERIFIER_assert_#in~cond|) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-07 13:41:48,828 INFO L193 IcfgInterpreter]: Reachable states at location L14 satisfy 38#(and (<= main_~k~0 2147483647) (<= main_~n~0 2147483647) (<= 0 (+ main_~k~0 2147483648)) (<= 0 (+ main_~n~0 2147483648))) [2019-10-07 13:41:48,828 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 635#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (or (and (<= __VERIFIER_assert_~cond 0) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1)))) [2019-10-07 13:41:48,828 INFO L193 IcfgInterpreter]: Reachable states at location L15 satisfy 43#(and (<= main_~k~0 2147483647) (<= main_~n~0 2147483647) (<= 0 (+ main_~k~0 2147483648)) (< main_~n~0 1000000) (<= 0 (+ main_~n~0 2147483648)) (<= main_~n~0 1000000)) [2019-10-07 13:41:48,828 INFO L193 IcfgInterpreter]: Reachable states at location L27-1 satisfy 473#(and (or (and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (< main_~j~0 main_~n~0) (<= 1 main_~j~0) (<= main_~j~0 1000000) (<= 1 main_~n~0) (<= main_~n~0 main_~k~0)) (and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= main_~i~0 0) (= main_~i~0 0) (<= main_~n~0 main_~k~0))) (<= main_~n~0 1000000)) [2019-10-07 13:41:48,828 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 562#(and (or (and (= main_~n~0 main_~k~0) (<= main_~k~0 2147483647) (<= main_~n~0 2147483647) (<= 0 (+ main_~k~0 2147483648)) (<= 0 main_~i~0) (< main_~n~0 1000000) (<= main_~k~0 1000000) (<= 0 (+ main_~n~0 2147483648)) (<= main_~i~0 0) (= main_~i~0 0)) (and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 1 main_~i~0) (<= 0 main_~k~0) (not (< main_~j~0 main_~n~0)))) (<= main_~n~0 1000000)) [2019-10-07 13:41:48,829 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-07 13:41:48,829 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-07 13:41:48,829 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 461#(or (and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= main_~n~0 1000000) (<= main_~i~0 0) (= main_~i~0 0)) (and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (< main_~j~0 main_~n~0) (<= 1 main_~j~0) (<= main_~j~0 1000000) (<= main_~n~0 1000000) (<= 1 main_~n~0))) [2019-10-07 13:41:48,829 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 664#true [2019-10-07 13:41:48,829 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:41:48,829 INFO L193 IcfgInterpreter]: Reachable states at location L28 satisfy 621#(and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= main_~n~0 1000000)) [2019-10-07 13:41:48,829 INFO L193 IcfgInterpreter]: Reachable states at location L20-2 satisfy 609#(or (and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= main_~n~0 1000000)) (and (<= 0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= main_~k~0 1000000) (<= 1 main_~j~0) (<= main_~n~0 1000000))) [2019-10-07 13:41:48,830 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 640#(and (<= __VERIFIER_assert_~cond 0) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:41:48,830 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 630#(and (or (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)))) [2019-10-07 13:41:48,830 INFO L193 IcfgInterpreter]: Reachable states at location L22-2 satisfy 414#(and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= main_~n~0 1000000)) [2019-10-07 13:41:48,830 INFO L193 IcfgInterpreter]: Reachable states at location L21 satisfy 361#(and (or (and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (< main_~j~0 main_~n~0) (<= 1 main_~j~0) (<= main_~j~0 1000000) (<= 1 main_~n~0)) (and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= main_~i~0 0) (= main_~i~0 0))) (<= 0 (+ |main_#t~nondet5| 2147483648)) (<= |main_#t~nondet5| 2147483647) (<= main_~n~0 1000000)) [2019-10-07 13:41:49,585 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:41:49,585 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 7, 14] total 35 [2019-10-07 13:41:49,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-07 13:41:49,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-07 13:41:49,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1085, Unknown=0, NotChecked=0, Total=1190 [2019-10-07 13:41:49,588 INFO L87 Difference]: Start difference. First operand 107 states and 148 transitions. Second operand 35 states. [2019-10-07 13:41:53,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:41:53,351 INFO L93 Difference]: Finished difference Result 256 states and 371 transitions. [2019-10-07 13:41:53,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-07 13:41:53,354 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 58 [2019-10-07 13:41:53,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:41:53,354 INFO L225 Difference]: With dead ends: 256 [2019-10-07 13:41:53,354 INFO L226 Difference]: Without dead ends: 0 [2019-10-07 13:41:53,358 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 153 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1253 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=762, Invalid=4494, Unknown=0, NotChecked=0, Total=5256 [2019-10-07 13:41:53,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-07 13:41:53,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-07 13:41:53,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-07 13:41:53,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-07 13:41:53,359 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2019-10-07 13:41:53,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:41:53,359 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-07 13:41:53,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-07 13:41:53,359 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-07 13:41:53,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-07 13:41:53,560 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:41:53,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-07 13:41:53,682 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 115 [2019-10-07 13:41:53,810 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 108 [2019-10-07 13:41:53,990 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 131 [2019-10-07 13:41:54,627 WARN L191 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 18 [2019-10-07 13:41:55,143 WARN L191 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 17 [2019-10-07 13:41:55,725 WARN L191 SmtUtils]: Spent 579.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 29 [2019-10-07 13:41:56,143 WARN L191 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 17 [2019-10-07 13:41:56,515 WARN L191 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 18 [2019-10-07 13:41:56,938 WARN L191 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 32 [2019-10-07 13:41:56,942 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-07 13:41:56,942 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:41:56,942 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:41:56,942 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-07 13:41:56,942 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-07 13:41:56,943 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-07 13:41:56,943 INFO L439 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (and (<= 0 main_~i~0) (< main_~n~0 1000000) (< main_~j~0 main_~n~0) (<= (* 2 main_~i~0) main_~j~0) (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0)) [2019-10-07 13:41:56,943 INFO L439 ceAbstractionStarter]: At program point L27-1(line 27) the Hoare annotation is: (and (<= 0 main_~i~0) (< main_~n~0 1000000) (< main_~j~0 main_~n~0) (<= (* 2 main_~i~0) main_~j~0) (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0)) [2019-10-07 13:41:56,943 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 34) no Hoare annotation was computed. [2019-10-07 13:41:56,943 INFO L439 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: (let ((.cse0 (* 2 main_~i~0))) (and (<= 0 main_~i~0) (< main_~k~0 main_~n~0) (< main_~j~0 main_~n~0) (< main_~n~0 1000000) (<= .cse0 main_~j~0) (<= .cse0 main_~k~0))) [2019-10-07 13:41:56,943 INFO L443 ceAbstractionStarter]: For program point L23-1(lines 22 24) no Hoare annotation was computed. [2019-10-07 13:41:56,943 INFO L439 ceAbstractionStarter]: At program point L19-3(lines 19 31) the Hoare annotation is: (let ((.cse3 (< main_~n~0 1000000)) (.cse4 (<= main_~k~0 main_~n~0)) (.cse0 (<= 0 main_~n~0)) (.cse1 (<= 1 main_~j~0)) (.cse2 (<= main_~n~0 main_~k~0))) (or (and (<= main_~k~0 2147483647) .cse0 .cse1 (<= (div (+ (- main_~n~0) 1) (- 2)) 0) (<= main_~k~0 main_~i~0) .cse2) (and .cse3 (<= 0 (+ main_~n~0 2147483648)) .cse4 .cse2 (= main_~i~0 0)) (and .cse3 .cse4 (and (and .cse0 (<= 0 main_~i~0) .cse1) (<= main_~n~0 main_~j~0)) .cse2))) [2019-10-07 13:41:56,944 INFO L443 ceAbstractionStarter]: For program point L15(lines 15 18) no Hoare annotation was computed. [2019-10-07 13:41:56,944 INFO L446 ceAbstractionStarter]: At program point L32(lines 10 34) the Hoare annotation is: true [2019-10-07 13:41:56,944 INFO L443 ceAbstractionStarter]: For program point L28(lines 20 30) no Hoare annotation was computed. [2019-10-07 13:41:56,944 INFO L439 ceAbstractionStarter]: At program point L20-2(lines 20 30) the Hoare annotation is: (let ((.cse0 (* 2 main_~i~0)) (.cse2 (<= 0 main_~n~0)) (.cse3 (<= 1 main_~j~0)) (.cse1 (<= main_~n~0 main_~k~0))) (or (and (<= main_~k~0 (+ .cse0 1)) .cse1 (and .cse2 .cse3) (<= main_~i~0 0)) (and (and (<= .cse0 main_~j~0) (or (and (< main_~i~0 main_~n~0) (= main_~i~0 0)) (and .cse2 (<= 0 main_~i~0) .cse3)) .cse1) (< main_~n~0 1000000) (<= main_~k~0 main_~n~0)))) [2019-10-07 13:41:56,944 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 29) no Hoare annotation was computed. [2019-10-07 13:41:56,944 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 34) no Hoare annotation was computed. [2019-10-07 13:41:56,944 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 34) the Hoare annotation is: true [2019-10-07 13:41:56,944 INFO L439 ceAbstractionStarter]: At program point L22-2(lines 22 24) the Hoare annotation is: (let ((.cse0 (* 2 main_~i~0))) (and (<= 0 main_~i~0) (< main_~n~0 1000000) (< main_~j~0 main_~n~0) (<= .cse0 main_~j~0) (<= .cse0 main_~k~0) (<= main_~k~0 main_~n~0))) [2019-10-07 13:41:56,944 INFO L443 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2019-10-07 13:41:56,944 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-10-07 13:41:56,945 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-10-07 13:41:56,945 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-07 13:41:56,945 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-10-07 13:41:56,945 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-10-07 13:41:56,945 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-10-07 13:41:56,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.10 01:41:56 BoogieIcfgContainer [2019-10-07 13:41:56,968 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-07 13:41:56,970 INFO L168 Benchmark]: Toolchain (without parser) took 30681.60 ms. Allocated memory was 145.2 MB in the beginning and 441.5 MB in the end (delta: 296.2 MB). Free memory was 103.9 MB in the beginning and 393.6 MB in the end (delta: -289.7 MB). Peak memory consumption was 298.2 MB. Max. memory is 7.1 GB. [2019-10-07 13:41:56,970 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 13:41:56,971 INFO L168 Benchmark]: CACSL2BoogieTranslator took 260.31 ms. Allocated memory is still 145.2 MB. Free memory was 103.7 MB in the beginning and 93.9 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2019-10-07 13:41:56,972 INFO L168 Benchmark]: Boogie Preprocessor took 122.83 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 93.9 MB in the beginning and 181.8 MB in the end (delta: -87.8 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. [2019-10-07 13:41:56,972 INFO L168 Benchmark]: RCFGBuilder took 292.99 ms. Allocated memory is still 202.4 MB. Free memory was 181.8 MB in the beginning and 166.0 MB in the end (delta: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 7.1 GB. [2019-10-07 13:41:56,973 INFO L168 Benchmark]: TraceAbstraction took 30000.68 ms. Allocated memory was 202.4 MB in the beginning and 441.5 MB in the end (delta: 239.1 MB). Free memory was 166.0 MB in the beginning and 393.6 MB in the end (delta: -227.6 MB). Peak memory consumption was 303.2 MB. Max. memory is 7.1 GB. [2019-10-07 13:41:56,977 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 260.31 ms. Allocated memory is still 145.2 MB. Free memory was 103.7 MB in the beginning and 93.9 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 122.83 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 93.9 MB in the beginning and 181.8 MB in the end (delta: -87.8 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 292.99 ms. Allocated memory is still 202.4 MB. Free memory was 181.8 MB in the beginning and 166.0 MB in the end (delta: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 30000.68 ms. Allocated memory was 202.4 MB in the beginning and 441.5 MB in the end (delta: 239.1 MB). Free memory was 166.0 MB in the beginning and 393.6 MB in the end (delta: -227.6 MB). Peak memory consumption was 303.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (((k <= 2 * i + 1 && n <= k) && 0 <= n && 1 <= j) && i <= 0) || ((((2 * i <= j && ((i < n && i == 0) || ((0 <= n && 0 <= i) && 1 <= j))) && n <= k) && n < 1000000) && k <= n) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: ((((0 <= i && n < 1000000) && j < n) && 2 * i <= j) && 2 * i <= k) && k <= n - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: ((((((k <= 2147483647 && 0 <= n) && 1 <= j) && (-n + 1) / -2 <= 0) && k <= i) && n <= k) || ((((n < 1000000 && 0 <= n + 2147483648) && k <= n) && n <= k) && i == 0)) || (((n < 1000000 && k <= n) && ((0 <= n && 0 <= i) && 1 <= j) && n <= j) && n <= k) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. Result: SAFE, OverallTime: 29.9s, OverallIterations: 10, TraceHistogramMax: 6, AutomataDifference: 15.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.3s, HoareTripleCheckerStatistics: 192 SDtfs, 504 SDslu, 1027 SDs, 0 SdLazy, 3286 SolverSat, 1012 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 5.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 916 GetRequests, 576 SyntacticMatches, 24 SemanticMatches, 316 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4161 ImplicationChecksByTransitivity, 12.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 212 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 98 PreInvPairs, 222 NumberOfFragments, 227 HoareAnnotationTreeSize, 98 FomulaSimplifications, 195766 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 12 FomulaSimplificationsInter, 104835 FormulaSimplificationTreeSizeReductionInter, 2.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 529 NumberOfCodeBlocks, 513 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 736 ConstructedInterpolants, 2 QuantifiedInterpolants, 68548 SizeOfPredicates, 26 NumberOfNonLiveVariables, 494 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 22 InterpolantComputations, 6 PerfectInterpolantSequences, 496/594 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: OVERALL_TIME[ms]: 4081, ICFG_INTERPRETER_ENTERED_PROCEDURES: 20, DAG_INTERPRETER_EARLY_EXIT_QUERIES: 651, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 346, TOOLS_POST_TIME[ms]: 145, TOOLS_POST_CALL_APPLICATIONS: 209, TOOLS_POST_CALL_TIME[ms]: 769, TOOLS_POST_RETURN_APPLICATIONS: 184, TOOLS_POST_RETURN_TIME[ms]: 139, TOOLS_QUANTIFIERELIM_APPLICATIONS: 739, TOOLS_QUANTIFIERELIM_TIME[ms]: 902, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 42, FLUID_QUERY_TIME[ms]: 22, FLUID_QUERIES: 751, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 392, DOMAIN_JOIN_TIME[ms]: 1988, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 54, DOMAIN_WIDEN_TIME[ms]: 444, DOMAIN_ISSUBSETEQ_APPLICATIONS: 100, DOMAIN_ISSUBSETEQ_TIME[ms]: 177, DOMAIN_ISBOTTOM_APPLICATIONS: 121, DOMAIN_ISBOTTOM_TIME[ms]: 176, LOOP_SUMMARIZER_APPLICATIONS: 46, LOOP_SUMMARIZER_CACHE_MISSES: 46, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 2792, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 2791, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 100, CALL_SUMMARIZER_APPLICATIONS: 184, CALL_SUMMARIZER_CACHE_MISSES: 10, CALL_SUMMARIZER_OVERALL_TIME[ms]: 44, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 42, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 7, PATH_EXPR_TIME[ms]: 6, REGEX_TO_DAG_TIME[ms]: 5, DAG_COMPRESSION_TIME[ms]: 43, DAG_COMPRESSION_PROCESSED_NODES: 1146, DAG_COMPRESSION_RETAINED_NODES: 433, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...