/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 04:01:27,746 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 04:01:27,749 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 04:01:27,767 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 04:01:27,768 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 04:01:27,770 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 04:01:27,772 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 04:01:27,782 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 04:01:27,787 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 04:01:27,791 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 04:01:27,793 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 04:01:27,794 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 04:01:27,794 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 04:01:27,796 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 04:01:27,800 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 04:01:27,802 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 04:01:27,803 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 04:01:27,804 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 04:01:27,806 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 04:01:27,811 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 04:01:27,816 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 04:01:27,820 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 04:01:27,823 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 04:01:27,824 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 04:01:27,826 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 04:01:27,826 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 04:01:27,826 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 04:01:27,828 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 04:01:27,829 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 04:01:27,833 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 04:01:27,834 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 04:01:27,834 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 04:01:27,835 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 04:01:27,836 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 04:01:27,837 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 04:01:27,837 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 04:01:27,838 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 04:01:27,838 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 04:01:27,838 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 04:01:27,839 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 04:01:27,840 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 04:01:27,841 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-07 04:01:27,855 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 04:01:27,855 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 04:01:27,856 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 04:01:27,857 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 04:01:27,857 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 04:01:27,857 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 04:01:27,857 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 04:01:27,857 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 04:01:27,858 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 04:01:27,858 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 04:01:27,858 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 04:01:27,858 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 04:01:27,858 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 04:01:27,859 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 04:01:27,859 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 04:01:27,859 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 04:01:27,859 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 04:01:27,859 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 04:01:27,860 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 04:01:27,860 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 04:01:27,860 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 04:01:27,860 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 04:01:27,860 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 04:01:27,861 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 04:01:27,864 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 04:01:27,864 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 04:01:27,864 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 04:01:27,864 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 04:01:27,865 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-11-07 04:01:28,164 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 04:01:28,186 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 04:01:28,189 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 04:01:28,190 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 04:01:28,191 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 04:01:28,192 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2019-11-07 04:01:28,266 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d29a755c/54a00b3372ce403896fea19efdfd31cc/FLAG4a55078c4 [2019-11-07 04:01:28,772 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 04:01:28,775 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2019-11-07 04:01:28,784 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d29a755c/54a00b3372ce403896fea19efdfd31cc/FLAG4a55078c4 [2019-11-07 04:01:29,204 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d29a755c/54a00b3372ce403896fea19efdfd31cc [2019-11-07 04:01:29,222 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 04:01:29,223 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 04:01:29,224 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 04:01:29,224 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 04:01:29,228 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 04:01:29,229 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:01:29" (1/1) ... [2019-11-07 04:01:29,232 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37d7d8b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:29, skipping insertion in model container [2019-11-07 04:01:29,232 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:01:29" (1/1) ... [2019-11-07 04:01:29,238 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 04:01:29,254 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 04:01:29,454 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:01:29,464 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 04:01:29,482 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:01:29,494 INFO L192 MainTranslator]: Completed translation [2019-11-07 04:01:29,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:29 WrapperNode [2019-11-07 04:01:29,494 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 04:01:29,495 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 04:01:29,495 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 04:01:29,495 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 04:01:29,591 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:29" (1/1) ... [2019-11-07 04:01:29,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:29" (1/1) ... [2019-11-07 04:01:29,601 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:29" (1/1) ... [2019-11-07 04:01:29,602 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:29" (1/1) ... [2019-11-07 04:01:29,607 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:29" (1/1) ... [2019-11-07 04:01:29,612 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:29" (1/1) ... [2019-11-07 04:01:29,613 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:29" (1/1) ... [2019-11-07 04:01:29,616 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 04:01:29,616 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 04:01:29,616 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 04:01:29,616 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 04:01:29,617 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 04:01:29,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 04:01:29,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 04:01:29,663 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-07 04:01:29,663 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 04:01:29,663 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 04:01:29,663 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 04:01:29,663 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-07 04:01:29,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 04:01:29,664 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 04:01:29,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 04:01:29,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 04:01:29,909 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 04:01:29,910 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-07 04:01:29,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:01:29 BoogieIcfgContainer [2019-11-07 04:01:29,911 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 04:01:29,919 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 04:01:29,919 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 04:01:29,923 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 04:01:29,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:01:29" (1/3) ... [2019-11-07 04:01:29,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30f97d53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:01:29, skipping insertion in model container [2019-11-07 04:01:29,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:29" (2/3) ... [2019-11-07 04:01:29,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30f97d53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:01:29, skipping insertion in model container [2019-11-07 04:01:29,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:01:29" (3/3) ... [2019-11-07 04:01:29,927 INFO L109 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.i [2019-11-07 04:01:29,938 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 04:01:29,945 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 04:01:29,956 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 04:01:29,980 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 04:01:29,981 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 04:01:29,981 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 04:01:29,981 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 04:01:29,981 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 04:01:29,981 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 04:01:29,981 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 04:01:29,982 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 04:01:29,998 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-11-07 04:01:30,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-07 04:01:30,003 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:30,004 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:30,006 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:30,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:30,012 INFO L82 PathProgramCache]: Analyzing trace with hash 345773710, now seen corresponding path program 1 times [2019-11-07 04:01:30,021 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:30,022 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169303023] [2019-11-07 04:01:30,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:30,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:30,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:30,131 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169303023] [2019-11-07 04:01:30,132 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:30,132 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-07 04:01:30,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017867944] [2019-11-07 04:01:30,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-07 04:01:30,147 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:30,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-07 04:01:30,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-07 04:01:30,164 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2019-11-07 04:01:30,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:30,205 INFO L93 Difference]: Finished difference Result 56 states and 87 transitions. [2019-11-07 04:01:30,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-07 04:01:30,207 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-11-07 04:01:30,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:30,220 INFO L225 Difference]: With dead ends: 56 [2019-11-07 04:01:30,220 INFO L226 Difference]: Without dead ends: 27 [2019-11-07 04:01:30,228 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-07 04:01:30,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-07 04:01:30,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-07 04:01:30,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-07 04:01:30,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2019-11-07 04:01:30,288 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 13 [2019-11-07 04:01:30,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:30,289 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-11-07 04:01:30,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-07 04:01:30,290 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2019-11-07 04:01:30,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-07 04:01:30,294 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:30,294 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:30,295 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:30,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:30,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1539602810, now seen corresponding path program 1 times [2019-11-07 04:01:30,296 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:30,297 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182187938] [2019-11-07 04:01:30,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:30,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:30,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:30,407 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182187938] [2019-11-07 04:01:30,408 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:30,409 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:01:30,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757027404] [2019-11-07 04:01:30,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:01:30,411 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:30,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:01:30,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:01:30,412 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 5 states. [2019-11-07 04:01:30,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:30,541 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2019-11-07 04:01:30,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 04:01:30,541 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-07 04:01:30,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:30,543 INFO L225 Difference]: With dead ends: 33 [2019-11-07 04:01:30,543 INFO L226 Difference]: Without dead ends: 31 [2019-11-07 04:01:30,544 INFO L630 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-11-07 04:01:30,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-07 04:01:30,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-11-07 04:01:30,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-07 04:01:30,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2019-11-07 04:01:30,555 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 14 [2019-11-07 04:01:30,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:30,556 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-11-07 04:01:30,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:01:30,556 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2019-11-07 04:01:30,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-07 04:01:30,557 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:30,558 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:30,558 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:30,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:30,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1090524767, now seen corresponding path program 1 times [2019-11-07 04:01:30,559 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:30,559 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886886523] [2019-11-07 04:01:30,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:30,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:30,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:30,630 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886886523] [2019-11-07 04:01:30,630 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:30,631 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 04:01:30,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386110016] [2019-11-07 04:01:30,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 04:01:30,632 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:30,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 04:01:30,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 04:01:30,633 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand 6 states. [2019-11-07 04:01:30,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:30,797 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2019-11-07 04:01:30,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 04:01:30,798 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-11-07 04:01:30,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:30,800 INFO L225 Difference]: With dead ends: 46 [2019-11-07 04:01:30,802 INFO L226 Difference]: Without dead ends: 44 [2019-11-07 04:01:30,802 INFO L630 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-11-07 04:01:30,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-07 04:01:30,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2019-11-07 04:01:30,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-07 04:01:30,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2019-11-07 04:01:30,824 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 54 transitions. Word has length 19 [2019-11-07 04:01:30,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:30,825 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 54 transitions. [2019-11-07 04:01:30,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 04:01:30,827 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 54 transitions. [2019-11-07 04:01:30,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-07 04:01:30,829 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:30,829 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:30,830 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:30,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:30,830 INFO L82 PathProgramCache]: Analyzing trace with hash 809711761, now seen corresponding path program 1 times [2019-11-07 04:01:30,830 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:30,830 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855777947] [2019-11-07 04:01:30,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:30,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:30,933 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-07 04:01:30,933 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855777947] [2019-11-07 04:01:30,934 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:30,934 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 04:01:30,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698088727] [2019-11-07 04:01:30,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 04:01:30,935 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:30,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 04:01:30,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-07 04:01:30,936 INFO L87 Difference]: Start difference. First operand 42 states and 54 transitions. Second operand 6 states. [2019-11-07 04:01:31,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:31,039 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2019-11-07 04:01:31,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 04:01:31,040 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-11-07 04:01:31,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:31,042 INFO L225 Difference]: With dead ends: 52 [2019-11-07 04:01:31,042 INFO L226 Difference]: Without dead ends: 50 [2019-11-07 04:01:31,042 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:01:31,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-07 04:01:31,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2019-11-07 04:01:31,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-07 04:01:31,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2019-11-07 04:01:31,055 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 57 transitions. Word has length 26 [2019-11-07 04:01:31,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:31,055 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 57 transitions. [2019-11-07 04:01:31,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 04:01:31,056 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2019-11-07 04:01:31,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-07 04:01:31,057 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:31,057 INFO L410 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-11-07 04:01:31,058 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:31,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:31,058 INFO L82 PathProgramCache]: Analyzing trace with hash -157864588, now seen corresponding path program 1 times [2019-11-07 04:01:31,058 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:31,059 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874504601] [2019-11-07 04:01:31,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:31,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:31,138 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-07 04:01:31,138 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874504601] [2019-11-07 04:01:31,138 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:31,139 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-07 04:01:31,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181575352] [2019-11-07 04:01:31,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-07 04:01:31,139 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:31,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-07 04:01:31,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:01:31,140 INFO L87 Difference]: Start difference. First operand 46 states and 57 transitions. Second operand 7 states. [2019-11-07 04:01:31,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:31,306 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2019-11-07 04:01:31,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-07 04:01:31,307 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-11-07 04:01:31,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:31,308 INFO L225 Difference]: With dead ends: 67 [2019-11-07 04:01:31,308 INFO L226 Difference]: Without dead ends: 60 [2019-11-07 04:01:31,309 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 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-11-07 04:01:31,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-07 04:01:31,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2019-11-07 04:01:31,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-07 04:01:31,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2019-11-07 04:01:31,322 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 30 [2019-11-07 04:01:31,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:31,323 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2019-11-07 04:01:31,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-07 04:01:31,324 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2019-11-07 04:01:31,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-07 04:01:31,325 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:31,325 INFO L410 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, 1] [2019-11-07 04:01:31,325 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:31,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:31,326 INFO L82 PathProgramCache]: Analyzing trace with hash 501600618, now seen corresponding path program 1 times [2019-11-07 04:01:31,326 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:31,327 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651455932] [2019-11-07 04:01:31,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:31,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:31,422 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-07 04:01:31,423 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651455932] [2019-11-07 04:01:31,423 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:31,423 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-07 04:01:31,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189874028] [2019-11-07 04:01:31,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-07 04:01:31,424 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:31,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-07 04:01:31,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:01:31,425 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand 7 states. [2019-11-07 04:01:31,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:31,540 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2019-11-07 04:01:31,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-07 04:01:31,541 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-11-07 04:01:31,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:31,543 INFO L225 Difference]: With dead ends: 68 [2019-11-07 04:01:31,543 INFO L226 Difference]: Without dead ends: 66 [2019-11-07 04:01:31,543 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 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-11-07 04:01:31,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-07 04:01:31,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2019-11-07 04:01:31,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-07 04:01:31,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2019-11-07 04:01:31,558 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 31 [2019-11-07 04:01:31,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:31,562 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2019-11-07 04:01:31,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-07 04:01:31,562 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2019-11-07 04:01:31,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-07 04:01:31,566 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:31,566 INFO L410 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, 1] [2019-11-07 04:01:31,567 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:31,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:31,567 INFO L82 PathProgramCache]: Analyzing trace with hash 397668462, now seen corresponding path program 1 times [2019-11-07 04:01:31,568 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:31,568 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385905695] [2019-11-07 04:01:31,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:31,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:31,725 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-11-07 04:01:31,727 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385905695] [2019-11-07 04:01:31,727 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963873408] [2019-11-07 04:01:31,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:01:31,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:31,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-07 04:01:31,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 04:01:31,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:01:32,002 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-07 04:01:32,003 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 04:01:32,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:01:32,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:01:32,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:01:32,175 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-07 04:01:32,176 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1973061450] [2019-11-07 04:01:32,217 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2019-11-07 04:01:32,217 INFO L166 IcfgInterpreter]: Building call graph [2019-11-07 04:01:32,223 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-07 04:01:32,230 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-07 04:01:32,231 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-07 04:01:32,283 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-11-07 04:01:33,933 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 9 for LOIs [2019-11-07 04:01:33,942 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-11-07 04:01:33,943 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-07 04:01:34,797 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-07 04:01:34,798 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11, 14] total 32 [2019-11-07 04:01:34,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704935121] [2019-11-07 04:01:34,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-07 04:01:34,801 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:34,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-07 04:01:34,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=868, Unknown=0, NotChecked=0, Total=992 [2019-11-07 04:01:34,802 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand 32 states. [2019-11-07 04:01:36,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:36,457 INFO L93 Difference]: Finished difference Result 81 states and 103 transitions. [2019-11-07 04:01:36,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-07 04:01:36,458 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 54 [2019-11-07 04:01:36,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:36,459 INFO L225 Difference]: With dead ends: 81 [2019-11-07 04:01:36,460 INFO L226 Difference]: Without dead ends: 66 [2019-11-07 04:01:36,462 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 129 SyntacticMatches, 11 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 688 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=436, Invalid=1916, Unknown=0, NotChecked=0, Total=2352 [2019-11-07 04:01:36,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-07 04:01:36,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2019-11-07 04:01:36,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-07 04:01:36,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2019-11-07 04:01:36,473 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 54 [2019-11-07 04:01:36,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:36,474 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2019-11-07 04:01:36,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-07 04:01:36,474 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2019-11-07 04:01:36,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-07 04:01:36,475 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:36,476 INFO L410 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:36,686 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:01:36,687 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:36,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:36,688 INFO L82 PathProgramCache]: Analyzing trace with hash 543255984, now seen corresponding path program 1 times [2019-11-07 04:01:36,688 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:36,688 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418967328] [2019-11-07 04:01:36,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:36,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:36,774 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-11-07 04:01:36,775 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418967328] [2019-11-07 04:01:36,775 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577767865] [2019-11-07 04:01:36,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:01:36,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:36,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-07 04:01:36,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 04:01:36,913 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-11-07 04:01:36,913 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 04:01:36,966 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-11-07 04:01:36,966 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1012638885] [2019-11-07 04:01:36,969 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-11-07 04:01:36,969 INFO L166 IcfgInterpreter]: Building call graph [2019-11-07 04:01:36,970 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-07 04:01:36,970 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-07 04:01:36,971 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-07 04:01:36,980 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-11-07 04:01:37,659 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 9 for LOIs [2019-11-07 04:01:37,668 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-11-07 04:01:37,669 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-07 04:01:38,177 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-07 04:01:38,178 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 13] total 25 [2019-11-07 04:01:38,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890107707] [2019-11-07 04:01:38,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-07 04:01:38,179 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:38,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-07 04:01:38,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2019-11-07 04:01:38,180 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 25 states. [2019-11-07 04:01:39,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:39,409 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2019-11-07 04:01:39,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-07 04:01:39,410 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 55 [2019-11-07 04:01:39,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:39,412 INFO L225 Difference]: With dead ends: 70 [2019-11-07 04:01:39,412 INFO L226 Difference]: Without dead ends: 68 [2019-11-07 04:01:39,414 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 140 SyntacticMatches, 9 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=322, Invalid=1318, Unknown=0, NotChecked=0, Total=1640 [2019-11-07 04:01:39,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-07 04:01:39,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 60. [2019-11-07 04:01:39,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-07 04:01:39,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2019-11-07 04:01:39,423 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 55 [2019-11-07 04:01:39,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:39,423 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2019-11-07 04:01:39,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-07 04:01:39,424 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2019-11-07 04:01:39,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-07 04:01:39,425 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:39,425 INFO L410 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:39,638 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:01:39,639 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:39,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:39,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1241638922, now seen corresponding path program 2 times [2019-11-07 04:01:39,641 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:39,642 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679015018] [2019-11-07 04:01:39,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:39,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:39,803 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 22 proven. 24 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-11-07 04:01:39,803 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679015018] [2019-11-07 04:01:39,804 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112987090] [2019-11-07 04:01:39,804 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:01:39,878 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-07 04:01:39,879 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-07 04:01:39,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-07 04:01:39,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 04:01:40,095 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 68 proven. 32 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-11-07 04:01:40,095 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 04:01:40,369 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 68 proven. 32 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-11-07 04:01:40,369 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [669503535] [2019-11-07 04:01:40,371 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-11-07 04:01:40,371 INFO L166 IcfgInterpreter]: Building call graph [2019-11-07 04:01:40,372 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-07 04:01:40,372 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-07 04:01:40,372 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-07 04:01:40,385 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-11-07 04:01:41,129 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 9 for LOIs [2019-11-07 04:01:41,139 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-11-07 04:01:41,140 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-07 04:01:41,858 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-07 04:01:41,859 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12, 13] total 37 [2019-11-07 04:01:41,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619841166] [2019-11-07 04:01:41,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-11-07 04:01:41,860 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:41,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-11-07 04:01:41,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1174, Unknown=0, NotChecked=0, Total=1332 [2019-11-07 04:01:41,861 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 37 states. [2019-11-07 04:01:43,021 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 29 [2019-11-07 04:01:43,215 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 35 [2019-11-07 04:01:43,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:43,675 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2019-11-07 04:01:43,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-07 04:01:43,675 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 79 [2019-11-07 04:01:43,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:43,676 INFO L225 Difference]: With dead ends: 76 [2019-11-07 04:01:43,677 INFO L226 Difference]: Without dead ends: 0 [2019-11-07 04:01:43,679 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 202 SyntacticMatches, 9 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=491, Invalid=2161, Unknown=0, NotChecked=0, Total=2652 [2019-11-07 04:01:43,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-07 04:01:43,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-07 04:01:43,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-07 04:01:43,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-07 04:01:43,680 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 79 [2019-11-07 04:01:43,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:43,680 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-07 04:01:43,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-11-07 04:01:43,680 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-07 04:01:43,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-07 04:01:43,883 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:01:43,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-07 04:01:44,198 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 31 [2019-11-07 04:01:44,443 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 28 [2019-11-07 04:01:44,674 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 28 [2019-11-07 04:01:44,879 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-11-07 04:01:44,879 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-07 04:01:44,880 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-07 04:01:44,880 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-07 04:01:44,880 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-07 04:01:44,880 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-07 04:01:44,880 INFO L439 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (let ((.cse1 (<= main_~inlen~0 2147483647)) (.cse3 (< main_~buf~0 main_~buflim~0)) (.cse2 (+ main_~buflim~0 2)) (.cse0 (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)))) (or (and .cse0 (and .cse1 (<= 1 main_~in~0) (<= .cse2 main_~bufferlen~0) (<= 1 main_~buf~0) (<= main_~bufferlen~0 2147483647)) .cse3) (and .cse1 (<= 0 main_~in~0) (<= main_~in~0 0) .cse3 (= main_~bufferlen~0 .cse2) .cse0 (= main_~buf~0 0)))) [2019-11-07 04:01:44,881 INFO L439 ceAbstractionStarter]: At program point L27-1(line 27) the Hoare annotation is: (let ((.cse1 (<= main_~inlen~0 2147483647)) (.cse3 (< main_~buf~0 main_~buflim~0)) (.cse2 (+ main_~buflim~0 2)) (.cse0 (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)))) (or (and .cse0 (and .cse1 (<= 1 main_~in~0) (<= .cse2 main_~bufferlen~0) (<= 1 main_~buf~0) (<= main_~bufferlen~0 2147483647)) .cse3) (and .cse1 (<= 0 main_~in~0) (<= main_~in~0 0) .cse3 (= main_~bufferlen~0 .cse2) .cse0 (= main_~buf~0 0)))) [2019-11-07 04:01:44,881 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 42) no Hoare annotation was computed. [2019-11-07 04:01:44,881 INFO L443 ceAbstractionStarter]: For program point L23-1(lines 23 34) no Hoare annotation was computed. [2019-11-07 04:01:44,881 INFO L439 ceAbstractionStarter]: At program point L23-3(lines 23 34) the Hoare annotation is: (and (<= 0 main_~in~0) (<= 0 main_~buf~0) (<= (+ main_~buf~0 2) main_~bufferlen~0)) [2019-11-07 04:01:44,882 INFO L443 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-11-07 04:01:44,882 INFO L439 ceAbstractionStarter]: At program point L32(line 32) the Hoare annotation is: (and (<= main_~inlen~0 2147483647) (<= 1 main_~in~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= 1 main_~buf~0) (< main_~buf~0 (+ main_~buflim~0 1)) (<= main_~bufferlen~0 2147483647)) [2019-11-07 04:01:44,882 INFO L439 ceAbstractionStarter]: At program point L32-1(line 32) the Hoare annotation is: (and (<= main_~inlen~0 2147483647) (<= 1 main_~in~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= 1 main_~buf~0) (< main_~buf~0 (+ main_~buflim~0 1)) (<= main_~bufferlen~0 2147483647)) [2019-11-07 04:01:44,882 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-07 04:01:44,882 INFO L446 ceAbstractionStarter]: At program point L41(lines 11 42) the Hoare annotation is: true [2019-11-07 04:01:44,883 INFO L439 ceAbstractionStarter]: At program point L33(lines 23 34) the Hoare annotation is: (let ((.cse0 (<= main_~inlen~0 2147483647)) (.cse1 (+ main_~buflim~0 2))) (or (and .cse0 (<= 0 main_~in~0) (<= main_~in~0 0) (< main_~bufferlen~0 main_~inlen~0) (= main_~bufferlen~0 .cse1) (= main_~buf~0 0) (<= 2 main_~bufferlen~0)) (and (and .cse0 (<= 1 main_~in~0) (<= .cse1 main_~bufferlen~0) (<= 1 main_~buf~0) (< main_~buf~0 (+ main_~buflim~0 1)) (<= main_~bufferlen~0 2147483647)) (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0))))) [2019-11-07 04:01:44,883 INFO L443 ceAbstractionStarter]: For program point L25(lines 25 26) no Hoare annotation was computed. [2019-11-07 04:01:44,883 INFO L443 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2019-11-07 04:01:44,883 INFO L443 ceAbstractionStarter]: For program point L17-1(lines 11 42) no Hoare annotation was computed. [2019-11-07 04:01:44,883 INFO L439 ceAbstractionStarter]: At program point L38(line 38) the Hoare annotation is: (and (<= (+ main_~buf~0 1) main_~bufferlen~0) (<= 0 main_~in~0) (<= 0 main_~buf~0) (<= 2 main_~bufferlen~0)) [2019-11-07 04:01:44,883 INFO L439 ceAbstractionStarter]: At program point L38-1(line 38) the Hoare annotation is: (and (<= (+ main_~buf~0 1) main_~bufferlen~0) (<= 0 main_~in~0) (<= 0 main_~buf~0) (<= 2 main_~bufferlen~0)) [2019-11-07 04:01:44,883 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 42) the Hoare annotation is: true [2019-11-07 04:01:44,883 INFO L443 ceAbstractionStarter]: For program point L18(lines 11 42) no Hoare annotation was computed. [2019-11-07 04:01:44,883 INFO L443 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-11-07 04:01:44,883 INFO L439 ceAbstractionStarter]: At program point L35(line 35) the Hoare annotation is: (and (<= 0 main_~in~0) (<= 0 main_~buf~0) (<= (+ main_~buf~0 2) main_~bufferlen~0)) [2019-11-07 04:01:44,884 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-11-07 04:01:44,884 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-07 04:01:44,884 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-11-07 04:01:44,884 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-11-07 04:01:44,884 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-11-07 04:01:44,884 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-11-07 04:01:44,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:01:44 BoogieIcfgContainer [2019-11-07 04:01:44,915 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-07 04:01:44,918 INFO L168 Benchmark]: Toolchain (without parser) took 15693.76 ms. Allocated memory was 138.9 MB in the beginning and 393.7 MB in the end (delta: 254.8 MB). Free memory was 103.7 MB in the beginning and 235.6 MB in the end (delta: -131.9 MB). Peak memory consumption was 267.0 MB. Max. memory is 7.1 GB. [2019-11-07 04:01:44,919 INFO L168 Benchmark]: CDTParser took 1.26 ms. Allocated memory is still 138.9 MB. Free memory was 122.2 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-11-07 04:01:44,920 INFO L168 Benchmark]: CACSL2BoogieTranslator took 270.31 ms. Allocated memory is still 138.9 MB. Free memory was 103.5 MB in the beginning and 93.8 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2019-11-07 04:01:44,921 INFO L168 Benchmark]: Boogie Preprocessor took 121.04 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 93.8 MB in the beginning and 180.7 MB in the end (delta: -86.9 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2019-11-07 04:01:44,925 INFO L168 Benchmark]: RCFGBuilder took 295.54 ms. Allocated memory is still 202.4 MB. Free memory was 180.7 MB in the beginning and 165.9 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2019-11-07 04:01:44,926 INFO L168 Benchmark]: TraceAbstraction took 14996.68 ms. Allocated memory was 202.4 MB in the beginning and 393.7 MB in the end (delta: 191.4 MB). Free memory was 165.3 MB in the beginning and 235.6 MB in the end (delta: -70.4 MB). Peak memory consumption was 265.1 MB. Max. memory is 7.1 GB. [2019-11-07 04:01:44,934 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.26 ms. Allocated memory is still 138.9 MB. Free memory was 122.2 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 270.31 ms. Allocated memory is still 138.9 MB. Free memory was 103.5 MB in the beginning and 93.8 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 121.04 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 93.8 MB in the beginning and 180.7 MB in the end (delta: -86.9 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 295.54 ms. Allocated memory is still 202.4 MB. Free memory was 180.7 MB in the beginning and 165.9 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14996.68 ms. Allocated memory was 202.4 MB in the beginning and 393.7 MB in the end (delta: 191.4 MB). Free memory was 165.3 MB in the beginning and 235.6 MB in the end (delta: -70.4 MB). Peak memory consumption was 265.1 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: 23]: Loop Invariant Derived loop invariant: ((((((inlen <= 2147483647 && 0 <= in) && in <= 0) && bufferlen < inlen) && bufferlen == buflim + 2) && buf == 0) && 2 <= bufferlen) || ((((((inlen <= 2147483647 && 1 <= in) && buflim + 2 <= bufferlen) && 1 <= buf) && buf < buflim + 1) && bufferlen <= 2147483647) && in + buflim + 3 <= buf + inlen) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 32 locations, 1 error locations. Result: SAFE, OverallTime: 14.9s, OverallIterations: 9, TraceHistogramMax: 12, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.9s, HoareTripleCheckerStatistics: 286 SDtfs, 435 SDslu, 1048 SDs, 0 SdLazy, 1381 SolverSat, 895 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 679 GetRequests, 483 SyntacticMatches, 29 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1847 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 29 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 54 PreInvPairs, 92 NumberOfFragments, 301 HoareAnnotationTreeSize, 54 FomulaSimplifications, 1965 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 15 FomulaSimplificationsInter, 2181 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 509 NumberOfCodeBlocks, 504 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 682 ConstructedInterpolants, 0 QuantifiedInterpolants, 152497 SizeOfPredicates, 19 NumberOfNonLiveVariables, 378 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 15 InterpolantComputations, 6 PerfectInterpolantSequences, 1306/1462 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: OVERALL_TIME[ms]: 3196, ICFG_INTERPRETER_ENTERED_PROCEDURES: 12, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 150, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 101, TOOLS_POST_TIME[ms]: 44, TOOLS_POST_CALL_APPLICATIONS: 142, TOOLS_POST_CALL_TIME[ms]: 1068, TOOLS_POST_RETURN_APPLICATIONS: 120, TOOLS_POST_RETURN_TIME[ms]: 119, TOOLS_QUANTIFIERELIM_APPLICATIONS: 363, TOOLS_QUANTIFIERELIM_TIME[ms]: 1138, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 67, FLUID_QUERY_TIME[ms]: 12, FLUID_QUERIES: 368, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 157, DOMAIN_JOIN_TIME[ms]: 1438, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 6, DOMAIN_WIDEN_TIME[ms]: 103, DOMAIN_ISSUBSETEQ_APPLICATIONS: 9, DOMAIN_ISSUBSETEQ_TIME[ms]: 18, DOMAIN_ISBOTTOM_APPLICATIONS: 150, DOMAIN_ISBOTTOM_TIME[ms]: 230, LOOP_SUMMARIZER_APPLICATIONS: 3, LOOP_SUMMARIZER_CACHE_MISSES: 3, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 1819, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 1818, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 9, CALL_SUMMARIZER_APPLICATIONS: 120, CALL_SUMMARIZER_CACHE_MISSES: 6, CALL_SUMMARIZER_OVERALL_TIME[ms]: 14, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 13, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 6, PATH_EXPR_TIME[ms]: 7, REGEX_TO_DAG_TIME[ms]: 6, DAG_COMPRESSION_TIME[ms]: 48, DAG_COMPRESSION_PROCESSED_NODES: 1366, DAG_COMPRESSION_RETAINED_NODES: 290, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...