/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/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 17:49:06,447 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 17:49:06,451 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 17:49:06,492 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 17:49:06,493 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 17:49:06,500 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 17:49:06,504 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 17:49:06,508 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 17:49:06,510 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 17:49:06,513 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 17:49:06,514 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 17:49:06,515 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 17:49:06,516 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 17:49:06,518 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 17:49:06,521 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 17:49:06,523 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 17:49:06,524 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 17:49:06,525 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 17:49:06,526 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 17:49:06,534 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 17:49:06,536 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 17:49:06,537 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 17:49:06,538 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 17:49:06,539 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 17:49:06,550 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 17:49:06,551 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 17:49:06,551 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 17:49:06,552 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 17:49:06,552 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 17:49:06,553 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 17:49:06,553 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 17:49:06,555 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 17:49:06,556 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 17:49:06,557 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 17:49:06,558 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 17:49:06,558 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 17:49:06,559 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 17:49:06,559 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 17:49:06,559 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 17:49:06,560 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 17:49:06,561 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 17:49:06,562 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 17:49:06,579 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 17:49:06,580 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 17:49:06,581 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 17:49:06,581 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 17:49:06,581 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 17:49:06,582 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 17:49:06,582 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 17:49:06,582 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 17:49:06,582 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 17:49:06,582 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 17:49:06,582 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 17:49:06,583 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 17:49:06,586 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 17:49:06,586 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 17:49:06,587 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 17:49:06,587 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 17:49:06,587 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 17:49:06,587 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 17:49:06,587 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 17:49:06,588 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 17:49:06,588 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 17:49:06,588 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 17:49:06,588 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-09-04 17:49:07,009 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 17:49:07,037 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 17:49:07,042 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 17:49:07,044 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 17:49:07,044 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 17:49:07,045 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2020-09-04 17:49:07,139 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/13fd7b5cc/7f1b4ff5bbe8446895f497180ed50331/FLAG15ba2ded7 [2020-09-04 17:49:07,666 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 17:49:07,667 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2020-09-04 17:49:07,675 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/13fd7b5cc/7f1b4ff5bbe8446895f497180ed50331/FLAG15ba2ded7 [2020-09-04 17:49:07,998 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/13fd7b5cc/7f1b4ff5bbe8446895f497180ed50331 [2020-09-04 17:49:08,010 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 17:49:08,013 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 17:49:08,014 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 17:49:08,014 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 17:49:08,020 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 17:49:08,021 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 05:49:07" (1/1) ... [2020-09-04 17:49:08,026 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3705ef2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:49:08, skipping insertion in model container [2020-09-04 17:49:08,026 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 05:49:07" (1/1) ... [2020-09-04 17:49:08,036 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 17:49:08,065 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 17:49:08,287 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 17:49:08,293 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 17:49:08,316 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 17:49:08,335 INFO L208 MainTranslator]: Completed translation [2020-09-04 17:49:08,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:49:08 WrapperNode [2020-09-04 17:49:08,336 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 17:49:08,337 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 17:49:08,337 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 17:49:08,337 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 17:49:08,355 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:49:08" (1/1) ... [2020-09-04 17:49:08,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:49:08" (1/1) ... [2020-09-04 17:49:08,362 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:49:08" (1/1) ... [2020-09-04 17:49:08,362 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:49:08" (1/1) ... [2020-09-04 17:49:08,444 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:49:08" (1/1) ... [2020-09-04 17:49:08,450 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:49:08" (1/1) ... [2020-09-04 17:49:08,452 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:49:08" (1/1) ... [2020-09-04 17:49:08,454 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 17:49:08,454 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 17:49:08,455 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 17:49:08,455 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 17:49:08,456 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:49:08" (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 17:49:08,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 17:49:08,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 17:49:08,525 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-09-04 17:49:08,525 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-09-04 17:49:08,526 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 17:49:08,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 17:49:08,526 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-09-04 17:49:08,526 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-09-04 17:49:08,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-09-04 17:49:08,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 17:49:08,526 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 17:49:08,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 17:49:08,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 17:49:08,835 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 17:49:08,836 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-04 17:49:08,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 05:49:08 BoogieIcfgContainer [2020-09-04 17:49:08,841 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 17:49:08,842 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 17:49:08,842 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 17:49:08,846 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 17:49:08,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 05:49:07" (1/3) ... [2020-09-04 17:49:08,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c115caf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 05:49:08, skipping insertion in model container [2020-09-04 17:49:08,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:49:08" (2/3) ... [2020-09-04 17:49:08,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c115caf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 05:49:08, skipping insertion in model container [2020-09-04 17:49:08,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 05:49:08" (3/3) ... [2020-09-04 17:49:08,851 INFO L109 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.i [2020-09-04 17:49:08,862 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 17:49:08,872 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 17:49:08,892 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 17:49:08,917 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 17:49:08,917 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 17:49:08,917 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-09-04 17:49:08,917 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 17:49:08,918 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 17:49:08,918 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 17:49:08,918 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 17:49:08,918 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 17:49:08,935 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2020-09-04 17:49:08,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-04 17:49:08,946 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:49:08,947 INFO L422 BasicCegarLoop]: trace histogram [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 17:49:08,948 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:49:08,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:49:08,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1122321079, now seen corresponding path program 1 times [2020-09-04 17:49:08,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:49:08,963 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1580785624] [2020-09-04 17:49:08,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:49:09,029 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:49:09,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:09,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:49:09,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:09,123 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 17:49:09,126 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1580785624] [2020-09-04 17:49:09,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:49:09,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-09-04 17:49:09,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820519903] [2020-09-04 17:49:09,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-09-04 17:49:09,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:49:09,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-09-04 17:49:09,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-09-04 17:49:09,156 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 2 states. [2020-09-04 17:49:09,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:49:09,195 INFO L93 Difference]: Finished difference Result 91 states and 122 transitions. [2020-09-04 17:49:09,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-09-04 17:49:09,196 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2020-09-04 17:49:09,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:49:09,209 INFO L225 Difference]: With dead ends: 91 [2020-09-04 17:49:09,209 INFO L226 Difference]: Without dead ends: 47 [2020-09-04 17:49:09,215 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-09-04 17:49:09,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-09-04 17:49:09,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-09-04 17:49:09,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-09-04 17:49:09,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2020-09-04 17:49:09,273 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 24 [2020-09-04 17:49:09,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:49:09,274 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2020-09-04 17:49:09,274 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-09-04 17:49:09,274 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2020-09-04 17:49:09,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-09-04 17:49:09,275 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:49:09,276 INFO L422 BasicCegarLoop]: trace histogram [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 17:49:09,276 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 17:49:09,276 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:49:09,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:49:09,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1949391841, now seen corresponding path program 1 times [2020-09-04 17:49:09,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:49:09,278 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1278676813] [2020-09-04 17:49:09,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:49:09,280 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:49:09,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:09,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:49:09,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:09,406 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 17:49:09,406 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1278676813] [2020-09-04 17:49:09,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:49:09,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 17:49:09,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301471858] [2020-09-04 17:49:09,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 17:49:09,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:49:09,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 17:49:09,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 17:49:09,410 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 5 states. [2020-09-04 17:49:09,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:49:09,536 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2020-09-04 17:49:09,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 17:49:09,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2020-09-04 17:49:09,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:49:09,539 INFO L225 Difference]: With dead ends: 66 [2020-09-04 17:49:09,539 INFO L226 Difference]: Without dead ends: 64 [2020-09-04 17:49:09,541 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 17:49:09,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-09-04 17:49:09,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2020-09-04 17:49:09,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-09-04 17:49:09,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2020-09-04 17:49:09,568 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 26 [2020-09-04 17:49:09,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:49:09,569 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2020-09-04 17:49:09,569 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 17:49:09,569 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2020-09-04 17:49:09,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-09-04 17:49:09,571 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:49:09,571 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:49:09,571 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 17:49:09,572 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:49:09,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:49:09,575 INFO L82 PathProgramCache]: Analyzing trace with hash -873076999, now seen corresponding path program 1 times [2020-09-04 17:49:09,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:49:09,576 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [36713045] [2020-09-04 17:49:09,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:49:09,586 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:49:09,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:09,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:49:09,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:09,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 17:49:09,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:09,743 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 17:49:09,744 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [36713045] [2020-09-04 17:49:09,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:49:09,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 17:49:09,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618494895] [2020-09-04 17:49:09,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 17:49:09,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:49:09,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 17:49:09,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-09-04 17:49:09,746 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand 6 states. [2020-09-04 17:49:09,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:49:09,942 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2020-09-04 17:49:09,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 17:49:09,943 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2020-09-04 17:49:09,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:49:09,945 INFO L225 Difference]: With dead ends: 70 [2020-09-04 17:49:09,945 INFO L226 Difference]: Without dead ends: 68 [2020-09-04 17:49:09,946 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 17:49:09,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-09-04 17:49:09,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2020-09-04 17:49:09,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-09-04 17:49:09,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2020-09-04 17:49:09,968 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 31 [2020-09-04 17:49:09,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:49:09,968 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2020-09-04 17:49:09,969 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 17:49:09,969 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2020-09-04 17:49:09,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-09-04 17:49:09,970 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:49:09,971 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:49:09,972 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 17:49:09,972 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:49:09,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:49:09,973 INFO L82 PathProgramCache]: Analyzing trace with hash 2057902492, now seen corresponding path program 1 times [2020-09-04 17:49:09,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:49:09,974 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1604151866] [2020-09-04 17:49:09,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:49:09,975 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:49:10,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:10,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:49:10,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:10,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 17:49:10,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:10,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 17:49:10,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:10,119 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 17:49:10,119 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1604151866] [2020-09-04 17:49:10,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:49:10,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 17:49:10,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214914536] [2020-09-04 17:49:10,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 17:49:10,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:49:10,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 17:49:10,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-04 17:49:10,121 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand 7 states. [2020-09-04 17:49:10,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:49:10,260 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2020-09-04 17:49:10,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 17:49:10,261 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2020-09-04 17:49:10,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:49:10,262 INFO L225 Difference]: With dead ends: 77 [2020-09-04 17:49:10,263 INFO L226 Difference]: Without dead ends: 75 [2020-09-04 17:49:10,263 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-09-04 17:49:10,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-09-04 17:49:10,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2020-09-04 17:49:10,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-09-04 17:49:10,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2020-09-04 17:49:10,281 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 39 [2020-09-04 17:49:10,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:49:10,282 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2020-09-04 17:49:10,282 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 17:49:10,282 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2020-09-04 17:49:10,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-09-04 17:49:10,283 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:49:10,284 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:49:10,284 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 17:49:10,284 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:49:10,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:49:10,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1847294180, now seen corresponding path program 1 times [2020-09-04 17:49:10,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:49:10,285 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [997018363] [2020-09-04 17:49:10,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:49:10,287 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:49:10,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:10,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:49:10,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:10,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 17:49:10,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:10,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 17:49:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:10,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-09-04 17:49:10,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:10,419 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 17:49:10,419 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [997018363] [2020-09-04 17:49:10,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:49:10,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 17:49:10,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912900814] [2020-09-04 17:49:10,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 17:49:10,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:49:10,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 17:49:10,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-09-04 17:49:10,421 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand 8 states. [2020-09-04 17:49:10,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:49:10,632 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2020-09-04 17:49:10,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 17:49:10,632 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2020-09-04 17:49:10,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:49:10,634 INFO L225 Difference]: With dead ends: 81 [2020-09-04 17:49:10,634 INFO L226 Difference]: Without dead ends: 63 [2020-09-04 17:49:10,635 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-09-04 17:49:10,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-09-04 17:49:10,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2020-09-04 17:49:10,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-09-04 17:49:10,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2020-09-04 17:49:10,645 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 44 [2020-09-04 17:49:10,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:49:10,646 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2020-09-04 17:49:10,646 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 17:49:10,646 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2020-09-04 17:49:10,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-09-04 17:49:10,648 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:49:10,648 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:49:10,648 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 17:49:10,648 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:49:10,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:49:10,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1076854334, now seen corresponding path program 1 times [2020-09-04 17:49:10,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:49:10,649 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1574610146] [2020-09-04 17:49:10,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:49:10,651 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:49:10,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:10,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:49:10,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:10,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 17:49:10,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:10,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 17:49:10,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:10,728 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 17:49:10,728 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1574610146] [2020-09-04 17:49:10,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:49:10,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 17:49:10,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038556174] [2020-09-04 17:49:10,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 17:49:10,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:49:10,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 17:49:10,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-04 17:49:10,739 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand 7 states. [2020-09-04 17:49:10,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:49:10,842 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2020-09-04 17:49:10,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 17:49:10,843 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2020-09-04 17:49:10,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:49:10,845 INFO L225 Difference]: With dead ends: 72 [2020-09-04 17:49:10,845 INFO L226 Difference]: Without dead ends: 70 [2020-09-04 17:49:10,845 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-09-04 17:49:10,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-09-04 17:49:10,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2020-09-04 17:49:10,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-09-04 17:49:10,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2020-09-04 17:49:10,870 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 43 [2020-09-04 17:49:10,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:49:10,870 INFO L479 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2020-09-04 17:49:10,870 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 17:49:10,871 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2020-09-04 17:49:10,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-09-04 17:49:10,874 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:49:10,874 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:49:10,874 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 17:49:10,875 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:49:10,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:49:10,875 INFO L82 PathProgramCache]: Analyzing trace with hash 146364602, now seen corresponding path program 1 times [2020-09-04 17:49:10,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:49:10,875 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [636865809] [2020-09-04 17:49:10,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:49:10,879 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:49:10,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:10,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:49:10,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:10,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 17:49:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:10,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 17:49:10,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:10,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 17:49:10,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:11,006 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 17:49:11,007 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [636865809] [2020-09-04 17:49:11,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:49:11,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 17:49:11,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237716766] [2020-09-04 17:49:11,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 17:49:11,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:49:11,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 17:49:11,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-09-04 17:49:11,009 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand 9 states. [2020-09-04 17:49:11,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:49:11,247 INFO L93 Difference]: Finished difference Result 98 states and 113 transitions. [2020-09-04 17:49:11,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 17:49:11,248 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2020-09-04 17:49:11,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:49:11,249 INFO L225 Difference]: With dead ends: 98 [2020-09-04 17:49:11,249 INFO L226 Difference]: Without dead ends: 96 [2020-09-04 17:49:11,253 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2020-09-04 17:49:11,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-09-04 17:49:11,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 77. [2020-09-04 17:49:11,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-09-04 17:49:11,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2020-09-04 17:49:11,271 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 48 [2020-09-04 17:49:11,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:49:11,271 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2020-09-04 17:49:11,271 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 17:49:11,272 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2020-09-04 17:49:11,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-09-04 17:49:11,273 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:49:11,273 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 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] [2020-09-04 17:49:11,273 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 17:49:11,273 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:49:11,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:49:11,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1943579560, now seen corresponding path program 1 times [2020-09-04 17:49:11,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:49:11,274 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [89655459] [2020-09-04 17:49:11,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:49:11,308 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:49:11,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:11,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:49:11,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:11,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 17:49:11,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:11,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 17:49:11,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:11,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 17:49:11,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:11,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 17:49:11,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:11,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 17:49:11,406 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [89655459] [2020-09-04 17:49:11,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:49:11,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 17:49:11,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560280733] [2020-09-04 17:49:11,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 17:49:11,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:49:11,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 17:49:11,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-04 17:49:11,408 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 7 states. [2020-09-04 17:49:11,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:49:11,523 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2020-09-04 17:49:11,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 17:49:11,524 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2020-09-04 17:49:11,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:49:11,528 INFO L225 Difference]: With dead ends: 83 [2020-09-04 17:49:11,528 INFO L226 Difference]: Without dead ends: 81 [2020-09-04 17:49:11,529 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-09-04 17:49:11,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-09-04 17:49:11,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2020-09-04 17:49:11,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-09-04 17:49:11,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2020-09-04 17:49:11,541 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 56 [2020-09-04 17:49:11,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:49:11,542 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2020-09-04 17:49:11,542 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 17:49:11,543 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2020-09-04 17:49:11,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-09-04 17:49:11,544 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:49:11,545 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 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] [2020-09-04 17:49:11,545 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 17:49:11,545 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:49:11,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:49:11,545 INFO L82 PathProgramCache]: Analyzing trace with hash 903884048, now seen corresponding path program 1 times [2020-09-04 17:49:11,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:49:11,546 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1154595556] [2020-09-04 17:49:11,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:49:11,557 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:49:11,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:11,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:49:11,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:11,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 17:49:11,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:11,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 17:49:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:11,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 17:49:11,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:11,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 17:49:11,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:11,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-09-04 17:49:11,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:11,683 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 17:49:11,684 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1154595556] [2020-09-04 17:49:11,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:49:11,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 17:49:11,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760970408] [2020-09-04 17:49:11,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 17:49:11,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:49:11,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 17:49:11,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-09-04 17:49:11,695 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 8 states. [2020-09-04 17:49:11,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:49:11,944 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2020-09-04 17:49:11,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 17:49:11,945 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2020-09-04 17:49:11,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:49:11,947 INFO L225 Difference]: With dead ends: 100 [2020-09-04 17:49:11,948 INFO L226 Difference]: Without dead ends: 98 [2020-09-04 17:49:11,949 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-09-04 17:49:11,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-09-04 17:49:11,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2020-09-04 17:49:11,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-09-04 17:49:11,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2020-09-04 17:49:11,967 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 61 [2020-09-04 17:49:11,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:49:11,968 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2020-09-04 17:49:11,969 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 17:49:11,969 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2020-09-04 17:49:11,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-09-04 17:49:11,979 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:49:11,979 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 6, 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] [2020-09-04 17:49:11,979 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 17:49:11,979 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:49:11,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:49:11,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1662212275, now seen corresponding path program 1 times [2020-09-04 17:49:11,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:49:11,980 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [517047141] [2020-09-04 17:49:11,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:49:11,989 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:49:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:12,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:49:12,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:12,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 17:49:12,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:12,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 17:49:12,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:12,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 17:49:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:12,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 17:49:12,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:12,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-09-04 17:49:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:12,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-09-04 17:49:12,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:12,144 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 17:49:12,145 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [517047141] [2020-09-04 17:49:12,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:49:12,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 17:49:12,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080403551] [2020-09-04 17:49:12,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 17:49:12,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:49:12,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 17:49:12,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-09-04 17:49:12,149 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand 9 states. [2020-09-04 17:49:12,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:49:12,313 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2020-09-04 17:49:12,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 17:49:12,315 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2020-09-04 17:49:12,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:49:12,316 INFO L225 Difference]: With dead ends: 100 [2020-09-04 17:49:12,317 INFO L226 Difference]: Without dead ends: 98 [2020-09-04 17:49:12,317 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2020-09-04 17:49:12,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-09-04 17:49:12,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2020-09-04 17:49:12,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-09-04 17:49:12,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2020-09-04 17:49:12,339 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 69 [2020-09-04 17:49:12,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:49:12,339 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2020-09-04 17:49:12,339 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 17:49:12,340 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2020-09-04 17:49:12,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-09-04 17:49:12,341 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:49:12,341 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:49:12,342 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 17:49:12,342 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:49:12,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:49:12,342 INFO L82 PathProgramCache]: Analyzing trace with hash 71900773, now seen corresponding path program 1 times [2020-09-04 17:49:12,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:49:12,343 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [128328240] [2020-09-04 17:49:12,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:49:12,351 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:49:12,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:12,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:49:12,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:12,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 17:49:12,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:12,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 17:49:12,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:12,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 17:49:12,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:12,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 17:49:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:12,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-09-04 17:49:12,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:12,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-09-04 17:49:12,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:12,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-09-04 17:49:12,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:12,531 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 17:49:12,531 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [128328240] [2020-09-04 17:49:12,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:49:12,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 17:49:12,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771962293] [2020-09-04 17:49:12,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 17:49:12,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:49:12,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 17:49:12,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-09-04 17:49:12,533 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand 11 states. [2020-09-04 17:49:12,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:49:12,950 INFO L93 Difference]: Finished difference Result 119 states and 134 transitions. [2020-09-04 17:49:12,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 17:49:12,951 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2020-09-04 17:49:12,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:49:12,952 INFO L225 Difference]: With dead ends: 119 [2020-09-04 17:49:12,953 INFO L226 Difference]: Without dead ends: 101 [2020-09-04 17:49:12,954 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2020-09-04 17:49:12,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-09-04 17:49:12,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2020-09-04 17:49:12,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-09-04 17:49:12,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2020-09-04 17:49:12,966 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 74 [2020-09-04 17:49:12,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:49:12,966 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2020-09-04 17:49:12,966 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 17:49:12,966 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2020-09-04 17:49:12,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-09-04 17:49:12,967 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:49:12,967 INFO L422 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:49:12,968 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 17:49:12,968 INFO L427 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:49:12,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:49:12,968 INFO L82 PathProgramCache]: Analyzing trace with hash -50388093, now seen corresponding path program 1 times [2020-09-04 17:49:12,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:49:12,969 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [763265316] [2020-09-04 17:49:12,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:49:12,975 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:49:12,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:13,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:49:13,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:13,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 17:49:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:13,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 17:49:13,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:13,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 17:49:13,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:13,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 17:49:13,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:13,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-09-04 17:49:13,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:13,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-09-04 17:49:13,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:13,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-09-04 17:49:13,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:13,101 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-04 17:49:13,101 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [763265316] [2020-09-04 17:49:13,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:49:13,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 17:49:13,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378475652] [2020-09-04 17:49:13,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 17:49:13,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:49:13,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 17:49:13,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-09-04 17:49:13,103 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand 11 states. [2020-09-04 17:49:13,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:49:13,434 INFO L93 Difference]: Finished difference Result 128 states and 143 transitions. [2020-09-04 17:49:13,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 17:49:13,434 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 78 [2020-09-04 17:49:13,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:49:13,436 INFO L225 Difference]: With dead ends: 128 [2020-09-04 17:49:13,436 INFO L226 Difference]: Without dead ends: 126 [2020-09-04 17:49:13,437 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2020-09-04 17:49:13,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-09-04 17:49:13,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 107. [2020-09-04 17:49:13,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-09-04 17:49:13,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2020-09-04 17:49:13,450 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 78 [2020-09-04 17:49:13,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:49:13,451 INFO L479 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2020-09-04 17:49:13,451 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 17:49:13,451 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2020-09-04 17:49:13,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-09-04 17:49:13,452 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:49:13,452 INFO L422 BasicCegarLoop]: trace histogram [10, 9, 9, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:49:13,452 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 17:49:13,453 INFO L427 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:49:13,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:49:13,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1911943399, now seen corresponding path program 2 times [2020-09-04 17:49:13,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:49:13,453 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [984095258] [2020-09-04 17:49:13,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:49:13,460 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:49:13,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:13,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:49:13,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:13,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 17:49:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:13,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 17:49:13,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:13,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 17:49:13,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:13,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 17:49:13,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:13,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-09-04 17:49:13,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:13,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-09-04 17:49:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:13,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-09-04 17:49:13,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:13,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-09-04 17:49:13,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:13,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-09-04 17:49:13,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:13,622 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-09-04 17:49:13,623 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [984095258] [2020-09-04 17:49:13,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:49:13,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 17:49:13,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759704050] [2020-09-04 17:49:13,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 17:49:13,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:49:13,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 17:49:13,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-09-04 17:49:13,625 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand 11 states. [2020-09-04 17:49:14,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:49:14,098 INFO L93 Difference]: Finished difference Result 134 states and 151 transitions. [2020-09-04 17:49:14,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 17:49:14,099 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 91 [2020-09-04 17:49:14,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:49:14,106 INFO L225 Difference]: With dead ends: 134 [2020-09-04 17:49:14,106 INFO L226 Difference]: Without dead ends: 132 [2020-09-04 17:49:14,107 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2020-09-04 17:49:14,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-09-04 17:49:14,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 120. [2020-09-04 17:49:14,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-09-04 17:49:14,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 133 transitions. [2020-09-04 17:49:14,126 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 133 transitions. Word has length 91 [2020-09-04 17:49:14,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:49:14,127 INFO L479 AbstractCegarLoop]: Abstraction has 120 states and 133 transitions. [2020-09-04 17:49:14,127 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 17:49:14,127 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 133 transitions. [2020-09-04 17:49:14,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-09-04 17:49:14,128 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:49:14,129 INFO L422 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:49:14,129 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 17:49:14,129 INFO L427 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:49:14,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:49:14,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1949077486, now seen corresponding path program 2 times [2020-09-04 17:49:14,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:49:14,134 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2024388982] [2020-09-04 17:49:14,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:49:14,147 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:49:14,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:14,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:49:14,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:14,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 17:49:14,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:14,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 17:49:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:14,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 17:49:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:14,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 17:49:14,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:14,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-09-04 17:49:14,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:14,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-09-04 17:49:14,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:14,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-09-04 17:49:14,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:14,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-09-04 17:49:14,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:14,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-09-04 17:49:14,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:14,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-09-04 17:49:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:14,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-09-04 17:49:14,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:14,426 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-09-04 17:49:14,426 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2024388982] [2020-09-04 17:49:14,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:49:14,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-09-04 17:49:14,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658062824] [2020-09-04 17:49:14,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 17:49:14,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:49:14,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 17:49:14,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-09-04 17:49:14,428 INFO L87 Difference]: Start difference. First operand 120 states and 133 transitions. Second operand 13 states. [2020-09-04 17:49:14,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:49:14,710 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2020-09-04 17:49:14,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 17:49:14,712 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 104 [2020-09-04 17:49:14,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:49:14,713 INFO L225 Difference]: With dead ends: 126 [2020-09-04 17:49:14,713 INFO L226 Difference]: Without dead ends: 109 [2020-09-04 17:49:14,714 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2020-09-04 17:49:14,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-09-04 17:49:14,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 99. [2020-09-04 17:49:14,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-09-04 17:49:14,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 102 transitions. [2020-09-04 17:49:14,726 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 102 transitions. Word has length 104 [2020-09-04 17:49:14,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:49:14,727 INFO L479 AbstractCegarLoop]: Abstraction has 99 states and 102 transitions. [2020-09-04 17:49:14,727 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 17:49:14,727 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 102 transitions. [2020-09-04 17:49:14,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-09-04 17:49:14,728 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:49:14,729 INFO L422 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:49:14,729 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 17:49:14,729 INFO L427 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:49:14,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:49:14,730 INFO L82 PathProgramCache]: Analyzing trace with hash 55355532, now seen corresponding path program 2 times [2020-09-04 17:49:14,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:49:14,730 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1098219263] [2020-09-04 17:49:14,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:49:14,739 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:49:14,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:14,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:49:14,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:14,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 17:49:14,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:14,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 17:49:14,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:14,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 17:49:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:14,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 17:49:14,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:15,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-09-04 17:49:15,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:15,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-09-04 17:49:15,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:15,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-09-04 17:49:15,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:15,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-09-04 17:49:15,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:15,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-09-04 17:49:15,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:15,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-09-04 17:49:15,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:15,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-09-04 17:49:15,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:15,042 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-09-04 17:49:15,043 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1098219263] [2020-09-04 17:49:15,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:49:15,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-09-04 17:49:15,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259672150] [2020-09-04 17:49:15,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-04 17:49:15,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:49:15,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-04 17:49:15,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2020-09-04 17:49:15,045 INFO L87 Difference]: Start difference. First operand 99 states and 102 transitions. Second operand 16 states. [2020-09-04 17:49:15,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:49:15,646 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2020-09-04 17:49:15,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-04 17:49:15,646 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 108 [2020-09-04 17:49:15,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:49:15,648 INFO L225 Difference]: With dead ends: 130 [2020-09-04 17:49:15,648 INFO L226 Difference]: Without dead ends: 128 [2020-09-04 17:49:15,651 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2020-09-04 17:49:15,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-09-04 17:49:15,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 117. [2020-09-04 17:49:15,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-09-04 17:49:15,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 123 transitions. [2020-09-04 17:49:15,667 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 123 transitions. Word has length 108 [2020-09-04 17:49:15,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:49:15,667 INFO L479 AbstractCegarLoop]: Abstraction has 117 states and 123 transitions. [2020-09-04 17:49:15,667 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-04 17:49:15,667 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2020-09-04 17:49:15,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2020-09-04 17:49:15,669 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:49:15,669 INFO L422 BasicCegarLoop]: trace histogram [16, 15, 15, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:49:15,670 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-04 17:49:15,670 INFO L427 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:49:15,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:49:15,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1897035733, now seen corresponding path program 3 times [2020-09-04 17:49:15,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:49:15,671 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1508568377] [2020-09-04 17:49:15,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:49:15,678 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:49:15,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:16,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:49:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:16,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 17:49:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:16,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 17:49:16,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:16,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 17:49:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:16,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 17:49:16,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:16,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-09-04 17:49:16,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:16,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-09-04 17:49:16,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:16,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-09-04 17:49:16,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:16,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-09-04 17:49:16,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:16,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-09-04 17:49:16,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:16,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-09-04 17:49:16,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:16,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-09-04 17:49:16,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:16,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2020-09-04 17:49:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:16,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2020-09-04 17:49:16,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:16,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2020-09-04 17:49:16,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:16,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2020-09-04 17:49:16,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:16,255 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-09-04 17:49:16,255 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1508568377] [2020-09-04 17:49:16,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:49:16,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2020-09-04 17:49:16,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551096294] [2020-09-04 17:49:16,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-09-04 17:49:16,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:49:16,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-09-04 17:49:16,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2020-09-04 17:49:16,258 INFO L87 Difference]: Start difference. First operand 117 states and 123 transitions. Second operand 21 states. [2020-09-04 17:49:16,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:49:16,873 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2020-09-04 17:49:16,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 17:49:16,873 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 138 [2020-09-04 17:49:16,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:49:16,874 INFO L225 Difference]: With dead ends: 117 [2020-09-04 17:49:16,874 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 17:49:16,876 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=232, Invalid=890, Unknown=0, NotChecked=0, Total=1122 [2020-09-04 17:49:16,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 17:49:16,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 17:49:16,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 17:49:16,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 17:49:16,877 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 138 [2020-09-04 17:49:16,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:49:16,877 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 17:49:16,877 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-09-04 17:49:16,877 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 17:49:16,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 17:49:16,878 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-04 17:49:16,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 17:49:17,697 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2020-09-04 17:49:18,588 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 28 [2020-09-04 17:49:18,891 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 27 [2020-09-04 17:49:19,079 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 27 [2020-09-04 17:49:19,609 WARN L193 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 34 [2020-09-04 17:49:19,613 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 17:49:19,613 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-09-04 17:49:19,614 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 17:49:19,614 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 17:49:19,614 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 17:49:19,614 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 17:49:19,614 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-09-04 17:49:19,614 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-09-04 17:49:19,614 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-09-04 17:49:19,615 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-09-04 17:49:19,615 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-09-04 17:49:19,615 INFO L264 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (let ((.cse1 (<= (+ main_~buf~0 1) main_~buflim~0)) (.cse2 (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (.cse0 (+ main_~buf~0 main_~inlen~0)) (.cse3 (<= 0 main_~in~0)) (.cse4 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and (<= (+ main_~in~0 main_~bufferlen~0 1) .cse0) (<= 0 main_~buf~0) .cse1 .cse2 .cse3 .cse4) (and (<= 1 main_~buf~0) .cse1 .cse2 (<= (+ main_~in~0 main_~buflim~0 3) .cse0) .cse3 .cse4))) [2020-09-04 17:49:19,615 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 45) the Hoare annotation is: true [2020-09-04 17:49:19,615 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-09-04 17:49:19,615 INFO L271 CegarLoopResult]: At program point L44(lines 14 45) the Hoare annotation is: true [2020-09-04 17:49:19,616 INFO L264 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (and (<= (+ |main_#t~post5| 2) main_~bufferlen~0) (<= 0 main_~buf~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 0 |main_#t~post5|)) [2020-09-04 17:49:19,616 INFO L264 CegarLoopResult]: At program point L40-1(line 40) the Hoare annotation is: (and (<= 1 main_~buf~0) (<= (+ |main_#t~post5| 2) main_~bufferlen~0) (<= (+ main_~buf~0 1) main_~bufferlen~0) (<= 0 |main_#t~post5|)) [2020-09-04 17:49:19,616 INFO L264 CegarLoopResult]: At program point L36(lines 26 37) the Hoare annotation is: (let ((.cse2 (+ main_~buf~0 main_~inlen~0)) (.cse0 (<= main_~buf~0 main_~buflim~0)) (.cse1 (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (.cse3 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and (<= 1 main_~buf~0) .cse0 .cse1 (<= 1 main_~in~0) (<= (+ main_~in~0 main_~buflim~0 3) .cse2) .cse3) (and (<= (+ main_~in~0 main_~bufferlen~0 1) .cse2) (<= 0 main_~buf~0) .cse0 .cse1 .cse3 (<= 0 main_~in~0)))) [2020-09-04 17:49:19,616 INFO L264 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (let ((.cse5 (+ main_~in~0 main_~buflim~0 3))) (let ((.cse0 (<= .cse5 (+ |main_#t~post3| main_~inlen~0))) (.cse6 (+ main_~buf~0 main_~inlen~0)) (.cse1 (<= 0 |main_#t~post3|)) (.cse2 (<= (+ main_~buf~0 1) main_~buflim~0)) (.cse3 (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (.cse4 (<= (+ |main_#t~post3| 1) main_~buflim~0)) (.cse7 (<= 0 main_~in~0)) (.cse8 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and .cse0 (<= 1 main_~buf~0) .cse1 .cse2 .cse3 .cse4 (<= .cse5 .cse6) .cse7 .cse8) (and .cse0 (<= (+ main_~in~0 main_~bufferlen~0 1) .cse6) .cse1 (<= 0 main_~buf~0) .cse2 .cse3 .cse4 .cse7 .cse8)))) [2020-09-04 17:49:19,616 INFO L264 CegarLoopResult]: At program point L32-1(line 32) the Hoare annotation is: (and (<= (+ main_~in~0 main_~buflim~0 3) (+ |main_#t~post3| main_~inlen~0)) (<= 1 main_~buf~0) (<= (+ main_~in~0 main_~buflim~0 4) (+ main_~buf~0 main_~inlen~0)) (<= 0 |main_#t~post3|) (<= (+ main_~buflim~0 2) main_~bufferlen~0) (< main_~buf~0 (+ main_~buflim~0 1)) (<= (+ |main_#t~post3| 1) main_~buflim~0) (<= 0 main_~in~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0)) [2020-09-04 17:49:19,616 INFO L264 CegarLoopResult]: At program point L28(lines 28 29) the Hoare annotation is: (let ((.cse2 (+ main_~buf~0 main_~inlen~0)) (.cse0 (<= main_~buf~0 main_~buflim~0)) (.cse1 (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (.cse3 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and (<= 1 main_~buf~0) .cse0 .cse1 (<= 1 main_~in~0) (<= (+ main_~in~0 main_~buflim~0 3) .cse2) .cse3) (and (<= (+ main_~in~0 main_~bufferlen~0 1) .cse2) (<= 0 main_~buf~0) .cse0 .cse1 .cse3 (<= 0 main_~in~0)))) [2020-09-04 17:49:19,617 INFO L264 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: (and (<= 0 main_~buf~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0)) [2020-09-04 17:49:19,617 INFO L271 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: true [2020-09-04 17:49:19,617 INFO L264 CegarLoopResult]: At program point L20-1(lines 14 45) the Hoare annotation is: (<= 2 main_~bufferlen~0) [2020-09-04 17:49:19,617 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-09-04 17:49:19,617 INFO L271 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: true [2020-09-04 17:49:19,617 INFO L271 CegarLoopResult]: At program point L16-2(line 16) the Hoare annotation is: true [2020-09-04 17:49:19,618 INFO L264 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: (and (<= 1 main_~buf~0) (<= (+ main_~buf~0 1) main_~bufferlen~0)) [2020-09-04 17:49:19,618 INFO L264 CegarLoopResult]: At program point L41-1(line 41) the Hoare annotation is: (and (<= (+ main_~buf~0 1) main_~bufferlen~0) (<= 2 main_~bufferlen~0)) [2020-09-04 17:49:19,618 INFO L264 CegarLoopResult]: At program point L33(lines 33 34) the Hoare annotation is: (and (<= 1 main_~buf~0) (<= (+ main_~in~0 main_~buflim~0 4) (+ main_~buf~0 main_~inlen~0)) (< main_~buf~0 (+ main_~buflim~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= 0 main_~in~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0)) [2020-09-04 17:49:19,618 INFO L264 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (and (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= 0 main_~buf~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0) (<= 0 main_~in~0)) [2020-09-04 17:49:19,618 INFO L264 CegarLoopResult]: At program point L21(lines 14 45) the Hoare annotation is: (<= 2 main_~bufferlen~0) [2020-09-04 17:49:19,618 INFO L271 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-09-04 17:49:19,619 INFO L271 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-09-04 17:49:19,619 INFO L271 CegarLoopResult]: At program point L17-2(line 17) the Hoare annotation is: true [2020-09-04 17:49:19,619 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 45) the Hoare annotation is: true [2020-09-04 17:49:19,619 INFO L271 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: true [2020-09-04 17:49:19,619 INFO L264 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: (and (<= 0 main_~buf~0) (<= (+ main_~buf~0 2) main_~bufferlen~0)) [2020-09-04 17:49:19,619 INFO L264 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: (let ((.cse0 (+ main_~buf~0 main_~inlen~0))) (and (<= 1 main_~buf~0) (<= (+ main_~in~0 main_~buflim~0 4) .cse0) (<= main_~buf~0 main_~buflim~0) (<= 0 |main_#t~post4|) (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= (+ |main_#t~post4| main_~buflim~0 4) .cse0) (<= 0 main_~in~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0))) [2020-09-04 17:49:19,620 INFO L264 CegarLoopResult]: At program point L34-1(line 34) the Hoare annotation is: (let ((.cse0 (+ main_~buf~0 main_~inlen~0))) (and (<= 1 main_~buf~0) (<= 0 |main_#t~post4|) (< main_~buf~0 (+ main_~buflim~0 1)) (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= 1 main_~in~0) (<= (+ |main_#t~post4| main_~buflim~0 4) .cse0) (<= (+ main_~in~0 main_~buflim~0 3) .cse0) (<= (+ main_~bufferlen~0 1) main_~inlen~0))) [2020-09-04 17:49:19,620 INFO L264 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (let ((.cse1 (<= (+ main_~buf~0 1) main_~buflim~0)) (.cse2 (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (.cse0 (+ main_~buf~0 main_~inlen~0)) (.cse3 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and (<= (+ main_~in~0 main_~bufferlen~0 1) .cse0) (<= 0 main_~buf~0) .cse1 .cse2 .cse3 (<= 0 main_~in~0)) (and (<= 1 main_~buf~0) .cse1 .cse2 (<= 1 main_~in~0) (<= (+ main_~in~0 main_~buflim~0 3) .cse0) .cse3))) [2020-09-04 17:49:19,620 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 45) the Hoare annotation is: true [2020-09-04 17:49:19,620 INFO L264 CegarLoopResult]: At program point L30-1(line 30) the Hoare annotation is: (let ((.cse1 (<= (+ main_~buf~0 1) main_~buflim~0)) (.cse2 (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (.cse0 (+ main_~buf~0 main_~inlen~0)) (.cse3 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and (<= (+ main_~in~0 main_~bufferlen~0 1) .cse0) (<= 0 main_~buf~0) .cse1 .cse2 .cse3 (<= 0 main_~in~0)) (and (<= 1 main_~buf~0) .cse1 .cse2 (<= 1 main_~in~0) (<= (+ main_~in~0 main_~buflim~0 3) .cse0) .cse3))) [2020-09-04 17:49:19,620 INFO L264 CegarLoopResult]: At program point L26-1(lines 26 37) the Hoare annotation is: (let ((.cse2 (+ main_~buf~0 main_~inlen~0)) (.cse0 (<= main_~buf~0 main_~buflim~0)) (.cse1 (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (.cse3 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and (<= 1 main_~buf~0) .cse0 .cse1 (<= 1 main_~in~0) (<= (+ main_~in~0 main_~buflim~0 3) .cse2) .cse3) (and (<= (+ main_~in~0 main_~bufferlen~0 1) .cse2) (<= 0 main_~buf~0) .cse0 .cse1 .cse3 (<= 0 main_~in~0)))) [2020-09-04 17:49:19,621 INFO L264 CegarLoopResult]: At program point L26-2(line 26) the Hoare annotation is: (and (<= 0 main_~buf~0) (<= (+ main_~buf~0 2) main_~bufferlen~0)) [2020-09-04 17:49:19,621 INFO L264 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (and (<= 2 main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0)) [2020-09-04 17:49:19,621 INFO L264 CegarLoopResult]: At program point L26-4(line 26) the Hoare annotation is: (let ((.cse2 (+ main_~buf~0 main_~inlen~0)) (.cse0 (<= main_~buf~0 main_~buflim~0)) (.cse1 (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (.cse3 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and (<= 1 main_~buf~0) .cse0 .cse1 (<= 1 main_~in~0) (<= (+ main_~in~0 main_~buflim~0 3) .cse2) .cse3) (and (<= (+ main_~in~0 main_~bufferlen~0 1) .cse2) (<= 0 main_~buf~0) .cse0 .cse1 .cse3 (<= 0 main_~in~0)))) [2020-09-04 17:49:19,621 INFO L264 CegarLoopResult]: At program point L26-5(lines 26 37) the Hoare annotation is: (and (<= 0 main_~buf~0) (<= (+ main_~buf~0 2) main_~bufferlen~0)) [2020-09-04 17:49:19,621 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-09-04 17:49:19,621 INFO L271 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: true [2020-09-04 17:49:19,621 INFO L271 CegarLoopResult]: At program point L43-1(line 43) the Hoare annotation is: true [2020-09-04 17:49:19,622 INFO L264 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: (and (<= 0 main_~buf~0) (<= (+ main_~buf~0 2) main_~bufferlen~0)) [2020-09-04 17:49:19,622 INFO L264 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: (and (<= 1 main_~buf~0) (<= main_~buf~0 main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= 1 main_~in~0) (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~bufferlen~0 1) main_~inlen~0)) [2020-09-04 17:49:19,622 INFO L264 CegarLoopResult]: At program point L35-1(line 35) the Hoare annotation is: (and (<= 1 main_~buf~0) (<= main_~buf~0 main_~buflim~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= 1 main_~in~0) (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~bufferlen~0 1) main_~inlen~0)) [2020-09-04 17:49:19,622 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-09-04 17:49:19,622 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-09-04 17:49:19,622 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-09-04 17:49:19,623 INFO L264 CegarLoopResult]: At program point L7(lines 7 9) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-09-04 17:49:19,623 INFO L264 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-09-04 17:49:19,623 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-09-04 17:49:19,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 05:49:19 BoogieIcfgContainer [2020-09-04 17:49:19,648 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 17:49:19,650 INFO L168 Benchmark]: Toolchain (without parser) took 11638.00 ms. Allocated memory was 140.5 MB in the beginning and 337.1 MB in the end (delta: 196.6 MB). Free memory was 104.0 MB in the beginning and 240.5 MB in the end (delta: -136.5 MB). Peak memory consumption was 202.7 MB. Max. memory is 7.1 GB. [2020-09-04 17:49:19,651 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 140.5 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-09-04 17:49:19,651 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.67 ms. Allocated memory is still 140.5 MB. Free memory was 103.8 MB in the beginning and 94.0 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-09-04 17:49:19,652 INFO L168 Benchmark]: Boogie Preprocessor took 117.32 ms. Allocated memory was 140.5 MB in the beginning and 203.4 MB in the end (delta: 62.9 MB). Free memory was 94.0 MB in the beginning and 182.2 MB in the end (delta: -88.2 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2020-09-04 17:49:19,653 INFO L168 Benchmark]: RCFGBuilder took 386.77 ms. Allocated memory is still 203.4 MB. Free memory was 182.2 MB in the beginning and 166.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 7.1 GB. [2020-09-04 17:49:19,654 INFO L168 Benchmark]: TraceAbstraction took 10806.01 ms. Allocated memory was 203.4 MB in the beginning and 337.1 MB in the end (delta: 133.7 MB). Free memory was 165.5 MB in the beginning and 240.5 MB in the end (delta: -75.0 MB). Peak memory consumption was 201.3 MB. Max. memory is 7.1 GB. [2020-09-04 17:49:19,657 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.20 ms. Allocated memory is still 140.5 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 322.67 ms. Allocated memory is still 140.5 MB. Free memory was 103.8 MB in the beginning and 94.0 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 117.32 ms. Allocated memory was 140.5 MB in the beginning and 203.4 MB in the end (delta: 62.9 MB). Free memory was 94.0 MB in the beginning and 182.2 MB in the end (delta: -88.2 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 386.77 ms. Allocated memory is still 203.4 MB. Free memory was 182.2 MB in the beginning and 166.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10806.01 ms. Allocated memory was 203.4 MB in the beginning and 337.1 MB in the end (delta: 133.7 MB). Free memory was 165.5 MB in the beginning and 240.5 MB in the end (delta: -75.0 MB). Peak memory consumption was 201.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: 26]: Loop Invariant Derived loop invariant: (((((1 <= buf && buf <= buflim) && buflim + 2 <= bufferlen) && 1 <= in) && in + buflim + 3 <= buf + inlen) && bufferlen + 1 <= inlen) || (((((in + bufferlen + 1 <= buf + inlen && 0 <= buf) && buf <= buflim) && buflim + 2 <= bufferlen) && bufferlen + 1 <= inlen) && 0 <= in) - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 7.9s, OverallIterations: 16, TraceHistogramMax: 16, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 863 SDtfs, 907 SDslu, 3750 SDs, 0 SdLazy, 1792 SolverSat, 396 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 460 GetRequests, 239 SyntacticMatches, 1 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 101 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 55 LocationsWithAnnotation, 289 PreInvPairs, 460 NumberOfFragments, 911 HoareAnnotationTreeSize, 289 FomulaSimplifications, 48419 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 55 FomulaSimplificationsInter, 3947 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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...