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-f4eb214f-m [2019-10-13 22:58:56,255 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 22:58:56,257 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 22:58:56,275 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 22:58:56,275 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 22:58:56,277 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 22:58:56,279 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 22:58:56,288 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 22:58:56,294 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 22:58:56,296 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 22:58:56,298 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 22:58:56,299 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 22:58:56,299 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 22:58:56,301 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 22:58:56,303 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 22:58:56,305 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 22:58:56,306 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 22:58:56,307 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 22:58:56,308 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 22:58:56,313 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 22:58:56,318 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 22:58:56,321 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 22:58:56,324 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 22:58:56,324 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 22:58:56,326 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 22:58:56,327 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 22:58:56,327 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 22:58:56,329 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 22:58:56,330 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 22:58:56,331 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 22:58:56,331 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 22:58:56,333 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 22:58:56,334 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 22:58:56,334 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 22:58:56,336 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 22:58:56,336 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 22:58:56,337 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 22:58:56,337 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 22:58:56,337 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 22:58:56,338 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 22:58:56,340 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 22:58:56,340 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 22:58:56,370 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 22:58:56,371 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 22:58:56,372 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 22:58:56,372 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 22:58:56,372 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 22:58:56,373 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 22:58:56,373 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 22:58:56,373 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 22:58:56,377 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 22:58:56,377 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 22:58:56,378 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 22:58:56,378 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 22:58:56,378 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 22:58:56,378 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 22:58:56,379 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 22:58:56,379 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 22:58:56,379 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 22:58:56,379 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 22:58:56,379 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 22:58:56,380 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 22:58:56,380 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 22:58:56,380 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 22:58:56,384 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 22:58:56,384 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 22:58:56,384 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 22:58:56,384 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 22:58:56,384 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 22:58:56,385 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 22:58:56,385 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-13 22:58:56,659 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 22:58:56,671 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 22:58:56,675 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 22:58:56,676 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 22:58:56,677 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 22:58:56,677 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-13 22:58:56,740 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01b29cdb2/6f3d1ff3ba8e497eaedf80fa1db9bec9/FLAGb2106e855 [2019-10-13 22:58:57,168 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 22:58:57,169 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested6.i [2019-10-13 22:58:57,176 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01b29cdb2/6f3d1ff3ba8e497eaedf80fa1db9bec9/FLAGb2106e855 [2019-10-13 22:58:57,581 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01b29cdb2/6f3d1ff3ba8e497eaedf80fa1db9bec9 [2019-10-13 22:58:57,591 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 22:58:57,592 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 22:58:57,593 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 22:58:57,593 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 22:58:57,596 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 22:58:57,596 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:58:57" (1/1) ... [2019-10-13 22:58:57,598 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f1172d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:57, skipping insertion in model container [2019-10-13 22:58:57,599 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:58:57" (1/1) ... [2019-10-13 22:58:57,605 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 22:58:57,622 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 22:58:57,780 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 22:58:57,784 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 22:58:57,802 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 22:58:57,816 INFO L192 MainTranslator]: Completed translation [2019-10-13 22:58:57,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:57 WrapperNode [2019-10-13 22:58:57,817 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 22:58:57,818 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 22:58:57,818 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 22:58:57,818 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 22:58:57,903 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:57" (1/1) ... [2019-10-13 22:58:57,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:57" (1/1) ... [2019-10-13 22:58:57,914 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:57" (1/1) ... [2019-10-13 22:58:57,914 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:57" (1/1) ... [2019-10-13 22:58:57,924 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:57" (1/1) ... [2019-10-13 22:58:57,930 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:57" (1/1) ... [2019-10-13 22:58:57,931 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:57" (1/1) ... [2019-10-13 22:58:57,933 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 22:58:57,933 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 22:58:57,933 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 22:58:57,933 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 22:58:57,934 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:57" (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-13 22:58:57,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 22:58:57,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 22:58:57,986 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 22:58:57,986 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 22:58:57,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 22:58:57,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 22:58:57,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 22:58:57,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 22:58:57,987 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 22:58:57,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 22:58:57,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 22:58:58,266 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 22:58:58,269 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-13 22:58:58,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:58:58 BoogieIcfgContainer [2019-10-13 22:58:58,271 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 22:58:58,275 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 22:58:58,275 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 22:58:58,281 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 22:58:58,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:58:57" (1/3) ... [2019-10-13 22:58:58,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44c56332 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:58:58, skipping insertion in model container [2019-10-13 22:58:58,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:57" (2/3) ... [2019-10-13 22:58:58,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44c56332 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:58:58, skipping insertion in model container [2019-10-13 22:58:58,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:58:58" (3/3) ... [2019-10-13 22:58:58,293 INFO L109 eAbstractionObserver]: Analyzing ICFG nested6.i [2019-10-13 22:58:58,305 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 22:58:58,311 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 22:58:58,322 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 22:58:58,348 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 22:58:58,348 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 22:58:58,348 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 22:58:58,348 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 22:58:58,348 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 22:58:58,349 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 22:58:58,349 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 22:58:58,349 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 22:58:58,365 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-10-13 22:58:58,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 22:58:58,370 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:58,371 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:58,373 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:58,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:58,377 INFO L82 PathProgramCache]: Analyzing trace with hash -2132448607, now seen corresponding path program 1 times [2019-10-13 22:58:58,385 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:58,386 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974427097] [2019-10-13 22:58:58,386 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:58,386 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:58,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:58,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:58,624 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-13 22:58:58,627 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974427097] [2019-10-13 22:58:58,628 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:58,629 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 22:58:58,629 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086082308] [2019-10-13 22:58:58,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 22:58:58,637 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:58,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 22:58:58,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 22:58:58,659 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 5 states. [2019-10-13 22:58:58,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:58,841 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2019-10-13 22:58:58,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 22:58:58,844 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-10-13 22:58:58,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:58,855 INFO L225 Difference]: With dead ends: 54 [2019-10-13 22:58:58,856 INFO L226 Difference]: Without dead ends: 26 [2019-10-13 22:58:58,860 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 22:58:58,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-13 22:58:58,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-13 22:58:58,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-13 22:58:58,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-10-13 22:58:58,912 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 14 [2019-10-13 22:58:58,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:58,913 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-10-13 22:58:58,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 22:58:58,913 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-10-13 22:58:58,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 22:58:58,914 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:58,914 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:58,915 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:58,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:58,916 INFO L82 PathProgramCache]: Analyzing trace with hash 2119930173, now seen corresponding path program 1 times [2019-10-13 22:58:58,916 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:58,916 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919626957] [2019-10-13 22:58:58,917 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:58,917 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:58,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:58,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:59,008 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-13 22:58:59,009 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919626957] [2019-10-13 22:58:59,009 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:59,009 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 22:58:59,010 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465401619] [2019-10-13 22:58:59,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 22:58:59,013 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:59,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 22:58:59,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 22:58:59,014 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 6 states. [2019-10-13 22:58:59,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:59,190 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2019-10-13 22:58:59,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 22:58:59,191 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-10-13 22:58:59,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:59,192 INFO L225 Difference]: With dead ends: 37 [2019-10-13 22:58:59,192 INFO L226 Difference]: Without dead ends: 35 [2019-10-13 22:58:59,193 INFO L600 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-13 22:58:59,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-13 22:58:59,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2019-10-13 22:58:59,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-13 22:58:59,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-10-13 22:58:59,206 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 15 [2019-10-13 22:58:59,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:59,206 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-10-13 22:58:59,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 22:58:59,207 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-10-13 22:58:59,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 22:58:59,208 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:59,208 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:59,208 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:59,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:59,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1348120608, now seen corresponding path program 1 times [2019-10-13 22:58:59,209 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:59,209 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796114484] [2019-10-13 22:58:59,210 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:59,210 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:59,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:59,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:59,278 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-13 22:58:59,279 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796114484] [2019-10-13 22:58:59,279 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:59,279 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 22:58:59,280 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498577771] [2019-10-13 22:58:59,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 22:58:59,282 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:59,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 22:58:59,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 22:58:59,283 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 5 states. [2019-10-13 22:58:59,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:59,358 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2019-10-13 22:58:59,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 22:58:59,358 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-10-13 22:58:59,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:59,360 INFO L225 Difference]: With dead ends: 42 [2019-10-13 22:58:59,360 INFO L226 Difference]: Without dead ends: 40 [2019-10-13 22:58:59,361 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 22:58:59,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-13 22:58:59,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-10-13 22:58:59,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-13 22:58:59,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2019-10-13 22:58:59,372 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 19 [2019-10-13 22:58:59,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:59,373 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2019-10-13 22:58:59,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 22:58:59,373 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2019-10-13 22:58:59,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 22:58:59,374 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:59,374 INFO L380 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-13 22:58:59,375 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:59,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:59,375 INFO L82 PathProgramCache]: Analyzing trace with hash 177302015, now seen corresponding path program 1 times [2019-10-13 22:58:59,376 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:59,376 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054083519] [2019-10-13 22:58:59,376 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:59,376 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:59,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:59,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:59,485 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-13 22:58:59,486 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054083519] [2019-10-13 22:58:59,486 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:59,487 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 22:58:59,487 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154584123] [2019-10-13 22:58:59,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 22:58:59,488 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:59,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 22:58:59,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-13 22:58:59,489 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 7 states. [2019-10-13 22:58:59,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:59,686 INFO L93 Difference]: Finished difference Result 63 states and 79 transitions. [2019-10-13 22:58:59,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 22:58:59,687 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-10-13 22:58:59,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:59,690 INFO L225 Difference]: With dead ends: 63 [2019-10-13 22:58:59,690 INFO L226 Difference]: Without dead ends: 61 [2019-10-13 22:58:59,691 INFO L600 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-13 22:58:59,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-13 22:58:59,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 43. [2019-10-13 22:58:59,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-13 22:58:59,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2019-10-13 22:58:59,703 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 23 [2019-10-13 22:58:59,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:59,704 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2019-10-13 22:58:59,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 22:58:59,704 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2019-10-13 22:58:59,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 22:58:59,705 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:59,706 INFO L380 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-13 22:58:59,706 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:59,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:59,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1604066593, now seen corresponding path program 1 times [2019-10-13 22:58:59,707 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:59,707 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098194592] [2019-10-13 22:58:59,707 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:59,707 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:59,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:59,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:59,807 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-13 22:58:59,807 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098194592] [2019-10-13 22:58:59,807 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701395923] [2019-10-13 22:58:59,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:58:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:59,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-13 22:58:59,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:59:00,006 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-13 22:59:00,006 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:59:00,063 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-13 22:59:00,064 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 22:59:00,064 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [9] total 13 [2019-10-13 22:59:00,064 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382125685] [2019-10-13 22:59:00,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 22:59:00,065 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:59:00,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 22:59:00,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-13 22:59:00,066 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand 7 states. [2019-10-13 22:59:01,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:59:01,230 INFO L93 Difference]: Finished difference Result 104 states and 138 transitions. [2019-10-13 22:59:01,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 22:59:01,232 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-10-13 22:59:01,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:59:01,234 INFO L225 Difference]: With dead ends: 104 [2019-10-13 22:59:01,234 INFO L226 Difference]: Without dead ends: 68 [2019-10-13 22:59:01,236 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2019-10-13 22:59:01,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-13 22:59:01,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 43. [2019-10-13 22:59:01,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-13 22:59:01,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2019-10-13 22:59:01,258 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 25 [2019-10-13 22:59:01,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:59:01,259 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2019-10-13 22:59:01,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 22:59:01,260 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2019-10-13 22:59:01,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 22:59:01,261 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:59:01,262 INFO L380 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-13 22:59:01,465 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:59:01,466 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:59:01,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:59:01,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1654338469, now seen corresponding path program 1 times [2019-10-13 22:59:01,467 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:59:01,467 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112935163] [2019-10-13 22:59:01,468 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:01,468 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:01,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:59:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:01,566 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-13 22:59:01,566 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112935163] [2019-10-13 22:59:01,566 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855412973] [2019-10-13 22:59:01,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:59:01,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:01,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-13 22:59:01,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:59:01,664 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-13 22:59:01,665 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:59:01,706 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-13 22:59:01,707 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [742869631] [2019-10-13 22:59:01,753 INFO L162 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-10-13 22:59:01,753 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:59:01,763 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:59:01,770 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:59:01,771 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:59:01,828 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-13 22:59:03,012 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 9 for LOIs [2019-10-13 22:59:03,057 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-13 22:59:03,060 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 22:59:03,068 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 22:59:03,068 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-13 22:59:03,068 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-13 22:59:03,069 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-13 22:59:03,069 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 407#true [2019-10-13 22:59:03,070 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-13 22:59:03,070 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-13 22:59:03,070 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-13 22:59:03,071 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-13 22:59:03,071 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-13 22:59:03,071 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-13 22:59:03,072 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-13 22:59:03,072 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-13 22:59:03,072 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-13 22:59:03,073 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 412#true [2019-10-13 22:59:03,074 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 22:59:03,075 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-13 22:59:03,075 INFO L193 IcfgInterpreter]: Reachable states at location L20-2 satisfy 325#(or (and (= main_~n~0 main_~k~0) (<= main_~k~0 2147483647) (<= 0 main_~j~0) (<= 0 main_~n~0) (<= main_~n~0 2147483647) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= 0 (+ main_~n~0 2147483648)) (<= main_~n~0 1000000) (= (* main_~i~0 2) main_~j~0) (<= 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 0) (= main_~i~0 0)) (and (<= 0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= 1 main_~j~0) (<= main_~n~0 1000000) (not (< main_~k~0 main_~n~0)) (<= main_~i~0 0) (= main_~i~0 0))) [2019-10-13 22:59:03,075 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-13 22:59:03,076 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-13 22:59:03,076 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-13 22:59:03,076 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-13 22:59:03,077 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-13 22:59:03,653 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 22:59:03,653 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6, 13] total 21 [2019-10-13 22:59:03,654 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178993485] [2019-10-13 22:59:03,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-13 22:59:03,655 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:59:03,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-13 22:59:03,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2019-10-13 22:59:03,656 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 21 states. [2019-10-13 22:59:04,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:59:04,826 INFO L93 Difference]: Finished difference Result 111 states and 142 transitions. [2019-10-13 22:59:04,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-13 22:59:04,826 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2019-10-13 22:59:04,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:59:04,828 INFO L225 Difference]: With dead ends: 111 [2019-10-13 22:59:04,828 INFO L226 Difference]: Without dead ends: 87 [2019-10-13 22:59:04,829 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 75 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=239, Invalid=1483, Unknown=0, NotChecked=0, Total=1722 [2019-10-13 22:59:04,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-10-13 22:59:04,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 48. [2019-10-13 22:59:04,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-13 22:59:04,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2019-10-13 22:59:04,840 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 30 [2019-10-13 22:59:04,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:59:04,841 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2019-10-13 22:59:04,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-13 22:59:04,841 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2019-10-13 22:59:04,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-13 22:59:04,842 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:59:04,843 INFO L380 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-13 22:59:05,046 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:59:05,047 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:59:05,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:59:05,048 INFO L82 PathProgramCache]: Analyzing trace with hash 488758021, now seen corresponding path program 1 times [2019-10-13 22:59:05,048 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:59:05,048 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787936679] [2019-10-13 22:59:05,049 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:05,049 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:05,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:59:05,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:05,182 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-13 22:59:05,182 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787936679] [2019-10-13 22:59:05,183 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362793838] [2019-10-13 22:59:05,183 INFO L94 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-13 22:59:05,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:05,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-13 22:59:05,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:59:05,339 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-13 22:59:05,339 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:59:05,390 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-13 22:59:05,391 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1071068629] [2019-10-13 22:59:05,393 INFO L162 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-10-13 22:59:05,393 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:59:05,393 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:59:05,394 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:59:05,394 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:59:05,407 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-13 22:59:06,047 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 9 for LOIs [2019-10-13 22:59:06,067 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-13 22:59:06,069 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 22:59:06,069 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 22:59:06,069 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-13 22:59:06,069 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-13 22:59:06,070 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-13 22:59:06,070 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 472#true [2019-10-13 22:59:06,070 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-13 22:59:06,070 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-13 22:59:06,071 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-13 22:59:06,071 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-13 22:59:06,071 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-13 22:59:06,071 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-13 22:59:06,072 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-13 22:59:06,072 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-13 22:59:06,072 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-13 22:59:06,072 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 477#true [2019-10-13 22:59:06,072 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 22:59:06,072 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-13 22:59:06,073 INFO L193 IcfgInterpreter]: Reachable states at location L20-2 satisfy 376#(and (<= 0 main_~j~0) (or (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 2) main_~j~0) (<= 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 0) (= main_~i~0 0)) (and (<= 0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= 1 main_~j~0) (not (< main_~k~0 main_~n~0)))) (<= main_~n~0 1000000)) [2019-10-13 22:59:06,073 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-13 22:59:06,073 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-13 22:59:06,074 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-13 22:59:06,074 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-13 22:59:06,074 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-13 22:59:06,688 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 22:59:06,689 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8, 14] total 29 [2019-10-13 22:59:06,689 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405494223] [2019-10-13 22:59:06,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-13 22:59:06,691 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:59:06,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-13 22:59:06,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=718, Unknown=0, NotChecked=0, Total=812 [2019-10-13 22:59:06,693 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand 29 states. [2019-10-13 22:59:08,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:59:08,981 INFO L93 Difference]: Finished difference Result 130 states and 171 transitions. [2019-10-13 22:59:08,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-13 22:59:08,982 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 32 [2019-10-13 22:59:08,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:59:08,984 INFO L225 Difference]: With dead ends: 130 [2019-10-13 22:59:08,984 INFO L226 Difference]: Without dead ends: 98 [2019-10-13 22:59:08,986 INFO L600 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-13 22:59:08,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-10-13 22:59:09,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 53. [2019-10-13 22:59:09,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-13 22:59:09,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2019-10-13 22:59:09,001 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 32 [2019-10-13 22:59:09,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:59:09,001 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2019-10-13 22:59:09,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-13 22:59:09,001 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2019-10-13 22:59:09,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-13 22:59:09,003 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:59:09,003 INFO L380 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-13 22:59:09,206 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:59:09,206 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:59:09,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:59:09,207 INFO L82 PathProgramCache]: Analyzing trace with hash -961518785, now seen corresponding path program 2 times [2019-10-13 22:59:09,207 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:59:09,207 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095220152] [2019-10-13 22:59:09,207 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:09,208 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:09,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:59:09,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:09,320 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-13 22:59:09,321 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095220152] [2019-10-13 22:59:09,321 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487455239] [2019-10-13 22:59:09,321 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-13 22:59:09,387 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-13 22:59:09,387 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 22:59:09,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-13 22:59:09,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:59:09,425 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-13 22:59:09,425 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:59:09,477 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-13 22:59:09,477 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [538578144] [2019-10-13 22:59:09,479 INFO L162 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-10-13 22:59:09,479 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:59:09,480 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:59:09,480 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:59:09,481 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:59:09,489 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-13 22:59:09,775 WARN L222 IntervalDomain]: Interval conversion did not stabilize in 6 iterations. Over-approximation may be very coarse. [2019-10-13 22:59:09,923 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 9 for LOIs [2019-10-13 22:59:09,945 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-13 22:59:09,947 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 22:59:09,947 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 22:59:09,947 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-13 22:59:09,948 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-13 22:59:09,948 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-13 22:59:09,948 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 406#true [2019-10-13 22:59:09,948 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-13 22:59:09,949 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-13 22:59:09,949 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-13 22:59:09,949 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-13 22:59:09,949 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-13 22:59:09,950 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-13 22:59:09,950 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-13 22:59:09,950 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-13 22:59:09,950 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-13 22:59:09,955 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 411#true [2019-10-13 22:59:09,955 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 22:59:09,957 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-13 22:59:09,957 INFO L193 IcfgInterpreter]: Reachable states at location L20-2 satisfy 324#(or (and (= main_~n~0 main_~k~0) (<= main_~k~0 2147483647) (<= 0 main_~j~0) (<= 0 main_~n~0) (<= main_~n~0 2147483647) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= 0 (+ main_~n~0 2147483648)) (<= main_~n~0 1000000) (= (* main_~i~0 2) main_~j~0) (<= 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 0) (= main_~i~0 0)) (and (<= 0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= 1 main_~j~0) (<= main_~n~0 1000000) (not (< main_~k~0 main_~n~0)) (<= main_~i~0 0) (= main_~i~0 0))) [2019-10-13 22:59:09,957 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-13 22:59:09,958 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-13 22:59:09,958 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-13 22:59:09,958 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-13 22:59:09,958 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-13 22:59:10,505 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 22:59:10,505 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8, 13] total 25 [2019-10-13 22:59:10,505 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385562396] [2019-10-13 22:59:10,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-13 22:59:10,506 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:59:10,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-13 22:59:10,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2019-10-13 22:59:10,507 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 25 states. [2019-10-13 22:59:12,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:59:12,470 INFO L93 Difference]: Finished difference Result 149 states and 204 transitions. [2019-10-13 22:59:12,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-13 22:59:12,470 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 37 [2019-10-13 22:59:12,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:59:12,474 INFO L225 Difference]: With dead ends: 149 [2019-10-13 22:59:12,474 INFO L226 Difference]: Without dead ends: 120 [2019-10-13 22:59:12,476 INFO L600 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-13 22:59:12,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-10-13 22:59:12,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 93. [2019-10-13 22:59:12,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-13 22:59:12,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 128 transitions. [2019-10-13 22:59:12,498 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 128 transitions. Word has length 37 [2019-10-13 22:59:12,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:59:12,499 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 128 transitions. [2019-10-13 22:59:12,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-13 22:59:12,499 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 128 transitions. [2019-10-13 22:59:12,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-13 22:59:12,501 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:59:12,502 INFO L380 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-13 22:59:12,714 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:59:12,715 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:59:12,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:59:12,715 INFO L82 PathProgramCache]: Analyzing trace with hash 953205258, now seen corresponding path program 1 times [2019-10-13 22:59:12,715 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:59:12,715 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101069761] [2019-10-13 22:59:12,716 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:12,716 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:12,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:59:12,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:12,803 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-13 22:59:12,804 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101069761] [2019-10-13 22:59:12,804 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687945329] [2019-10-13 22:59:12,804 INFO L94 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-13 22:59:12,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:12,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 22:59:12,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:59:12,950 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-13 22:59:12,950 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:59:13,019 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-13 22:59:13,019 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1153356043] [2019-10-13 22:59:13,021 INFO L162 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-10-13 22:59:13,021 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:59:13,021 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:59:13,022 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:59:13,022 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:59:13,038 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-13 22:59:13,694 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 9 for LOIs [2019-10-13 22:59:13,710 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-13 22:59:13,711 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 22:59:13,711 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 22:59:13,712 INFO L193 IcfgInterpreter]: Reachable states at location L4-2 satisfy 643#(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-13 22:59:13,712 INFO L193 IcfgInterpreter]: Reachable states at location L23-1 satisfy 485#(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-13 22:59:13,712 INFO L193 IcfgInterpreter]: Reachable states at location L23 satisfy 472#(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-13 22:59:13,712 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 652#true [2019-10-13 22:59:13,712 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 648#(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-13 22:59:13,713 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-13 22:59:13,713 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 628#(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-13 22:59:13,713 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-13 22:59:13,713 INFO L193 IcfgInterpreter]: Reachable states at location L27-1 satisfy 502#(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-13 22:59:13,713 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 571#(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-13 22:59:13,714 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-13 22:59:13,714 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-13 22:59:13,714 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 490#(and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= main_~n~0 1000000)) [2019-10-13 22:59:13,714 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 657#true [2019-10-13 22:59:13,714 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 22:59:13,715 INFO L193 IcfgInterpreter]: Reachable states at location L28 satisfy 614#(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-13 22:59:13,715 INFO L193 IcfgInterpreter]: Reachable states at location L20-2 satisfy 602#(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-13 22:59:13,715 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 633#(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-13 22:59:13,715 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 638#(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-13 22:59:13,715 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 623#(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-13 22:59:13,716 INFO L193 IcfgInterpreter]: Reachable states at location L22-2 satisfy 443#(and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= main_~n~0 1000000)) [2019-10-13 22:59:13,716 INFO L193 IcfgInterpreter]: Reachable states at location L21 satisfy 380#(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-13 22:59:14,386 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 22:59:14,387 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6, 13] total 30 [2019-10-13 22:59:14,387 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573696050] [2019-10-13 22:59:14,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-13 22:59:14,389 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:59:14,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-13 22:59:14,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870 [2019-10-13 22:59:14,390 INFO L87 Difference]: Start difference. First operand 93 states and 128 transitions. Second operand 30 states. [2019-10-13 22:59:16,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:59:16,881 INFO L93 Difference]: Finished difference Result 214 states and 304 transitions. [2019-10-13 22:59:16,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-13 22:59:16,882 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 47 [2019-10-13 22:59:16,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:59:16,884 INFO L225 Difference]: With dead ends: 214 [2019-10-13 22:59:16,884 INFO L226 Difference]: Without dead ends: 160 [2019-10-13 22:59:16,889 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 123 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 962 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=609, Invalid=3297, Unknown=0, NotChecked=0, Total=3906 [2019-10-13 22:59:16,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-10-13 22:59:16,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 107. [2019-10-13 22:59:16,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-10-13 22:59:16,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 148 transitions. [2019-10-13 22:59:16,914 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 148 transitions. Word has length 47 [2019-10-13 22:59:16,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:59:16,915 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 148 transitions. [2019-10-13 22:59:16,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-13 22:59:16,915 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 148 transitions. [2019-10-13 22:59:16,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-13 22:59:16,918 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:59:16,918 INFO L380 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-13 22:59:17,123 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:59:17,124 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:59:17,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:59:17,124 INFO L82 PathProgramCache]: Analyzing trace with hash 164211579, now seen corresponding path program 2 times [2019-10-13 22:59:17,124 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:59:17,125 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220007438] [2019-10-13 22:59:17,125 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:17,125 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:17,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:59:17,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:17,253 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-13 22:59:17,254 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220007438] [2019-10-13 22:59:17,254 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272606213] [2019-10-13 22:59:17,254 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:59:17,363 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-13 22:59:17,363 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 22:59:17,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-13 22:59:17,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:59:17,501 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-13 22:59:17,502 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:59:17,578 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-13 22:59:17,578 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [960211740] [2019-10-13 22:59:17,580 INFO L162 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-10-13 22:59:17,580 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:59:17,580 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:59:17,581 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:59:17,581 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:59:17,589 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-13 22:59:18,453 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 9 for LOIs [2019-10-13 22:59:18,476 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-13 22:59:18,478 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 22:59:18,478 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 22:59:18,478 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-13 22:59:18,479 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-13 22:59:18,479 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-13 22:59:18,480 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 659#true [2019-10-13 22:59:18,480 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-13 22:59:18,480 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-13 22:59:18,480 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-13 22:59:18,481 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-13 22:59:18,481 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-13 22:59:18,481 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-13 22:59:18,482 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-13 22:59:18,482 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-13 22:59:18,482 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-13 22:59:18,482 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 664#true [2019-10-13 22:59:18,483 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 22:59:18,483 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-13 22:59:18,483 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-13 22:59:18,483 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-13 22:59:18,484 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-13 22:59:18,484 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-13 22:59:18,484 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-13 22:59:18,484 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-13 22:59:19,571 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 22:59:19,571 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 7, 14] total 35 [2019-10-13 22:59:19,571 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974291560] [2019-10-13 22:59:19,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-13 22:59:19,572 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:59:19,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-13 22:59:19,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1085, Unknown=0, NotChecked=0, Total=1190 [2019-10-13 22:59:19,573 INFO L87 Difference]: Start difference. First operand 107 states and 148 transitions. Second operand 35 states. [2019-10-13 22:59:23,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:59:23,230 INFO L93 Difference]: Finished difference Result 256 states and 371 transitions. [2019-10-13 22:59:23,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-13 22:59:23,231 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 58 [2019-10-13 22:59:23,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:59:23,231 INFO L225 Difference]: With dead ends: 256 [2019-10-13 22:59:23,231 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 22:59:23,235 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 153 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1253 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=762, Invalid=4494, Unknown=0, NotChecked=0, Total=5256 [2019-10-13 22:59:23,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 22:59:23,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 22:59:23,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 22:59:23,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 22:59:23,236 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2019-10-13 22:59:23,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:59:23,236 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 22:59:23,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-13 22:59:23,236 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 22:59:23,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 22:59:23,437 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:59:23,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 22:59:23,572 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 120 [2019-10-13 22:59:23,680 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 108 [2019-10-13 22:59:23,794 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 141 [2019-10-13 22:59:24,416 WARN L191 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 18 [2019-10-13 22:59:24,881 WARN L191 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 17 [2019-10-13 22:59:25,477 WARN L191 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 30 [2019-10-13 22:59:25,882 WARN L191 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 17 [2019-10-13 22:59:26,289 WARN L191 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 18 [2019-10-13 22:59:26,713 WARN L191 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 32 [2019-10-13 22:59:26,716 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-13 22:59:26,716 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 22:59:26,717 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 22:59:26,717 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-13 22:59:26,717 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 22:59:26,717 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 22:59:26,717 INFO L439 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (and (<= 0 main_~i~0) (< main_~j~0 main_~n~0) (< main_~n~0 1000000) (<= (* 2 main_~i~0) main_~j~0) (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0)) [2019-10-13 22:59:26,717 INFO L439 ceAbstractionStarter]: At program point L27-1(line 27) the Hoare annotation is: (and (<= 0 main_~i~0) (< main_~j~0 main_~n~0) (< main_~n~0 1000000) (<= (* 2 main_~i~0) main_~j~0) (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0)) [2019-10-13 22:59:26,717 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 34) no Hoare annotation was computed. [2019-10-13 22:59:26,717 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-13 22:59:26,717 INFO L443 ceAbstractionStarter]: For program point L23-1(lines 22 24) no Hoare annotation was computed. [2019-10-13 22:59:26,718 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) .cse2 (<= main_~n~0 main_~j~0))))) [2019-10-13 22:59:26,718 INFO L443 ceAbstractionStarter]: For program point L15(lines 15 18) no Hoare annotation was computed. [2019-10-13 22:59:26,718 INFO L446 ceAbstractionStarter]: At program point L32(lines 10 34) the Hoare annotation is: true [2019-10-13 22:59:26,718 INFO L443 ceAbstractionStarter]: For program point L28(lines 20 30) no Hoare annotation was computed. [2019-10-13 22:59:26,718 INFO L439 ceAbstractionStarter]: At program point L20-2(lines 20 30) the Hoare annotation is: (let ((.cse0 (* 2 main_~i~0))) (let ((.cse1 (<= 0 main_~n~0)) (.cse2 (<= 1 main_~j~0)) (.cse3 (and (<= .cse0 main_~j~0) (<= main_~n~0 main_~k~0)))) (or (and (<= main_~k~0 (+ .cse0 1)) (and .cse1 .cse2) .cse3 (<= main_~i~0 0)) (and (and (or (and (< main_~i~0 main_~n~0) (= main_~i~0 0)) (and .cse1 (<= 0 main_~i~0) .cse2)) .cse3) (< main_~n~0 1000000) (<= main_~k~0 main_~n~0))))) [2019-10-13 22:59:26,718 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 29) no Hoare annotation was computed. [2019-10-13 22:59:26,718 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 34) no Hoare annotation was computed. [2019-10-13 22:59:26,718 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 34) the Hoare annotation is: true [2019-10-13 22:59:26,718 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-13 22:59:26,718 INFO L443 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2019-10-13 22:59:26,719 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-13 22:59:26,719 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-10-13 22:59:26,719 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-10-13 22:59:26,719 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-10-13 22:59:26,719 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-10-13 22:59:26,719 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-10-13 22:59:26,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 10:59:26 BoogieIcfgContainer [2019-10-13 22:59:26,737 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 22:59:26,738 INFO L168 Benchmark]: Toolchain (without parser) took 29146.53 ms. Allocated memory was 140.0 MB in the beginning and 464.5 MB in the end (delta: 324.5 MB). Free memory was 105.3 MB in the beginning and 290.3 MB in the end (delta: -184.9 MB). Peak memory consumption was 318.3 MB. Max. memory is 7.1 GB. [2019-10-13 22:59:26,739 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 140.0 MB. Free memory was 123.3 MB in the beginning and 123.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-13 22:59:26,740 INFO L168 Benchmark]: CACSL2BoogieTranslator took 224.35 ms. Allocated memory is still 140.0 MB. Free memory was 105.1 MB in the beginning and 95.6 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2019-10-13 22:59:26,741 INFO L168 Benchmark]: Boogie Preprocessor took 115.07 ms. Allocated memory was 140.0 MB in the beginning and 202.9 MB in the end (delta: 62.9 MB). Free memory was 95.6 MB in the beginning and 181.3 MB in the end (delta: -85.8 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2019-10-13 22:59:26,741 INFO L168 Benchmark]: RCFGBuilder took 338.05 ms. Allocated memory is still 202.9 MB. Free memory was 181.3 MB in the beginning and 166.7 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. [2019-10-13 22:59:26,742 INFO L168 Benchmark]: TraceAbstraction took 28461.67 ms. Allocated memory was 202.9 MB in the beginning and 464.5 MB in the end (delta: 261.6 MB). Free memory was 166.0 MB in the beginning and 290.3 MB in the end (delta: -124.3 MB). Peak memory consumption was 316.0 MB. Max. memory is 7.1 GB. [2019-10-13 22:59:26,744 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.19 ms. Allocated memory is still 140.0 MB. Free memory was 123.3 MB in the beginning and 123.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 224.35 ms. Allocated memory is still 140.0 MB. Free memory was 105.1 MB in the beginning and 95.6 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 115.07 ms. Allocated memory was 140.0 MB in the beginning and 202.9 MB in the end (delta: 62.9 MB). Free memory was 95.6 MB in the beginning and 181.3 MB in the end (delta: -85.8 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 338.05 ms. Allocated memory is still 202.9 MB. Free memory was 181.3 MB in the beginning and 166.7 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28461.67 ms. Allocated memory was 202.9 MB in the beginning and 464.5 MB in the end (delta: 261.6 MB). Free memory was 166.0 MB in the beginning and 290.3 MB in the end (delta: -124.3 MB). Peak memory consumption was 316.0 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 && 0 <= n && 1 <= j) && 2 * i <= j && n <= k) && i <= 0) || (((((i < n && i == 0) || ((0 <= n && 0 <= i) && 1 <= j)) && 2 * i <= 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 <= k) && n <= j) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. Result: SAFE, OverallTime: 28.3s, OverallIterations: 10, TraceHistogramMax: 6, AutomataDifference: 13.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.2s, HoareTripleCheckerStatistics: 192 SDtfs, 504 SDslu, 1027 SDs, 0 SdLazy, 3287 SolverSat, 1012 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 916 GetRequests, 576 SyntacticMatches, 24 SemanticMatches, 316 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4161 ImplicationChecksByTransitivity, 13.6s 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, 234 HoareAnnotationTreeSize, 98 FomulaSimplifications, 158019 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 12 FomulaSimplificationsInter, 143562 FormulaSimplificationTreeSizeReductionInter, 2.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s 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]: 4086, ICFG_INTERPRETER_ENTERED_PROCEDURES: 20, DAG_INTERPRETER_EARLY_EXIT_QUERIES: 624, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 331, TOOLS_POST_TIME[ms]: 145, TOOLS_POST_CALL_APPLICATIONS: 201, TOOLS_POST_CALL_TIME[ms]: 675, TOOLS_POST_RETURN_APPLICATIONS: 176, TOOLS_POST_RETURN_TIME[ms]: 152, TOOLS_QUANTIFIERELIM_APPLICATIONS: 708, TOOLS_QUANTIFIERELIM_TIME[ms]: 823, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 86, FLUID_QUERY_TIME[ms]: 35, FLUID_QUERIES: 718, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 381, DOMAIN_JOIN_TIME[ms]: 2012, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 50, DOMAIN_WIDEN_TIME[ms]: 479, DOMAIN_ISSUBSETEQ_APPLICATIONS: 94, DOMAIN_ISSUBSETEQ_TIME[ms]: 170, DOMAIN_ISBOTTOM_APPLICATIONS: 116, DOMAIN_ISBOTTOM_TIME[ms]: 180, LOOP_SUMMARIZER_APPLICATIONS: 44, LOOP_SUMMARIZER_CACHE_MISSES: 44, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 2677, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 2676, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 94, CALL_SUMMARIZER_APPLICATIONS: 176, CALL_SUMMARIZER_CACHE_MISSES: 10, CALL_SUMMARIZER_OVERALL_TIME[ms]: 33, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 31, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 6, PATH_EXPR_TIME[ms]: 6, REGEX_TO_DAG_TIME[ms]: 5, DAG_COMPRESSION_TIME[ms]: 38, 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...