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/heapsort.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 13:40:54,346 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 13:40:54,349 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 13:40:54,367 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 13:40:54,367 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 13:40:54,369 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 13:40:54,372 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 13:40:54,375 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 13:40:54,381 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 13:40:54,382 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 13:40:54,383 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 13:40:54,384 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 13:40:54,384 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 13:40:54,385 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 13:40:54,386 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 13:40:54,387 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 13:40:54,388 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 13:40:54,389 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 13:40:54,390 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 13:40:54,392 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 13:40:54,393 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 13:40:54,394 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 13:40:54,395 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 13:40:54,396 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 13:40:54,402 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 13:40:54,402 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 13:40:54,402 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 13:40:54,403 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 13:40:54,403 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 13:40:54,405 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 13:40:54,405 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 13:40:54,407 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 13:40:54,408 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 13:40:54,409 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 13:40:54,410 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 13:40:54,410 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 13:40:54,413 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 13:40:54,413 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 13:40:54,414 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 13:40:54,415 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 13:40:54,415 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 13:40:54,416 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 13:40:54,449 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 13:40:54,449 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 13:40:54,450 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 13:40:54,453 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 13:40:54,453 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 13:40:54,454 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 13:40:54,454 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 13:40:54,454 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 13:40:54,454 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 13:40:54,454 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 13:40:54,455 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 13:40:54,455 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 13:40:54,455 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 13:40:54,457 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 13:40:54,457 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 13:40:54,458 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 13:40:54,458 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 13:40:54,458 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 13:40:54,458 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 13:40:54,458 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 13:40:54,459 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 13:40:54,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:40:54,459 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 13:40:54,462 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 13:40:54,462 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 13:40:54,463 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 13:40:54,463 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 13:40:54,463 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 13:40:54,463 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 13:40:54,756 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 13:40:54,776 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 13:40:54,780 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 13:40:54,781 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 13:40:54,782 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 13:40:54,782 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/heapsort.i [2019-10-07 13:40:54,860 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e59d803e5/bf79a7a57be8426ca46e578cbc62748a/FLAG880d81178 [2019-10-07 13:40:55,328 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 13:40:55,329 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/heapsort.i [2019-10-07 13:40:55,336 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e59d803e5/bf79a7a57be8426ca46e578cbc62748a/FLAG880d81178 [2019-10-07 13:40:55,706 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e59d803e5/bf79a7a57be8426ca46e578cbc62748a [2019-10-07 13:40:55,717 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 13:40:55,718 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 13:40:55,719 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 13:40:55,720 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 13:40:55,723 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 13:40:55,724 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:40:55" (1/1) ... [2019-10-07 13:40:55,728 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1adaab4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:55, skipping insertion in model container [2019-10-07 13:40:55,728 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:40:55" (1/1) ... [2019-10-07 13:40:55,736 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 13:40:55,755 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 13:40:55,936 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:40:55,939 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 13:40:55,961 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:40:55,975 INFO L192 MainTranslator]: Completed translation [2019-10-07 13:40:55,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:55 WrapperNode [2019-10-07 13:40:55,976 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 13:40:55,977 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 13:40:55,977 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 13:40:55,977 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 13:40:56,066 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:55" (1/1) ... [2019-10-07 13:40:56,067 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:55" (1/1) ... [2019-10-07 13:40:56,073 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:55" (1/1) ... [2019-10-07 13:40:56,074 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:55" (1/1) ... [2019-10-07 13:40:56,079 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:55" (1/1) ... [2019-10-07 13:40:56,085 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:55" (1/1) ... [2019-10-07 13:40:56,086 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:55" (1/1) ... [2019-10-07 13:40:56,089 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 13:40:56,089 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 13:40:56,089 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 13:40:56,089 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 13:40:56,090 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:40:56,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 13:40:56,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 13:40:56,146 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-07 13:40:56,147 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 13:40:56,147 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 13:40:56,147 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-07 13:40:56,147 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 13:40:56,147 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 13:40:56,147 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 13:40:56,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 13:40:56,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 13:40:56,530 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 13:40:56,531 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-07 13:40:56,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:40:56 BoogieIcfgContainer [2019-10-07 13:40:56,532 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 13:40:56,534 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 13:40:56,534 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 13:40:56,537 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 13:40:56,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 01:40:55" (1/3) ... [2019-10-07 13:40:56,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61078ac3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:40:56, skipping insertion in model container [2019-10-07 13:40:56,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:55" (2/3) ... [2019-10-07 13:40:56,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61078ac3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:40:56, skipping insertion in model container [2019-10-07 13:40:56,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:40:56" (3/3) ... [2019-10-07 13:40:56,541 INFO L109 eAbstractionObserver]: Analyzing ICFG heapsort.i [2019-10-07 13:40:56,549 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 13:40:56,557 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 13:40:56,568 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 13:40:56,593 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 13:40:56,593 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 13:40:56,593 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 13:40:56,593 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 13:40:56,594 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 13:40:56,594 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 13:40:56,594 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 13:40:56,594 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 13:40:56,612 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2019-10-07 13:40:56,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-07 13:40:56,619 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:56,620 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:56,622 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:56,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:56,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1191516201, now seen corresponding path program 1 times [2019-10-07 13:40:56,634 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:56,635 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:56,635 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:56,635 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:56,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:56,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:56,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:40:56,844 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:56,845 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:56,845 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:40:56,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:40:56,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:40:56,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:40:56,867 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 5 states. [2019-10-07 13:40:56,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:56,992 INFO L93 Difference]: Finished difference Result 78 states and 129 transitions. [2019-10-07 13:40:56,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:40:56,995 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-10-07 13:40:56,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:57,006 INFO L225 Difference]: With dead ends: 78 [2019-10-07 13:40:57,006 INFO L226 Difference]: Without dead ends: 40 [2019-10-07 13:40:57,011 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:40:57,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-07 13:40:57,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-10-07 13:40:57,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-07 13:40:57,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2019-10-07 13:40:57,071 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 56 transitions. Word has length 13 [2019-10-07 13:40:57,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:57,072 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 56 transitions. [2019-10-07 13:40:57,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:40:57,072 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2019-10-07 13:40:57,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-07 13:40:57,073 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:57,074 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:57,074 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:57,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:57,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1186779432, now seen corresponding path program 1 times [2019-10-07 13:40:57,075 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:57,075 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:57,075 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:57,076 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:57,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:57,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:57,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:40:57,155 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:57,156 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:57,156 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:40:57,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:40:57,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:40:57,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:40:57,159 INFO L87 Difference]: Start difference. First operand 40 states and 56 transitions. Second operand 5 states. [2019-10-07 13:40:57,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:57,282 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2019-10-07 13:40:57,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:40:57,282 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-10-07 13:40:57,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:57,284 INFO L225 Difference]: With dead ends: 47 [2019-10-07 13:40:57,285 INFO L226 Difference]: Without dead ends: 45 [2019-10-07 13:40:57,287 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:40:57,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-07 13:40:57,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-10-07 13:40:57,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-07 13:40:57,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 59 transitions. [2019-10-07 13:40:57,311 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 59 transitions. Word has length 13 [2019-10-07 13:40:57,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:57,312 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 59 transitions. [2019-10-07 13:40:57,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:40:57,313 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 59 transitions. [2019-10-07 13:40:57,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-07 13:40:57,314 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:57,314 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:57,315 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:57,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:57,315 INFO L82 PathProgramCache]: Analyzing trace with hash 381238888, now seen corresponding path program 1 times [2019-10-07 13:40:57,315 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:57,316 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:57,316 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:57,316 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:57,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:57,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:57,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:40:57,404 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:57,404 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:57,404 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 13:40:57,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 13:40:57,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 13:40:57,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:40:57,406 INFO L87 Difference]: Start difference. First operand 44 states and 59 transitions. Second operand 6 states. [2019-10-07 13:40:57,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:57,673 INFO L93 Difference]: Finished difference Result 76 states and 108 transitions. [2019-10-07 13:40:57,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 13:40:57,674 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-10-07 13:40:57,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:57,676 INFO L225 Difference]: With dead ends: 76 [2019-10-07 13:40:57,676 INFO L226 Difference]: Without dead ends: 74 [2019-10-07 13:40:57,677 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-07 13:40:57,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-07 13:40:57,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 69. [2019-10-07 13:40:57,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-07 13:40:57,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 99 transitions. [2019-10-07 13:40:57,696 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 99 transitions. Word has length 13 [2019-10-07 13:40:57,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:57,696 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 99 transitions. [2019-10-07 13:40:57,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 13:40:57,696 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 99 transitions. [2019-10-07 13:40:57,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-07 13:40:57,698 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:57,698 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:57,698 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:57,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:57,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1990396420, now seen corresponding path program 1 times [2019-10-07 13:40:57,699 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:57,699 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:57,699 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:57,699 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:57,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:57,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:57,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:40:57,794 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:57,795 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:57,795 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 13:40:57,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 13:40:57,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 13:40:57,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:40:57,796 INFO L87 Difference]: Start difference. First operand 69 states and 99 transitions. Second operand 6 states. [2019-10-07 13:40:57,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:57,970 INFO L93 Difference]: Finished difference Result 76 states and 105 transitions. [2019-10-07 13:40:57,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 13:40:57,970 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-10-07 13:40:57,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:57,972 INFO L225 Difference]: With dead ends: 76 [2019-10-07 13:40:57,972 INFO L226 Difference]: Without dead ends: 74 [2019-10-07 13:40:57,973 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-07 13:40:57,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-07 13:40:57,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-10-07 13:40:57,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-07 13:40:57,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 102 transitions. [2019-10-07 13:40:57,989 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 102 transitions. Word has length 18 [2019-10-07 13:40:57,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:57,990 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 102 transitions. [2019-10-07 13:40:57,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 13:40:57,990 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 102 transitions. [2019-10-07 13:40:57,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-07 13:40:57,991 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:57,991 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:57,992 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:57,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:57,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1609033957, now seen corresponding path program 1 times [2019-10-07 13:40:57,992 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:57,992 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:57,993 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:57,993 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:57,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:58,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:58,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:40:58,075 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:58,076 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:58,076 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:40:58,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:40:58,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:40:58,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:40:58,077 INFO L87 Difference]: Start difference. First operand 73 states and 102 transitions. Second operand 5 states. [2019-10-07 13:40:58,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:58,149 INFO L93 Difference]: Finished difference Result 79 states and 107 transitions. [2019-10-07 13:40:58,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:40:58,150 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-07 13:40:58,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:58,151 INFO L225 Difference]: With dead ends: 79 [2019-10-07 13:40:58,152 INFO L226 Difference]: Without dead ends: 77 [2019-10-07 13:40:58,152 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:40:58,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-07 13:40:58,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-10-07 13:40:58,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-07 13:40:58,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 105 transitions. [2019-10-07 13:40:58,167 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 105 transitions. Word has length 18 [2019-10-07 13:40:58,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:58,168 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 105 transitions. [2019-10-07 13:40:58,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:40:58,168 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 105 transitions. [2019-10-07 13:40:58,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-07 13:40:58,169 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:58,169 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:58,170 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:58,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:58,170 INFO L82 PathProgramCache]: Analyzing trace with hash -915397493, now seen corresponding path program 1 times [2019-10-07 13:40:58,170 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:58,170 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:58,171 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:58,171 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:58,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:58,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:58,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:40:58,230 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:58,230 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:58,230 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 13:40:58,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 13:40:58,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 13:40:58,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:40:58,231 INFO L87 Difference]: Start difference. First operand 77 states and 105 transitions. Second operand 6 states. [2019-10-07 13:40:58,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:58,387 INFO L93 Difference]: Finished difference Result 83 states and 110 transitions. [2019-10-07 13:40:58,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 13:40:58,387 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-10-07 13:40:58,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:58,389 INFO L225 Difference]: With dead ends: 83 [2019-10-07 13:40:58,389 INFO L226 Difference]: Without dead ends: 81 [2019-10-07 13:40:58,390 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-07 13:40:58,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-10-07 13:40:58,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-10-07 13:40:58,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-07 13:40:58,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 108 transitions. [2019-10-07 13:40:58,410 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 108 transitions. Word has length 18 [2019-10-07 13:40:58,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:58,411 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 108 transitions. [2019-10-07 13:40:58,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 13:40:58,411 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 108 transitions. [2019-10-07 13:40:58,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-07 13:40:58,412 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:58,414 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:58,414 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:58,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:58,415 INFO L82 PathProgramCache]: Analyzing trace with hash -742213082, now seen corresponding path program 1 times [2019-10-07 13:40:58,416 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:58,416 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:58,416 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:58,416 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:58,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:58,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:58,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:40:58,524 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:58,524 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:58,524 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-07 13:40:58,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 13:40:58,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 13:40:58,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:40:58,531 INFO L87 Difference]: Start difference. First operand 81 states and 108 transitions. Second operand 7 states. [2019-10-07 13:40:58,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:58,752 INFO L93 Difference]: Finished difference Result 122 states and 169 transitions. [2019-10-07 13:40:58,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 13:40:58,753 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-10-07 13:40:58,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:58,756 INFO L225 Difference]: With dead ends: 122 [2019-10-07 13:40:58,756 INFO L226 Difference]: Without dead ends: 120 [2019-10-07 13:40:58,757 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-07 13:40:58,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-10-07 13:40:58,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 105. [2019-10-07 13:40:58,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-10-07 13:40:58,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 144 transitions. [2019-10-07 13:40:58,779 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 144 transitions. Word has length 18 [2019-10-07 13:40:58,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:58,779 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 144 transitions. [2019-10-07 13:40:58,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 13:40:58,780 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 144 transitions. [2019-10-07 13:40:58,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-07 13:40:58,781 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:58,781 INFO L385 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:58,781 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:58,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:58,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1815138482, now seen corresponding path program 1 times [2019-10-07 13:40:58,782 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:58,782 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:58,783 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:58,783 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:58,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:58,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:58,840 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 13:40:58,840 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:58,841 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:58,841 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 13:40:58,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 13:40:58,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 13:40:58,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:40:58,843 INFO L87 Difference]: Start difference. First operand 105 states and 144 transitions. Second operand 6 states. [2019-10-07 13:40:58,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:58,990 INFO L93 Difference]: Finished difference Result 157 states and 229 transitions. [2019-10-07 13:40:58,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 13:40:58,990 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-10-07 13:40:58,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:58,994 INFO L225 Difference]: With dead ends: 157 [2019-10-07 13:40:58,994 INFO L226 Difference]: Without dead ends: 155 [2019-10-07 13:40:58,995 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-07 13:40:58,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-10-07 13:40:59,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 123. [2019-10-07 13:40:59,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-10-07 13:40:59,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 173 transitions. [2019-10-07 13:40:59,016 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 173 transitions. Word has length 25 [2019-10-07 13:40:59,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:59,017 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 173 transitions. [2019-10-07 13:40:59,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 13:40:59,017 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 173 transitions. [2019-10-07 13:40:59,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-07 13:40:59,018 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:59,018 INFO L385 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:59,019 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:59,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:59,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1476054722, now seen corresponding path program 1 times [2019-10-07 13:40:59,019 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:59,019 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:59,020 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:59,020 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:59,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:59,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:59,091 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 13:40:59,091 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:59,092 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:59,092 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-07 13:40:59,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 13:40:59,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 13:40:59,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:40:59,094 INFO L87 Difference]: Start difference. First operand 123 states and 173 transitions. Second operand 7 states. [2019-10-07 13:40:59,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:59,249 INFO L93 Difference]: Finished difference Result 130 states and 179 transitions. [2019-10-07 13:40:59,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 13:40:59,249 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-10-07 13:40:59,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:59,251 INFO L225 Difference]: With dead ends: 130 [2019-10-07 13:40:59,251 INFO L226 Difference]: Without dead ends: 128 [2019-10-07 13:40:59,252 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-10-07 13:40:59,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-10-07 13:40:59,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 87. [2019-10-07 13:40:59,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-10-07 13:40:59,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 108 transitions. [2019-10-07 13:40:59,266 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 108 transitions. Word has length 27 [2019-10-07 13:40:59,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:59,266 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 108 transitions. [2019-10-07 13:40:59,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 13:40:59,266 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 108 transitions. [2019-10-07 13:40:59,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-07 13:40:59,268 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:59,268 INFO L385 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:59,268 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:59,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:59,268 INFO L82 PathProgramCache]: Analyzing trace with hash -388432127, now seen corresponding path program 1 times [2019-10-07 13:40:59,269 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:59,269 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:59,269 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:59,269 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:59,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:59,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:59,340 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-07 13:40:59,341 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:59,341 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:59,341 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-07 13:40:59,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 13:40:59,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 13:40:59,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:40:59,342 INFO L87 Difference]: Start difference. First operand 87 states and 108 transitions. Second operand 7 states. [2019-10-07 13:40:59,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:59,499 INFO L93 Difference]: Finished difference Result 102 states and 127 transitions. [2019-10-07 13:40:59,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 13:40:59,501 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-10-07 13:40:59,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:59,502 INFO L225 Difference]: With dead ends: 102 [2019-10-07 13:40:59,503 INFO L226 Difference]: Without dead ends: 100 [2019-10-07 13:40:59,503 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-07 13:40:59,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-10-07 13:40:59,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 91. [2019-10-07 13:40:59,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-10-07 13:40:59,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2019-10-07 13:40:59,516 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 111 transitions. Word has length 30 [2019-10-07 13:40:59,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:59,516 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 111 transitions. [2019-10-07 13:40:59,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 13:40:59,516 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2019-10-07 13:40:59,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-07 13:40:59,518 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:59,518 INFO L385 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:59,518 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:59,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:59,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1762875004, now seen corresponding path program 1 times [2019-10-07 13:40:59,519 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:59,519 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:59,519 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:59,519 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:59,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:59,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:59,593 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-07 13:40:59,593 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:59,594 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:59,594 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-07 13:40:59,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-07 13:40:59,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-07 13:40:59,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-10-07 13:40:59,595 INFO L87 Difference]: Start difference. First operand 91 states and 111 transitions. Second operand 8 states. [2019-10-07 13:41:00,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:41:00,124 INFO L93 Difference]: Finished difference Result 161 states and 212 transitions. [2019-10-07 13:41:00,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-07 13:41:00,125 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2019-10-07 13:41:00,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:41:00,127 INFO L225 Difference]: With dead ends: 161 [2019-10-07 13:41:00,127 INFO L226 Difference]: Without dead ends: 159 [2019-10-07 13:41:00,128 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-07 13:41:00,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-10-07 13:41:00,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 153. [2019-10-07 13:41:00,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-10-07 13:41:00,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 202 transitions. [2019-10-07 13:41:00,147 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 202 transitions. Word has length 39 [2019-10-07 13:41:00,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:41:00,148 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 202 transitions. [2019-10-07 13:41:00,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-07 13:41:00,148 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 202 transitions. [2019-10-07 13:41:00,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-07 13:41:00,149 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:41:00,150 INFO L385 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:41:00,150 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:41:00,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:41:00,150 INFO L82 PathProgramCache]: Analyzing trace with hash -696616044, now seen corresponding path program 1 times [2019-10-07 13:41:00,150 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:41:00,151 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:41:00,151 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:41:00,151 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:41:00,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:41:00,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:41:00,197 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-07 13:41:00,198 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:41:00,198 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:41:00,198 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 13:41:00,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 13:41:00,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 13:41:00,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:41:00,199 INFO L87 Difference]: Start difference. First operand 153 states and 202 transitions. Second operand 6 states. [2019-10-07 13:41:00,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:41:00,335 INFO L93 Difference]: Finished difference Result 235 states and 338 transitions. [2019-10-07 13:41:00,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 13:41:00,336 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-10-07 13:41:00,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:41:00,338 INFO L225 Difference]: With dead ends: 235 [2019-10-07 13:41:00,338 INFO L226 Difference]: Without dead ends: 233 [2019-10-07 13:41:00,339 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-07 13:41:00,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-10-07 13:41:00,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 210. [2019-10-07 13:41:00,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-10-07 13:41:00,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 297 transitions. [2019-10-07 13:41:00,367 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 297 transitions. Word has length 46 [2019-10-07 13:41:00,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:41:00,368 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 297 transitions. [2019-10-07 13:41:00,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 13:41:00,368 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 297 transitions. [2019-10-07 13:41:00,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-07 13:41:00,370 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:41:00,370 INFO L385 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:41:00,370 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:41:00,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:41:00,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1730536098, now seen corresponding path program 1 times [2019-10-07 13:41:00,371 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:41:00,371 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:41:00,371 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:41:00,371 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:41:00,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:41:00,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:41:00,448 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-07 13:41:00,448 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:41:00,449 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:41:00,449 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 13:41:00,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 13:41:00,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 13:41:00,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-10-07 13:41:00,450 INFO L87 Difference]: Start difference. First operand 210 states and 297 transitions. Second operand 9 states. [2019-10-07 13:41:00,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:41:00,896 INFO L93 Difference]: Finished difference Result 570 states and 888 transitions. [2019-10-07 13:41:00,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 13:41:00,896 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-10-07 13:41:00,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:41:00,901 INFO L225 Difference]: With dead ends: 570 [2019-10-07 13:41:00,901 INFO L226 Difference]: Without dead ends: 568 [2019-10-07 13:41:00,903 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-10-07 13:41:00,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-10-07 13:41:00,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 497. [2019-10-07 13:41:00,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2019-10-07 13:41:00,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 774 transitions. [2019-10-07 13:41:00,972 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 774 transitions. Word has length 53 [2019-10-07 13:41:00,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:41:00,973 INFO L462 AbstractCegarLoop]: Abstraction has 497 states and 774 transitions. [2019-10-07 13:41:00,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 13:41:00,973 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 774 transitions. [2019-10-07 13:41:00,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-07 13:41:00,975 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:41:00,976 INFO L385 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:41:00,976 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:41:00,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:41:00,976 INFO L82 PathProgramCache]: Analyzing trace with hash -589963654, now seen corresponding path program 1 times [2019-10-07 13:41:00,977 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:41:00,977 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:41:00,977 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:41:00,977 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:41:00,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:41:00,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:41:01,042 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-07 13:41:01,042 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:41:01,042 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:41:01,042 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-07 13:41:01,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 13:41:01,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 13:41:01,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:41:01,043 INFO L87 Difference]: Start difference. First operand 497 states and 774 transitions. Second operand 7 states. [2019-10-07 13:41:01,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:41:01,263 INFO L93 Difference]: Finished difference Result 691 states and 1114 transitions. [2019-10-07 13:41:01,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-07 13:41:01,263 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2019-10-07 13:41:01,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:41:01,270 INFO L225 Difference]: With dead ends: 691 [2019-10-07 13:41:01,270 INFO L226 Difference]: Without dead ends: 689 [2019-10-07 13:41:01,271 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-10-07 13:41:01,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2019-10-07 13:41:01,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 561. [2019-10-07 13:41:01,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2019-10-07 13:41:01,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 885 transitions. [2019-10-07 13:41:01,361 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 885 transitions. Word has length 60 [2019-10-07 13:41:01,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:41:01,362 INFO L462 AbstractCegarLoop]: Abstraction has 561 states and 885 transitions. [2019-10-07 13:41:01,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 13:41:01,362 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 885 transitions. [2019-10-07 13:41:01,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-07 13:41:01,364 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:41:01,364 INFO L385 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:41:01,365 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:41:01,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:41:01,365 INFO L82 PathProgramCache]: Analyzing trace with hash -751656022, now seen corresponding path program 1 times [2019-10-07 13:41:01,365 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:41:01,365 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:41:01,365 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:41:01,366 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:41:01,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:41:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:41:01,422 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-07 13:41:01,423 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:41:01,423 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:41:01,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:41:01,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:41:01,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-07 13:41:01,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:41:01,555 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-10-07 13:41:01,555 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:41:01,674 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-07 13:41:01,675 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 13:41:01,675 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 5] total 12 [2019-10-07 13:41:01,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:41:01,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:41:01,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-10-07 13:41:01,678 INFO L87 Difference]: Start difference. First operand 561 states and 885 transitions. Second operand 5 states. [2019-10-07 13:41:01,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:41:01,922 INFO L93 Difference]: Finished difference Result 1210 states and 1913 transitions. [2019-10-07 13:41:01,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:41:01,922 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-10-07 13:41:01,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:41:01,928 INFO L225 Difference]: With dead ends: 1210 [2019-10-07 13:41:01,928 INFO L226 Difference]: Without dead ends: 673 [2019-10-07 13:41:01,936 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-10-07 13:41:01,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2019-10-07 13:41:02,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 579. [2019-10-07 13:41:02,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-10-07 13:41:02,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 903 transitions. [2019-10-07 13:41:02,056 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 903 transitions. Word has length 60 [2019-10-07 13:41:02,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:41:02,058 INFO L462 AbstractCegarLoop]: Abstraction has 579 states and 903 transitions. [2019-10-07 13:41:02,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:41:02,058 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 903 transitions. [2019-10-07 13:41:02,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-07 13:41:02,061 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:41:02,061 INFO L385 BasicCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:41:02,265 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:41:02,266 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:41:02,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:41:02,267 INFO L82 PathProgramCache]: Analyzing trace with hash -678920824, now seen corresponding path program 1 times [2019-10-07 13:41:02,267 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:41:02,267 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:41:02,267 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:41:02,267 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:41:02,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:41:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:41:02,348 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-10-07 13:41:02,349 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:41:02,349 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:41:02,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:41:02,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:41:02,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-07 13:41:02,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:41:02,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:41:02,506 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-10-07 13:41:02,506 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:41:02,623 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-10-07 13:41:02,623 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:41:02,661 INFO L162 IcfgInterpreter]: Started Sifa with 29 locations of interest [2019-10-07 13:41:02,662 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:41:02,668 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:41:02,676 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:41:02,676 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:41:02,729 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-07 13:42:04,941 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 9 for LOIs [2019-10-07 13:42:04,954 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-07 13:42:04,956 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:42:04,956 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:42:04,956 INFO L193 IcfgInterpreter]: Reachable states at location L4-2 satisfy 17261#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (<= 0 |__VERIFIER_assert_#in~cond|) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (<= 0 |__VERIFIER_assert_#in~cond|) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-07 13:42:04,957 INFO L193 IcfgInterpreter]: Reachable states at location L45-1 satisfy 55#(and (<= 1 main_~n~0) (<= main_~n~0 1000000) (<= 0 main_~r~0) (<= main_~r~0 1000000)) [2019-10-07 13:42:04,957 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 17270#true [2019-10-07 13:42:04,957 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 17266#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (<= 0 |__VERIFIER_assert_#in~cond|) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (<= 0 |__VERIFIER_assert_#in~cond|) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-07 13:42:04,957 INFO L193 IcfgInterpreter]: Reachable states at location L34 satisfy 16852#(and (<= 1 main_~j~0) (<= main_~j~0 1000000) (<= 1 main_~n~0) (<= main_~n~0 1000000) (<= main_~r~0 1000000) (<= 1 main_~r~0)) [2019-10-07 13:42:04,958 INFO L193 IcfgInterpreter]: Reachable states at location L25-1 satisfy 16821#(and (<= 1 main_~j~0) (<= main_~j~0 1000000) (<= 1 main_~n~0) (<= main_~n~0 1000000) (<= main_~r~0 1000000) (<= 1 main_~r~0)) [2019-10-07 13:42:04,958 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 16739#(and (<= main_~j~0 1000000) (<= 1 main_~n~0) (<= main_~n~0 1000000) (<= main_~r~0 1000000) (<= 1 main_~r~0)) [2019-10-07 13:42:04,958 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 17246#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (or (and (<= __VERIFIER_assert_~cond 0) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1)))) [2019-10-07 13:42:04,958 INFO L193 IcfgInterpreter]: Reachable states at location L38-1 satisfy 16878#(and (<= 1 main_~i~0) (<= 1 main_~j~0) (<= main_~j~0 1000000) (<= 1 main_~n~0) (<= main_~n~0 1000000) (<= main_~r~0 1000000) (<= 1 main_~r~0)) [2019-10-07 13:42:04,958 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-07 13:42:04,959 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-07 13:42:04,959 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 16772#(and (<= 1 main_~j~0) (<= main_~j~0 1000000) (<= main_~j~0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 1000000) (<= main_~r~0 1000000) (<= 1 main_~r~0)) [2019-10-07 13:42:04,959 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 16866#(and (<= 1 main_~j~0) (<= main_~j~0 1000000) (<= 1 main_~n~0) (<= main_~n~0 1000000) (<= main_~r~0 1000000) (<= 1 main_~r~0)) [2019-10-07 13:42:04,960 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 17256#(and (<= __VERIFIER_assert_~cond 0) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:42:04,960 INFO L193 IcfgInterpreter]: Reachable states at location L29 satisfy 16812#(and (<= 0 main_~j~0) (<= 1 main_~j~0) (<= (+ main_~j~0 1) main_~n~0) (<= main_~j~0 main_~n~0) (<= main_~j~0 1000000) (<= 2 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 1000000) (<= main_~r~0 1000000) (<= 1 main_~r~0) (<= main_~j~0 999999)) [2019-10-07 13:42:04,960 INFO L193 IcfgInterpreter]: Reachable states at location L40 satisfy 16918#(and (<= 1 main_~i~0) (<= main_~i~0 1000000) (<= 1 main_~j~0) (<= main_~j~0 1000000) (<= 1 main_~n~0) (<= main_~n~0 1000000) (<= main_~r~0 1000000) (<= 1 main_~r~0)) [2019-10-07 13:42:04,960 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 17251#(and (<= __VERIFIER_assert_~cond 0) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:42:04,961 INFO L193 IcfgInterpreter]: Reachable states at location L24-2 satisfy 17237#(and (<= 1 main_~n~0) (<= main_~n~0 1000000) (<= main_~r~0 1000000) (<= 1 main_~r~0)) [2019-10-07 13:42:04,961 INFO L193 IcfgInterpreter]: Reachable states at location L33 satisfy 16840#(and (<= 1 main_~j~0) (<= main_~j~0 1000000) (<= 1 main_~n~0) (<= main_~n~0 1000000) (<= main_~r~0 1000000) (<= 1 main_~r~0)) [2019-10-07 13:42:04,961 INFO L193 IcfgInterpreter]: Reachable states at location L13 satisfy 38#(and (<= main_~n~0 2147483647) (= |main_#in~argc| main_~argc) (= |main_#in~argv.offset| main_~argv.offset) (= |main_#in~argv.base| main_~argv.base) (<= 0 (+ main_~n~0 2147483648))) [2019-10-07 13:42:04,962 INFO L193 IcfgInterpreter]: Reachable states at location L35 satisfy 16861#(and (<= 0 (+ |main_#t~nondet5| 2147483648)) (<= 1 main_~j~0) (<= |main_#t~nondet5| 2147483647) (<= main_~j~0 1000000) (<= 1 main_~n~0) (<= main_~n~0 1000000) (<= main_~r~0 1000000) (<= 1 main_~r~0)) [2019-10-07 13:42:04,962 INFO L193 IcfgInterpreter]: Reachable states at location L26-1 satisfy 16756#(and (<= 1 main_~j~0) (<= main_~j~0 1000000) (<= 1 main_~n~0) (<= main_~n~0 1000000) (<= main_~r~0 1000000) (<= 1 main_~r~0)) [2019-10-07 13:42:04,962 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 16744#(and (<= main_~j~0 1000000) (<= 1 main_~n~0) (<= main_~n~0 1000000) (<= main_~r~0 1000000) (<= 1 main_~r~0)) [2019-10-07 13:42:04,962 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 17275#true [2019-10-07 13:42:04,962 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:42:04,962 INFO L193 IcfgInterpreter]: Reachable states at location L28 satisfy 16788#(and (<= 0 main_~j~0) (<= 1 main_~j~0) (<= main_~j~0 main_~n~0) (<= main_~j~0 1000000) (<= 1 main_~n~0) (<= main_~n~0 1000000) (<= main_~r~0 1000000) (<= 1 main_~r~0)) [2019-10-07 13:42:04,963 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 16894#(and (<= 1 main_~i~0) (<= main_~i~0 1000000) (<= 1 main_~j~0) (<= main_~j~0 1000000) (<= 1 main_~n~0) (<= main_~n~0 1000000) (<= main_~r~0 1000000) (<= 1 main_~r~0)) [2019-10-07 13:42:04,963 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 17241#(and (or (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)))) [2019-10-07 13:42:04,963 INFO L193 IcfgInterpreter]: Reachable states at location L41 satisfy 17232#(and (<= 1 main_~i~0) (<= main_~i~0 1000000) (<= 1 main_~j~0) (<= main_~j~0 main_~n~0) (<= main_~j~0 1000000) (<= 1 main_~n~0) (<= main_~n~0 1000000) (<= main_~r~0 1000000) (<= 1 main_~r~0)) [2019-10-07 13:42:05,427 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:42:05,428 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 16] total 27 [2019-10-07 13:42:05,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-07 13:42:05,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-07 13:42:05,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=582, Unknown=0, NotChecked=0, Total=702 [2019-10-07 13:42:05,430 INFO L87 Difference]: Start difference. First operand 579 states and 903 transitions. Second operand 27 states. [2019-10-07 13:42:06,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:42:06,976 INFO L93 Difference]: Finished difference Result 675 states and 1045 transitions. [2019-10-07 13:42:06,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-07 13:42:06,977 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 81 [2019-10-07 13:42:06,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:42:06,978 INFO L225 Difference]: With dead ends: 675 [2019-10-07 13:42:06,978 INFO L226 Difference]: Without dead ends: 0 [2019-10-07 13:42:06,983 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 221 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=380, Invalid=1342, Unknown=0, NotChecked=0, Total=1722 [2019-10-07 13:42:06,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-07 13:42:06,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-07 13:42:06,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-07 13:42:06,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-07 13:42:06,985 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 81 [2019-10-07 13:42:06,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:42:06,985 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-07 13:42:06,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-07 13:42:06,986 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-07 13:42:06,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-07 13:42:07,199 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:42:07,204 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-07 13:42:07,401 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 126 [2019-10-07 13:42:07,562 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 126 [2019-10-07 13:42:08,012 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 141 [2019-10-07 13:42:08,166 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 75 [2019-10-07 13:42:08,379 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 141 [2019-10-07 13:42:09,208 WARN L191 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 44 [2019-10-07 13:42:09,843 WARN L191 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 44 [2019-10-07 13:42:10,113 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2019-10-07 13:42:10,858 WARN L191 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 44 [2019-10-07 13:42:11,057 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2019-10-07 13:42:11,619 WARN L191 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 44 [2019-10-07 13:42:11,750 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2019-10-07 13:42:11,760 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-07 13:42:11,760 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:42:11,760 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:42:11,760 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-07 13:42:11,760 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-07 13:42:11,760 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-07 13:42:11,761 INFO L439 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (let ((.cse0 (* 2 main_~n~0))) (and (<= 2 main_~j~0) (<= (+ main_~i~0 1) main_~n~0) (<= 1 main_~l~0) (= |main_#in~argv.base| main_~argv.base) (<= (+ main_~j~0 1) main_~n~0) (<= main_~n~0 1000000) (<= (+ (* 2 main_~i~0) main_~r~0 1) (+ main_~j~0 .cse0)) (= |main_#in~argc| main_~argc) (<= (+ (* 2 main_~l~0) main_~r~0) .cse0) (= |main_#in~argv.offset| main_~argv.offset) (<= main_~r~0 main_~n~0) (<= 2 main_~r~0) (<= (div (- main_~j~0) (- 2)) main_~i~0))) [2019-10-07 13:42:11,761 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 56) no Hoare annotation was computed. [2019-10-07 13:42:11,761 INFO L439 ceAbstractionStarter]: At program point L40(line 40) the Hoare annotation is: (let ((.cse0 (* 2 main_~n~0))) (and (<= 2 main_~j~0) (<= (+ main_~i~0 1) main_~n~0) (<= 1 main_~l~0) (= |main_#in~argv.base| main_~argv.base) (<= main_~j~0 main_~n~0) (<= main_~n~0 1000000) (<= (+ (* 2 main_~i~0) main_~r~0 1) (+ main_~j~0 .cse0)) (<= 1 main_~i~0) (= |main_#in~argc| main_~argc) (<= (+ (* 2 main_~l~0) main_~r~0) .cse0) (= |main_#in~argv.offset| main_~argv.offset) (<= main_~r~0 main_~n~0) (<= 2 main_~r~0))) [2019-10-07 13:42:11,761 INFO L439 ceAbstractionStarter]: At program point L28(line 28) the Hoare annotation is: (let ((.cse0 (* 2 main_~n~0))) (and (<= 2 main_~j~0) (<= (+ main_~i~0 1) main_~n~0) (<= 1 main_~l~0) (= |main_#in~argv.base| main_~argv.base) (<= (+ main_~j~0 1) main_~n~0) (<= main_~n~0 1000000) (<= (+ (* 2 main_~i~0) main_~r~0 1) (+ main_~j~0 .cse0)) (= |main_#in~argc| main_~argc) (<= (+ (* 2 main_~l~0) main_~r~0) .cse0) (= |main_#in~argv.offset| main_~argv.offset) (<= main_~r~0 main_~n~0) (<= 2 main_~r~0) (<= (div (- main_~j~0) (- 2)) main_~i~0))) [2019-10-07 13:42:11,761 INFO L439 ceAbstractionStarter]: At program point L24-2(lines 24 44) the Hoare annotation is: (let ((.cse0 (* 2 main_~n~0))) (and (<= 2 main_~j~0) (<= 1 main_~l~0) (= |main_#in~argc| main_~argc) (<= (+ (* 2 main_~l~0) main_~r~0) .cse0) (= |main_#in~argv.offset| main_~argv.offset) (= |main_#in~argv.base| main_~argv.base) (<= main_~r~0 main_~n~0) (<= main_~n~0 1000000) (<= (+ (* 2 main_~i~0) main_~r~0 1) (+ main_~j~0 .cse0)) (<= 2 main_~r~0) (<= (div (- main_~j~0) (- 2)) main_~i~0))) [2019-10-07 13:42:11,761 INFO L443 ceAbstractionStarter]: For program point L24-3(lines 21 54) no Hoare annotation was computed. [2019-10-07 13:42:11,762 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 10 56) no Hoare annotation was computed. [2019-10-07 13:42:11,762 INFO L443 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2019-10-07 13:42:11,762 INFO L439 ceAbstractionStarter]: At program point L33(line 33) the Hoare annotation is: (let ((.cse0 (* 2 main_~n~0))) (and (<= 2 main_~j~0) (<= (+ main_~i~0 1) main_~n~0) (<= 1 main_~l~0) (= |main_#in~argv.base| main_~argv.base) (<= main_~j~0 main_~n~0) (<= main_~n~0 1000000) (<= (+ (* 2 main_~i~0) main_~r~0 1) (+ main_~j~0 .cse0)) (<= 1 main_~i~0) (= |main_#in~argc| main_~argc) (<= (+ (* 2 main_~l~0) main_~r~0) .cse0) (= |main_#in~argv.offset| main_~argv.offset) (<= main_~r~0 main_~n~0) (<= 2 main_~r~0))) [2019-10-07 13:42:11,762 INFO L443 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2019-10-07 13:42:11,762 INFO L443 ceAbstractionStarter]: For program point L25(lines 25 32) no Hoare annotation was computed. [2019-10-07 13:42:11,762 INFO L439 ceAbstractionStarter]: At program point L25-1(lines 25 32) the Hoare annotation is: (let ((.cse0 (* 2 main_~n~0))) (and (<= 2 main_~j~0) (<= (+ main_~i~0 1) main_~n~0) (<= 1 main_~l~0) (= |main_#in~argv.base| main_~argv.base) (<= main_~j~0 main_~n~0) (<= main_~n~0 1000000) (<= (+ (* 2 main_~i~0) main_~r~0 1) (+ main_~j~0 .cse0)) (<= 1 main_~i~0) (= |main_#in~argc| main_~argc) (<= (+ (* 2 main_~l~0) main_~r~0) .cse0) (= |main_#in~argv.offset| main_~argv.offset) (<= main_~r~0 main_~n~0) (<= 2 main_~r~0))) [2019-10-07 13:42:11,763 INFO L439 ceAbstractionStarter]: At program point L50(line 50) the Hoare annotation is: (let ((.cse5 (<= 2 main_~r~0)) (.cse4 (let ((.cse6 (* 2 main_~n~0))) (and (<= 2 main_~j~0) (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) main_~r~0) .cse6) (<= (+ main_~l~0 1) main_~n~0) (<= main_~r~0 main_~n~0) (<= (+ (* 2 main_~i~0) main_~r~0 1) (+ main_~j~0 .cse6))))) (.cse0 (= |main_#in~argc| main_~argc)) (.cse1 (= |main_#in~argv.offset| main_~argv.offset)) (.cse2 (= |main_#in~argv.base| main_~argv.base)) (.cse3 (<= main_~n~0 1000000))) (or (and (<= 1 main_~i~0) .cse0 .cse1 .cse2 .cse3 (and .cse4 (<= main_~j~0 main_~n~0)) .cse5) (and (and .cse5 .cse4) .cse0 .cse1 .cse2 .cse3 (<= (div (- main_~j~0) (- 2)) main_~i~0)))) [2019-10-07 13:42:11,763 INFO L439 ceAbstractionStarter]: At program point L50-1(line 50) the Hoare annotation is: (let ((.cse5 (<= 2 main_~r~0)) (.cse4 (let ((.cse6 (* 2 main_~n~0))) (and (<= 2 main_~j~0) (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) main_~r~0) .cse6) (<= (+ main_~l~0 1) main_~n~0) (<= main_~r~0 main_~n~0) (<= (+ (* 2 main_~i~0) main_~r~0 1) (+ main_~j~0 .cse6))))) (.cse0 (= |main_#in~argc| main_~argc)) (.cse1 (= |main_#in~argv.offset| main_~argv.offset)) (.cse2 (= |main_#in~argv.base| main_~argv.base)) (.cse3 (<= main_~n~0 1000000))) (or (and (<= 1 main_~i~0) .cse0 .cse1 .cse2 .cse3 (and .cse4 (<= main_~j~0 main_~n~0)) .cse5) (and (and .cse5 .cse4) .cse0 .cse1 .cse2 .cse3 (<= (div (- main_~j~0) (- 2)) main_~i~0)))) [2019-10-07 13:42:11,763 INFO L439 ceAbstractionStarter]: At program point L46(line 46) the Hoare annotation is: (let ((.cse0 (= |main_#in~argc| main_~argc)) (.cse1 (= |main_#in~argv.offset| main_~argv.offset)) (.cse4 (= |main_#in~argv.base| main_~argv.base)) (.cse5 (<= main_~n~0 1000000)) (.cse3 (<= 2 main_~l~0)) (.cse2 (let ((.cse6 (* 2 main_~n~0))) (and (<= 2 main_~j~0) (<= (+ (* 2 main_~i~0) main_~r~0 1) (+ main_~j~0 .cse6)) (and (<= (+ (* 2 main_~l~0) main_~r~0) .cse6) (<= main_~r~0 main_~n~0) (<= 1 main_~l~0) (<= 2 main_~r~0)))))) (or (and .cse0 .cse1 (and .cse2 .cse3) .cse4 .cse5 (<= (div (- main_~j~0) (- 2)) main_~i~0)) (and (<= 1 main_~i~0) .cse0 .cse1 .cse4 (<= main_~j~0 main_~n~0) .cse5 (and .cse3 .cse2)))) [2019-10-07 13:42:11,763 INFO L443 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2019-10-07 13:42:11,764 INFO L439 ceAbstractionStarter]: At program point L46-1(line 46) the Hoare annotation is: (let ((.cse0 (= |main_#in~argc| main_~argc)) (.cse1 (= |main_#in~argv.offset| main_~argv.offset)) (.cse4 (= |main_#in~argv.base| main_~argv.base)) (.cse5 (<= main_~n~0 1000000)) (.cse3 (<= 2 main_~l~0)) (.cse2 (let ((.cse6 (* 2 main_~n~0))) (and (<= 2 main_~j~0) (<= (+ (* 2 main_~i~0) main_~r~0 1) (+ main_~j~0 .cse6)) (and (<= (+ (* 2 main_~l~0) main_~r~0) .cse6) (<= main_~r~0 main_~n~0) (<= 1 main_~l~0) (<= 2 main_~r~0)))))) (or (and .cse0 .cse1 (and .cse2 .cse3) .cse4 .cse5 (<= (div (- main_~j~0) (- 2)) main_~i~0)) (and (<= 1 main_~i~0) .cse0 .cse1 .cse4 (<= main_~j~0 main_~n~0) .cse5 (and .cse3 .cse2)))) [2019-10-07 13:42:11,764 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 56) no Hoare annotation was computed. [2019-10-07 13:42:11,764 INFO L439 ceAbstractionStarter]: At program point L38(line 38) the Hoare annotation is: (let ((.cse0 (* 2 main_~n~0))) (and (<= 2 main_~j~0) (<= (+ main_~i~0 1) main_~n~0) (<= 1 main_~l~0) (= |main_#in~argv.base| main_~argv.base) (<= main_~j~0 main_~n~0) (<= main_~n~0 1000000) (<= (+ (* 2 main_~i~0) main_~r~0 1) (+ main_~j~0 .cse0)) (<= 1 main_~i~0) (= |main_#in~argc| main_~argc) (<= (+ (* 2 main_~l~0) main_~r~0) .cse0) (= |main_#in~argv.offset| main_~argv.offset) (<= main_~r~0 main_~n~0) (<= 2 main_~r~0))) [2019-10-07 13:42:11,764 INFO L439 ceAbstractionStarter]: At program point L38-1(line 38) the Hoare annotation is: (let ((.cse0 (* 2 main_~n~0))) (and (<= 2 main_~j~0) (<= (+ main_~i~0 1) main_~n~0) (<= 1 main_~l~0) (= |main_#in~argv.base| main_~argv.base) (<= main_~j~0 main_~n~0) (<= main_~n~0 1000000) (<= (+ (* 2 main_~i~0) main_~r~0 1) (+ main_~j~0 .cse0)) (<= 1 main_~i~0) (= |main_#in~argc| main_~argc) (<= (+ (* 2 main_~l~0) main_~r~0) .cse0) (= |main_#in~argv.offset| main_~argv.offset) (<= main_~r~0 main_~n~0) (<= 2 main_~r~0))) [2019-10-07 13:42:11,764 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-10-07 13:42:11,764 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 56) the Hoare annotation is: true [2019-10-07 13:42:11,765 INFO L439 ceAbstractionStarter]: At program point L26(line 26) the Hoare annotation is: (let ((.cse0 (* 2 main_~n~0))) (and (<= 2 main_~j~0) (<= (+ main_~i~0 1) main_~n~0) (<= 1 main_~l~0) (= |main_#in~argv.base| main_~argv.base) (<= (+ main_~j~0 1) main_~n~0) (<= main_~n~0 1000000) (<= (+ (* 2 main_~i~0) main_~r~0 1) (+ main_~j~0 .cse0)) (= |main_#in~argc| main_~argc) (<= (+ (* 2 main_~l~0) main_~r~0) .cse0) (= |main_#in~argv.offset| main_~argv.offset) (<= main_~r~0 main_~n~0) (<= 2 main_~r~0) (<= (div (- main_~j~0) (- 2)) main_~i~0))) [2019-10-07 13:42:11,765 INFO L439 ceAbstractionStarter]: At program point L26-1(line 26) the Hoare annotation is: (let ((.cse0 (* 2 main_~n~0))) (and (<= 2 main_~j~0) (<= (+ main_~i~0 1) main_~n~0) (<= 1 main_~l~0) (= |main_#in~argv.base| main_~argv.base) (<= (+ main_~j~0 1) main_~n~0) (<= main_~n~0 1000000) (<= (+ (* 2 main_~i~0) main_~r~0 1) (+ main_~j~0 .cse0)) (= |main_#in~argc| main_~argc) (<= (+ (* 2 main_~l~0) main_~r~0) .cse0) (= |main_#in~argv.offset| main_~argv.offset) (<= main_~r~0 main_~n~0) (<= 2 main_~r~0) (<= (div (- main_~j~0) (- 2)) main_~i~0))) [2019-10-07 13:42:11,765 INFO L443 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-10-07 13:42:11,765 INFO L443 ceAbstractionStarter]: For program point L47(line 47) no Hoare annotation was computed. [2019-10-07 13:42:11,765 INFO L439 ceAbstractionStarter]: At program point L39(line 39) the Hoare annotation is: (let ((.cse0 (* 2 main_~n~0))) (and (<= 2 main_~j~0) (<= (+ main_~i~0 1) main_~n~0) (<= 1 main_~l~0) (= |main_#in~argv.base| main_~argv.base) (<= main_~j~0 main_~n~0) (<= main_~n~0 1000000) (<= (+ (* 2 main_~i~0) main_~r~0 1) (+ main_~j~0 .cse0)) (<= 1 main_~i~0) (= |main_#in~argc| main_~argc) (<= (+ (* 2 main_~l~0) main_~r~0) .cse0) (= |main_#in~argv.offset| main_~argv.offset) (<= main_~r~0 main_~n~0) (<= 2 main_~r~0))) [2019-10-07 13:42:11,765 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 37) no Hoare annotation was computed. [2019-10-07 13:42:11,766 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-10-07 13:42:11,766 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-07 13:42:11,766 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-10-07 13:42:11,766 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-10-07 13:42:11,766 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-10-07 13:42:11,766 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-10-07 13:42:11,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.10 01:42:11 BoogieIcfgContainer [2019-10-07 13:42:11,784 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-07 13:42:11,785 INFO L168 Benchmark]: Toolchain (without parser) took 76067.18 ms. Allocated memory was 137.9 MB in the beginning and 786.4 MB in the end (delta: 648.5 MB). Free memory was 102.5 MB in the beginning and 194.0 MB in the end (delta: -91.5 MB). Peak memory consumption was 667.0 MB. Max. memory is 7.1 GB. [2019-10-07 13:42:11,786 INFO L168 Benchmark]: CDTParser took 1.35 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 13:42:11,787 INFO L168 Benchmark]: CACSL2BoogieTranslator took 257.32 ms. Allocated memory is still 137.9 MB. Free memory was 102.3 MB in the beginning and 92.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-10-07 13:42:11,788 INFO L168 Benchmark]: Boogie Preprocessor took 111.67 ms. Allocated memory was 137.9 MB in the beginning and 200.8 MB in the end (delta: 62.9 MB). Free memory was 92.3 MB in the beginning and 179.1 MB in the end (delta: -86.8 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2019-10-07 13:42:11,789 INFO L168 Benchmark]: RCFGBuilder took 443.44 ms. Allocated memory is still 200.8 MB. Free memory was 179.1 MB in the beginning and 159.8 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 7.1 GB. [2019-10-07 13:42:11,790 INFO L168 Benchmark]: TraceAbstraction took 75250.06 ms. Allocated memory was 200.8 MB in the beginning and 786.4 MB in the end (delta: 585.6 MB). Free memory was 159.2 MB in the beginning and 194.0 MB in the end (delta: -34.8 MB). Peak memory consumption was 660.7 MB. Max. memory is 7.1 GB. [2019-10-07 13:42:11,793 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.35 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 257.32 ms. Allocated memory is still 137.9 MB. Free memory was 102.3 MB in the beginning and 92.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 111.67 ms. Allocated memory was 137.9 MB in the beginning and 200.8 MB in the end (delta: 62.9 MB). Free memory was 92.3 MB in the beginning and 179.1 MB in the end (delta: -86.8 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 443.44 ms. Allocated memory is still 200.8 MB. Free memory was 179.1 MB in the beginning and 159.8 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 75250.06 ms. Allocated memory was 200.8 MB in the beginning and 786.4 MB in the end (delta: 585.6 MB). Free memory was 159.2 MB in the beginning and 194.0 MB in the end (delta: -34.8 MB). Peak memory consumption was 660.7 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: 24]: Loop Invariant Derived loop invariant: (((((((((2 <= j && 1 <= l) && \old(argc) == argc) && 2 * l + r <= 2 * n) && argv == argv) && argv == argv) && r <= n) && n <= 1000000) && 2 * i + r + 1 <= j + 2 * n) && 2 <= r) && -j / -2 <= i - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 1 error locations. Result: SAFE, OverallTime: 75.1s, OverallIterations: 16, TraceHistogramMax: 13, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.5s, HoareTripleCheckerStatistics: 907 SDtfs, 499 SDslu, 2759 SDs, 0 SdLazy, 1828 SolverSat, 834 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 514 GetRequests, 366 SyntacticMatches, 4 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=579occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 426 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 589 PreInvPairs, 880 NumberOfFragments, 1119 HoareAnnotationTreeSize, 589 FomulaSimplifications, 706152 FormulaSimplificationTreeSizeReduction, 1.3s HoareSimplificationTime, 20 FomulaSimplificationsInter, 129511 FormulaSimplificationTreeSizeReductionInter, 3.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 673 NumberOfCodeBlocks, 673 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 794 ConstructedInterpolants, 16 QuantifiedInterpolants, 92989 SizeOfPredicates, 10 NumberOfNonLiveVariables, 299 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 20 InterpolantComputations, 15 PerfectInterpolantSequences, 1659/1686 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: OVERALL_TIME[ms]: 62301, ICFG_INTERPRETER_ENTERED_PROCEDURES: 4, DAG_INTERPRETER_EARLY_EXIT_QUERIES: 3762, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 674, TOOLS_POST_TIME[ms]: 230, TOOLS_POST_CALL_APPLICATIONS: 2180, TOOLS_POST_CALL_TIME[ms]: 45951, TOOLS_POST_RETURN_APPLICATIONS: 2168, TOOLS_POST_RETURN_TIME[ms]: 1103, TOOLS_QUANTIFIERELIM_APPLICATIONS: 5022, TOOLS_QUANTIFIERELIM_TIME[ms]: 46545, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 103, FLUID_QUERY_TIME[ms]: 54, FLUID_QUERIES: 3808, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 2643, DOMAIN_JOIN_TIME[ms]: 12702, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 22, DOMAIN_WIDEN_TIME[ms]: 107, DOMAIN_ISSUBSETEQ_APPLICATIONS: 46, DOMAIN_ISSUBSETEQ_TIME[ms]: 66, DOMAIN_ISBOTTOM_APPLICATIONS: 1247, DOMAIN_ISBOTTOM_TIME[ms]: 1586, LOOP_SUMMARIZER_APPLICATIONS: 24, LOOP_SUMMARIZER_CACHE_MISSES: 24, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 44796, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 44794, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 46, CALL_SUMMARIZER_APPLICATIONS: 2168, CALL_SUMMARIZER_CACHE_MISSES: 2, CALL_SUMMARIZER_OVERALL_TIME[ms]: 14, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 8, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 5, PATH_EXPR_TIME[ms]: 4, REGEX_TO_DAG_TIME[ms]: 7, DAG_COMPRESSION_TIME[ms]: 129, DAG_COMPRESSION_PROCESSED_NODES: 2672, DAG_COMPRESSION_RETAINED_NODES: 1636, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...