/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/recursive-simple/sum_20x0-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 16:31:01,444 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 16:31:01,448 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 16:31:01,476 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 16:31:01,476 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 16:31:01,478 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 16:31:01,479 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 16:31:01,481 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 16:31:01,483 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 16:31:01,484 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 16:31:01,485 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 16:31:01,486 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 16:31:01,487 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 16:31:01,488 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 16:31:01,489 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 16:31:01,490 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 16:31:01,491 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 16:31:01,492 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 16:31:01,494 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 16:31:01,496 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 16:31:01,498 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 16:31:01,499 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 16:31:01,500 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 16:31:01,501 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 16:31:01,504 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 16:31:01,506 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 16:31:01,506 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 16:31:01,507 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 16:31:01,508 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 16:31:01,511 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 16:31:01,511 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 16:31:01,512 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 16:31:01,513 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 16:31:01,513 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 16:31:01,515 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 16:31:01,515 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 16:31:01,517 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 16:31:01,518 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 16:31:01,518 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 16:31:01,519 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 16:31:01,521 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 16:31:01,522 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 16:31:01,557 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 16:31:01,557 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 16:31:01,559 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 16:31:01,559 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 16:31:01,560 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 16:31:01,560 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 16:31:01,560 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 16:31:01,560 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 16:31:01,560 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 16:31:01,562 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 16:31:01,562 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 16:31:01,562 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 16:31:01,562 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 16:31:01,562 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 16:31:01,563 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 16:31:01,563 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 16:31:01,563 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 16:31:01,563 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 16:31:01,563 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 16:31:01,565 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 16:31:01,565 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 16:31:01,565 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 16:31:01,565 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-09-04 16:31:02,068 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 16:31:02,087 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 16:31:02,092 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 16:31:02,094 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 16:31:02,095 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 16:31:02,096 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/sum_20x0-1.c [2020-09-04 16:31:02,188 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/0049d3582/c9c93d78d9f048b5930ab183d80db5d9/FLAGf903d3597 [2020-09-04 16:31:02,704 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 16:31:02,705 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/sum_20x0-1.c [2020-09-04 16:31:02,714 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/0049d3582/c9c93d78d9f048b5930ab183d80db5d9/FLAGf903d3597 [2020-09-04 16:31:03,034 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/0049d3582/c9c93d78d9f048b5930ab183d80db5d9 [2020-09-04 16:31:03,051 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 16:31:03,053 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 16:31:03,054 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 16:31:03,055 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 16:31:03,059 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 16:31:03,060 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:31:03" (1/1) ... [2020-09-04 16:31:03,065 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f159ca9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:31:03, skipping insertion in model container [2020-09-04 16:31:03,066 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:31:03" (1/1) ... [2020-09-04 16:31:03,076 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 16:31:03,101 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 16:31:03,391 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:31:03,396 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 16:31:03,414 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:31:03,430 INFO L208 MainTranslator]: Completed translation [2020-09-04 16:31:03,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:31:03 WrapperNode [2020-09-04 16:31:03,431 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 16:31:03,432 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 16:31:03,432 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 16:31:03,432 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 16:31:03,446 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:31:03" (1/1) ... [2020-09-04 16:31:03,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:31:03" (1/1) ... [2020-09-04 16:31:03,452 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:31:03" (1/1) ... [2020-09-04 16:31:03,452 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:31:03" (1/1) ... [2020-09-04 16:31:03,456 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:31:03" (1/1) ... [2020-09-04 16:31:03,459 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:31:03" (1/1) ... [2020-09-04 16:31:03,460 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:31:03" (1/1) ... [2020-09-04 16:31:03,461 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 16:31:03,462 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 16:31:03,462 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 16:31:03,462 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 16:31:03,464 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:31:03" (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 16:31:03,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 16:31:03,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 16:31:03,664 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2020-09-04 16:31:03,664 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 16:31:03,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 16:31:03,664 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2020-09-04 16:31:03,664 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 16:31:03,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 16:31:03,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 16:31:03,888 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 16:31:03,888 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 16:31:03,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:31:03 BoogieIcfgContainer [2020-09-04 16:31:03,895 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 16:31:03,897 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 16:31:03,897 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 16:31:03,902 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 16:31:03,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 04:31:03" (1/3) ... [2020-09-04 16:31:03,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fa265ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:31:03, skipping insertion in model container [2020-09-04 16:31:03,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:31:03" (2/3) ... [2020-09-04 16:31:03,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fa265ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:31:03, skipping insertion in model container [2020-09-04 16:31:03,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:31:03" (3/3) ... [2020-09-04 16:31:03,907 INFO L109 eAbstractionObserver]: Analyzing ICFG sum_20x0-1.c [2020-09-04 16:31:03,921 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 16:31:03,934 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 16:31:03,961 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 16:31:03,997 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 16:31:03,997 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 16:31:03,997 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-09-04 16:31:03,997 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 16:31:03,998 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 16:31:03,998 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 16:31:03,998 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 16:31:03,998 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 16:31:04,020 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2020-09-04 16:31:04,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-04 16:31:04,037 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:04,038 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:04,039 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:04,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:04,049 INFO L82 PathProgramCache]: Analyzing trace with hash 989240825, now seen corresponding path program 1 times [2020-09-04 16:31:04,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:04,064 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1497911469] [2020-09-04 16:31:04,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:04,158 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:04,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:04,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:04,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:04,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:04,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:04,345 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 16:31:04,348 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1497911469] [2020-09-04 16:31:04,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:04,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 16:31:04,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832902667] [2020-09-04 16:31:04,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 16:31:04,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:04,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 16:31:04,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 16:31:04,372 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 5 states. [2020-09-04 16:31:04,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:04,493 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2020-09-04 16:31:04,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 16:31:04,495 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-09-04 16:31:04,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:04,509 INFO L225 Difference]: With dead ends: 39 [2020-09-04 16:31:04,509 INFO L226 Difference]: Without dead ends: 25 [2020-09-04 16:31:04,514 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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 16:31:04,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-09-04 16:31:04,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-09-04 16:31:04,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-09-04 16:31:04,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2020-09-04 16:31:04,571 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 18 [2020-09-04 16:31:04,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:04,572 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-09-04 16:31:04,572 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 16:31:04,572 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-09-04 16:31:04,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-09-04 16:31:04,574 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:04,575 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:04,575 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 16:31:04,576 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:04,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:04,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1852726759, now seen corresponding path program 1 times [2020-09-04 16:31:04,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:04,577 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [196763156] [2020-09-04 16:31:04,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:04,580 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:04,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:04,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:04,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:04,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:04,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:04,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:04,717 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-09-04 16:31:04,718 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [196763156] [2020-09-04 16:31:04,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:04,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 16:31:04,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939494759] [2020-09-04 16:31:04,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 16:31:04,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:04,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 16:31:04,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 16:31:04,721 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 6 states. [2020-09-04 16:31:04,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:04,803 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2020-09-04 16:31:04,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 16:31:04,803 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-09-04 16:31:04,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:04,805 INFO L225 Difference]: With dead ends: 36 [2020-09-04 16:31:04,805 INFO L226 Difference]: Without dead ends: 30 [2020-09-04 16:31:04,808 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-09-04 16:31:04,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-09-04 16:31:04,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-09-04 16:31:04,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-09-04 16:31:04,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2020-09-04 16:31:04,820 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 27 [2020-09-04 16:31:04,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:04,821 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2020-09-04 16:31:04,821 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 16:31:04,821 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-09-04 16:31:04,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-09-04 16:31:04,823 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:04,823 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:04,823 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 16:31:04,824 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:04,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:04,824 INFO L82 PathProgramCache]: Analyzing trace with hash -175020829, now seen corresponding path program 2 times [2020-09-04 16:31:04,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:04,825 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2009376864] [2020-09-04 16:31:04,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:04,828 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:04,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:04,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:04,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:04,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:04,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:04,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:04,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:04,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:04,982 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-09-04 16:31:04,983 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2009376864] [2020-09-04 16:31:04,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:04,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 16:31:04,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175863964] [2020-09-04 16:31:04,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 16:31:04,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:04,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 16:31:04,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-04 16:31:04,986 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 7 states. [2020-09-04 16:31:05,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:05,085 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2020-09-04 16:31:05,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 16:31:05,085 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-09-04 16:31:05,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:05,087 INFO L225 Difference]: With dead ends: 41 [2020-09-04 16:31:05,088 INFO L226 Difference]: Without dead ends: 35 [2020-09-04 16:31:05,089 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-09-04 16:31:05,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-09-04 16:31:05,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-09-04 16:31:05,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-09-04 16:31:05,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2020-09-04 16:31:05,101 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 36 [2020-09-04 16:31:05,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:05,102 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2020-09-04 16:31:05,102 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 16:31:05,102 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2020-09-04 16:31:05,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-09-04 16:31:05,104 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:05,105 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:05,105 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 16:31:05,105 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:05,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:05,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1021564803, now seen corresponding path program 3 times [2020-09-04 16:31:05,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:05,107 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [768223806] [2020-09-04 16:31:05,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:05,109 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:05,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:05,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:05,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:05,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:05,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:05,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:05,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:05,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:05,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:05,374 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:31:05,375 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [768223806] [2020-09-04 16:31:05,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:05,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 16:31:05,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835206991] [2020-09-04 16:31:05,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 16:31:05,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:05,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 16:31:05,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-09-04 16:31:05,379 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 8 states. [2020-09-04 16:31:05,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:05,498 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-09-04 16:31:05,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 16:31:05,499 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2020-09-04 16:31:05,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:05,500 INFO L225 Difference]: With dead ends: 46 [2020-09-04 16:31:05,501 INFO L226 Difference]: Without dead ends: 40 [2020-09-04 16:31:05,502 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-09-04 16:31:05,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-09-04 16:31:05,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-09-04 16:31:05,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-09-04 16:31:05,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2020-09-04 16:31:05,513 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 45 [2020-09-04 16:31:05,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:05,514 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2020-09-04 16:31:05,514 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 16:31:05,514 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2020-09-04 16:31:05,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-09-04 16:31:05,516 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:05,517 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:05,517 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 16:31:05,517 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:05,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:05,518 INFO L82 PathProgramCache]: Analyzing trace with hash -263249715, now seen corresponding path program 4 times [2020-09-04 16:31:05,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:05,518 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [294731619] [2020-09-04 16:31:05,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:05,521 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:05,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:05,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:05,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:05,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:05,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:05,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:05,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:05,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:05,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:05,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:05,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:05,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:05,754 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-09-04 16:31:05,755 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [294731619] [2020-09-04 16:31:05,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:05,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 16:31:05,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785918326] [2020-09-04 16:31:05,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 16:31:05,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:05,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 16:31:05,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-09-04 16:31:05,757 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 9 states. [2020-09-04 16:31:05,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:05,868 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2020-09-04 16:31:05,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 16:31:05,869 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2020-09-04 16:31:05,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:05,872 INFO L225 Difference]: With dead ends: 51 [2020-09-04 16:31:05,872 INFO L226 Difference]: Without dead ends: 45 [2020-09-04 16:31:05,874 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-09-04 16:31:05,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-09-04 16:31:05,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-09-04 16:31:05,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-09-04 16:31:05,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2020-09-04 16:31:05,903 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 54 [2020-09-04 16:31:05,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:05,905 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2020-09-04 16:31:05,905 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 16:31:05,905 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2020-09-04 16:31:05,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-09-04 16:31:05,908 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:05,908 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:05,908 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 16:31:05,909 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:05,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:05,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1884999187, now seen corresponding path program 5 times [2020-09-04 16:31:05,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:05,911 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1801000386] [2020-09-04 16:31:05,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:05,917 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:05,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:05,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:05,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:05,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:06,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:06,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:06,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:06,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:06,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:06,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:06,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:06,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:06,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:06,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:06,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:06,280 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-09-04 16:31:06,281 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1801000386] [2020-09-04 16:31:06,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:06,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 16:31:06,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125799585] [2020-09-04 16:31:06,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 16:31:06,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:06,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 16:31:06,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-09-04 16:31:06,284 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 10 states. [2020-09-04 16:31:06,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:06,395 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2020-09-04 16:31:06,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 16:31:06,396 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2020-09-04 16:31:06,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:06,398 INFO L225 Difference]: With dead ends: 56 [2020-09-04 16:31:06,398 INFO L226 Difference]: Without dead ends: 50 [2020-09-04 16:31:06,399 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-09-04 16:31:06,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-09-04 16:31:06,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-09-04 16:31:06,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-09-04 16:31:06,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2020-09-04 16:31:06,410 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 63 [2020-09-04 16:31:06,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:06,410 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2020-09-04 16:31:06,410 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 16:31:06,411 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2020-09-04 16:31:06,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-09-04 16:31:06,412 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:06,413 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:06,413 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 16:31:06,413 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:06,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:06,414 INFO L82 PathProgramCache]: Analyzing trace with hash -441437769, now seen corresponding path program 6 times [2020-09-04 16:31:06,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:06,417 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1907747911] [2020-09-04 16:31:06,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:06,419 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:06,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:06,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:06,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:06,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:06,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:06,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:06,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:06,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:06,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:06,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:06,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:06,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:06,701 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-09-04 16:31:06,702 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1907747911] [2020-09-04 16:31:06,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:06,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 16:31:06,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863823929] [2020-09-04 16:31:06,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 16:31:06,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:06,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 16:31:06,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-09-04 16:31:06,704 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 11 states. [2020-09-04 16:31:06,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:06,830 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2020-09-04 16:31:06,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 16:31:06,831 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2020-09-04 16:31:06,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:06,833 INFO L225 Difference]: With dead ends: 61 [2020-09-04 16:31:06,833 INFO L226 Difference]: Without dead ends: 55 [2020-09-04 16:31:06,834 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2020-09-04 16:31:06,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-09-04 16:31:06,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-09-04 16:31:06,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-09-04 16:31:06,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2020-09-04 16:31:06,845 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 72 [2020-09-04 16:31:06,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:06,845 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2020-09-04 16:31:06,846 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 16:31:06,846 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2020-09-04 16:31:06,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-09-04 16:31:06,847 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:06,847 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:06,848 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 16:31:06,848 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:06,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:06,848 INFO L82 PathProgramCache]: Analyzing trace with hash 999943849, now seen corresponding path program 7 times [2020-09-04 16:31:06,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:06,849 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1784280629] [2020-09-04 16:31:06,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:06,851 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:06,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:06,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:06,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:06,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:06,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:06,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:07,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:07,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:07,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:07,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:07,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:07,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:07,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:07,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:07,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:07,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:07,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:07,203 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-09-04 16:31:07,204 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1784280629] [2020-09-04 16:31:07,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:07,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-04 16:31:07,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739923776] [2020-09-04 16:31:07,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 16:31:07,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:07,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 16:31:07,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-09-04 16:31:07,207 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 12 states. [2020-09-04 16:31:07,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:07,357 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2020-09-04 16:31:07,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 16:31:07,358 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 81 [2020-09-04 16:31:07,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:07,360 INFO L225 Difference]: With dead ends: 66 [2020-09-04 16:31:07,360 INFO L226 Difference]: Without dead ends: 60 [2020-09-04 16:31:07,361 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2020-09-04 16:31:07,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-09-04 16:31:07,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2020-09-04 16:31:07,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-09-04 16:31:07,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2020-09-04 16:31:07,371 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 81 [2020-09-04 16:31:07,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:07,372 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2020-09-04 16:31:07,372 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 16:31:07,372 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2020-09-04 16:31:07,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-09-04 16:31:07,373 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:07,374 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:07,374 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 16:31:07,374 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:07,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:07,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1356134305, now seen corresponding path program 8 times [2020-09-04 16:31:07,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:07,375 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1301191046] [2020-09-04 16:31:07,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:07,377 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:07,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:07,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:07,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:07,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:07,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:07,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:07,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:07,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:07,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:07,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:07,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:07,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:07,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:07,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:07,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:07,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:07,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:07,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:07,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:07,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:07,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:07,738 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-09-04 16:31:07,739 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1301191046] [2020-09-04 16:31:07,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:07,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-09-04 16:31:07,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639056476] [2020-09-04 16:31:07,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 16:31:07,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:07,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 16:31:07,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-09-04 16:31:07,742 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 13 states. [2020-09-04 16:31:07,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:07,888 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2020-09-04 16:31:07,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 16:31:07,889 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 90 [2020-09-04 16:31:07,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:07,890 INFO L225 Difference]: With dead ends: 71 [2020-09-04 16:31:07,891 INFO L226 Difference]: Without dead ends: 65 [2020-09-04 16:31:07,892 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2020-09-04 16:31:07,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-09-04 16:31:07,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-09-04 16:31:07,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-09-04 16:31:07,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2020-09-04 16:31:07,902 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 90 [2020-09-04 16:31:07,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:07,903 INFO L479 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2020-09-04 16:31:07,903 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 16:31:07,903 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2020-09-04 16:31:07,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-09-04 16:31:07,905 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:07,905 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:07,905 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 16:31:07,905 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:07,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:07,906 INFO L82 PathProgramCache]: Analyzing trace with hash -928437697, now seen corresponding path program 9 times [2020-09-04 16:31:07,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:07,906 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [205489668] [2020-09-04 16:31:07,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:07,908 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:07,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:07,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:07,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:07,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:07,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:08,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:08,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:08,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:08,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:08,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:08,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:08,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:08,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:08,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:08,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:08,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:08,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:08,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:08,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:08,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:08,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:08,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:08,348 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-09-04 16:31:08,349 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [205489668] [2020-09-04 16:31:08,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:08,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-09-04 16:31:08,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838548409] [2020-09-04 16:31:08,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 16:31:08,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:08,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 16:31:08,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2020-09-04 16:31:08,351 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 14 states. [2020-09-04 16:31:08,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:08,512 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2020-09-04 16:31:08,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 16:31:08,513 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 99 [2020-09-04 16:31:08,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:08,514 INFO L225 Difference]: With dead ends: 76 [2020-09-04 16:31:08,515 INFO L226 Difference]: Without dead ends: 70 [2020-09-04 16:31:08,516 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2020-09-04 16:31:08,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-09-04 16:31:08,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-09-04 16:31:08,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-09-04 16:31:08,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2020-09-04 16:31:08,525 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 99 [2020-09-04 16:31:08,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:08,526 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2020-09-04 16:31:08,526 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 16:31:08,526 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2020-09-04 16:31:08,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-09-04 16:31:08,527 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:08,528 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:08,528 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 16:31:08,528 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:08,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:08,528 INFO L82 PathProgramCache]: Analyzing trace with hash -276966773, now seen corresponding path program 10 times [2020-09-04 16:31:08,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:08,529 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1849044782] [2020-09-04 16:31:08,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:08,531 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:08,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:08,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:08,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:08,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:08,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:08,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:08,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:08,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:08,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:08,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:08,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:08,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:08,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:08,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:08,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:08,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:08,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:08,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:08,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:08,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:08,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:08,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:08,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:08,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:08,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:09,027 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-09-04 16:31:09,028 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1849044782] [2020-09-04 16:31:09,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:09,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-09-04 16:31:09,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958298959] [2020-09-04 16:31:09,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 16:31:09,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:09,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 16:31:09,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2020-09-04 16:31:09,030 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 15 states. [2020-09-04 16:31:09,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:09,194 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2020-09-04 16:31:09,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 16:31:09,194 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 108 [2020-09-04 16:31:09,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:09,196 INFO L225 Difference]: With dead ends: 81 [2020-09-04 16:31:09,196 INFO L226 Difference]: Without dead ends: 75 [2020-09-04 16:31:09,197 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=236, Invalid=414, Unknown=0, NotChecked=0, Total=650 [2020-09-04 16:31:09,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-09-04 16:31:09,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2020-09-04 16:31:09,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-09-04 16:31:09,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2020-09-04 16:31:09,207 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 108 [2020-09-04 16:31:09,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:09,208 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2020-09-04 16:31:09,208 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 16:31:09,208 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2020-09-04 16:31:09,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-09-04 16:31:09,209 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:09,209 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:09,210 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 16:31:09,210 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:09,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:09,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1749540651, now seen corresponding path program 11 times [2020-09-04 16:31:09,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:09,211 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1741223953] [2020-09-04 16:31:09,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:09,212 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:09,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:09,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:09,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:09,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:09,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:09,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:09,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:09,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:09,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:09,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:09,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:09,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:09,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:09,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:09,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:09,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:09,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:09,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:09,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:09,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:09,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:09,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:09,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:09,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:09,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:09,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:09,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:09,865 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-09-04 16:31:09,866 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1741223953] [2020-09-04 16:31:09,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:09,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-09-04 16:31:09,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366397631] [2020-09-04 16:31:09,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-04 16:31:09,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:09,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-04 16:31:09,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2020-09-04 16:31:09,868 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 16 states. [2020-09-04 16:31:10,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:10,064 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2020-09-04 16:31:10,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 16:31:10,065 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 117 [2020-09-04 16:31:10,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:10,066 INFO L225 Difference]: With dead ends: 86 [2020-09-04 16:31:10,067 INFO L226 Difference]: Without dead ends: 80 [2020-09-04 16:31:10,069 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=275, Invalid=481, Unknown=0, NotChecked=0, Total=756 [2020-09-04 16:31:10,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-09-04 16:31:10,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2020-09-04 16:31:10,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-09-04 16:31:10,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2020-09-04 16:31:10,078 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 117 [2020-09-04 16:31:10,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:10,078 INFO L479 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2020-09-04 16:31:10,078 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-04 16:31:10,078 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2020-09-04 16:31:10,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2020-09-04 16:31:10,080 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:10,080 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:10,080 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 16:31:10,081 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:10,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:10,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1141580405, now seen corresponding path program 12 times [2020-09-04 16:31:10,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:10,081 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [855817504] [2020-09-04 16:31:10,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:10,083 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:10,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:10,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:10,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:10,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:10,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:10,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:10,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:10,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:10,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:10,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:10,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:10,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:10,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:10,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:10,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:10,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:10,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:10,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:10,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:10,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:10,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:10,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:10,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:10,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:10,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:10,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:10,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:10,852 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-09-04 16:31:10,853 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [855817504] [2020-09-04 16:31:10,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:10,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-09-04 16:31:10,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734759148] [2020-09-04 16:31:10,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-04 16:31:10,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:10,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-04 16:31:10,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=163, Unknown=0, NotChecked=0, Total=272 [2020-09-04 16:31:10,856 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 17 states. [2020-09-04 16:31:11,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:11,083 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2020-09-04 16:31:11,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-04 16:31:11,084 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 126 [2020-09-04 16:31:11,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:11,085 INFO L225 Difference]: With dead ends: 91 [2020-09-04 16:31:11,086 INFO L226 Difference]: Without dead ends: 85 [2020-09-04 16:31:11,087 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=317, Invalid=553, Unknown=0, NotChecked=0, Total=870 [2020-09-04 16:31:11,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-09-04 16:31:11,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2020-09-04 16:31:11,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-09-04 16:31:11,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2020-09-04 16:31:11,097 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 126 [2020-09-04 16:31:11,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:11,097 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2020-09-04 16:31:11,098 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-04 16:31:11,098 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2020-09-04 16:31:11,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-09-04 16:31:11,099 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:11,099 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:11,100 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 16:31:11,100 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:11,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:11,101 INFO L82 PathProgramCache]: Analyzing trace with hash 55997035, now seen corresponding path program 13 times [2020-09-04 16:31:11,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:11,101 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1065941973] [2020-09-04 16:31:11,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:11,103 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:11,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:11,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:11,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:11,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:11,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:11,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:11,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:11,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:11,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:11,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:11,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:11,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:11,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:11,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:11,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:11,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:11,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:11,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:11,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:11,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:11,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:11,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:11,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:11,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:11,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:11,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:11,874 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-09-04 16:31:11,875 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1065941973] [2020-09-04 16:31:11,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:11,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-09-04 16:31:11,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161368502] [2020-09-04 16:31:11,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-09-04 16:31:11,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:11,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-09-04 16:31:11,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=182, Unknown=0, NotChecked=0, Total=306 [2020-09-04 16:31:11,877 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 18 states. [2020-09-04 16:31:12,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:12,094 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2020-09-04 16:31:12,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 16:31:12,095 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 135 [2020-09-04 16:31:12,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:12,096 INFO L225 Difference]: With dead ends: 96 [2020-09-04 16:31:12,096 INFO L226 Difference]: Without dead ends: 90 [2020-09-04 16:31:12,097 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=362, Invalid=630, Unknown=0, NotChecked=0, Total=992 [2020-09-04 16:31:12,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-09-04 16:31:12,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2020-09-04 16:31:12,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-09-04 16:31:12,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2020-09-04 16:31:12,106 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 135 [2020-09-04 16:31:12,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:12,106 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2020-09-04 16:31:12,107 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-09-04 16:31:12,107 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2020-09-04 16:31:12,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-09-04 16:31:12,108 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:12,109 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:12,109 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 16:31:12,109 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:12,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:12,110 INFO L82 PathProgramCache]: Analyzing trace with hash 394086239, now seen corresponding path program 14 times [2020-09-04 16:31:12,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:12,110 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [59237892] [2020-09-04 16:31:12,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:12,112 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:12,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:12,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:12,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:12,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:12,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:12,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:12,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:12,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:12,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:12,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:12,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:12,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:12,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:12,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:12,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:12,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:12,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:12,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:12,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:12,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:12,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:12,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:12,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:12,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:12,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:12,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:12,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:12,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:12,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:12,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:13,035 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-09-04 16:31:13,035 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [59237892] [2020-09-04 16:31:13,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:13,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-09-04 16:31:13,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120135483] [2020-09-04 16:31:13,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-09-04 16:31:13,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:13,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-09-04 16:31:13,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=202, Unknown=0, NotChecked=0, Total=342 [2020-09-04 16:31:13,038 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 19 states. [2020-09-04 16:31:13,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:13,302 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2020-09-04 16:31:13,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 16:31:13,303 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 144 [2020-09-04 16:31:13,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:13,305 INFO L225 Difference]: With dead ends: 101 [2020-09-04 16:31:13,305 INFO L226 Difference]: Without dead ends: 95 [2020-09-04 16:31:13,306 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=410, Invalid=712, Unknown=0, NotChecked=0, Total=1122 [2020-09-04 16:31:13,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-09-04 16:31:13,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2020-09-04 16:31:13,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-09-04 16:31:13,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2020-09-04 16:31:13,316 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 144 [2020-09-04 16:31:13,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:13,316 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2020-09-04 16:31:13,316 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-09-04 16:31:13,317 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2020-09-04 16:31:13,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-09-04 16:31:13,318 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:13,319 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:13,319 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-04 16:31:13,319 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:13,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:13,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1047772929, now seen corresponding path program 15 times [2020-09-04 16:31:13,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:13,320 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1338259410] [2020-09-04 16:31:13,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:13,322 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:13,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:13,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:13,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:13,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:13,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:13,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:13,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:13,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:13,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:13,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:13,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:13,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:13,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:13,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:13,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:13,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:13,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:13,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:13,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:13,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:13,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:13,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:13,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:13,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:13,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:13,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:13,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:13,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:13,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:13,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:14,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:14,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:14,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:14,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:14,246 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-09-04 16:31:14,246 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1338259410] [2020-09-04 16:31:14,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:14,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-09-04 16:31:14,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254732233] [2020-09-04 16:31:14,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-09-04 16:31:14,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:14,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-09-04 16:31:14,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=223, Unknown=0, NotChecked=0, Total=380 [2020-09-04 16:31:14,249 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 20 states. [2020-09-04 16:31:14,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:14,503 INFO L93 Difference]: Finished difference Result 106 states and 107 transitions. [2020-09-04 16:31:14,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-09-04 16:31:14,504 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 153 [2020-09-04 16:31:14,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:14,505 INFO L225 Difference]: With dead ends: 106 [2020-09-04 16:31:14,505 INFO L226 Difference]: Without dead ends: 100 [2020-09-04 16:31:14,507 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=461, Invalid=799, Unknown=0, NotChecked=0, Total=1260 [2020-09-04 16:31:14,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-09-04 16:31:14,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2020-09-04 16:31:14,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-09-04 16:31:14,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2020-09-04 16:31:14,517 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 153 [2020-09-04 16:31:14,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:14,520 INFO L479 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2020-09-04 16:31:14,520 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-09-04 16:31:14,520 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2020-09-04 16:31:14,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2020-09-04 16:31:14,521 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:14,522 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:14,522 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-04 16:31:14,522 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:14,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:14,522 INFO L82 PathProgramCache]: Analyzing trace with hash -76242615, now seen corresponding path program 16 times [2020-09-04 16:31:14,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:14,523 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1786758979] [2020-09-04 16:31:14,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:14,526 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:14,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:14,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:14,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:14,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:14,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:14,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:14,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:14,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:14,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:14,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:14,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:14,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:14,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:14,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:14,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:14,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:14,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:15,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:15,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:15,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:15,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:15,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:15,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:15,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:15,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:15,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:15,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:15,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:15,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:15,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:15,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:15,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:15,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:15,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:15,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:15,724 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-09-04 16:31:15,725 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1786758979] [2020-09-04 16:31:15,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:15,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2020-09-04 16:31:15,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296480611] [2020-09-04 16:31:15,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-09-04 16:31:15,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:15,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-09-04 16:31:15,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=245, Unknown=0, NotChecked=0, Total=420 [2020-09-04 16:31:15,730 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 21 states. [2020-09-04 16:31:16,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:16,004 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2020-09-04 16:31:16,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-04 16:31:16,004 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 162 [2020-09-04 16:31:16,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:16,006 INFO L225 Difference]: With dead ends: 111 [2020-09-04 16:31:16,006 INFO L226 Difference]: Without dead ends: 105 [2020-09-04 16:31:16,008 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=515, Invalid=891, Unknown=0, NotChecked=0, Total=1406 [2020-09-04 16:31:16,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-09-04 16:31:16,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2020-09-04 16:31:16,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-09-04 16:31:16,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2020-09-04 16:31:16,017 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 162 [2020-09-04 16:31:16,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:16,018 INFO L479 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2020-09-04 16:31:16,018 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-09-04 16:31:16,018 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2020-09-04 16:31:16,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-09-04 16:31:16,020 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:16,020 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:16,021 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-04 16:31:16,021 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:16,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:16,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1382000279, now seen corresponding path program 17 times [2020-09-04 16:31:16,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:16,022 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1007332199] [2020-09-04 16:31:16,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:16,024 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:16,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:16,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:16,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:16,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:16,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:16,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:16,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:16,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:16,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:16,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:16,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:16,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:16,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:16,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:16,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:16,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:16,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:16,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:16,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:16,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:16,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:16,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:16,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:16,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:16,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:16,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:16,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:16,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:16,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:16,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:16,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:16,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:16,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:16,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:16,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:16,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:16,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:17,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:17,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:17,229 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-09-04 16:31:17,230 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1007332199] [2020-09-04 16:31:17,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:17,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2020-09-04 16:31:17,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144244845] [2020-09-04 16:31:17,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-09-04 16:31:17,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:17,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-09-04 16:31:17,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=268, Unknown=0, NotChecked=0, Total=462 [2020-09-04 16:31:17,239 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 22 states. [2020-09-04 16:31:17,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:17,539 INFO L93 Difference]: Finished difference Result 116 states and 117 transitions. [2020-09-04 16:31:17,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-09-04 16:31:17,540 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 171 [2020-09-04 16:31:17,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:17,541 INFO L225 Difference]: With dead ends: 116 [2020-09-04 16:31:17,541 INFO L226 Difference]: Without dead ends: 110 [2020-09-04 16:31:17,543 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=572, Invalid=988, Unknown=0, NotChecked=0, Total=1560 [2020-09-04 16:31:17,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-09-04 16:31:17,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2020-09-04 16:31:17,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-09-04 16:31:17,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2020-09-04 16:31:17,552 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 171 [2020-09-04 16:31:17,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:17,553 INFO L479 AbstractCegarLoop]: Abstraction has 110 states and 111 transitions. [2020-09-04 16:31:17,553 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-09-04 16:31:17,553 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2020-09-04 16:31:17,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-09-04 16:31:17,555 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:17,555 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:17,556 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-09-04 16:31:17,556 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:17,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:17,556 INFO L82 PathProgramCache]: Analyzing trace with hash -869167053, now seen corresponding path program 18 times [2020-09-04 16:31:17,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:17,557 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [408625759] [2020-09-04 16:31:17,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:17,559 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:17,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:17,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:17,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:17,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:17,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:17,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:17,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:17,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:17,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:17,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:17,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:17,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:17,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:17,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:18,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:18,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:18,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:18,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:18,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:18,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:18,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:18,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:18,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:18,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:18,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,813 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2020-09-04 16:31:18,814 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [408625759] [2020-09-04 16:31:18,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:18,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2020-09-04 16:31:18,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568597190] [2020-09-04 16:31:18,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-09-04 16:31:18,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:18,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-09-04 16:31:18,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=292, Unknown=0, NotChecked=0, Total=506 [2020-09-04 16:31:18,818 INFO L87 Difference]: Start difference. First operand 110 states and 111 transitions. Second operand 23 states. [2020-09-04 16:31:19,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:19,121 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2020-09-04 16:31:19,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-09-04 16:31:19,123 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 180 [2020-09-04 16:31:19,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:19,125 INFO L225 Difference]: With dead ends: 121 [2020-09-04 16:31:19,126 INFO L226 Difference]: Without dead ends: 115 [2020-09-04 16:31:19,128 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=632, Invalid=1090, Unknown=0, NotChecked=0, Total=1722 [2020-09-04 16:31:19,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-09-04 16:31:19,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2020-09-04 16:31:19,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-09-04 16:31:19,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2020-09-04 16:31:19,140 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 180 [2020-09-04 16:31:19,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:19,141 INFO L479 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2020-09-04 16:31:19,141 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-09-04 16:31:19,141 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2020-09-04 16:31:19,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2020-09-04 16:31:19,144 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:19,144 INFO L422 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:19,144 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-09-04 16:31:19,145 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:19,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:19,145 INFO L82 PathProgramCache]: Analyzing trace with hash 482986285, now seen corresponding path program 19 times [2020-09-04 16:31:19,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:19,145 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2129240432] [2020-09-04 16:31:19,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:19,148 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:19,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:19,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:19,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:19,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:19,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:19,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:19,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:19,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:19,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:19,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:19,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:19,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:19,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:19,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:19,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:19,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:19,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:19,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:19,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:19,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:19,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:19,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:19,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:19,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:19,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:19,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:19,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:20,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:20,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:20,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:20,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:20,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:20,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:20,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:20,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:20,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:20,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:20,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:20,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:20,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:20,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:20,420 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2020-09-04 16:31:20,421 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2129240432] [2020-09-04 16:31:20,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:20,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2020-09-04 16:31:20,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139707540] [2020-09-04 16:31:20,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-09-04 16:31:20,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:20,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-09-04 16:31:20,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=317, Unknown=0, NotChecked=0, Total=552 [2020-09-04 16:31:20,424 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 24 states. [2020-09-04 16:31:20,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:20,809 INFO L93 Difference]: Finished difference Result 126 states and 127 transitions. [2020-09-04 16:31:20,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-04 16:31:20,809 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 189 [2020-09-04 16:31:20,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:20,814 INFO L225 Difference]: With dead ends: 126 [2020-09-04 16:31:20,814 INFO L226 Difference]: Without dead ends: 120 [2020-09-04 16:31:20,816 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=695, Invalid=1197, Unknown=0, NotChecked=0, Total=1892 [2020-09-04 16:31:20,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-09-04 16:31:20,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2020-09-04 16:31:20,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-09-04 16:31:20,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2020-09-04 16:31:20,830 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 189 [2020-09-04 16:31:20,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:20,831 INFO L479 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2020-09-04 16:31:20,831 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-09-04 16:31:20,831 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2020-09-04 16:31:20,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2020-09-04 16:31:20,833 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:20,833 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:20,834 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-09-04 16:31:20,834 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:20,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:20,834 INFO L82 PathProgramCache]: Analyzing trace with hash 848589853, now seen corresponding path program 20 times [2020-09-04 16:31:20,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:20,835 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [780695112] [2020-09-04 16:31:20,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:20,836 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:20,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 16:31:20,874 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 16:31:20,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 16:31:20,912 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 16:31:20,954 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-04 16:31:20,954 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-04 16:31:20,955 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-09-04 16:31:20,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 04:31:20 BoogieIcfgContainer [2020-09-04 16:31:20,995 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 16:31:21,003 INFO L168 Benchmark]: Toolchain (without parser) took 17944.36 ms. Allocated memory was 142.1 MB in the beginning and 577.2 MB in the end (delta: 435.2 MB). Free memory was 99.4 MB in the beginning and 494.8 MB in the end (delta: -395.3 MB). Peak memory consumption was 39.8 MB. Max. memory is 7.1 GB. [2020-09-04 16:31:21,004 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 142.1 MB. Free memory was 117.6 MB in the beginning and 117.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-09-04 16:31:21,006 INFO L168 Benchmark]: CACSL2BoogieTranslator took 377.38 ms. Allocated memory is still 142.1 MB. Free memory was 99.2 MB in the beginning and 89.5 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-09-04 16:31:21,008 INFO L168 Benchmark]: Boogie Preprocessor took 29.23 ms. Allocated memory is still 142.1 MB. Free memory was 89.5 MB in the beginning and 88.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-09-04 16:31:21,009 INFO L168 Benchmark]: RCFGBuilder took 433.53 ms. Allocated memory was 142.1 MB in the beginning and 199.8 MB in the end (delta: 57.7 MB). Free memory was 88.2 MB in the beginning and 167.2 MB in the end (delta: -79.0 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-09-04 16:31:21,009 INFO L168 Benchmark]: TraceAbstraction took 17097.92 ms. Allocated memory was 199.8 MB in the beginning and 577.2 MB in the end (delta: 377.5 MB). Free memory was 166.5 MB in the beginning and 494.8 MB in the end (delta: -328.3 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. [2020-09-04 16:31:21,016 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 142.1 MB. Free memory was 117.6 MB in the beginning and 117.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 377.38 ms. Allocated memory is still 142.1 MB. Free memory was 99.2 MB in the beginning and 89.5 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.23 ms. Allocated memory is still 142.1 MB. Free memory was 89.5 MB in the beginning and 88.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 433.53 ms. Allocated memory was 142.1 MB in the beginning and 199.8 MB in the end (delta: 57.7 MB). Free memory was 88.2 MB in the beginning and 167.2 MB in the end (delta: -79.0 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17097.92 ms. Allocated memory was 199.8 MB in the beginning and 577.2 MB in the end (delta: 377.5 MB). Free memory was 166.5 MB in the beginning and 494.8 MB in the end (delta: -328.3 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 16]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int a = 20; [L13] int b = 0; [L14] CALL, EXPR sum(a, b) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND TRUE n <= 0 [L5] return m + n; [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L14] RET, EXPR sum(a, b) [L14] int result = sum(a, b); [L15] COND TRUE result == a + b [L16] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16.9s, OverallIterations: 21, TraceHistogramMax: 21, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 363 SDtfs, 1043 SDslu, 1851 SDs, 0 SdLazy, 831 SolverSat, 40 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 940 GetRequests, 480 SyntacticMatches, 0 SemanticMatches, 460 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2470 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred 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.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, 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 incorrect! Received shutdown request...