/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-72570d3 [2020-08-22 19:47:46,375 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-22 19:47:46,378 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-22 19:47:46,417 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-22 19:47:46,417 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-22 19:47:46,425 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-22 19:47:46,428 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-22 19:47:46,433 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-22 19:47:46,435 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-22 19:47:46,438 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-22 19:47:46,439 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-22 19:47:46,440 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-22 19:47:46,440 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-22 19:47:46,443 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-22 19:47:46,446 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-22 19:47:46,447 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-22 19:47:46,449 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-22 19:47:46,450 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-22 19:47:46,451 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-22 19:47:46,460 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-22 19:47:46,463 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-22 19:47:46,464 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-22 19:47:46,465 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-22 19:47:46,466 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-22 19:47:46,478 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-22 19:47:46,478 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-22 19:47:46,479 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-22 19:47:46,480 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-22 19:47:46,485 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-22 19:47:46,486 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-22 19:47:46,486 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-22 19:47:46,490 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-22 19:47:46,490 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-22 19:47:46,495 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-22 19:47:46,496 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-22 19:47:46,496 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-22 19:47:46,497 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-22 19:47:46,497 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-22 19:47:46,497 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-22 19:47:46,499 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-22 19:47:46,500 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-22 19:47:46,501 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-08-22 19:47:46,519 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-22 19:47:46,520 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-22 19:47:46,522 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-22 19:47:46,522 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-22 19:47:46,522 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-22 19:47:46,522 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-22 19:47:46,523 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-22 19:47:46,523 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-22 19:47:46,523 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-22 19:47:46,523 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-22 19:47:46,524 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-22 19:47:46,525 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-22 19:47:46,525 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-22 19:47:46,525 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-22 19:47:46,526 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-22 19:47:46,526 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-08-22 19:47:46,526 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-22 19:47:46,526 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-22 19:47:46,526 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 19:47:46,527 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-22 19:47:46,527 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-08-22 19:47:46,527 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-22 19:47:46,527 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-08-22 19:47:46,837 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-22 19:47:46,852 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-22 19:47:46,856 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-22 19:47:46,857 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-22 19:47:46,858 INFO L275 PluginConnector]: CDTParser initialized [2020-08-22 19:47:46,859 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2020-08-22 19:47:46,924 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11b132c25/410dda530c8c4035a12bbd33b12bec95/FLAG2d5b11b69 [2020-08-22 19:47:47,373 INFO L306 CDTParser]: Found 1 translation units. [2020-08-22 19:47:47,373 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2020-08-22 19:47:47,381 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11b132c25/410dda530c8c4035a12bbd33b12bec95/FLAG2d5b11b69 [2020-08-22 19:47:47,723 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11b132c25/410dda530c8c4035a12bbd33b12bec95 [2020-08-22 19:47:47,733 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-22 19:47:47,734 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-22 19:47:47,735 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-22 19:47:47,736 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-22 19:47:47,740 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-22 19:47:47,741 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 07:47:47" (1/1) ... [2020-08-22 19:47:47,745 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78be0286 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 07:47:47, skipping insertion in model container [2020-08-22 19:47:47,745 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 07:47:47" (1/1) ... [2020-08-22 19:47:47,753 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-22 19:47:47,772 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-22 19:47:47,975 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 19:47:47,979 INFO L203 MainTranslator]: Completed pre-run [2020-08-22 19:47:47,996 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 19:47:48,009 INFO L208 MainTranslator]: Completed translation [2020-08-22 19:47:48,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 07:47:48 WrapperNode [2020-08-22 19:47:48,010 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-22 19:47:48,011 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-22 19:47:48,011 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-22 19:47:48,011 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-22 19:47:48,022 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 07:47:48" (1/1) ... [2020-08-22 19:47:48,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 07:47:48" (1/1) ... [2020-08-22 19:47:48,027 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 07:47:48" (1/1) ... [2020-08-22 19:47:48,028 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 07:47:48" (1/1) ... [2020-08-22 19:47:48,033 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 07:47:48" (1/1) ... [2020-08-22 19:47:48,115 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 07:47:48" (1/1) ... [2020-08-22 19:47:48,116 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 07:47:48" (1/1) ... [2020-08-22 19:47:48,119 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-22 19:47:48,119 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-22 19:47:48,119 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-22 19:47:48,119 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-22 19:47:48,120 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 07:47:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 19:47:48,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-22 19:47:48,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-22 19:47:48,176 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-08-22 19:47:48,176 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-08-22 19:47:48,176 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-22 19:47:48,176 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-22 19:47:48,176 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-08-22 19:47:48,177 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-08-22 19:47:48,177 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-08-22 19:47:48,177 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-22 19:47:48,178 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-22 19:47:48,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-22 19:47:48,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-22 19:47:48,445 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-22 19:47:48,452 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-08-22 19:47:48,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 07:47:48 BoogieIcfgContainer [2020-08-22 19:47:48,456 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-22 19:47:48,457 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-22 19:47:48,457 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-22 19:47:48,460 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-22 19:47:48,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.08 07:47:47" (1/3) ... [2020-08-22 19:47:48,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42e8a21a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 07:47:48, skipping insertion in model container [2020-08-22 19:47:48,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 07:47:48" (2/3) ... [2020-08-22 19:47:48,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42e8a21a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 07:47:48, skipping insertion in model container [2020-08-22 19:47:48,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 07:47:48" (3/3) ... [2020-08-22 19:47:48,464 INFO L109 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.i [2020-08-22 19:47:48,476 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-22 19:47:48,485 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-22 19:47:48,501 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-22 19:47:48,526 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-22 19:47:48,526 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-22 19:47:48,526 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-08-22 19:47:48,526 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-22 19:47:48,526 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-22 19:47:48,527 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-22 19:47:48,527 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-22 19:47:48,527 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-22 19:47:48,544 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2020-08-22 19:47:48,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-08-22 19:47:48,556 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:47:48,557 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-08-22 19:47:48,557 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:47:48,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:47:48,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1122321079, now seen corresponding path program 1 times [2020-08-22 19:47:48,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:47:48,570 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1130041372] [2020-08-22 19:47:48,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:47:48,626 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:47:48,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:48,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:47:48,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:48,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 19:47:48,714 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1130041372] [2020-08-22 19:47:48,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:47:48,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-08-22 19:47:48,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628273292] [2020-08-22 19:47:48,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-08-22 19:47:48,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:47:48,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-08-22 19:47:48,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-08-22 19:47:48,737 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 2 states. [2020-08-22 19:47:48,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:47:48,770 INFO L93 Difference]: Finished difference Result 91 states and 122 transitions. [2020-08-22 19:47:48,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-08-22 19:47:48,771 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2020-08-22 19:47:48,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:47:48,781 INFO L225 Difference]: With dead ends: 91 [2020-08-22 19:47:48,781 INFO L226 Difference]: Without dead ends: 47 [2020-08-22 19:47:48,786 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-08-22 19:47:48,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-08-22 19:47:48,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-08-22 19:47:48,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-08-22 19:47:48,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2020-08-22 19:47:48,834 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 24 [2020-08-22 19:47:48,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:47:48,835 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2020-08-22 19:47:48,835 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-08-22 19:47:48,835 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2020-08-22 19:47:48,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-22 19:47:48,837 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:47:48,837 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-08-22 19:47:48,838 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-22 19:47:48,838 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:47:48,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:47:48,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1949391841, now seen corresponding path program 1 times [2020-08-22 19:47:48,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:47:48,840 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1642555516] [2020-08-22 19:47:48,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:47:48,842 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:47:48,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:48,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:47:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:48,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 19:47:48,967 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1642555516] [2020-08-22 19:47:48,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:47:48,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-22 19:47:48,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33630632] [2020-08-22 19:47:48,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 19:47:48,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:47:48,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 19:47:48,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-22 19:47:48,971 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 5 states. [2020-08-22 19:47:49,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:47:49,173 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2020-08-22 19:47:49,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-22 19:47:49,175 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2020-08-22 19:47:49,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:47:49,179 INFO L225 Difference]: With dead ends: 66 [2020-08-22 19:47:49,180 INFO L226 Difference]: Without dead ends: 64 [2020-08-22 19:47:49,182 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-08-22 19:47:49,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-08-22 19:47:49,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2020-08-22 19:47:49,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-08-22 19:47:49,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2020-08-22 19:47:49,225 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 26 [2020-08-22 19:47:49,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:47:49,226 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2020-08-22 19:47:49,227 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 19:47:49,227 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2020-08-22 19:47:49,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-08-22 19:47:49,229 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:47:49,229 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-08-22 19:47:49,231 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-22 19:47:49,232 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:47:49,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:47:49,232 INFO L82 PathProgramCache]: Analyzing trace with hash -873076999, now seen corresponding path program 1 times [2020-08-22 19:47:49,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:47:49,234 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1185589639] [2020-08-22 19:47:49,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:47:49,240 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:47:49,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:49,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:47:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:49,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 19:47:49,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:49,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 19:47:49,362 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1185589639] [2020-08-22 19:47:49,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:47:49,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-08-22 19:47:49,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646355468] [2020-08-22 19:47:49,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-22 19:47:49,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:47:49,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-22 19:47:49,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-08-22 19:47:49,365 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand 6 states. [2020-08-22 19:47:49,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:47:49,545 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2020-08-22 19:47:49,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-22 19:47:49,547 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2020-08-22 19:47:49,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:47:49,549 INFO L225 Difference]: With dead ends: 70 [2020-08-22 19:47:49,549 INFO L226 Difference]: Without dead ends: 68 [2020-08-22 19:47:49,550 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-08-22 19:47:49,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-08-22 19:47:49,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2020-08-22 19:47:49,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-08-22 19:47:49,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2020-08-22 19:47:49,572 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 31 [2020-08-22 19:47:49,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:47:49,573 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2020-08-22 19:47:49,573 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-22 19:47:49,573 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2020-08-22 19:47:49,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-08-22 19:47:49,575 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:47:49,575 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-08-22 19:47:49,575 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-22 19:47:49,576 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:47:49,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:47:49,576 INFO L82 PathProgramCache]: Analyzing trace with hash 2057902492, now seen corresponding path program 1 times [2020-08-22 19:47:49,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:47:49,577 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [297531209] [2020-08-22 19:47:49,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:47:49,579 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:47:49,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:49,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:47:49,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:49,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 19:47:49,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:49,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 19:47:49,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:49,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 19:47:49,778 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [297531209] [2020-08-22 19:47:49,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:47:49,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-22 19:47:49,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016777412] [2020-08-22 19:47:49,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 19:47:49,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:47:49,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 19:47:49,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-22 19:47:49,781 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand 7 states. [2020-08-22 19:47:49,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:47:49,936 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2020-08-22 19:47:49,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-22 19:47:49,937 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2020-08-22 19:47:49,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:47:49,938 INFO L225 Difference]: With dead ends: 77 [2020-08-22 19:47:49,939 INFO L226 Difference]: Without dead ends: 75 [2020-08-22 19:47:49,939 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-08-22 19:47:49,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-08-22 19:47:49,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2020-08-22 19:47:49,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-08-22 19:47:49,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2020-08-22 19:47:49,956 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 39 [2020-08-22 19:47:49,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:47:49,957 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2020-08-22 19:47:49,957 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 19:47:49,957 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2020-08-22 19:47:49,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-08-22 19:47:49,960 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:47:49,961 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-08-22 19:47:49,961 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-22 19:47:49,961 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:47:49,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:47:49,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1847294180, now seen corresponding path program 1 times [2020-08-22 19:47:49,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:47:49,966 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1758625532] [2020-08-22 19:47:49,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:47:49,970 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:47:49,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:50,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:47:50,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:50,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 19:47:50,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:50,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 19:47:50,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:50,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-08-22 19:47:50,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:50,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 19:47:50,135 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1758625532] [2020-08-22 19:47:50,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:47:50,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-08-22 19:47:50,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234864648] [2020-08-22 19:47:50,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-22 19:47:50,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:47:50,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-22 19:47:50,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-08-22 19:47:50,137 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand 8 states. [2020-08-22 19:47:50,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:47:50,385 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2020-08-22 19:47:50,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-22 19:47:50,385 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2020-08-22 19:47:50,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:47:50,387 INFO L225 Difference]: With dead ends: 81 [2020-08-22 19:47:50,387 INFO L226 Difference]: Without dead ends: 63 [2020-08-22 19:47:50,389 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-08-22 19:47:50,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-08-22 19:47:50,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2020-08-22 19:47:50,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-08-22 19:47:50,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2020-08-22 19:47:50,400 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 44 [2020-08-22 19:47:50,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:47:50,400 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2020-08-22 19:47:50,401 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-22 19:47:50,401 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2020-08-22 19:47:50,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-08-22 19:47:50,402 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:47:50,402 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-08-22 19:47:50,403 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-22 19:47:50,403 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:47:50,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:47:50,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1076854334, now seen corresponding path program 1 times [2020-08-22 19:47:50,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:47:50,404 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1455116125] [2020-08-22 19:47:50,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:47:50,405 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:47:50,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:50,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:47:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:50,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 19:47:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:50,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 19:47:50,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:50,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 19:47:50,469 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1455116125] [2020-08-22 19:47:50,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:47:50,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-22 19:47:50,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642625739] [2020-08-22 19:47:50,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 19:47:50,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:47:50,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 19:47:50,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-22 19:47:50,471 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand 7 states. [2020-08-22 19:47:50,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:47:50,565 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2020-08-22 19:47:50,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-22 19:47:50,565 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2020-08-22 19:47:50,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:47:50,567 INFO L225 Difference]: With dead ends: 72 [2020-08-22 19:47:50,567 INFO L226 Difference]: Without dead ends: 70 [2020-08-22 19:47:50,567 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-08-22 19:47:50,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-08-22 19:47:50,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2020-08-22 19:47:50,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-08-22 19:47:50,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2020-08-22 19:47:50,579 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 43 [2020-08-22 19:47:50,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:47:50,579 INFO L479 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2020-08-22 19:47:50,579 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 19:47:50,579 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2020-08-22 19:47:50,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-08-22 19:47:50,581 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:47:50,581 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-08-22 19:47:50,581 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-22 19:47:50,582 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:47:50,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:47:50,582 INFO L82 PathProgramCache]: Analyzing trace with hash 146364602, now seen corresponding path program 1 times [2020-08-22 19:47:50,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:47:50,583 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [533195433] [2020-08-22 19:47:50,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:47:50,584 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:47:50,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:50,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:47:50,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:50,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 19:47:50,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:50,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 19:47:50,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:50,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-08-22 19:47:50,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:50,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 19:47:50,736 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [533195433] [2020-08-22 19:47:50,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:47:50,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-08-22 19:47:50,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386935254] [2020-08-22 19:47:50,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-22 19:47:50,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:47:50,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-22 19:47:50,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-08-22 19:47:50,739 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand 9 states. [2020-08-22 19:47:50,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:47:50,994 INFO L93 Difference]: Finished difference Result 98 states and 113 transitions. [2020-08-22 19:47:50,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-22 19:47:50,994 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2020-08-22 19:47:50,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:47:50,997 INFO L225 Difference]: With dead ends: 98 [2020-08-22 19:47:50,997 INFO L226 Difference]: Without dead ends: 96 [2020-08-22 19:47:50,998 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-08-22 19:47:50,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-08-22 19:47:51,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 77. [2020-08-22 19:47:51,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-08-22 19:47:51,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2020-08-22 19:47:51,021 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 48 [2020-08-22 19:47:51,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:47:51,025 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2020-08-22 19:47:51,025 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-22 19:47:51,025 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2020-08-22 19:47:51,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-08-22 19:47:51,027 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:47:51,028 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-08-22 19:47:51,028 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-22 19:47:51,028 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:47:51,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:47:51,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1943579560, now seen corresponding path program 1 times [2020-08-22 19:47:51,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:47:51,031 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1260072292] [2020-08-22 19:47:51,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:47:51,064 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:47:51,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:51,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:47:51,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:51,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 19:47:51,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:51,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 19:47:51,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:51,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-08-22 19:47:51,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:51,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 19:47:51,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:51,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 19:47:51,136 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1260072292] [2020-08-22 19:47:51,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:47:51,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-22 19:47:51,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716182817] [2020-08-22 19:47:51,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 19:47:51,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:47:51,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 19:47:51,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-22 19:47:51,139 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 7 states. [2020-08-22 19:47:51,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:47:51,246 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2020-08-22 19:47:51,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-22 19:47:51,247 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2020-08-22 19:47:51,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:47:51,250 INFO L225 Difference]: With dead ends: 83 [2020-08-22 19:47:51,250 INFO L226 Difference]: Without dead ends: 81 [2020-08-22 19:47:51,251 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-08-22 19:47:51,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-08-22 19:47:51,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2020-08-22 19:47:51,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-08-22 19:47:51,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2020-08-22 19:47:51,265 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 56 [2020-08-22 19:47:51,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:47:51,265 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2020-08-22 19:47:51,266 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 19:47:51,266 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2020-08-22 19:47:51,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-08-22 19:47:51,267 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:47:51,267 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-08-22 19:47:51,268 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-22 19:47:51,268 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:47:51,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:47:51,268 INFO L82 PathProgramCache]: Analyzing trace with hash 903884048, now seen corresponding path program 1 times [2020-08-22 19:47:51,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:47:51,269 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [42005406] [2020-08-22 19:47:51,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:47:51,277 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:47:51,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:51,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:47:51,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:51,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 19:47:51,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:51,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 19:47:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:51,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-08-22 19:47:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:51,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 19:47:51,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:51,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-08-22 19:47:51,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:51,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 19:47:51,378 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [42005406] [2020-08-22 19:47:51,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:47:51,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-08-22 19:47:51,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803189728] [2020-08-22 19:47:51,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-22 19:47:51,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:47:51,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-22 19:47:51,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-08-22 19:47:51,381 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 8 states. [2020-08-22 19:47:51,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:47:51,592 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2020-08-22 19:47:51,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-22 19:47:51,593 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2020-08-22 19:47:51,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:47:51,595 INFO L225 Difference]: With dead ends: 100 [2020-08-22 19:47:51,595 INFO L226 Difference]: Without dead ends: 98 [2020-08-22 19:47:51,596 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-08-22 19:47:51,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-08-22 19:47:51,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2020-08-22 19:47:51,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-08-22 19:47:51,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2020-08-22 19:47:51,612 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 61 [2020-08-22 19:47:51,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:47:51,612 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2020-08-22 19:47:51,612 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-22 19:47:51,613 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2020-08-22 19:47:51,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-08-22 19:47:51,614 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:47:51,614 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-08-22 19:47:51,615 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-22 19:47:51,615 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:47:51,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:47:51,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1662212275, now seen corresponding path program 1 times [2020-08-22 19:47:51,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:47:51,616 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [334299730] [2020-08-22 19:47:51,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:47:51,623 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:47:51,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:51,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:47:51,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:51,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 19:47:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:51,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 19:47:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:51,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-08-22 19:47:51,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:51,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 19:47:51,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:51,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-08-22 19:47:51,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:51,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-08-22 19:47:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:51,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 19:47:51,724 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [334299730] [2020-08-22 19:47:51,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:47:51,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-08-22 19:47:51,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956614231] [2020-08-22 19:47:51,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-22 19:47:51,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:47:51,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-22 19:47:51,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-08-22 19:47:51,726 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand 9 states. [2020-08-22 19:47:51,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:47:51,889 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2020-08-22 19:47:51,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-22 19:47:51,889 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2020-08-22 19:47:51,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:47:51,891 INFO L225 Difference]: With dead ends: 100 [2020-08-22 19:47:51,891 INFO L226 Difference]: Without dead ends: 98 [2020-08-22 19:47:51,892 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-08-22 19:47:51,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-08-22 19:47:51,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2020-08-22 19:47:51,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-08-22 19:47:51,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2020-08-22 19:47:51,907 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 69 [2020-08-22 19:47:51,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:47:51,908 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2020-08-22 19:47:51,908 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-22 19:47:51,908 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2020-08-22 19:47:51,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-08-22 19:47:51,909 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:47:51,909 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-08-22 19:47:51,909 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-22 19:47:51,910 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:47:51,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:47:51,910 INFO L82 PathProgramCache]: Analyzing trace with hash 71900773, now seen corresponding path program 1 times [2020-08-22 19:47:51,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:47:51,911 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1284221952] [2020-08-22 19:47:51,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:47:51,918 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:47:51,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:52,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:47:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:52,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 19:47:52,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:52,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 19:47:52,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:52,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-08-22 19:47:52,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:52,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 19:47:52,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:52,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-08-22 19:47:52,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:52,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-08-22 19:47:52,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:52,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-08-22 19:47:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:52,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 19:47:52,109 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1284221952] [2020-08-22 19:47:52,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:47:52,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-08-22 19:47:52,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348759539] [2020-08-22 19:47:52,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-22 19:47:52,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:47:52,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-22 19:47:52,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-08-22 19:47:52,115 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand 11 states. [2020-08-22 19:47:52,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:47:52,580 INFO L93 Difference]: Finished difference Result 119 states and 134 transitions. [2020-08-22 19:47:52,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-22 19:47:52,580 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2020-08-22 19:47:52,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:47:52,582 INFO L225 Difference]: With dead ends: 119 [2020-08-22 19:47:52,583 INFO L226 Difference]: Without dead ends: 101 [2020-08-22 19:47:52,585 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-08-22 19:47:52,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-08-22 19:47:52,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2020-08-22 19:47:52,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-08-22 19:47:52,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2020-08-22 19:47:52,610 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 74 [2020-08-22 19:47:52,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:47:52,610 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2020-08-22 19:47:52,610 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-22 19:47:52,611 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2020-08-22 19:47:52,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-08-22 19:47:52,614 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:47:52,614 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-08-22 19:47:52,614 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-22 19:47:52,614 INFO L427 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:47:52,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:47:52,615 INFO L82 PathProgramCache]: Analyzing trace with hash -50388093, now seen corresponding path program 1 times [2020-08-22 19:47:52,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:47:52,616 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [860773668] [2020-08-22 19:47:52,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:47:52,625 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:47:52,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:52,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:47:52,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:52,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 19:47:52,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:52,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 19:47:52,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:52,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-08-22 19:47:52,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:52,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 19:47:52,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:52,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-08-22 19:47:52,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:52,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-08-22 19:47:52,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:52,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-08-22 19:47:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:52,772 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-22 19:47:52,773 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [860773668] [2020-08-22 19:47:52,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:47:52,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-08-22 19:47:52,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424692439] [2020-08-22 19:47:52,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-22 19:47:52,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:47:52,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-22 19:47:52,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-08-22 19:47:52,775 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand 11 states. [2020-08-22 19:47:53,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:47:53,103 INFO L93 Difference]: Finished difference Result 128 states and 143 transitions. [2020-08-22 19:47:53,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-22 19:47:53,103 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 78 [2020-08-22 19:47:53,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:47:53,105 INFO L225 Difference]: With dead ends: 128 [2020-08-22 19:47:53,105 INFO L226 Difference]: Without dead ends: 126 [2020-08-22 19:47:53,106 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-08-22 19:47:53,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-08-22 19:47:53,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 107. [2020-08-22 19:47:53,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-08-22 19:47:53,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2020-08-22 19:47:53,129 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 78 [2020-08-22 19:47:53,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:47:53,130 INFO L479 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2020-08-22 19:47:53,130 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-22 19:47:53,130 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2020-08-22 19:47:53,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-08-22 19:47:53,131 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:47:53,131 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-08-22 19:47:53,132 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-22 19:47:53,132 INFO L427 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:47:53,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:47:53,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1911943399, now seen corresponding path program 2 times [2020-08-22 19:47:53,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:47:53,133 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [155394405] [2020-08-22 19:47:53,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:47:53,143 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:47:53,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:53,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:47:53,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:53,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 19:47:53,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:53,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 19:47:53,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:53,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-08-22 19:47:53,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:53,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 19:47:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:53,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-08-22 19:47:53,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:53,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-08-22 19:47:53,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:53,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-08-22 19:47:53,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:53,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-08-22 19:47:53,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:53,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-08-22 19:47:53,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:53,341 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-08-22 19:47:53,341 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [155394405] [2020-08-22 19:47:53,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:47:53,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-08-22 19:47:53,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769941150] [2020-08-22 19:47:53,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-22 19:47:53,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:47:53,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-22 19:47:53,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-08-22 19:47:53,344 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand 11 states. [2020-08-22 19:47:53,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:47:53,802 INFO L93 Difference]: Finished difference Result 134 states and 151 transitions. [2020-08-22 19:47:53,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-22 19:47:53,803 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 91 [2020-08-22 19:47:53,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:47:53,811 INFO L225 Difference]: With dead ends: 134 [2020-08-22 19:47:53,811 INFO L226 Difference]: Without dead ends: 132 [2020-08-22 19:47:53,812 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-08-22 19:47:53,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-08-22 19:47:53,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 120. [2020-08-22 19:47:53,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-08-22 19:47:53,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 133 transitions. [2020-08-22 19:47:53,834 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 133 transitions. Word has length 91 [2020-08-22 19:47:53,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:47:53,834 INFO L479 AbstractCegarLoop]: Abstraction has 120 states and 133 transitions. [2020-08-22 19:47:53,834 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-22 19:47:53,834 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 133 transitions. [2020-08-22 19:47:53,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-08-22 19:47:53,836 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:47:53,836 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-08-22 19:47:53,836 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-22 19:47:53,837 INFO L427 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:47:53,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:47:53,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1949077486, now seen corresponding path program 2 times [2020-08-22 19:47:53,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:47:53,841 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1621365246] [2020-08-22 19:47:53,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:47:53,852 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:47:53,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:54,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:47:54,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:54,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 19:47:54,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:54,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 19:47:54,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:54,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-08-22 19:47:54,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:54,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 19:47:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:54,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-08-22 19:47:54,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:54,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-08-22 19:47:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:54,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-08-22 19:47:54,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:54,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-08-22 19:47:54,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:54,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-08-22 19:47:54,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:54,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-08-22 19:47:54,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:54,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-08-22 19:47:54,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:54,096 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-08-22 19:47:54,097 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1621365246] [2020-08-22 19:47:54,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:47:54,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-08-22 19:47:54,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220159380] [2020-08-22 19:47:54,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-22 19:47:54,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:47:54,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-22 19:47:54,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-08-22 19:47:54,099 INFO L87 Difference]: Start difference. First operand 120 states and 133 transitions. Second operand 13 states. [2020-08-22 19:47:54,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:47:54,417 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2020-08-22 19:47:54,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-22 19:47:54,420 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 104 [2020-08-22 19:47:54,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:47:54,422 INFO L225 Difference]: With dead ends: 126 [2020-08-22 19:47:54,423 INFO L226 Difference]: Without dead ends: 109 [2020-08-22 19:47:54,425 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-08-22 19:47:54,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-08-22 19:47:54,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 99. [2020-08-22 19:47:54,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-08-22 19:47:54,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 102 transitions. [2020-08-22 19:47:54,446 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 102 transitions. Word has length 104 [2020-08-22 19:47:54,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:47:54,447 INFO L479 AbstractCegarLoop]: Abstraction has 99 states and 102 transitions. [2020-08-22 19:47:54,447 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-22 19:47:54,447 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 102 transitions. [2020-08-22 19:47:54,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-08-22 19:47:54,449 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:47:54,449 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-08-22 19:47:54,449 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-08-22 19:47:54,450 INFO L427 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:47:54,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:47:54,450 INFO L82 PathProgramCache]: Analyzing trace with hash 55355532, now seen corresponding path program 2 times [2020-08-22 19:47:54,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:47:54,451 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [33273709] [2020-08-22 19:47:54,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:47:54,462 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:47:54,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:54,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:47:54,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:54,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 19:47:54,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:54,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 19:47:54,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:54,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-08-22 19:47:54,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:54,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 19:47:54,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:54,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-08-22 19:47:54,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:54,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-08-22 19:47:54,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:54,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-08-22 19:47:54,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:54,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-08-22 19:47:54,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:54,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-08-22 19:47:54,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:54,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-08-22 19:47:54,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:54,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-08-22 19:47:54,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:54,741 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-08-22 19:47:54,742 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [33273709] [2020-08-22 19:47:54,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:47:54,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-08-22 19:47:54,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364693773] [2020-08-22 19:47:54,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-08-22 19:47:54,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:47:54,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-08-22 19:47:54,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2020-08-22 19:47:54,744 INFO L87 Difference]: Start difference. First operand 99 states and 102 transitions. Second operand 16 states. [2020-08-22 19:47:55,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:47:55,313 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2020-08-22 19:47:55,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-08-22 19:47:55,314 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 108 [2020-08-22 19:47:55,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:47:55,315 INFO L225 Difference]: With dead ends: 130 [2020-08-22 19:47:55,318 INFO L226 Difference]: Without dead ends: 128 [2020-08-22 19:47:55,322 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2020-08-22 19:47:55,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-08-22 19:47:55,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 117. [2020-08-22 19:47:55,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-08-22 19:47:55,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 123 transitions. [2020-08-22 19:47:55,340 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 123 transitions. Word has length 108 [2020-08-22 19:47:55,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:47:55,341 INFO L479 AbstractCegarLoop]: Abstraction has 117 states and 123 transitions. [2020-08-22 19:47:55,341 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-08-22 19:47:55,341 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2020-08-22 19:47:55,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2020-08-22 19:47:55,343 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:47:55,343 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-08-22 19:47:55,343 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-08-22 19:47:55,344 INFO L427 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:47:55,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:47:55,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1897035733, now seen corresponding path program 3 times [2020-08-22 19:47:55,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:47:55,345 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [156993062] [2020-08-22 19:47:55,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:47:55,352 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:47:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:55,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:47:55,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:55,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 19:47:55,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:55,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 19:47:55,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:55,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-08-22 19:47:55,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:55,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 19:47:55,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:55,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-08-22 19:47:55,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:55,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-08-22 19:47:55,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:55,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-08-22 19:47:55,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:55,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2020-08-22 19:47:55,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:55,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-08-22 19:47:55,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:55,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-08-22 19:47:55,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:55,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-08-22 19:47:55,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:55,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2020-08-22 19:47:55,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:55,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2020-08-22 19:47:55,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:55,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2020-08-22 19:47:55,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:55,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2020-08-22 19:47:55,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:47:55,827 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-08-22 19:47:55,827 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [156993062] [2020-08-22 19:47:55,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:47:55,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2020-08-22 19:47:55,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538576542] [2020-08-22 19:47:55,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-08-22 19:47:55,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:47:55,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-08-22 19:47:55,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2020-08-22 19:47:55,830 INFO L87 Difference]: Start difference. First operand 117 states and 123 transitions. Second operand 21 states. [2020-08-22 19:47:56,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:47:56,438 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2020-08-22 19:47:56,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-08-22 19:47:56,439 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 138 [2020-08-22 19:47:56,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:47:56,440 INFO L225 Difference]: With dead ends: 117 [2020-08-22 19:47:56,440 INFO L226 Difference]: Without dead ends: 0 [2020-08-22 19:47:56,445 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-08-22 19:47:56,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-08-22 19:47:56,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-08-22 19:47:56,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-08-22 19:47:56,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-08-22 19:47:56,446 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 138 [2020-08-22 19:47:56,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:47:56,447 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-08-22 19:47:56,447 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-08-22 19:47:56,447 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-08-22 19:47:56,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-08-22 19:47:56,447 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-08-22 19:47:56,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-08-22 19:47:57,225 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 27 [2020-08-22 19:47:58,003 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 27 [2020-08-22 19:47:58,206 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 27 [2020-08-22 19:47:58,686 WARN L193 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 34 [2020-08-22 19:47:58,691 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-08-22 19:47:58,691 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-08-22 19:47:58,691 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-08-22 19:47:58,691 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-08-22 19:47:58,691 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-08-22 19:47:58,691 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-08-22 19:47:58,692 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-08-22 19:47:58,692 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-08-22 19:47:58,692 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-08-22 19:47:58,692 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-08-22 19:47:58,692 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-08-22 19:47:58,692 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-08-22 19:47:58,692 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 45) the Hoare annotation is: true [2020-08-22 19:47:58,693 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-08-22 19:47:58,693 INFO L271 CegarLoopResult]: At program point L44(lines 14 45) the Hoare annotation is: true [2020-08-22 19:47:58,693 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-08-22 19:47:58,693 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-08-22 19:47:58,693 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-08-22 19:47:58,693 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-08-22 19:47:58,694 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-08-22 19:47:58,694 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-08-22 19:47:58,694 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-08-22 19:47:58,694 INFO L271 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: true [2020-08-22 19:47:58,694 INFO L264 CegarLoopResult]: At program point L20-1(lines 14 45) the Hoare annotation is: (<= 2 main_~bufferlen~0) [2020-08-22 19:47:58,694 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-08-22 19:47:58,695 INFO L271 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: true [2020-08-22 19:47:58,695 INFO L271 CegarLoopResult]: At program point L16-2(line 16) the Hoare annotation is: true [2020-08-22 19:47:58,695 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-08-22 19:47:58,695 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-08-22 19:47:58,695 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-08-22 19:47:58,695 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-08-22 19:47:58,696 INFO L264 CegarLoopResult]: At program point L21(lines 14 45) the Hoare annotation is: (<= 2 main_~bufferlen~0) [2020-08-22 19:47:58,696 INFO L271 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-08-22 19:47:58,696 INFO L271 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-08-22 19:47:58,696 INFO L271 CegarLoopResult]: At program point L17-2(line 17) the Hoare annotation is: true [2020-08-22 19:47:58,696 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 45) the Hoare annotation is: true [2020-08-22 19:47:58,696 INFO L271 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: true [2020-08-22 19:47:58,696 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-08-22 19:47:58,697 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-08-22 19:47:58,697 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-08-22 19:47:58,697 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-08-22 19:47:58,697 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 45) the Hoare annotation is: true [2020-08-22 19:47:58,697 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-08-22 19:47:58,698 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-08-22 19:47:58,698 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-08-22 19:47:58,698 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-08-22 19:47:58,698 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-08-22 19:47:58,698 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-08-22 19:47:58,698 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-08-22 19:47:58,698 INFO L271 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: true [2020-08-22 19:47:58,699 INFO L271 CegarLoopResult]: At program point L43-1(line 43) the Hoare annotation is: true [2020-08-22 19:47:58,699 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-08-22 19:47:58,699 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-08-22 19:47:58,699 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-08-22 19:47:58,699 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-08-22 19:47:58,699 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-08-22 19:47:58,699 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-08-22 19:47:58,700 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-08-22 19:47:58,700 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-08-22 19:47:58,700 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-08-22 19:47:58,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.08 07:47:58 BoogieIcfgContainer [2020-08-22 19:47:58,724 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-22 19:47:58,726 INFO L168 Benchmark]: Toolchain (without parser) took 10991.66 ms. Allocated memory was 139.5 MB in the beginning and 320.3 MB in the end (delta: 180.9 MB). Free memory was 103.4 MB in the beginning and 193.5 MB in the end (delta: -90.0 MB). Peak memory consumption was 187.8 MB. Max. memory is 7.1 GB. [2020-08-22 19:47:58,727 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 139.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-08-22 19:47:58,728 INFO L168 Benchmark]: CACSL2BoogieTranslator took 275.06 ms. Allocated memory is still 139.5 MB. Free memory was 103.2 MB in the beginning and 93.6 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-08-22 19:47:58,729 INFO L168 Benchmark]: Boogie Preprocessor took 108.06 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 93.6 MB in the beginning and 182.0 MB in the end (delta: -88.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. [2020-08-22 19:47:58,729 INFO L168 Benchmark]: RCFGBuilder took 336.60 ms. Allocated memory is still 202.9 MB. Free memory was 182.0 MB in the beginning and 165.2 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 7.1 GB. [2020-08-22 19:47:58,730 INFO L168 Benchmark]: TraceAbstraction took 10267.15 ms. Allocated memory was 202.9 MB in the beginning and 320.3 MB in the end (delta: 117.4 MB). Free memory was 164.5 MB in the beginning and 193.5 MB in the end (delta: -28.9 MB). Peak memory consumption was 185.5 MB. Max. memory is 7.1 GB. [2020-08-22 19:47:58,734 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.25 ms. Allocated memory is still 139.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 275.06 ms. Allocated memory is still 139.5 MB. Free memory was 103.2 MB in the beginning and 93.6 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 108.06 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 93.6 MB in the beginning and 182.0 MB in the end (delta: -88.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 336.60 ms. Allocated memory is still 202.9 MB. Free memory was 182.0 MB in the beginning and 165.2 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10267.15 ms. Allocated memory was 202.9 MB in the beginning and 320.3 MB in the end (delta: 117.4 MB). Free memory was 164.5 MB in the beginning and 193.5 MB in the end (delta: -28.9 MB). Peak memory consumption was 185.5 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.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 863 SDtfs, 907 SDslu, 3750 SDs, 0 SdLazy, 1792 SolverSat, 396 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 460 GetRequests, 239 SyntacticMatches, 1 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 2.8s 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.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 101 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 55 LocationsWithAnnotation, 289 PreInvPairs, 460 NumberOfFragments, 911 HoareAnnotationTreeSize, 289 FomulaSimplifications, 48419 FormulaSimplificationTreeSizeReduction, 0.6s 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...