/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 -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 13:43:50,217 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 13:43:50,222 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 13:43:50,264 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 13:43:50,265 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 13:43:50,272 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 13:43:50,276 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 13:43:50,280 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 13:43:50,283 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 13:43:50,286 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 13:43:50,287 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 13:43:50,288 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 13:43:50,288 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 13:43:50,292 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 13:43:50,294 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 13:43:50,298 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 13:43:50,300 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 13:43:50,301 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 13:43:50,303 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 13:43:50,312 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 13:43:50,314 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 13:43:50,316 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 13:43:50,317 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 13:43:50,318 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 13:43:50,330 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 13:43:50,331 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 13:43:50,331 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 13:43:50,338 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 13:43:50,339 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 13:43:50,340 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 13:43:50,340 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 13:43:50,344 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 13:43:50,345 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 13:43:50,348 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 13:43:50,349 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 13:43:50,349 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 13:43:50,350 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 13:43:50,351 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 13:43:50,351 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 13:43:50,352 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 13:43:50,353 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 13:43:50,355 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-04 13:43:50,402 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 13:43:50,402 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 13:43:50,404 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-04 13:43:50,405 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-04 13:43:50,405 INFO L138 SettingsManager]: * Use SBE=true [2020-09-04 13:43:50,405 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 13:43:50,405 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 13:43:50,406 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 13:43:50,406 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 13:43:50,406 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 13:43:50,407 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 13:43:50,407 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 13:43:50,408 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 13:43:50,408 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 13:43:50,408 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 13:43:50,409 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 13:43:50,409 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 13:43:50,409 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 13:43:50,409 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-04 13:43:50,409 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 13:43:50,410 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 13:43:50,410 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 13:43:50,410 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 13:43:50,410 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-04 13:43:50,410 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-04 13:43:50,411 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-04 13:43:50,411 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-04 13:43:50,411 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 13:43:50,411 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-04 13:43:50,411 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-09-04 13:43:50,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 13:43:50,919 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 13:43:50,924 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 13:43:50,926 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 13:43:50,926 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 13:43:50,928 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i [2020-09-04 13:43:51,023 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/824d84fc2/15b12e6aa04f4365a573dadbf5697cf6/FLAG078026d41 [2020-09-04 13:43:51,535 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 13:43:51,536 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i [2020-09-04 13:43:51,544 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/824d84fc2/15b12e6aa04f4365a573dadbf5697cf6/FLAG078026d41 [2020-09-04 13:43:51,883 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/824d84fc2/15b12e6aa04f4365a573dadbf5697cf6 [2020-09-04 13:43:51,896 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 13:43:51,898 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 13:43:51,904 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 13:43:51,905 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 13:43:51,909 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 13:43:51,910 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:43:51" (1/1) ... [2020-09-04 13:43:51,915 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@782f63b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:43:51, skipping insertion in model container [2020-09-04 13:43:51,915 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:43:51" (1/1) ... [2020-09-04 13:43:51,927 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 13:43:51,960 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 13:43:52,246 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:43:52,259 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 13:43:52,320 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:43:52,351 INFO L208 MainTranslator]: Completed translation [2020-09-04 13:43:52,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:43:52 WrapperNode [2020-09-04 13:43:52,353 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 13:43:52,354 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 13:43:52,354 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 13:43:52,354 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 13:43:52,466 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:43:52" (1/1) ... [2020-09-04 13:43:52,466 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:43:52" (1/1) ... [2020-09-04 13:43:52,483 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:43:52" (1/1) ... [2020-09-04 13:43:52,484 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:43:52" (1/1) ... [2020-09-04 13:43:52,501 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:43:52" (1/1) ... [2020-09-04 13:43:52,516 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:43:52" (1/1) ... [2020-09-04 13:43:52,519 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:43:52" (1/1) ... [2020-09-04 13:43:52,522 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 13:43:52,522 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 13:43:52,522 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 13:43:52,523 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 13:43:52,524 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:43:52" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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 [2020-09-04 13:43:52,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 13:43:52,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 13:43:52,603 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-09-04 13:43:52,604 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-09-04 13:43:52,604 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 13:43:52,604 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 13:43:52,605 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-09-04 13:43:52,605 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-09-04 13:43:52,605 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-09-04 13:43:52,605 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 13:43:52,605 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 13:43:52,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 13:43:52,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 13:43:52,957 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 13:43:52,958 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-09-04 13:43:52,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:43:52 BoogieIcfgContainer [2020-09-04 13:43:52,964 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 13:43:52,965 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 13:43:52,965 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 13:43:52,970 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 13:43:52,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 01:43:51" (1/3) ... [2020-09-04 13:43:52,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7762b37d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:43:52, skipping insertion in model container [2020-09-04 13:43:52,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:43:52" (2/3) ... [2020-09-04 13:43:52,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7762b37d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:43:52, skipping insertion in model container [2020-09-04 13:43:52,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:43:52" (3/3) ... [2020-09-04 13:43:52,975 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2020-09-04 13:43:52,987 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-09-04 13:43:52,998 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 13:43:53,034 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 13:43:53,077 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 13:43:53,077 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 13:43:53,078 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-09-04 13:43:53,078 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 13:43:53,078 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 13:43:53,078 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 13:43:53,078 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 13:43:53,078 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 13:43:53,102 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2020-09-04 13:43:53,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-09-04 13:43:53,110 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:43:53,111 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:43:53,111 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:43:53,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:43:53,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1626077920, now seen corresponding path program 1 times [2020-09-04 13:43:53,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:43:53,130 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119571183] [2020-09-04 13:43:53,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:43:53,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:53,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:43:53,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:53,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:43:53,406 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119571183] [2020-09-04 13:43:53,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:43:53,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 13:43:53,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395255264] [2020-09-04 13:43:53,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 13:43:53,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:43:53,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 13:43:53,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 13:43:53,433 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 5 states. [2020-09-04 13:43:53,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:43:53,693 INFO L93 Difference]: Finished difference Result 111 states and 206 transitions. [2020-09-04 13:43:53,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 13:43:53,695 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-09-04 13:43:53,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:43:53,711 INFO L225 Difference]: With dead ends: 111 [2020-09-04 13:43:53,711 INFO L226 Difference]: Without dead ends: 63 [2020-09-04 13:43:53,722 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-04 13:43:53,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-09-04 13:43:53,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2020-09-04 13:43:53,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-09-04 13:43:53,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 79 transitions. [2020-09-04 13:43:53,792 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 79 transitions. Word has length 16 [2020-09-04 13:43:53,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:43:53,793 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 79 transitions. [2020-09-04 13:43:53,793 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 13:43:53,794 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 79 transitions. [2020-09-04 13:43:53,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-04 13:43:53,796 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:43:53,796 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:43:53,797 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 13:43:53,797 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:43:53,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:43:53,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1393145919, now seen corresponding path program 1 times [2020-09-04 13:43:53,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:43:53,799 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56948481] [2020-09-04 13:43:53,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:43:53,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:53,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:43:53,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:53,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:43:53,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:53,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:43:53,904 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56948481] [2020-09-04 13:43:53,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:43:53,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 13:43:53,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702271385] [2020-09-04 13:43:53,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 13:43:53,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:43:53,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 13:43:53,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-09-04 13:43:53,908 INFO L87 Difference]: Start difference. First operand 56 states and 79 transitions. Second operand 6 states. [2020-09-04 13:43:54,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:43:54,123 INFO L93 Difference]: Finished difference Result 62 states and 84 transitions. [2020-09-04 13:43:54,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 13:43:54,124 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-09-04 13:43:54,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:43:54,129 INFO L225 Difference]: With dead ends: 62 [2020-09-04 13:43:54,129 INFO L226 Difference]: Without dead ends: 60 [2020-09-04 13:43:54,131 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-04 13:43:54,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-09-04 13:43:54,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2020-09-04 13:43:54,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-09-04 13:43:54,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 82 transitions. [2020-09-04 13:43:54,149 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 82 transitions. Word has length 21 [2020-09-04 13:43:54,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:43:54,150 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 82 transitions. [2020-09-04 13:43:54,150 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 13:43:54,150 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 82 transitions. [2020-09-04 13:43:54,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-09-04 13:43:54,152 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:43:54,152 INFO L422 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, 1, 1, 1, 1] [2020-09-04 13:43:54,153 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 13:43:54,153 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:43:54,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:43:54,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1101915893, now seen corresponding path program 1 times [2020-09-04 13:43:54,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:43:54,154 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658896060] [2020-09-04 13:43:54,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:43:54,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:54,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:43:54,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:54,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:43:54,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:54,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-09-04 13:43:54,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:54,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 13:43:54,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:54,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:43:54,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:54,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-09-04 13:43:54,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:54,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-09-04 13:43:54,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:54,324 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-09-04 13:43:54,324 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658896060] [2020-09-04 13:43:54,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:43:54,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:43:54,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212865899] [2020-09-04 13:43:54,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:43:54,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:43:54,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:43:54,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:43:54,327 INFO L87 Difference]: Start difference. First operand 60 states and 82 transitions. Second operand 3 states. [2020-09-04 13:43:54,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:43:54,360 INFO L93 Difference]: Finished difference Result 89 states and 122 transitions. [2020-09-04 13:43:54,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:43:54,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-09-04 13:43:54,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:43:54,363 INFO L225 Difference]: With dead ends: 89 [2020-09-04 13:43:54,364 INFO L226 Difference]: Without dead ends: 60 [2020-09-04 13:43:54,365 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:43:54,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-09-04 13:43:54,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2020-09-04 13:43:54,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-09-04 13:43:54,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 80 transitions. [2020-09-04 13:43:54,380 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 80 transitions. Word has length 50 [2020-09-04 13:43:54,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:43:54,381 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 80 transitions. [2020-09-04 13:43:54,381 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:43:54,381 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 80 transitions. [2020-09-04 13:43:54,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-09-04 13:43:54,383 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:43:54,383 INFO L422 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, 1, 1, 1, 1, 1] [2020-09-04 13:43:54,383 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 13:43:54,384 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:43:54,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:43:54,384 INFO L82 PathProgramCache]: Analyzing trace with hash 668905142, now seen corresponding path program 1 times [2020-09-04 13:43:54,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:43:54,385 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287793584] [2020-09-04 13:43:54,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:43:54,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:54,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:43:54,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:54,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:43:54,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:54,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-09-04 13:43:54,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:54,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 13:43:54,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:54,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:43:54,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:54,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 13:43:54,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:54,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 13:43:54,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:54,576 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-09-04 13:43:54,577 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287793584] [2020-09-04 13:43:54,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:43:54,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 13:43:54,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590087278] [2020-09-04 13:43:54,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 13:43:54,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:43:54,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 13:43:54,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 13:43:54,580 INFO L87 Difference]: Start difference. First operand 60 states and 80 transitions. Second operand 6 states. [2020-09-04 13:43:54,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:43:54,818 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2020-09-04 13:43:54,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 13:43:54,819 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2020-09-04 13:43:54,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:43:54,821 INFO L225 Difference]: With dead ends: 67 [2020-09-04 13:43:54,824 INFO L226 Difference]: Without dead ends: 65 [2020-09-04 13:43:54,825 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-04 13:43:54,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-09-04 13:43:54,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2020-09-04 13:43:54,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-09-04 13:43:54,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2020-09-04 13:43:54,854 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 83 transitions. Word has length 51 [2020-09-04 13:43:54,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:43:54,857 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 83 transitions. [2020-09-04 13:43:54,857 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 13:43:54,858 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2020-09-04 13:43:54,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-09-04 13:43:54,862 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:43:54,863 INFO L422 BasicCegarLoop]: trace histogram [13, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:43:54,863 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 13:43:54,863 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:43:54,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:43:54,867 INFO L82 PathProgramCache]: Analyzing trace with hash -702087769, now seen corresponding path program 1 times [2020-09-04 13:43:54,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:43:54,868 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192974928] [2020-09-04 13:43:54,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:43:54,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:43:55,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:43:55,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-09-04 13:43:55,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 13:43:55,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:43:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 13:43:55,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 13:43:55,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2020-09-04 13:43:55,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-09-04 13:43:55,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-09-04 13:43:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 13:43:55,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-09-04 13:43:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-09-04 13:43:55,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,066 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2020-09-04 13:43:55,066 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192974928] [2020-09-04 13:43:55,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:43:55,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 13:43:55,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489630092] [2020-09-04 13:43:55,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 13:43:55,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:43:55,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 13:43:55,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-09-04 13:43:55,069 INFO L87 Difference]: Start difference. First operand 64 states and 83 transitions. Second operand 7 states. [2020-09-04 13:43:55,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:43:55,195 INFO L93 Difference]: Finished difference Result 83 states and 108 transitions. [2020-09-04 13:43:55,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 13:43:55,195 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2020-09-04 13:43:55,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:43:55,198 INFO L225 Difference]: With dead ends: 83 [2020-09-04 13:43:55,198 INFO L226 Difference]: Without dead ends: 81 [2020-09-04 13:43:55,199 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-04 13:43:55,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-09-04 13:43:55,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 75. [2020-09-04 13:43:55,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-09-04 13:43:55,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 97 transitions. [2020-09-04 13:43:55,216 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 97 transitions. Word has length 86 [2020-09-04 13:43:55,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:43:55,216 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 97 transitions. [2020-09-04 13:43:55,217 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 13:43:55,217 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 97 transitions. [2020-09-04 13:43:55,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-09-04 13:43:55,219 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:43:55,219 INFO L422 BasicCegarLoop]: trace histogram [14, 13, 13, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:43:55,219 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 13:43:55,220 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:43:55,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:43:55,220 INFO L82 PathProgramCache]: Analyzing trace with hash 58209754, now seen corresponding path program 1 times [2020-09-04 13:43:55,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:43:55,221 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930788335] [2020-09-04 13:43:55,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:43:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:43:55,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:43:55,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-09-04 13:43:55,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 13:43:55,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:43:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 13:43:55,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 13:43:55,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2020-09-04 13:43:55,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-09-04 13:43:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-09-04 13:43:55,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 13:43:55,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-09-04 13:43:55,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-09-04 13:43:55,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-09-04 13:43:55,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,371 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2020-09-04 13:43:55,372 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930788335] [2020-09-04 13:43:55,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:43:55,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 13:43:55,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206723573] [2020-09-04 13:43:55,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 13:43:55,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:43:55,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 13:43:55,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-09-04 13:43:55,375 INFO L87 Difference]: Start difference. First operand 75 states and 97 transitions. Second operand 6 states. [2020-09-04 13:43:55,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:43:55,493 INFO L93 Difference]: Finished difference Result 81 states and 102 transitions. [2020-09-04 13:43:55,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 13:43:55,493 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2020-09-04 13:43:55,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:43:55,495 INFO L225 Difference]: With dead ends: 81 [2020-09-04 13:43:55,496 INFO L226 Difference]: Without dead ends: 79 [2020-09-04 13:43:55,496 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-09-04 13:43:55,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-09-04 13:43:55,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-09-04 13:43:55,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-09-04 13:43:55,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 100 transitions. [2020-09-04 13:43:55,510 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 100 transitions. Word has length 91 [2020-09-04 13:43:55,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:43:55,511 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 100 transitions. [2020-09-04 13:43:55,511 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 13:43:55,511 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 100 transitions. [2020-09-04 13:43:55,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-09-04 13:43:55,514 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:43:55,514 INFO L422 BasicCegarLoop]: trace histogram [19, 18, 18, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:43:55,514 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 13:43:55,515 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:43:55,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:43:55,515 INFO L82 PathProgramCache]: Analyzing trace with hash 299780712, now seen corresponding path program 1 times [2020-09-04 13:43:55,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:43:55,516 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657368601] [2020-09-04 13:43:55,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:43:55,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:43:55,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:43:55,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-09-04 13:43:55,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 13:43:55,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:43:55,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 13:43:55,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 13:43:55,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2020-09-04 13:43:55,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-09-04 13:43:55,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-09-04 13:43:55,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 13:43:55,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-09-04 13:43:55,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-09-04 13:43:55,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-09-04 13:43:55,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-09-04 13:43:55,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-09-04 13:43:55,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2020-09-04 13:43:55,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2020-09-04 13:43:55,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2020-09-04 13:43:55,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:43:55,685 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2020-09-04 13:43:55,686 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657368601] [2020-09-04 13:43:55,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:43:55,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 13:43:55,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500607841] [2020-09-04 13:43:55,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 13:43:55,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:43:55,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 13:43:55,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 13:43:55,689 INFO L87 Difference]: Start difference. First operand 79 states and 100 transitions. Second operand 6 states. [2020-09-04 13:43:55,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:43:55,782 INFO L93 Difference]: Finished difference Result 82 states and 103 transitions. [2020-09-04 13:43:55,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 13:43:55,783 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2020-09-04 13:43:55,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:43:55,784 INFO L225 Difference]: With dead ends: 82 [2020-09-04 13:43:55,784 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 13:43:55,785 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-04 13:43:55,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 13:43:55,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 13:43:55,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 13:43:55,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 13:43:55,787 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 120 [2020-09-04 13:43:55,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:43:55,787 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 13:43:55,787 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 13:43:55,787 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 13:43:55,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 13:43:55,788 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 13:43:55,791 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 13:43:56,409 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 13:43:56,410 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-09-04 13:43:56,410 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-09-04 13:43:56,410 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 13:43:56,410 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 13:43:56,410 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-09-04 13:43:56,410 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-09-04 13:43:56,410 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-09-04 13:43:56,411 INFO L268 CegarLoopResult]: For program point L4-2(lines 3 5) no Hoare annotation was computed. [2020-09-04 13:43:56,411 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-09-04 13:43:56,411 INFO L264 CegarLoopResult]: At program point L60(line 60) the Hoare annotation is: (and (<= 1 main_~c~0) (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (<= (+ main_~c~0 1) main_~tokenlen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-09-04 13:43:56,411 INFO L264 CegarLoopResult]: At program point L60-1(line 60) the Hoare annotation is: (and (<= 1 main_~c~0) (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (<= (+ main_~c~0 1) main_~tokenlen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-09-04 13:43:56,412 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 13 72) no Hoare annotation was computed. [2020-09-04 13:43:56,412 INFO L264 CegarLoopResult]: At program point L52(line 52) the Hoare annotation is: (and (= main_~c~0 0) (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-09-04 13:43:56,412 INFO L264 CegarLoopResult]: At program point L52-1(line 52) the Hoare annotation is: (and (= main_~c~0 0) (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-09-04 13:43:56,412 INFO L264 CegarLoopResult]: At program point L36-1(lines 35 41) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-09-04 13:43:56,412 INFO L264 CegarLoopResult]: At program point L36-2(lines 36 41) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-09-04 13:43:56,413 INFO L264 CegarLoopResult]: At program point L61(line 61) the Hoare annotation is: (and (<= 1 main_~c~0) (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (<= (+ main_~c~0 1) main_~tokenlen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-09-04 13:43:56,413 INFO L264 CegarLoopResult]: At program point L45(line 45) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-09-04 13:43:56,413 INFO L264 CegarLoopResult]: At program point L45-1(line 45) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-09-04 13:43:56,413 INFO L271 CegarLoopResult]: At program point L70(lines 14 72) the Hoare annotation is: true [2020-09-04 13:43:56,414 INFO L268 CegarLoopResult]: For program point L37(line 37) no Hoare annotation was computed. [2020-09-04 13:43:56,414 INFO L264 CegarLoopResult]: At program point L62(line 62) the Hoare annotation is: (and (<= 1 main_~c~0) (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (<= (+ main_~c~0 1) main_~tokenlen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-09-04 13:43:56,414 INFO L268 CegarLoopResult]: For program point L21(line 21) no Hoare annotation was computed. [2020-09-04 13:43:56,414 INFO L264 CegarLoopResult]: At program point L54-1(lines 53 66) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (<= 1 main_~cp~0)) (.cse2 (< main_~cp~0 main_~urilen~0))) (or (and (<= 1 main_~c~0) .cse0 .cse1 (<= (+ main_~c~0 1) main_~tokenlen~0) .cse2) (and (= main_~c~0 0) .cse0 .cse1 .cse2))) [2020-09-04 13:43:56,414 INFO L268 CegarLoopResult]: For program point L46(lines 33 69) no Hoare annotation was computed. [2020-09-04 13:43:56,415 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 13 72) no Hoare annotation was computed. [2020-09-04 13:43:56,415 INFO L264 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-09-04 13:43:56,415 INFO L264 CegarLoopResult]: At program point L38-1(line 38) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-09-04 13:43:56,415 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 72) the Hoare annotation is: true [2020-09-04 13:43:56,415 INFO L268 CegarLoopResult]: For program point L22(line 22) no Hoare annotation was computed. [2020-09-04 13:43:56,415 INFO L268 CegarLoopResult]: For program point L39(line 39) no Hoare annotation was computed. [2020-09-04 13:43:56,416 INFO L264 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-09-04 13:43:56,416 INFO L264 CegarLoopResult]: At program point L31-1(line 31) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-09-04 13:43:56,416 INFO L264 CegarLoopResult]: At program point L56(line 56) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (<= 1 main_~cp~0)) (.cse2 (<= (+ main_~c~0 2) main_~tokenlen~0)) (.cse3 (not (= (+ main_~cp~0 1) main_~urilen~0))) (.cse4 (< main_~cp~0 main_~urilen~0))) (or (and (<= 1 main_~c~0) .cse0 .cse1 .cse2 .cse3 .cse4) (and (= main_~c~0 0) .cse0 .cse1 .cse2 .cse3 .cse4))) [2020-09-04 13:43:56,416 INFO L268 CegarLoopResult]: For program point L23(line 23) no Hoare annotation was computed. [2020-09-04 13:43:56,416 INFO L264 CegarLoopResult]: At program point L56-1(line 56) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (<= 1 main_~cp~0)) (.cse2 (<= (+ main_~c~0 2) main_~tokenlen~0)) (.cse3 (not (= (+ main_~cp~0 1) main_~urilen~0))) (.cse4 (< main_~cp~0 main_~urilen~0))) (or (and (<= 1 main_~c~0) .cse0 .cse1 .cse2 .cse3 .cse4) (and (= main_~c~0 0) .cse0 .cse1 .cse2 .cse3 .cse4))) [2020-09-04 13:43:56,417 INFO L268 CegarLoopResult]: For program point L32(line 32) no Hoare annotation was computed. [2020-09-04 13:43:56,417 INFO L268 CegarLoopResult]: For program point L57(line 57) no Hoare annotation was computed. [2020-09-04 13:43:56,417 INFO L268 CegarLoopResult]: For program point L24(line 24) no Hoare annotation was computed. [2020-09-04 13:43:56,417 INFO L268 CegarLoopResult]: For program point L24-1(lines 14 72) no Hoare annotation was computed. [2020-09-04 13:43:56,417 INFO L268 CegarLoopResult]: For program point L33(lines 33 69) no Hoare annotation was computed. [2020-09-04 13:43:56,417 INFO L268 CegarLoopResult]: For program point L58(lines 58 64) no Hoare annotation was computed. [2020-09-04 13:43:56,417 INFO L268 CegarLoopResult]: For program point L25(lines 14 72) no Hoare annotation was computed. [2020-09-04 13:43:56,418 INFO L268 CegarLoopResult]: For program point L58-1(lines 58 64) no Hoare annotation was computed. [2020-09-04 13:43:56,418 INFO L268 CegarLoopResult]: For program point L50(lines 50 68) no Hoare annotation was computed. [2020-09-04 13:43:56,418 INFO L264 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-09-04 13:43:56,418 INFO L264 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-09-04 13:43:56,418 INFO L264 CegarLoopResult]: At program point L34-1(line 34) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-09-04 13:43:56,418 INFO L268 CegarLoopResult]: For program point L26(lines 14 72) no Hoare annotation was computed. [2020-09-04 13:43:56,419 INFO L268 CegarLoopResult]: For program point L43(lines 33 69) no Hoare annotation was computed. [2020-09-04 13:43:56,419 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-09-04 13:43:56,419 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 6 11) no Hoare annotation was computed. [2020-09-04 13:43:56,419 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-09-04 13:43:56,419 INFO L268 CegarLoopResult]: For program point L7(lines 7 9) no Hoare annotation was computed. [2020-09-04 13:43:56,419 INFO L268 CegarLoopResult]: For program point L7-2(lines 6 11) no Hoare annotation was computed. [2020-09-04 13:43:56,419 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-09-04 13:43:56,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 01:43:56 BoogieIcfgContainer [2020-09-04 13:43:56,443 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 13:43:56,447 INFO L168 Benchmark]: Toolchain (without parser) took 4547.01 ms. Allocated memory was 145.8 MB in the beginning and 249.6 MB in the end (delta: 103.8 MB). Free memory was 101.7 MB in the beginning and 212.7 MB in the end (delta: -111.0 MB). Peak memory consumption was 113.5 MB. Max. memory is 7.1 GB. [2020-09-04 13:43:56,448 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 145.8 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-09-04 13:43:56,449 INFO L168 Benchmark]: CACSL2BoogieTranslator took 448.95 ms. Allocated memory is still 145.8 MB. Free memory was 101.5 MB in the beginning and 91.2 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2020-09-04 13:43:56,450 INFO L168 Benchmark]: Boogie Preprocessor took 167.92 ms. Allocated memory was 145.8 MB in the beginning and 200.8 MB in the end (delta: 55.1 MB). Free memory was 91.0 MB in the beginning and 178.4 MB in the end (delta: -87.4 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-09-04 13:43:56,451 INFO L168 Benchmark]: RCFGBuilder took 441.80 ms. Allocated memory is still 200.8 MB. Free memory was 178.4 MB in the beginning and 159.2 MB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 7.1 GB. [2020-09-04 13:43:56,452 INFO L168 Benchmark]: TraceAbstraction took 3477.84 ms. Allocated memory was 200.8 MB in the beginning and 249.6 MB in the end (delta: 48.8 MB). Free memory was 158.5 MB in the beginning and 212.9 MB in the end (delta: -54.3 MB). Peak memory consumption was 115.3 MB. Max. memory is 7.1 GB. [2020-09-04 13:43:56,456 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36 ms. Allocated memory is still 145.8 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 448.95 ms. Allocated memory is still 145.8 MB. Free memory was 101.5 MB in the beginning and 91.2 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 167.92 ms. Allocated memory was 145.8 MB in the beginning and 200.8 MB in the end (delta: 55.1 MB). Free memory was 91.0 MB in the beginning and 178.4 MB in the end (delta: -87.4 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 441.80 ms. Allocated memory is still 200.8 MB. Free memory was 178.4 MB in the beginning and 159.2 MB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3477.84 ms. Allocated memory was 200.8 MB in the beginning and 249.6 MB in the end (delta: 48.8 MB). Free memory was 158.5 MB in the beginning and 212.9 MB in the end (delta: -54.3 MB). Peak memory consumption was 115.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: 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: 14]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (0 < scheme + 1 && 1 <= cp) && cp < urilen - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: ((((1 <= c && 0 < scheme + 1) && 1 <= cp) && c + 1 <= tokenlen) && cp < urilen) || (((c == 0 && 0 < scheme + 1) && 1 <= cp) && cp < urilen) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 2.7s, OverallIterations: 7, TraceHistogramMax: 19, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 461 SDtfs, 100 SDslu, 1249 SDs, 0 SdLazy, 396 SolverSat, 96 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 173 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred 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, 7 MinimizatonAttempts, 14 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 77 PreInvPairs, 109 NumberOfFragments, 450 HoareAnnotationTreeSize, 77 FomulaSimplifications, 362 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 26 FomulaSimplificationsInter, 155 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 435 NumberOfCodeBlocks, 435 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 428 ConstructedInterpolants, 0 QuantifiedInterpolants, 48444 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 1426/1426 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...