/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/apache-get-tag.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 17:48:36,347 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 17:48:36,352 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 17:48:36,394 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 17:48:36,394 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 17:48:36,402 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 17:48:36,405 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 17:48:36,409 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 17:48:36,412 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 17:48:36,415 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 17:48:36,416 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 17:48:36,417 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 17:48:36,417 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 17:48:36,420 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 17:48:36,423 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 17:48:36,424 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 17:48:36,426 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 17:48:36,427 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 17:48:36,429 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 17:48:36,437 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 17:48:36,440 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 17:48:36,441 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 17:48:36,442 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 17:48:36,443 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 17:48:36,455 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 17:48:36,455 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 17:48:36,455 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 17:48:36,456 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 17:48:36,457 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 17:48:36,458 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 17:48:36,458 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 17:48:36,459 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 17:48:36,466 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 17:48:36,466 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 17:48:36,467 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 17:48:36,468 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 17:48:36,468 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 17:48:36,468 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 17:48:36,472 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 17:48:36,473 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 17:48:36,473 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 17:48:36,476 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 17:48:36,495 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 17:48:36,495 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 17:48:36,496 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 17:48:36,497 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 17:48:36,498 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 17:48:36,498 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 17:48:36,498 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 17:48:36,498 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 17:48:36,499 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 17:48:36,499 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 17:48:36,500 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 17:48:36,500 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 17:48:36,501 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 17:48:36,501 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 17:48:36,501 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 17:48:36,502 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 17:48:36,502 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 17:48:36,502 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 17:48:36,502 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 17:48:36,503 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 17:48:36,503 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 17:48:36,503 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 17:48:36,503 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-09-04 17:48:36,927 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 17:48:36,944 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 17:48:36,948 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 17:48:36,949 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 17:48:36,950 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 17:48:36,951 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i [2020-09-04 17:48:37,035 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/abe2d09c6/9731973e32704536ac064e0885c0ce7c/FLAG25f5c6644 [2020-09-04 17:48:37,560 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 17:48:37,561 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/loop-invgen/apache-get-tag.i [2020-09-04 17:48:37,569 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/abe2d09c6/9731973e32704536ac064e0885c0ce7c/FLAG25f5c6644 [2020-09-04 17:48:37,916 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/abe2d09c6/9731973e32704536ac064e0885c0ce7c [2020-09-04 17:48:37,927 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 17:48:37,929 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 17:48:37,930 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 17:48:37,930 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 17:48:37,935 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 17:48:37,936 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 05:48:37" (1/1) ... [2020-09-04 17:48:37,940 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bc51459 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:48:37, skipping insertion in model container [2020-09-04 17:48:37,940 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 05:48:37" (1/1) ... [2020-09-04 17:48:37,949 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 17:48:37,976 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 17:48:38,184 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 17:48:38,190 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 17:48:38,215 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 17:48:38,232 INFO L208 MainTranslator]: Completed translation [2020-09-04 17:48:38,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:48:38 WrapperNode [2020-09-04 17:48:38,233 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 17:48:38,234 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 17:48:38,234 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 17:48:38,234 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 17:48:38,249 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:48:38" (1/1) ... [2020-09-04 17:48:38,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:48:38" (1/1) ... [2020-09-04 17:48:38,255 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:48:38" (1/1) ... [2020-09-04 17:48:38,256 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:48:38" (1/1) ... [2020-09-04 17:48:38,260 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:48:38" (1/1) ... [2020-09-04 17:48:38,348 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:48:38" (1/1) ... [2020-09-04 17:48:38,352 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:48:38" (1/1) ... [2020-09-04 17:48:38,355 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 17:48:38,355 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 17:48:38,355 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 17:48:38,356 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 17:48:38,357 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:48:38" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 17:48:38,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 17:48:38,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 17:48:38,442 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-09-04 17:48:38,442 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-09-04 17:48:38,442 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 17:48:38,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 17:48:38,443 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-09-04 17:48:38,443 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-09-04 17:48:38,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-09-04 17:48:38,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 17:48:38,443 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 17:48:38,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 17:48:38,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 17:48:38,816 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 17:48:38,816 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-09-04 17:48:38,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 05:48:38 BoogieIcfgContainer [2020-09-04 17:48:38,821 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 17:48:38,823 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 17:48:38,823 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 17:48:38,826 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 17:48:38,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 05:48:37" (1/3) ... [2020-09-04 17:48:38,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7af028bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 05:48:38, skipping insertion in model container [2020-09-04 17:48:38,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:48:38" (2/3) ... [2020-09-04 17:48:38,830 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7af028bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 05:48:38, skipping insertion in model container [2020-09-04 17:48:38,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 05:48:38" (3/3) ... [2020-09-04 17:48:38,832 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i [2020-09-04 17:48:38,841 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 17:48:38,850 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 17:48:38,871 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 17:48:38,899 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 17:48:38,899 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 17:48:38,899 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-09-04 17:48:38,899 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 17:48:38,899 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 17:48:38,900 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 17:48:38,900 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 17:48:38,900 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 17:48:38,919 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2020-09-04 17:48:38,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-04 17:48:38,932 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:48:38,933 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:48:38,934 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:48:38,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:48:38,941 INFO L82 PathProgramCache]: Analyzing trace with hash -537390573, now seen corresponding path program 1 times [2020-09-04 17:48:38,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:48:38,951 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [191587550] [2020-09-04 17:48:38,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:48:39,024 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:48:39,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:39,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:48:39,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:39,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-09-04 17:48:39,110 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [191587550] [2020-09-04 17:48:39,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:48:39,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-09-04 17:48:39,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712519316] [2020-09-04 17:48:39,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-09-04 17:48:39,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:48:39,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-09-04 17:48:39,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-09-04 17:48:39,140 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 2 states. [2020-09-04 17:48:39,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:48:39,188 INFO L93 Difference]: Finished difference Result 134 states and 203 transitions. [2020-09-04 17:48:39,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-09-04 17:48:39,190 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2020-09-04 17:48:39,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:48:39,204 INFO L225 Difference]: With dead ends: 134 [2020-09-04 17:48:39,204 INFO L226 Difference]: Without dead ends: 69 [2020-09-04 17:48:39,211 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-09-04 17:48:39,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-09-04 17:48:39,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-09-04 17:48:39,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-09-04 17:48:39,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 87 transitions. [2020-09-04 17:48:39,276 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 87 transitions. Word has length 19 [2020-09-04 17:48:39,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:48:39,277 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 87 transitions. [2020-09-04 17:48:39,277 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-09-04 17:48:39,277 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2020-09-04 17:48:39,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-09-04 17:48:39,278 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:48:39,278 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] [2020-09-04 17:48:39,279 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 17:48:39,279 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:48:39,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:48:39,280 INFO L82 PathProgramCache]: Analyzing trace with hash 471335344, now seen corresponding path program 1 times [2020-09-04 17:48:39,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:48:39,280 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [199984746] [2020-09-04 17:48:39,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:48:39,283 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:48:39,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:39,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:48:39,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:39,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:48:39,405 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [199984746] [2020-09-04 17:48:39,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:48:39,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 17:48:39,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933138585] [2020-09-04 17:48:39,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 17:48:39,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:48:39,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 17:48:39,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 17:48:39,408 INFO L87 Difference]: Start difference. First operand 69 states and 87 transitions. Second operand 5 states. [2020-09-04 17:48:39,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:48:39,572 INFO L93 Difference]: Finished difference Result 91 states and 115 transitions. [2020-09-04 17:48:39,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 17:48:39,573 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-09-04 17:48:39,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:48:39,575 INFO L225 Difference]: With dead ends: 91 [2020-09-04 17:48:39,576 INFO L226 Difference]: Without dead ends: 89 [2020-09-04 17:48:39,579 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-04 17:48:39,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-09-04 17:48:39,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 82. [2020-09-04 17:48:39,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-09-04 17:48:39,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 104 transitions. [2020-09-04 17:48:39,612 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 104 transitions. Word has length 20 [2020-09-04 17:48:39,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:48:39,613 INFO L479 AbstractCegarLoop]: Abstraction has 82 states and 104 transitions. [2020-09-04 17:48:39,613 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 17:48:39,613 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 104 transitions. [2020-09-04 17:48:39,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-04 17:48:39,614 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:48:39,614 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] [2020-09-04 17:48:39,615 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 17:48:39,615 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:48:39,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:48:39,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1383579147, now seen corresponding path program 1 times [2020-09-04 17:48:39,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:48:39,616 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2114048576] [2020-09-04 17:48:39,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:48:39,618 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:48:39,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:39,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:48:39,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:39,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-09-04 17:48:39,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:39,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:48:39,686 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2114048576] [2020-09-04 17:48:39,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:48:39,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 17:48:39,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598723743] [2020-09-04 17:48:39,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 17:48:39,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:48:39,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 17:48:39,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 17:48:39,688 INFO L87 Difference]: Start difference. First operand 82 states and 104 transitions. Second operand 5 states. [2020-09-04 17:48:39,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:48:39,785 INFO L93 Difference]: Finished difference Result 88 states and 109 transitions. [2020-09-04 17:48:39,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 17:48:39,785 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-09-04 17:48:39,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:48:39,789 INFO L225 Difference]: With dead ends: 88 [2020-09-04 17:48:39,790 INFO L226 Difference]: Without dead ends: 78 [2020-09-04 17:48:39,791 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-04 17:48:39,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-09-04 17:48:39,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2020-09-04 17:48:39,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-09-04 17:48:39,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 95 transitions. [2020-09-04 17:48:39,805 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 95 transitions. Word has length 25 [2020-09-04 17:48:39,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:48:39,806 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 95 transitions. [2020-09-04 17:48:39,806 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 17:48:39,806 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2020-09-04 17:48:39,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-09-04 17:48:39,807 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:48:39,807 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] [2020-09-04 17:48:39,808 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 17:48:39,808 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:48:39,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:48:39,808 INFO L82 PathProgramCache]: Analyzing trace with hash 344115466, now seen corresponding path program 1 times [2020-09-04 17:48:39,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:48:39,809 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1835685421] [2020-09-04 17:48:39,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:48:39,811 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:48:39,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:39,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:48:39,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:39,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 17:48:39,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:39,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:48:39,941 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1835685421] [2020-09-04 17:48:39,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:48:39,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 17:48:39,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470132460] [2020-09-04 17:48:39,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 17:48:39,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:48:39,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 17:48:39,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-04 17:48:39,943 INFO L87 Difference]: Start difference. First operand 78 states and 95 transitions. Second operand 7 states. [2020-09-04 17:48:40,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:48:40,136 INFO L93 Difference]: Finished difference Result 90 states and 108 transitions. [2020-09-04 17:48:40,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 17:48:40,137 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2020-09-04 17:48:40,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:48:40,139 INFO L225 Difference]: With dead ends: 90 [2020-09-04 17:48:40,139 INFO L226 Difference]: Without dead ends: 88 [2020-09-04 17:48:40,140 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-09-04 17:48:40,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-09-04 17:48:40,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2020-09-04 17:48:40,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-09-04 17:48:40,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 102 transitions. [2020-09-04 17:48:40,169 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 102 transitions. Word has length 28 [2020-09-04 17:48:40,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:48:40,170 INFO L479 AbstractCegarLoop]: Abstraction has 84 states and 102 transitions. [2020-09-04 17:48:40,170 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 17:48:40,170 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions. [2020-09-04 17:48:40,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-09-04 17:48:40,171 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:48:40,171 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:48:40,175 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 17:48:40,175 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:48:40,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:48:40,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1469174755, now seen corresponding path program 1 times [2020-09-04 17:48:40,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:48:40,176 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [198209714] [2020-09-04 17:48:40,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:48:40,216 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:48:40,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:40,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:48:40,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:40,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 17:48:40,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:40,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 17:48:40,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:40,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:48:40,300 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [198209714] [2020-09-04 17:48:40,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:48:40,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 17:48:40,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068867522] [2020-09-04 17:48:40,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 17:48:40,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:48:40,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 17:48:40,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-04 17:48:40,302 INFO L87 Difference]: Start difference. First operand 84 states and 102 transitions. Second operand 7 states. [2020-09-04 17:48:40,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:48:40,472 INFO L93 Difference]: Finished difference Result 94 states and 111 transitions. [2020-09-04 17:48:40,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 17:48:40,473 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2020-09-04 17:48:40,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:48:40,474 INFO L225 Difference]: With dead ends: 94 [2020-09-04 17:48:40,474 INFO L226 Difference]: Without dead ends: 85 [2020-09-04 17:48:40,475 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-09-04 17:48:40,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-09-04 17:48:40,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2020-09-04 17:48:40,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-09-04 17:48:40,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 96 transitions. [2020-09-04 17:48:40,488 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 96 transitions. Word has length 38 [2020-09-04 17:48:40,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:48:40,489 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 96 transitions. [2020-09-04 17:48:40,489 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 17:48:40,489 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 96 transitions. [2020-09-04 17:48:40,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-09-04 17:48:40,490 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:48:40,491 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:48:40,491 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 17:48:40,491 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:48:40,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:48:40,492 INFO L82 PathProgramCache]: Analyzing trace with hash 859677550, now seen corresponding path program 1 times [2020-09-04 17:48:40,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:48:40,492 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [693025246] [2020-09-04 17:48:40,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:48:40,498 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:48:40,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:40,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:48:40,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:40,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 17:48:40,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:40,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 17:48:40,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:40,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:48:40,587 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [693025246] [2020-09-04 17:48:40,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:48:40,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 17:48:40,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257117385] [2020-09-04 17:48:40,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 17:48:40,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:48:40,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 17:48:40,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-04 17:48:40,589 INFO L87 Difference]: Start difference. First operand 81 states and 96 transitions. Second operand 7 states. [2020-09-04 17:48:40,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:48:40,725 INFO L93 Difference]: Finished difference Result 91 states and 105 transitions. [2020-09-04 17:48:40,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 17:48:40,725 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-09-04 17:48:40,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:48:40,727 INFO L225 Difference]: With dead ends: 91 [2020-09-04 17:48:40,727 INFO L226 Difference]: Without dead ends: 89 [2020-09-04 17:48:40,728 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-09-04 17:48:40,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-09-04 17:48:40,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2020-09-04 17:48:40,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-09-04 17:48:40,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2020-09-04 17:48:40,741 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 41 [2020-09-04 17:48:40,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:48:40,742 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2020-09-04 17:48:40,742 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 17:48:40,742 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2020-09-04 17:48:40,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-09-04 17:48:40,744 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:48:40,744 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, 1] [2020-09-04 17:48:40,745 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 17:48:40,745 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:48:40,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:48:40,745 INFO L82 PathProgramCache]: Analyzing trace with hash -943144682, now seen corresponding path program 1 times [2020-09-04 17:48:40,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:48:40,746 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1992596096] [2020-09-04 17:48:40,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:48:40,748 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:48:40,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:40,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:48:40,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:40,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 17:48:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:40,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 17:48:40,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:40,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:48:40,839 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1992596096] [2020-09-04 17:48:40,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:48:40,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 17:48:40,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704660138] [2020-09-04 17:48:40,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 17:48:40,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:48:40,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 17:48:40,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-04 17:48:40,842 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand 7 states. [2020-09-04 17:48:41,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:48:41,003 INFO L93 Difference]: Finished difference Result 120 states and 141 transitions. [2020-09-04 17:48:41,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 17:48:41,003 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2020-09-04 17:48:41,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:48:41,005 INFO L225 Difference]: With dead ends: 120 [2020-09-04 17:48:41,005 INFO L226 Difference]: Without dead ends: 118 [2020-09-04 17:48:41,006 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-09-04 17:48:41,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-09-04 17:48:41,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 109. [2020-09-04 17:48:41,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-09-04 17:48:41,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 128 transitions. [2020-09-04 17:48:41,021 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 128 transitions. Word has length 44 [2020-09-04 17:48:41,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:48:41,022 INFO L479 AbstractCegarLoop]: Abstraction has 109 states and 128 transitions. [2020-09-04 17:48:41,022 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 17:48:41,022 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 128 transitions. [2020-09-04 17:48:41,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-09-04 17:48:41,023 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:48:41,024 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 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] [2020-09-04 17:48:41,024 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 17:48:41,024 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:48:41,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:48:41,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1177695863, now seen corresponding path program 2 times [2020-09-04 17:48:41,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:48:41,025 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [910213406] [2020-09-04 17:48:41,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:48:41,030 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:48:41,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:41,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:48:41,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:41,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 17:48:41,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:41,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 17:48:41,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:41,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 17:48:41,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:41,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:48:41,134 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [910213406] [2020-09-04 17:48:41,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:48:41,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 17:48:41,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948735002] [2020-09-04 17:48:41,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 17:48:41,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:48:41,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 17:48:41,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-09-04 17:48:41,136 INFO L87 Difference]: Start difference. First operand 109 states and 128 transitions. Second operand 8 states. [2020-09-04 17:48:41,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:48:41,273 INFO L93 Difference]: Finished difference Result 115 states and 133 transitions. [2020-09-04 17:48:41,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 17:48:41,273 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2020-09-04 17:48:41,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:48:41,275 INFO L225 Difference]: With dead ends: 115 [2020-09-04 17:48:41,275 INFO L226 Difference]: Without dead ends: 113 [2020-09-04 17:48:41,276 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-09-04 17:48:41,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-09-04 17:48:41,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2020-09-04 17:48:41,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-09-04 17:48:41,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 131 transitions. [2020-09-04 17:48:41,290 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 131 transitions. Word has length 46 [2020-09-04 17:48:41,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:48:41,290 INFO L479 AbstractCegarLoop]: Abstraction has 113 states and 131 transitions. [2020-09-04 17:48:41,290 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 17:48:41,291 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 131 transitions. [2020-09-04 17:48:41,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-09-04 17:48:41,292 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:48:41,292 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, 1] [2020-09-04 17:48:41,292 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 17:48:41,293 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:48:41,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:48:41,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1826770767, now seen corresponding path program 1 times [2020-09-04 17:48:41,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:48:41,294 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1465479817] [2020-09-04 17:48:41,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:48:41,295 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:48:41,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:41,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:48:41,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:41,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 17:48:41,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:41,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 17:48:41,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:41,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-09-04 17:48:41,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:41,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:48:41,399 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1465479817] [2020-09-04 17:48:41,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:48:41,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 17:48:41,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16403426] [2020-09-04 17:48:41,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 17:48:41,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:48:41,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 17:48:41,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-09-04 17:48:41,402 INFO L87 Difference]: Start difference. First operand 113 states and 131 transitions. Second operand 8 states. [2020-09-04 17:48:41,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:48:41,576 INFO L93 Difference]: Finished difference Result 128 states and 147 transitions. [2020-09-04 17:48:41,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 17:48:41,577 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2020-09-04 17:48:41,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:48:41,578 INFO L225 Difference]: With dead ends: 128 [2020-09-04 17:48:41,578 INFO L226 Difference]: Without dead ends: 123 [2020-09-04 17:48:41,579 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-09-04 17:48:41,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-09-04 17:48:41,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 117. [2020-09-04 17:48:41,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-09-04 17:48:41,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 134 transitions. [2020-09-04 17:48:41,591 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 134 transitions. Word has length 49 [2020-09-04 17:48:41,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:48:41,591 INFO L479 AbstractCegarLoop]: Abstraction has 117 states and 134 transitions. [2020-09-04 17:48:41,591 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 17:48:41,592 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 134 transitions. [2020-09-04 17:48:41,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-09-04 17:48:41,593 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:48:41,593 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:48:41,593 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 17:48:41,593 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:48:41,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:48:41,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1519048418, now seen corresponding path program 1 times [2020-09-04 17:48:41,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:48:41,594 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1022855186] [2020-09-04 17:48:41,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:48:41,596 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:48:41,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:41,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:48:41,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:41,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 17:48:41,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:41,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 17:48:41,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:41,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-09-04 17:48:41,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:41,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-09-04 17:48:41,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:41,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-09-04 17:48:41,724 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1022855186] [2020-09-04 17:48:41,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:48:41,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 17:48:41,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785702244] [2020-09-04 17:48:41,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 17:48:41,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:48:41,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 17:48:41,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-09-04 17:48:41,726 INFO L87 Difference]: Start difference. First operand 117 states and 134 transitions. Second operand 9 states. [2020-09-04 17:48:41,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:48:41,945 INFO L93 Difference]: Finished difference Result 135 states and 153 transitions. [2020-09-04 17:48:41,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 17:48:41,945 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2020-09-04 17:48:41,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:48:41,947 INFO L225 Difference]: With dead ends: 135 [2020-09-04 17:48:41,947 INFO L226 Difference]: Without dead ends: 133 [2020-09-04 17:48:41,947 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2020-09-04 17:48:41,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-09-04 17:48:41,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 126. [2020-09-04 17:48:41,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-09-04 17:48:41,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 143 transitions. [2020-09-04 17:48:41,967 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 143 transitions. Word has length 58 [2020-09-04 17:48:41,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:48:41,969 INFO L479 AbstractCegarLoop]: Abstraction has 126 states and 143 transitions. [2020-09-04 17:48:41,969 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 17:48:41,969 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 143 transitions. [2020-09-04 17:48:41,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-09-04 17:48:41,971 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:48:41,971 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:48:41,971 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 17:48:41,971 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:48:41,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:48:41,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1733407875, now seen corresponding path program 1 times [2020-09-04 17:48:41,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:48:41,972 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1164821434] [2020-09-04 17:48:41,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:48:41,978 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:48:41,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:42,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:48:42,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:42,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 17:48:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:42,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 17:48:42,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:42,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 17:48:42,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:42,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-09-04 17:48:42,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:42,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:48:42,114 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1164821434] [2020-09-04 17:48:42,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:48:42,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 17:48:42,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906790990] [2020-09-04 17:48:42,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 17:48:42,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:48:42,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 17:48:42,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-09-04 17:48:42,116 INFO L87 Difference]: Start difference. First operand 126 states and 143 transitions. Second operand 9 states. [2020-09-04 17:48:42,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:48:42,331 INFO L93 Difference]: Finished difference Result 158 states and 182 transitions. [2020-09-04 17:48:42,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 17:48:42,332 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2020-09-04 17:48:42,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:48:42,334 INFO L225 Difference]: With dead ends: 158 [2020-09-04 17:48:42,334 INFO L226 Difference]: Without dead ends: 156 [2020-09-04 17:48:42,335 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2020-09-04 17:48:42,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2020-09-04 17:48:42,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 147. [2020-09-04 17:48:42,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-09-04 17:48:42,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 169 transitions. [2020-09-04 17:48:42,349 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 169 transitions. Word has length 62 [2020-09-04 17:48:42,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:48:42,350 INFO L479 AbstractCegarLoop]: Abstraction has 147 states and 169 transitions. [2020-09-04 17:48:42,350 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 17:48:42,350 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 169 transitions. [2020-09-04 17:48:42,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-09-04 17:48:42,351 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:48:42,351 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:48:42,352 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 17:48:42,352 INFO L427 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:48:42,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:48:42,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1967257859, now seen corresponding path program 1 times [2020-09-04 17:48:42,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:48:42,353 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1924970684] [2020-09-04 17:48:42,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:48:42,354 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:48:42,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:42,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:48:42,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:42,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 17:48:42,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:42,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 17:48:42,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:42,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-09-04 17:48:42,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:42,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-09-04 17:48:42,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:42,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2020-09-04 17:48:42,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:42,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:48:42,508 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1924970684] [2020-09-04 17:48:42,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:48:42,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 17:48:42,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720984098] [2020-09-04 17:48:42,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 17:48:42,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:48:42,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 17:48:42,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-09-04 17:48:42,510 INFO L87 Difference]: Start difference. First operand 147 states and 169 transitions. Second operand 9 states. [2020-09-04 17:48:42,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:48:42,723 INFO L93 Difference]: Finished difference Result 158 states and 180 transitions. [2020-09-04 17:48:42,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 17:48:42,723 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2020-09-04 17:48:42,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:48:42,725 INFO L225 Difference]: With dead ends: 158 [2020-09-04 17:48:42,725 INFO L226 Difference]: Without dead ends: 156 [2020-09-04 17:48:42,726 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2020-09-04 17:48:42,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2020-09-04 17:48:42,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 152. [2020-09-04 17:48:42,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-09-04 17:48:42,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 174 transitions. [2020-09-04 17:48:42,739 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 174 transitions. Word has length 63 [2020-09-04 17:48:42,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:48:42,740 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 174 transitions. [2020-09-04 17:48:42,740 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 17:48:42,740 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 174 transitions. [2020-09-04 17:48:42,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-09-04 17:48:42,741 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:48:42,741 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 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, 1] [2020-09-04 17:48:42,742 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 17:48:42,742 INFO L427 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:48:42,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:48:42,742 INFO L82 PathProgramCache]: Analyzing trace with hash -822659134, now seen corresponding path program 1 times [2020-09-04 17:48:42,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:48:42,743 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1616672247] [2020-09-04 17:48:42,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:48:42,744 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:48:42,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:42,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:48:42,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:42,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 17:48:42,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:42,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 17:48:42,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:42,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-09-04 17:48:42,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:42,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-09-04 17:48:42,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:42,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:48:42,832 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1616672247] [2020-09-04 17:48:42,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:48:42,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 17:48:42,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289343573] [2020-09-04 17:48:42,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 17:48:42,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:48:42,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 17:48:42,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-09-04 17:48:42,834 INFO L87 Difference]: Start difference. First operand 152 states and 174 transitions. Second operand 9 states. [2020-09-04 17:48:43,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:48:43,037 INFO L93 Difference]: Finished difference Result 187 states and 216 transitions. [2020-09-04 17:48:43,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 17:48:43,038 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2020-09-04 17:48:43,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:48:43,040 INFO L225 Difference]: With dead ends: 187 [2020-09-04 17:48:43,040 INFO L226 Difference]: Without dead ends: 185 [2020-09-04 17:48:43,041 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2020-09-04 17:48:43,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-09-04 17:48:43,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 177. [2020-09-04 17:48:43,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-09-04 17:48:43,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 205 transitions. [2020-09-04 17:48:43,057 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 205 transitions. Word has length 65 [2020-09-04 17:48:43,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:48:43,057 INFO L479 AbstractCegarLoop]: Abstraction has 177 states and 205 transitions. [2020-09-04 17:48:43,057 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 17:48:43,057 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 205 transitions. [2020-09-04 17:48:43,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-09-04 17:48:43,058 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:48:43,059 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:48:43,059 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 17:48:43,059 INFO L427 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:48:43,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:48:43,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1510377470, now seen corresponding path program 1 times [2020-09-04 17:48:43,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:48:43,060 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1521093895] [2020-09-04 17:48:43,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:48:43,067 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:48:43,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:43,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:48:43,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:43,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 17:48:43,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:43,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 17:48:43,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:43,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 17:48:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:43,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-09-04 17:48:43,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:43,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-09-04 17:48:43,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:43,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:48:43,180 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1521093895] [2020-09-04 17:48:43,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:48:43,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 17:48:43,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516566393] [2020-09-04 17:48:43,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 17:48:43,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:48:43,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 17:48:43,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-09-04 17:48:43,182 INFO L87 Difference]: Start difference. First operand 177 states and 205 transitions. Second operand 9 states. [2020-09-04 17:48:43,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:48:43,420 INFO L93 Difference]: Finished difference Result 192 states and 221 transitions. [2020-09-04 17:48:43,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 17:48:43,421 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2020-09-04 17:48:43,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:48:43,423 INFO L225 Difference]: With dead ends: 192 [2020-09-04 17:48:43,423 INFO L226 Difference]: Without dead ends: 187 [2020-09-04 17:48:43,424 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2020-09-04 17:48:43,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2020-09-04 17:48:43,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 181. [2020-09-04 17:48:43,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2020-09-04 17:48:43,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 208 transitions. [2020-09-04 17:48:43,445 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 208 transitions. Word has length 67 [2020-09-04 17:48:43,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:48:43,446 INFO L479 AbstractCegarLoop]: Abstraction has 181 states and 208 transitions. [2020-09-04 17:48:43,446 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 17:48:43,446 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 208 transitions. [2020-09-04 17:48:43,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-09-04 17:48:43,448 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:48:43,448 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 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] [2020-09-04 17:48:43,448 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 17:48:43,449 INFO L427 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:48:43,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:48:43,449 INFO L82 PathProgramCache]: Analyzing trace with hash 869213219, now seen corresponding path program 2 times [2020-09-04 17:48:43,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:48:43,449 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [929158333] [2020-09-04 17:48:43,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:48:43,452 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:48:43,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:43,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:48:43,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:43,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 17:48:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:43,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 17:48:43,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:43,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-09-04 17:48:43,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:43,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-09-04 17:48:43,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:43,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 17:48:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:43,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:48:43,607 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [929158333] [2020-09-04 17:48:43,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:48:43,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 17:48:43,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584869226] [2020-09-04 17:48:43,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 17:48:43,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:48:43,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 17:48:43,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-09-04 17:48:43,609 INFO L87 Difference]: Start difference. First operand 181 states and 208 transitions. Second operand 9 states. [2020-09-04 17:48:43,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:48:43,825 INFO L93 Difference]: Finished difference Result 193 states and 220 transitions. [2020-09-04 17:48:43,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 17:48:43,826 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2020-09-04 17:48:43,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:48:43,828 INFO L225 Difference]: With dead ends: 193 [2020-09-04 17:48:43,828 INFO L226 Difference]: Without dead ends: 188 [2020-09-04 17:48:43,829 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2020-09-04 17:48:43,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2020-09-04 17:48:43,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 184. [2020-09-04 17:48:43,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-09-04 17:48:43,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 209 transitions. [2020-09-04 17:48:43,844 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 209 transitions. Word has length 70 [2020-09-04 17:48:43,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:48:43,845 INFO L479 AbstractCegarLoop]: Abstraction has 184 states and 209 transitions. [2020-09-04 17:48:43,845 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 17:48:43,845 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 209 transitions. [2020-09-04 17:48:43,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-09-04 17:48:43,846 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:48:43,846 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:48:43,846 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-04 17:48:43,847 INFO L427 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:48:43,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:48:43,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1269119089, now seen corresponding path program 1 times [2020-09-04 17:48:43,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:48:43,847 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [425889120] [2020-09-04 17:48:43,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:48:43,852 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:48:43,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:43,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:48:43,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:43,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 17:48:43,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:43,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 17:48:43,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:43,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 17:48:43,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:43,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-09-04 17:48:43,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:43,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-09-04 17:48:43,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:43,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2020-09-04 17:48:43,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:43,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:48:43,964 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [425889120] [2020-09-04 17:48:43,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:48:43,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 17:48:43,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585321971] [2020-09-04 17:48:43,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 17:48:43,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:48:43,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 17:48:43,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-09-04 17:48:43,966 INFO L87 Difference]: Start difference. First operand 184 states and 209 transitions. Second operand 11 states. [2020-09-04 17:48:44,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:48:44,234 INFO L93 Difference]: Finished difference Result 202 states and 228 transitions. [2020-09-04 17:48:44,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 17:48:44,234 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 76 [2020-09-04 17:48:44,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:48:44,236 INFO L225 Difference]: With dead ends: 202 [2020-09-04 17:48:44,236 INFO L226 Difference]: Without dead ends: 200 [2020-09-04 17:48:44,237 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2020-09-04 17:48:44,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2020-09-04 17:48:44,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 193. [2020-09-04 17:48:44,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-09-04 17:48:44,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 218 transitions. [2020-09-04 17:48:44,252 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 218 transitions. Word has length 76 [2020-09-04 17:48:44,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:48:44,252 INFO L479 AbstractCegarLoop]: Abstraction has 193 states and 218 transitions. [2020-09-04 17:48:44,252 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 17:48:44,252 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 218 transitions. [2020-09-04 17:48:44,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-09-04 17:48:44,253 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:48:44,254 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:48:44,254 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-04 17:48:44,254 INFO L427 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:48:44,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:48:44,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1147260786, now seen corresponding path program 1 times [2020-09-04 17:48:44,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:48:44,255 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [557891205] [2020-09-04 17:48:44,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:48:44,256 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:48:44,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:44,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:48:44,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:44,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 17:48:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:44,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 17:48:44,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:44,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-09-04 17:48:44,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:44,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-09-04 17:48:44,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:44,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 17:48:44,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:44,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2020-09-04 17:48:44,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:44,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:48:44,370 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [557891205] [2020-09-04 17:48:44,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:48:44,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 17:48:44,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603009402] [2020-09-04 17:48:44,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 17:48:44,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:48:44,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 17:48:44,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-09-04 17:48:44,371 INFO L87 Difference]: Start difference. First operand 193 states and 218 transitions. Second operand 11 states. [2020-09-04 17:48:44,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:48:44,649 INFO L93 Difference]: Finished difference Result 234 states and 268 transitions. [2020-09-04 17:48:44,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 17:48:44,649 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 79 [2020-09-04 17:48:44,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:48:44,651 INFO L225 Difference]: With dead ends: 234 [2020-09-04 17:48:44,652 INFO L226 Difference]: Without dead ends: 232 [2020-09-04 17:48:44,652 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2020-09-04 17:48:44,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2020-09-04 17:48:44,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 223. [2020-09-04 17:48:44,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2020-09-04 17:48:44,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 255 transitions. [2020-09-04 17:48:44,669 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 255 transitions. Word has length 79 [2020-09-04 17:48:44,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:48:44,670 INFO L479 AbstractCegarLoop]: Abstraction has 223 states and 255 transitions. [2020-09-04 17:48:44,670 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 17:48:44,670 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 255 transitions. [2020-09-04 17:48:44,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-09-04 17:48:44,671 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:48:44,671 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:48:44,672 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-04 17:48:44,672 INFO L427 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:48:44,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:48:44,672 INFO L82 PathProgramCache]: Analyzing trace with hash 341113206, now seen corresponding path program 2 times [2020-09-04 17:48:44,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:48:44,673 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [599093644] [2020-09-04 17:48:44,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:48:44,674 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:48:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:44,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:48:44,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:44,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 17:48:44,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:44,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 17:48:44,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:44,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-09-04 17:48:44,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:44,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-09-04 17:48:44,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:44,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2020-09-04 17:48:44,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:44,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-09-04 17:48:44,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:44,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:48:44,781 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [599093644] [2020-09-04 17:48:44,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:48:44,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 17:48:44,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486372378] [2020-09-04 17:48:44,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 17:48:44,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:48:44,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 17:48:44,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-09-04 17:48:44,783 INFO L87 Difference]: Start difference. First operand 223 states and 255 transitions. Second operand 11 states. [2020-09-04 17:48:45,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:48:45,067 INFO L93 Difference]: Finished difference Result 264 states and 305 transitions. [2020-09-04 17:48:45,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 17:48:45,068 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 79 [2020-09-04 17:48:45,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:48:45,070 INFO L225 Difference]: With dead ends: 264 [2020-09-04 17:48:45,070 INFO L226 Difference]: Without dead ends: 262 [2020-09-04 17:48:45,071 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2020-09-04 17:48:45,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2020-09-04 17:48:45,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 223. [2020-09-04 17:48:45,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2020-09-04 17:48:45,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 255 transitions. [2020-09-04 17:48:45,089 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 255 transitions. Word has length 79 [2020-09-04 17:48:45,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:48:45,090 INFO L479 AbstractCegarLoop]: Abstraction has 223 states and 255 transitions. [2020-09-04 17:48:45,090 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 17:48:45,090 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 255 transitions. [2020-09-04 17:48:45,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-09-04 17:48:45,091 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:48:45,092 INFO L422 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:48:45,092 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-09-04 17:48:45,092 INFO L427 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:48:45,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:48:45,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1759613834, now seen corresponding path program 1 times [2020-09-04 17:48:45,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:48:45,093 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1361224825] [2020-09-04 17:48:45,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:48:45,097 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:48:45,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:45,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:48:45,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:45,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 17:48:45,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:45,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 17:48:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:45,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 17:48:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:45,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-09-04 17:48:45,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:45,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-09-04 17:48:45,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:45,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2020-09-04 17:48:45,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:45,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-09-04 17:48:45,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:45,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:48:45,255 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1361224825] [2020-09-04 17:48:45,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:48:45,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 17:48:45,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421072629] [2020-09-04 17:48:45,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 17:48:45,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:48:45,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 17:48:45,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-09-04 17:48:45,257 INFO L87 Difference]: Start difference. First operand 223 states and 255 transitions. Second operand 10 states. [2020-09-04 17:48:45,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:48:45,517 INFO L93 Difference]: Finished difference Result 236 states and 268 transitions. [2020-09-04 17:48:45,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 17:48:45,518 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 81 [2020-09-04 17:48:45,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:48:45,521 INFO L225 Difference]: With dead ends: 236 [2020-09-04 17:48:45,521 INFO L226 Difference]: Without dead ends: 234 [2020-09-04 17:48:45,521 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2020-09-04 17:48:45,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2020-09-04 17:48:45,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 228. [2020-09-04 17:48:45,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2020-09-04 17:48:45,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 260 transitions. [2020-09-04 17:48:45,546 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 260 transitions. Word has length 81 [2020-09-04 17:48:45,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:48:45,547 INFO L479 AbstractCegarLoop]: Abstraction has 228 states and 260 transitions. [2020-09-04 17:48:45,547 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 17:48:45,547 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 260 transitions. [2020-09-04 17:48:45,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-09-04 17:48:45,550 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:48:45,551 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:48:45,551 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-09-04 17:48:45,551 INFO L427 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:48:45,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:48:45,551 INFO L82 PathProgramCache]: Analyzing trace with hash -343631243, now seen corresponding path program 1 times [2020-09-04 17:48:45,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:48:45,552 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [253519919] [2020-09-04 17:48:45,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:48:45,561 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:48:45,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:45,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:48:45,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:45,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 17:48:45,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:45,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 17:48:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:45,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 17:48:45,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:45,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-09-04 17:48:45,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:45,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-09-04 17:48:45,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:45,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2020-09-04 17:48:45,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:45,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:48:45,693 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [253519919] [2020-09-04 17:48:45,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:48:45,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 17:48:45,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680531687] [2020-09-04 17:48:45,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 17:48:45,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:48:45,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 17:48:45,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-09-04 17:48:45,696 INFO L87 Difference]: Start difference. First operand 228 states and 260 transitions. Second operand 11 states. [2020-09-04 17:48:45,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:48:45,994 INFO L93 Difference]: Finished difference Result 263 states and 302 transitions. [2020-09-04 17:48:45,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 17:48:45,995 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 83 [2020-09-04 17:48:45,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:48:45,997 INFO L225 Difference]: With dead ends: 263 [2020-09-04 17:48:45,997 INFO L226 Difference]: Without dead ends: 261 [2020-09-04 17:48:45,998 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2020-09-04 17:48:45,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2020-09-04 17:48:46,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 253. [2020-09-04 17:48:46,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2020-09-04 17:48:46,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 291 transitions. [2020-09-04 17:48:46,017 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 291 transitions. Word has length 83 [2020-09-04 17:48:46,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:48:46,018 INFO L479 AbstractCegarLoop]: Abstraction has 253 states and 291 transitions. [2020-09-04 17:48:46,018 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 17:48:46,018 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 291 transitions. [2020-09-04 17:48:46,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-09-04 17:48:46,019 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:48:46,019 INFO L422 BasicCegarLoop]: trace histogram [8, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:48:46,020 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-09-04 17:48:46,020 INFO L427 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:48:46,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:48:46,020 INFO L82 PathProgramCache]: Analyzing trace with hash -857748777, now seen corresponding path program 3 times [2020-09-04 17:48:46,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:48:46,021 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1403991374] [2020-09-04 17:48:46,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:48:46,023 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:48:46,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:46,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:48:46,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:46,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 17:48:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:46,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 17:48:46,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:46,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-09-04 17:48:46,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:46,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-09-04 17:48:46,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:46,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 17:48:46,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:46,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2020-09-04 17:48:46,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:46,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-09-04 17:48:46,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:46,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:48:46,164 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1403991374] [2020-09-04 17:48:46,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:48:46,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 17:48:46,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044019264] [2020-09-04 17:48:46,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 17:48:46,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:48:46,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 17:48:46,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-09-04 17:48:46,166 INFO L87 Difference]: Start difference. First operand 253 states and 291 transitions. Second operand 10 states. [2020-09-04 17:48:46,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:48:46,432 INFO L93 Difference]: Finished difference Result 262 states and 299 transitions. [2020-09-04 17:48:46,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 17:48:46,433 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 84 [2020-09-04 17:48:46,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:48:46,435 INFO L225 Difference]: With dead ends: 262 [2020-09-04 17:48:46,435 INFO L226 Difference]: Without dead ends: 152 [2020-09-04 17:48:46,436 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2020-09-04 17:48:46,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-09-04 17:48:46,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2020-09-04 17:48:46,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-09-04 17:48:46,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 170 transitions. [2020-09-04 17:48:46,446 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 170 transitions. Word has length 84 [2020-09-04 17:48:46,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:48:46,446 INFO L479 AbstractCegarLoop]: Abstraction has 150 states and 170 transitions. [2020-09-04 17:48:46,446 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 17:48:46,446 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 170 transitions. [2020-09-04 17:48:46,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-09-04 17:48:46,447 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:48:46,448 INFO L422 BasicCegarLoop]: trace histogram [8, 7, 7, 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, 1, 1, 1, 1, 1] [2020-09-04 17:48:46,448 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-09-04 17:48:46,448 INFO L427 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:48:46,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:48:46,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1405253968, now seen corresponding path program 2 times [2020-09-04 17:48:46,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:48:46,449 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [943529748] [2020-09-04 17:48:46,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:48:46,453 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:48:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:46,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:48:46,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:46,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 17:48:46,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:46,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 17:48:46,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:46,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 17:48:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:46,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-09-04 17:48:46,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:46,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-09-04 17:48:46,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:46,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2020-09-04 17:48:46,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:46,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-09-04 17:48:46,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:46,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:48:46,595 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [943529748] [2020-09-04 17:48:46,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:48:46,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 17:48:46,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249586908] [2020-09-04 17:48:46,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 17:48:46,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:48:46,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 17:48:46,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-09-04 17:48:46,597 INFO L87 Difference]: Start difference. First operand 150 states and 170 transitions. Second operand 10 states. [2020-09-04 17:48:46,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:48:46,847 INFO L93 Difference]: Finished difference Result 160 states and 180 transitions. [2020-09-04 17:48:46,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 17:48:46,849 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2020-09-04 17:48:46,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:48:46,851 INFO L225 Difference]: With dead ends: 160 [2020-09-04 17:48:46,851 INFO L226 Difference]: Without dead ends: 155 [2020-09-04 17:48:46,852 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2020-09-04 17:48:46,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-09-04 17:48:46,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2020-09-04 17:48:46,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-09-04 17:48:46,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 171 transitions. [2020-09-04 17:48:46,864 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 171 transitions. Word has length 88 [2020-09-04 17:48:46,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:48:46,865 INFO L479 AbstractCegarLoop]: Abstraction has 153 states and 171 transitions. [2020-09-04 17:48:46,865 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 17:48:46,865 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 171 transitions. [2020-09-04 17:48:46,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-09-04 17:48:46,866 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:48:46,867 INFO L422 BasicCegarLoop]: trace histogram [9, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:48:46,867 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-09-04 17:48:46,867 INFO L427 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:48:46,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:48:46,867 INFO L82 PathProgramCache]: Analyzing trace with hash 813915649, now seen corresponding path program 1 times [2020-09-04 17:48:46,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:48:46,869 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [196096587] [2020-09-04 17:48:46,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:48:46,878 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:48:46,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:47,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:48:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:47,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 17:48:47,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:47,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 17:48:47,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:47,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 17:48:47,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:47,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-09-04 17:48:47,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:47,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-09-04 17:48:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:47,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2020-09-04 17:48:47,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:47,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-09-04 17:48:47,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:47,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2020-09-04 17:48:47,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:47,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:48:47,055 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [196096587] [2020-09-04 17:48:47,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:48:47,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-09-04 17:48:47,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181556111] [2020-09-04 17:48:47,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 17:48:47,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:48:47,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 17:48:47,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-09-04 17:48:47,061 INFO L87 Difference]: Start difference. First operand 153 states and 171 transitions. Second operand 13 states. [2020-09-04 17:48:47,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:48:47,418 INFO L93 Difference]: Finished difference Result 194 states and 221 transitions. [2020-09-04 17:48:47,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 17:48:47,418 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 97 [2020-09-04 17:48:47,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:48:47,420 INFO L225 Difference]: With dead ends: 194 [2020-09-04 17:48:47,420 INFO L226 Difference]: Without dead ends: 192 [2020-09-04 17:48:47,421 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2020-09-04 17:48:47,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2020-09-04 17:48:47,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 183. [2020-09-04 17:48:47,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-09-04 17:48:47,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 208 transitions. [2020-09-04 17:48:47,432 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 208 transitions. Word has length 97 [2020-09-04 17:48:47,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:48:47,433 INFO L479 AbstractCegarLoop]: Abstraction has 183 states and 208 transitions. [2020-09-04 17:48:47,433 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 17:48:47,433 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 208 transitions. [2020-09-04 17:48:47,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-09-04 17:48:47,434 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:48:47,434 INFO L422 BasicCegarLoop]: trace histogram [9, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:48:47,435 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-09-04 17:48:47,435 INFO L427 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:48:47,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:48:47,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1992677655, now seen corresponding path program 2 times [2020-09-04 17:48:47,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:48:47,435 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [728569042] [2020-09-04 17:48:47,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:48:47,440 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:48:47,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:47,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:48:47,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:47,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 17:48:47,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:47,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 17:48:47,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:47,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 17:48:47,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:47,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-09-04 17:48:47,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:47,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-09-04 17:48:47,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:47,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2020-09-04 17:48:47,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:47,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-09-04 17:48:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:47,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2020-09-04 17:48:47,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:47,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:48:47,590 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [728569042] [2020-09-04 17:48:47,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:48:47,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-09-04 17:48:47,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411572529] [2020-09-04 17:48:47,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 17:48:47,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:48:47,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 17:48:47,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-09-04 17:48:47,593 INFO L87 Difference]: Start difference. First operand 183 states and 208 transitions. Second operand 13 states. [2020-09-04 17:48:48,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:48:48,042 INFO L93 Difference]: Finished difference Result 198 states and 224 transitions. [2020-09-04 17:48:48,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 17:48:48,042 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 97 [2020-09-04 17:48:48,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:48:48,045 INFO L225 Difference]: With dead ends: 198 [2020-09-04 17:48:48,045 INFO L226 Difference]: Without dead ends: 196 [2020-09-04 17:48:48,046 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2020-09-04 17:48:48,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2020-09-04 17:48:48,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 157. [2020-09-04 17:48:48,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-09-04 17:48:48,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 174 transitions. [2020-09-04 17:48:48,063 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 174 transitions. Word has length 97 [2020-09-04 17:48:48,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:48:48,064 INFO L479 AbstractCegarLoop]: Abstraction has 157 states and 174 transitions. [2020-09-04 17:48:48,064 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 17:48:48,064 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 174 transitions. [2020-09-04 17:48:48,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-09-04 17:48:48,066 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:48:48,067 INFO L422 BasicCegarLoop]: trace histogram [10, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:48:48,067 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-09-04 17:48:48,067 INFO L427 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:48:48,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:48:48,068 INFO L82 PathProgramCache]: Analyzing trace with hash 762056004, now seen corresponding path program 3 times [2020-09-04 17:48:48,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:48:48,068 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1514729226] [2020-09-04 17:48:48,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:48:48,074 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:48:48,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:48,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:48:48,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:48,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 17:48:48,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:48,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 17:48:48,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:48,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 17:48:48,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:48,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-09-04 17:48:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:48,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-09-04 17:48:48,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:48,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2020-09-04 17:48:48,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:48,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-09-04 17:48:48,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:48,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2020-09-04 17:48:48,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:48,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-09-04 17:48:48,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:48:48,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:48:48,357 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1514729226] [2020-09-04 17:48:48,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:48:48,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 17:48:48,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346679398] [2020-09-04 17:48:48,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 17:48:48,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:48:48,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 17:48:48,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-09-04 17:48:48,359 INFO L87 Difference]: Start difference. First operand 157 states and 174 transitions. Second operand 11 states. [2020-09-04 17:48:48,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:48:48,754 INFO L93 Difference]: Finished difference Result 157 states and 174 transitions. [2020-09-04 17:48:48,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-04 17:48:48,754 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 102 [2020-09-04 17:48:48,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:48:48,755 INFO L225 Difference]: With dead ends: 157 [2020-09-04 17:48:48,756 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 17:48:48,757 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 23 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2020-09-04 17:48:48,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 17:48:48,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 17:48:48,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 17:48:48,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 17:48:48,758 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 102 [2020-09-04 17:48:48,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:48:48,759 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 17:48:48,759 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 17:48:48,759 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 17:48:48,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 17:48:48,760 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-09-04 17:48:48,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 17:48:49,355 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 23 [2020-09-04 17:48:49,724 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 37 [2020-09-04 17:48:50,132 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 28 [2020-09-04 17:48:51,119 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 17:48:51,119 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-09-04 17:48:51,120 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 17:48:51,120 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 17:48:51,120 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 17:48:51,120 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 17:48:51,120 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-09-04 17:48:51,120 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-09-04 17:48:51,120 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-09-04 17:48:51,121 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-09-04 17:48:51,121 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-09-04 17:48:51,121 INFO L264 CegarLoopResult]: At program point L60(line 60) the Hoare annotation is: (and (<= 1 |main_#t~post9|) (<= (+ |main_#t~post9| 1) main_~tagbuf_len~0) (<= 1 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-09-04 17:48:51,121 INFO L264 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-09-04 17:48:51,121 INFO L264 CegarLoopResult]: At program point L60-1(line 60) the Hoare annotation is: (and (<= 2 main_~t~0) (<= 1 |main_#t~post9|) (<= main_~t~0 main_~tagbuf_len~0) (<= (+ |main_#t~post9| 1) main_~tagbuf_len~0)) [2020-09-04 17:48:51,121 INFO L264 CegarLoopResult]: At program point L27-1(lines 27 29) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-09-04 17:48:51,121 INFO L264 CegarLoopResult]: At program point L27-2(line 27) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-09-04 17:48:51,122 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 66) the Hoare annotation is: true [2020-09-04 17:48:51,122 INFO L264 CegarLoopResult]: At program point L27-3(line 27) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-09-04 17:48:51,122 INFO L264 CegarLoopResult]: At program point L44(line 44) the Hoare annotation is: (and (<= 1 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-09-04 17:48:51,122 INFO L264 CegarLoopResult]: At program point L44-1(lines 44 53) the Hoare annotation is: (and (<= 1 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-09-04 17:48:51,122 INFO L264 CegarLoopResult]: At program point L44-2(line 44) the Hoare annotation is: (and (<= 1 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-09-04 17:48:51,122 INFO L264 CegarLoopResult]: At program point L44-4(line 44) the Hoare annotation is: (and (<= 1 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-09-04 17:48:51,123 INFO L264 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: (and (<= (+ |main_#t~post4| 1) main_~tagbuf_len~0) (<= 0 main_~t~0) (<= 0 |main_#t~post4|) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-09-04 17:48:51,123 INFO L264 CegarLoopResult]: At program point L36-1(line 36) the Hoare annotation is: (and (<= (+ |main_#t~post4| 1) main_~tagbuf_len~0) (<= 0 |main_#t~post4|) (<= main_~t~0 main_~tagbuf_len~0) (<= 1 main_~t~0)) [2020-09-04 17:48:51,123 INFO L264 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-09-04 17:48:51,123 INFO L264 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-09-04 17:48:51,123 INFO L264 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: (and (<= 0 main_~t~0) (<= main_~t~0 main_~tagbuf_len~0)) [2020-09-04 17:48:51,123 INFO L264 CegarLoopResult]: At program point L45(line 45) the Hoare annotation is: (and (<= 1 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-09-04 17:48:51,123 INFO L264 CegarLoopResult]: At program point L45-1(line 45) the Hoare annotation is: (and (<= 1 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-09-04 17:48:51,124 INFO L264 CegarLoopResult]: At program point L37-2(lines 37 61) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 1 main_~t~0)) [2020-09-04 17:48:51,124 INFO L264 CegarLoopResult]: At program point L37-3(lines 37 61) the Hoare annotation is: (and (<= 1 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-09-04 17:48:51,124 INFO L264 CegarLoopResult]: At program point L62(line 62) the Hoare annotation is: (and (<= 0 main_~tagbuf_len~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-09-04 17:48:51,124 INFO L264 CegarLoopResult]: At program point L21-2(lines 21 33) the Hoare annotation is: (and (<= 0 main_~t~0) (<= main_~t~0 main_~tagbuf_len~0)) [2020-09-04 17:48:51,124 INFO L264 CegarLoopResult]: At program point L21-3(lines 21 33) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-09-04 17:48:51,124 INFO L264 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: (and (<= 1 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-09-04 17:48:51,124 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 66) the Hoare annotation is: true [2020-09-04 17:48:51,125 INFO L264 CegarLoopResult]: At program point L38(lines 38 42) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 1 main_~t~0)) [2020-09-04 17:48:51,125 INFO L271 CegarLoopResult]: At program point L63(lines 14 66) the Hoare annotation is: true [2020-09-04 17:48:51,125 INFO L264 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-09-04 17:48:51,125 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 66) the Hoare annotation is: true [2020-09-04 17:48:51,125 INFO L264 CegarLoopResult]: At program point L30-1(line 30) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-09-04 17:48:51,125 INFO L264 CegarLoopResult]: At program point L55(line 55) the Hoare annotation is: (and (<= 1 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-09-04 17:48:51,126 INFO L264 CegarLoopResult]: At program point L22(lines 22 26) the Hoare annotation is: (and (<= 0 main_~t~0) (<= main_~t~0 main_~tagbuf_len~0)) [2020-09-04 17:48:51,126 INFO L264 CegarLoopResult]: At program point L55-1(lines 55 57) the Hoare annotation is: (and (<= 1 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-09-04 17:48:51,126 INFO L264 CegarLoopResult]: At program point L55-2(line 55) the Hoare annotation is: (and (<= 1 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-09-04 17:48:51,126 INFO L264 CegarLoopResult]: At program point L55-3(line 55) the Hoare annotation is: (and (<= 1 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-09-04 17:48:51,126 INFO L264 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: (and (<= 1 |main_#t~post7|) (<= (+ |main_#t~post7| 1) main_~tagbuf_len~0) (<= 1 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-09-04 17:48:51,126 INFO L264 CegarLoopResult]: At program point L47-1(line 47) the Hoare annotation is: (and (<= 2 main_~t~0) (<= 1 |main_#t~post7|) (<= main_~t~0 main_~tagbuf_len~0) (<= (+ |main_#t~post7| 1) main_~tagbuf_len~0)) [2020-09-04 17:48:51,126 INFO L264 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: (and (<= 0 main_~t~0) (<= main_~t~0 main_~tagbuf_len~0)) [2020-09-04 17:48:51,127 INFO L264 CegarLoopResult]: At program point L39-1(line 39) the Hoare annotation is: (<= main_~t~0 main_~tagbuf_len~0) [2020-09-04 17:48:51,127 INFO L264 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-09-04 17:48:51,127 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (<= 0 main_~t~0) (<= main_~t~0 main_~tagbuf_len~0)) [2020-09-04 17:48:51,127 INFO L264 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: (<= main_~t~0 main_~tagbuf_len~0) [2020-09-04 17:48:51,127 INFO L264 CegarLoopResult]: At program point L48(lines 48 52) the Hoare annotation is: (and (<= 2 main_~t~0) (<= main_~t~0 main_~tagbuf_len~0)) [2020-09-04 17:48:51,127 INFO L264 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (and (<= 0 |main_#t~post3|) (<= 0 main_~t~0) (<= (+ |main_#t~post3| 1) main_~tagbuf_len~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-09-04 17:48:51,127 INFO L264 CegarLoopResult]: At program point L32-1(line 32) the Hoare annotation is: (and (<= 0 |main_#t~post3|) (<= main_~t~0 main_~tagbuf_len~0) (<= (+ |main_#t~post3| 1) main_~tagbuf_len~0) (<= 1 main_~t~0)) [2020-09-04 17:48:51,128 INFO L264 CegarLoopResult]: At program point L49(line 49) the Hoare annotation is: (and (<= 0 main_~t~0) (<= main_~t~0 main_~tagbuf_len~0)) [2020-09-04 17:48:51,128 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-09-04 17:48:51,128 INFO L264 CegarLoopResult]: At program point L49-1(line 49) the Hoare annotation is: (<= main_~t~0 main_~tagbuf_len~0) [2020-09-04 17:48:51,128 INFO L264 CegarLoopResult]: At program point L58(line 58) the Hoare annotation is: (and (<= 1 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-09-04 17:48:51,128 INFO L271 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-09-04 17:48:51,128 INFO L271 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-09-04 17:48:51,128 INFO L271 CegarLoopResult]: At program point L17-2(line 17) the Hoare annotation is: true [2020-09-04 17:48:51,129 INFO L264 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-09-04 17:48:51,129 INFO L264 CegarLoopResult]: At program point L59(line 59) the Hoare annotation is: (and (<= 1 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-09-04 17:48:51,129 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-09-04 17:48:51,129 INFO L264 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: (<= 1 main_~tagbuf_len~0) [2020-09-04 17:48:51,129 INFO L264 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: (and (<= 1 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-09-04 17:48:51,129 INFO L264 CegarLoopResult]: At program point L43-1(lines 43 57) the Hoare annotation is: (and (<= 1 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-09-04 17:48:51,129 INFO L264 CegarLoopResult]: At program point L43-2(line 43) the Hoare annotation is: (and (<= 1 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-09-04 17:48:51,130 INFO L264 CegarLoopResult]: At program point L43-3(line 43) the Hoare annotation is: (and (<= 1 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-09-04 17:48:51,130 INFO L264 CegarLoopResult]: At program point L43-4(lines 43 57) the Hoare annotation is: (and (<= 1 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-09-04 17:48:51,130 INFO L264 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-09-04 17:48:51,130 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-09-04 17:48:51,130 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-09-04 17:48:51,130 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-09-04 17:48:51,130 INFO L264 CegarLoopResult]: At program point L7(lines 7 9) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-09-04 17:48:51,131 INFO L264 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-09-04 17:48:51,131 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-09-04 17:48:51,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 05:48:51 BoogieIcfgContainer [2020-09-04 17:48:51,154 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 17:48:51,156 INFO L168 Benchmark]: Toolchain (without parser) took 13227.67 ms. Allocated memory was 140.5 MB in the beginning and 343.9 MB in the end (delta: 203.4 MB). Free memory was 103.9 MB in the beginning and 261.4 MB in the end (delta: -157.4 MB). Peak memory consumption was 209.0 MB. Max. memory is 7.1 GB. [2020-09-04 17:48:51,157 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 140.5 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 17:48:51,157 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.35 ms. Allocated memory is still 140.5 MB. Free memory was 103.7 MB in the beginning and 93.3 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2020-09-04 17:48:51,158 INFO L168 Benchmark]: Boogie Preprocessor took 121.01 ms. Allocated memory was 140.5 MB in the beginning and 204.5 MB in the end (delta: 64.0 MB). Free memory was 93.3 MB in the beginning and 183.2 MB in the end (delta: -89.9 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. [2020-09-04 17:48:51,158 INFO L168 Benchmark]: RCFGBuilder took 466.08 ms. Allocated memory is still 204.5 MB. Free memory was 183.2 MB in the beginning and 164.5 MB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. [2020-09-04 17:48:51,159 INFO L168 Benchmark]: TraceAbstraction took 12331.66 ms. Allocated memory was 204.5 MB in the beginning and 343.9 MB in the end (delta: 139.5 MB). Free memory was 163.9 MB in the beginning and 261.4 MB in the end (delta: -97.5 MB). Peak memory consumption was 205.0 MB. Max. memory is 7.1 GB. [2020-09-04 17:48:51,161 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.23 ms. Allocated memory is still 140.5 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 303.35 ms. Allocated memory is still 140.5 MB. Free memory was 103.7 MB in the beginning and 93.3 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 121.01 ms. Allocated memory was 140.5 MB in the beginning and 204.5 MB in the end (delta: 64.0 MB). Free memory was 93.3 MB in the beginning and 183.2 MB in the end (delta: -89.9 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 466.08 ms. Allocated memory is still 204.5 MB. Free memory was 183.2 MB in the beginning and 164.5 MB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12331.66 ms. Allocated memory was 204.5 MB in the beginning and 343.9 MB in the end (delta: 139.5 MB). Free memory was 163.9 MB in the beginning and 261.4 MB in the end (delta: -97.5 MB). Peak memory consumption was 205.0 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: 21]: Loop Invariant Derived loop invariant: 0 <= t && t <= tagbuf_len - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: t <= tagbuf_len && 1 <= t - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 - 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, 79 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 9.8s, OverallIterations: 25, TraceHistogramMax: 10, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2053 SDtfs, 888 SDslu, 10849 SDs, 0 SdLazy, 3941 SolverSat, 357 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 673 GetRequests, 331 SyntacticMatches, 33 SemanticMatches, 309 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=253occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 25 MinimizatonAttempts, 193 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 74 LocationsWithAnnotation, 494 PreInvPairs, 814 NumberOfFragments, 537 HoareAnnotationTreeSize, 494 FomulaSimplifications, 529514 FormulaSimplificationTreeSizeReduction, 1.3s HoareSimplificationTime, 74 FomulaSimplificationsInter, 1846 FormulaSimplificationTreeSizeReductionInter, 0.9s 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...