/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/id_o20.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 16:30:14,841 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 16:30:14,847 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 16:30:14,895 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 16:30:14,896 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 16:30:14,907 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 16:30:14,910 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 16:30:14,912 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 16:30:14,916 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 16:30:14,919 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 16:30:14,920 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 16:30:14,923 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 16:30:14,923 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 16:30:14,926 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 16:30:14,928 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 16:30:14,929 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 16:30:14,930 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 16:30:14,933 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 16:30:14,934 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 16:30:14,942 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 16:30:14,943 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 16:30:14,944 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 16:30:14,946 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 16:30:14,947 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 16:30:14,951 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 16:30:14,951 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 16:30:14,952 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 16:30:14,954 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 16:30:14,955 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 16:30:14,956 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 16:30:14,956 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 16:30:14,957 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 16:30:14,958 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 16:30:14,959 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 16:30:14,960 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 16:30:14,960 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 16:30:14,961 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 16:30:14,961 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 16:30:14,961 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 16:30:14,962 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 16:30:14,963 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 16:30:14,964 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:30:14,981 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 16:30:14,981 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 16:30:14,984 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 16:30:14,984 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 16:30:14,984 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 16:30:14,985 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 16:30:14,985 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 16:30:14,985 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 16:30:14,985 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 16:30:14,985 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 16:30:14,986 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 16:30:14,987 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 16:30:14,987 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 16:30:14,987 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 16:30:14,988 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 16:30:14,988 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 16:30:14,988 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 16:30:14,988 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 16:30:14,988 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 16:30:14,989 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 16:30:14,989 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 16:30:14,989 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 16:30:14,989 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-09-04 16:30:15,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 16:30:15,427 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 16:30:15,432 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 16:30:15,434 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 16:30:15,434 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 16:30:15,436 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_o20.c [2020-09-04 16:30:15,521 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b22bed83a/312af5cf12834be6b64387b9e111884d/FLAGa0c7b25fa [2020-09-04 16:30:16,089 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 16:30:16,090 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/id_o20.c [2020-09-04 16:30:16,099 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b22bed83a/312af5cf12834be6b64387b9e111884d/FLAGa0c7b25fa [2020-09-04 16:30:16,425 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b22bed83a/312af5cf12834be6b64387b9e111884d [2020-09-04 16:30:16,441 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 16:30:16,446 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 16:30:16,447 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 16:30:16,448 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 16:30:16,452 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 16:30:16,454 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:30:16" (1/1) ... [2020-09-04 16:30:16,458 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a067aa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:30:16, skipping insertion in model container [2020-09-04 16:30:16,459 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:30:16" (1/1) ... [2020-09-04 16:30:16,469 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 16:30:16,490 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 16:30:16,691 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:30:16,697 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 16:30:16,717 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:30:16,735 INFO L208 MainTranslator]: Completed translation [2020-09-04 16:30:16,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:30:16 WrapperNode [2020-09-04 16:30:16,736 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 16:30:16,737 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 16:30:16,737 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 16:30:16,738 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 16:30:16,754 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:30:16" (1/1) ... [2020-09-04 16:30:16,754 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:30:16" (1/1) ... [2020-09-04 16:30:16,760 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:30:16" (1/1) ... [2020-09-04 16:30:16,760 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:30:16" (1/1) ... [2020-09-04 16:30:16,764 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:30:16" (1/1) ... [2020-09-04 16:30:16,767 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:30:16" (1/1) ... [2020-09-04 16:30:16,768 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:30:16" (1/1) ... [2020-09-04 16:30:16,769 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 16:30:16,770 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 16:30:16,770 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 16:30:16,770 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 16:30:16,771 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:30:16" (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:30:16,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 16:30:16,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 16:30:16,935 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-09-04 16:30:16,936 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 16:30:16,936 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-09-04 16:30:16,936 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 16:30:16,936 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-09-04 16:30:16,936 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 16:30:16,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 16:30:16,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 16:30:17,123 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 16:30:17,124 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 16:30:17,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:30:17 BoogieIcfgContainer [2020-09-04 16:30:17,128 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 16:30:17,129 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 16:30:17,130 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 16:30:17,133 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 16:30:17,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 04:30:16" (1/3) ... [2020-09-04 16:30:17,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d69818c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:30:17, skipping insertion in model container [2020-09-04 16:30:17,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:30:16" (2/3) ... [2020-09-04 16:30:17,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d69818c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:30:17, skipping insertion in model container [2020-09-04 16:30:17,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:30:17" (3/3) ... [2020-09-04 16:30:17,138 INFO L109 eAbstractionObserver]: Analyzing ICFG id_o20.c [2020-09-04 16:30:17,150 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 16:30:17,159 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 16:30:17,181 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 16:30:17,207 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 16:30:17,207 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 16:30:17,208 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-09-04 16:30:17,208 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 16:30:17,208 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 16:30:17,208 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 16:30:17,208 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 16:30:17,209 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 16:30:17,227 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-09-04 16:30:17,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-09-04 16:30:17,240 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:30:17,241 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:30:17,242 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:30:17,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:30:17,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1651991454, now seen corresponding path program 1 times [2020-09-04 16:30:17,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:30:17,261 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1617379016] [2020-09-04 16:30:17,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:30:17,330 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:30:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:17,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:30:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:17,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:30:17,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:17,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 16:30:17,686 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1617379016] [2020-09-04 16:30:17,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:30:17,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 16:30:17,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408237136] [2020-09-04 16:30:17,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 16:30:17,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:30:17,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 16:30:17,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 16:30:17,718 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2020-09-04 16:30:17,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:30:17,804 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2020-09-04 16:30:17,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 16:30:17,807 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-09-04 16:30:17,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:30:17,821 INFO L225 Difference]: With dead ends: 37 [2020-09-04 16:30:17,822 INFO L226 Difference]: Without dead ends: 22 [2020-09-04 16:30:17,826 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-04 16:30:17,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-09-04 16:30:17,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-09-04 16:30:17,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-09-04 16:30:17,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2020-09-04 16:30:17,884 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 16 [2020-09-04 16:30:17,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:30:17,885 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2020-09-04 16:30:17,885 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 16:30:17,885 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-09-04 16:30:17,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-04 16:30:17,888 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:30:17,888 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:30:17,889 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 16:30:17,889 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:30:17,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:30:17,890 INFO L82 PathProgramCache]: Analyzing trace with hash 189324707, now seen corresponding path program 1 times [2020-09-04 16:30:17,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:30:17,891 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1505982195] [2020-09-04 16:30:17,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:30:17,894 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:30:17,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:18,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:30:18,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:18,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:30:18,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:18,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:18,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:18,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-04 16:30:18,130 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1505982195] [2020-09-04 16:30:18,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:30:18,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 16:30:18,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934104500] [2020-09-04 16:30:18,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 16:30:18,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:30:18,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 16:30:18,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-09-04 16:30:18,133 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 7 states. [2020-09-04 16:30:18,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:30:18,208 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2020-09-04 16:30:18,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 16:30:18,209 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-09-04 16:30:18,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:30:18,211 INFO L225 Difference]: With dead ends: 31 [2020-09-04 16:30:18,211 INFO L226 Difference]: Without dead ends: 26 [2020-09-04 16:30:18,213 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-09-04 16:30:18,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-09-04 16:30:18,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-09-04 16:30:18,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-09-04 16:30:18,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2020-09-04 16:30:18,223 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 23 [2020-09-04 16:30:18,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:30:18,223 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2020-09-04 16:30:18,224 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 16:30:18,224 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2020-09-04 16:30:18,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-09-04 16:30:18,225 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:30:18,225 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:30:18,226 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 16:30:18,226 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:30:18,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:30:18,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1416732684, now seen corresponding path program 2 times [2020-09-04 16:30:18,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:30:18,227 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [324691713] [2020-09-04 16:30:18,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:30:18,229 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:30:18,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:18,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:30:18,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:18,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:30:18,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:18,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:18,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:18,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:18,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:18,498 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-09-04 16:30:18,500 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [324691713] [2020-09-04 16:30:18,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:30:18,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 16:30:18,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309923332] [2020-09-04 16:30:18,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 16:30:18,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:30:18,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 16:30:18,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-09-04 16:30:18,507 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 9 states. [2020-09-04 16:30:18,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:30:18,648 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2020-09-04 16:30:18,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 16:30:18,649 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2020-09-04 16:30:18,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:30:18,650 INFO L225 Difference]: With dead ends: 35 [2020-09-04 16:30:18,650 INFO L226 Difference]: Without dead ends: 30 [2020-09-04 16:30:18,651 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-09-04 16:30:18,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-09-04 16:30:18,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-09-04 16:30:18,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-09-04 16:30:18,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2020-09-04 16:30:18,661 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 30 [2020-09-04 16:30:18,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:30:18,662 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2020-09-04 16:30:18,662 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 16:30:18,662 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-09-04 16:30:18,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-09-04 16:30:18,664 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:30:18,664 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:30:18,664 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 16:30:18,665 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:30:18,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:30:18,665 INFO L82 PathProgramCache]: Analyzing trace with hash -209476043, now seen corresponding path program 3 times [2020-09-04 16:30:18,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:30:18,666 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [677618757] [2020-09-04 16:30:18,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:30:18,668 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:30:18,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:18,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:30:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:18,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:30:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:18,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:18,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:18,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:18,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:18,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:18,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:18,983 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-09-04 16:30:18,983 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [677618757] [2020-09-04 16:30:18,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:30:18,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 16:30:18,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245180559] [2020-09-04 16:30:18,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 16:30:18,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:30:18,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 16:30:18,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2020-09-04 16:30:18,986 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 11 states. [2020-09-04 16:30:19,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:30:19,127 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2020-09-04 16:30:19,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 16:30:19,128 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2020-09-04 16:30:19,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:30:19,130 INFO L225 Difference]: With dead ends: 39 [2020-09-04 16:30:19,130 INFO L226 Difference]: Without dead ends: 34 [2020-09-04 16:30:19,131 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2020-09-04 16:30:19,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-09-04 16:30:19,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-09-04 16:30:19,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-09-04 16:30:19,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2020-09-04 16:30:19,140 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 37 [2020-09-04 16:30:19,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:30:19,141 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2020-09-04 16:30:19,141 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 16:30:19,141 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2020-09-04 16:30:19,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-09-04 16:30:19,143 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:30:19,143 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:30:19,143 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 16:30:19,144 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:30:19,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:30:19,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1007399302, now seen corresponding path program 4 times [2020-09-04 16:30:19,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:30:19,145 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1985236977] [2020-09-04 16:30:19,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:30:19,147 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:30:19,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:19,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:30:19,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:19,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:30:19,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:19,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:19,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:19,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:19,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:19,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:19,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:19,505 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-09-04 16:30:19,506 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1985236977] [2020-09-04 16:30:19,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:30:19,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-09-04 16:30:19,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012690024] [2020-09-04 16:30:19,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 16:30:19,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:30:19,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 16:30:19,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2020-09-04 16:30:19,508 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 13 states. [2020-09-04 16:30:19,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:30:19,707 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2020-09-04 16:30:19,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 16:30:19,709 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2020-09-04 16:30:19,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:30:19,710 INFO L225 Difference]: With dead ends: 43 [2020-09-04 16:30:19,710 INFO L226 Difference]: Without dead ends: 38 [2020-09-04 16:30:19,711 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2020-09-04 16:30:19,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-09-04 16:30:19,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-09-04 16:30:19,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-09-04 16:30:19,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2020-09-04 16:30:19,729 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 44 [2020-09-04 16:30:19,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:30:19,730 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2020-09-04 16:30:19,730 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 16:30:19,730 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2020-09-04 16:30:19,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-09-04 16:30:19,734 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:30:19,734 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:30:19,734 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 16:30:19,734 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:30:19,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:30:19,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1787659065, now seen corresponding path program 5 times [2020-09-04 16:30:19,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:30:19,736 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1088885867] [2020-09-04 16:30:19,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:30:19,741 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:30:19,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:19,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:30:19,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:19,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:30:19,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:19,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:19,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:19,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:19,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:20,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:20,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:20,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:20,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:20,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:20,186 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-09-04 16:30:20,187 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1088885867] [2020-09-04 16:30:20,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:30:20,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-09-04 16:30:20,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200735197] [2020-09-04 16:30:20,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 16:30:20,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:30:20,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 16:30:20,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-09-04 16:30:20,192 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 15 states. [2020-09-04 16:30:20,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:30:20,458 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2020-09-04 16:30:20,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-04 16:30:20,459 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 51 [2020-09-04 16:30:20,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:30:20,461 INFO L225 Difference]: With dead ends: 47 [2020-09-04 16:30:20,461 INFO L226 Difference]: Without dead ends: 42 [2020-09-04 16:30:20,462 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2020-09-04 16:30:20,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-09-04 16:30:20,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-09-04 16:30:20,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-09-04 16:30:20,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2020-09-04 16:30:20,473 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 51 [2020-09-04 16:30:20,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:30:20,474 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-09-04 16:30:20,474 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 16:30:20,474 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-09-04 16:30:20,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-09-04 16:30:20,475 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:30:20,476 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:30:20,476 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 16:30:20,476 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:30:20,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:30:20,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1360883432, now seen corresponding path program 6 times [2020-09-04 16:30:20,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:30:20,478 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1676048911] [2020-09-04 16:30:20,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:30:20,480 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:30:20,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:20,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:30:20,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:20,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:30:20,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:20,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:20,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:20,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:20,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:20,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:20,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:20,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:20,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:20,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:20,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:20,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:20,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:20,944 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-09-04 16:30:20,945 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1676048911] [2020-09-04 16:30:20,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:30:20,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-09-04 16:30:20,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567552473] [2020-09-04 16:30:20,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-04 16:30:20,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:30:20,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-04 16:30:20,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2020-09-04 16:30:20,947 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 17 states. [2020-09-04 16:30:21,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:30:21,247 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2020-09-04 16:30:21,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-04 16:30:21,248 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 58 [2020-09-04 16:30:21,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:30:21,250 INFO L225 Difference]: With dead ends: 51 [2020-09-04 16:30:21,251 INFO L226 Difference]: Without dead ends: 46 [2020-09-04 16:30:21,252 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2020-09-04 16:30:21,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-09-04 16:30:21,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2020-09-04 16:30:21,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-09-04 16:30:21,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2020-09-04 16:30:21,273 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 58 [2020-09-04 16:30:21,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:30:21,276 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2020-09-04 16:30:21,276 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-04 16:30:21,276 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2020-09-04 16:30:21,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-09-04 16:30:21,281 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:30:21,281 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:30:21,281 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 16:30:21,281 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:30:21,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:30:21,284 INFO L82 PathProgramCache]: Analyzing trace with hash -807968423, now seen corresponding path program 7 times [2020-09-04 16:30:21,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:30:21,285 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2139818764] [2020-09-04 16:30:21,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:30:21,289 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:30:21,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:21,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:30:21,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:21,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:30:21,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:21,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:21,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:21,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:21,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:21,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:21,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:21,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:21,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:21,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:21,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:21,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:21,950 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-09-04 16:30:21,952 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2139818764] [2020-09-04 16:30:21,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:30:21,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-09-04 16:30:21,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765846551] [2020-09-04 16:30:21,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-09-04 16:30:21,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:30:21,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-09-04 16:30:21,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2020-09-04 16:30:21,954 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 19 states. [2020-09-04 16:30:22,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:30:22,310 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2020-09-04 16:30:22,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-09-04 16:30:22,310 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 65 [2020-09-04 16:30:22,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:30:22,312 INFO L225 Difference]: With dead ends: 55 [2020-09-04 16:30:22,312 INFO L226 Difference]: Without dead ends: 50 [2020-09-04 16:30:22,314 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2020-09-04 16:30:22,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-09-04 16:30:22,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-09-04 16:30:22,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-09-04 16:30:22,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2020-09-04 16:30:22,328 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 65 [2020-09-04 16:30:22,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:30:22,328 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2020-09-04 16:30:22,328 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-09-04 16:30:22,328 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2020-09-04 16:30:22,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-09-04 16:30:22,332 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:30:22,332 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:30:22,332 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 16:30:22,333 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:30:22,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:30:22,333 INFO L82 PathProgramCache]: Analyzing trace with hash -705364310, now seen corresponding path program 8 times [2020-09-04 16:30:22,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:30:22,334 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [533637778] [2020-09-04 16:30:22,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:30:22,337 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:30:22,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:22,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:30:22,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:22,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:30:22,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:22,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:22,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:22,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:22,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:22,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:22,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:22,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:22,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:22,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:22,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:22,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:22,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:22,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:22,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:22,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:23,028 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-09-04 16:30:23,030 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [533637778] [2020-09-04 16:30:23,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:30:23,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2020-09-04 16:30:23,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944126925] [2020-09-04 16:30:23,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-09-04 16:30:23,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:30:23,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-09-04 16:30:23,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2020-09-04 16:30:23,040 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 21 states. [2020-09-04 16:30:23,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:30:23,523 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-09-04 16:30:23,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-09-04 16:30:23,524 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 72 [2020-09-04 16:30:23,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:30:23,526 INFO L225 Difference]: With dead ends: 59 [2020-09-04 16:30:23,526 INFO L226 Difference]: Without dead ends: 54 [2020-09-04 16:30:23,530 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=795, Unknown=0, NotChecked=0, Total=870 [2020-09-04 16:30:23,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-09-04 16:30:23,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-09-04 16:30:23,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-09-04 16:30:23,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2020-09-04 16:30:23,554 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 72 [2020-09-04 16:30:23,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:30:23,555 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2020-09-04 16:30:23,555 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-09-04 16:30:23,555 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2020-09-04 16:30:23,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-09-04 16:30:23,557 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:30:23,558 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:30:23,558 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 16:30:23,558 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:30:23,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:30:23,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1418439701, now seen corresponding path program 9 times [2020-09-04 16:30:23,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:30:23,560 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1357998352] [2020-09-04 16:30:23,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:30:23,564 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:30:23,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:23,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:30:23,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:23,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:30:23,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:23,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:23,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:23,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:23,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:23,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:23,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:23,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:23,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:24,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:24,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:24,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:24,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:24,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:24,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:24,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:24,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:24,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:24,454 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-09-04 16:30:24,456 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1357998352] [2020-09-04 16:30:24,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:30:24,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2020-09-04 16:30:24,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783469182] [2020-09-04 16:30:24,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-09-04 16:30:24,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:30:24,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-09-04 16:30:24,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2020-09-04 16:30:24,462 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 23 states. [2020-09-04 16:30:24,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:30:24,974 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2020-09-04 16:30:24,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-09-04 16:30:24,975 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 79 [2020-09-04 16:30:24,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:30:24,976 INFO L225 Difference]: With dead ends: 63 [2020-09-04 16:30:24,976 INFO L226 Difference]: Without dead ends: 58 [2020-09-04 16:30:24,978 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=83, Invalid=973, Unknown=0, NotChecked=0, Total=1056 [2020-09-04 16:30:24,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-09-04 16:30:24,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2020-09-04 16:30:24,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-09-04 16:30:24,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2020-09-04 16:30:24,996 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 79 [2020-09-04 16:30:24,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:30:24,997 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2020-09-04 16:30:24,997 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-09-04 16:30:24,997 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2020-09-04 16:30:25,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-09-04 16:30:25,002 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:30:25,002 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:30:25,002 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 16:30:25,002 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:30:25,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:30:25,003 INFO L82 PathProgramCache]: Analyzing trace with hash -182126020, now seen corresponding path program 10 times [2020-09-04 16:30:25,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:30:25,003 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [741212918] [2020-09-04 16:30:25,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:30:25,007 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:30:25,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:25,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:30:25,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:25,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:30:25,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:25,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:25,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:25,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:25,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:25,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:25,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:25,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:25,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:25,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:25,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:25,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:25,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:25,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:25,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:25,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:25,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:25,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:25,852 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2020-09-04 16:30:25,852 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [741212918] [2020-09-04 16:30:25,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:30:25,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2020-09-04 16:30:25,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483375693] [2020-09-04 16:30:25,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-09-04 16:30:25,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:30:25,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-09-04 16:30:25,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2020-09-04 16:30:25,856 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 25 states. [2020-09-04 16:30:26,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:30:26,487 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2020-09-04 16:30:26,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-09-04 16:30:26,488 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 86 [2020-09-04 16:30:26,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:30:26,489 INFO L225 Difference]: With dead ends: 67 [2020-09-04 16:30:26,489 INFO L226 Difference]: Without dead ends: 62 [2020-09-04 16:30:26,495 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=91, Invalid=1169, Unknown=0, NotChecked=0, Total=1260 [2020-09-04 16:30:26,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-09-04 16:30:26,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-09-04 16:30:26,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-09-04 16:30:26,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2020-09-04 16:30:26,509 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 86 [2020-09-04 16:30:26,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:30:26,509 INFO L479 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2020-09-04 16:30:26,509 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-09-04 16:30:26,510 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2020-09-04 16:30:26,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-09-04 16:30:26,511 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:30:26,511 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:30:26,511 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 16:30:26,511 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:30:26,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:30:26,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1527469181, now seen corresponding path program 11 times [2020-09-04 16:30:26,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:30:26,514 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1529358428] [2020-09-04 16:30:26,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:30:26,518 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:30:26,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:26,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:30:26,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:26,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:30:26,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:26,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:26,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:26,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:26,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:26,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:26,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:26,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:26,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:26,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:27,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:27,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:27,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:27,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:27,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:27,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:27,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:27,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:27,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:27,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:27,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:27,507 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2020-09-04 16:30:27,508 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1529358428] [2020-09-04 16:30:27,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:30:27,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2020-09-04 16:30:27,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506663935] [2020-09-04 16:30:27,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-09-04 16:30:27,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:30:27,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-09-04 16:30:27,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2020-09-04 16:30:27,510 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 27 states. [2020-09-04 16:30:28,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:30:28,320 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2020-09-04 16:30:28,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2020-09-04 16:30:28,320 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2020-09-04 16:30:28,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:30:28,322 INFO L225 Difference]: With dead ends: 71 [2020-09-04 16:30:28,322 INFO L226 Difference]: Without dead ends: 66 [2020-09-04 16:30:28,324 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=99, Invalid=1383, Unknown=0, NotChecked=0, Total=1482 [2020-09-04 16:30:28,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-09-04 16:30:28,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2020-09-04 16:30:28,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-09-04 16:30:28,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2020-09-04 16:30:28,341 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 93 [2020-09-04 16:30:28,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:30:28,342 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2020-09-04 16:30:28,342 INFO L480 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-09-04 16:30:28,342 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2020-09-04 16:30:28,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-09-04 16:30:28,344 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:30:28,344 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:30:28,344 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 16:30:28,344 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:30:28,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:30:28,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1034648626, now seen corresponding path program 12 times [2020-09-04 16:30:28,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:30:28,345 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [49735185] [2020-09-04 16:30:28,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:30:28,347 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:30:28,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:28,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:30:28,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:28,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:30:28,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:28,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:28,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:28,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:28,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:28,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:28,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:28,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:28,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:28,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:28,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:28,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:29,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:29,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:29,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:29,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:29,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:29,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:29,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:29,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:29,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:29,579 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2020-09-04 16:30:29,580 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [49735185] [2020-09-04 16:30:29,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:30:29,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2020-09-04 16:30:29,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100187639] [2020-09-04 16:30:29,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-09-04 16:30:29,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:30:29,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-09-04 16:30:29,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2020-09-04 16:30:29,584 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 29 states. [2020-09-04 16:30:30,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:30:30,544 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2020-09-04 16:30:30,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2020-09-04 16:30:30,545 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 100 [2020-09-04 16:30:30,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:30:30,546 INFO L225 Difference]: With dead ends: 75 [2020-09-04 16:30:30,546 INFO L226 Difference]: Without dead ends: 70 [2020-09-04 16:30:30,548 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=107, Invalid=1615, Unknown=0, NotChecked=0, Total=1722 [2020-09-04 16:30:30,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-09-04 16:30:30,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-09-04 16:30:30,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-09-04 16:30:30,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2020-09-04 16:30:30,565 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 100 [2020-09-04 16:30:30,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:30:30,565 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2020-09-04 16:30:30,565 INFO L480 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-09-04 16:30:30,565 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2020-09-04 16:30:30,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-09-04 16:30:30,567 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:30:30,567 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:30:30,567 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 16:30:30,568 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:30:30,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:30:30,568 INFO L82 PathProgramCache]: Analyzing trace with hash 996041487, now seen corresponding path program 13 times [2020-09-04 16:30:30,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:30:30,574 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1708294802] [2020-09-04 16:30:30,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:30:30,577 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:30:30,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:30,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:30:30,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:30,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:30:30,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:30,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:30,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:30,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:30,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:30,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:30,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:30,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:31,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:31,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:31,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:31,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:31,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:31,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:31,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:31,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:31,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:31,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:31,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:31,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:31,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:31,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:31,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:31,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:31,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:31,880 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2020-09-04 16:30:31,881 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1708294802] [2020-09-04 16:30:31,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:30:31,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2020-09-04 16:30:31,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254513481] [2020-09-04 16:30:31,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2020-09-04 16:30:31,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:30:31,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2020-09-04 16:30:31,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2020-09-04 16:30:31,885 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 31 states. [2020-09-04 16:30:33,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:30:33,046 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2020-09-04 16:30:33,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2020-09-04 16:30:33,047 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 107 [2020-09-04 16:30:33,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:30:33,049 INFO L225 Difference]: With dead ends: 79 [2020-09-04 16:30:33,049 INFO L226 Difference]: Without dead ends: 74 [2020-09-04 16:30:33,051 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=115, Invalid=1865, Unknown=0, NotChecked=0, Total=1980 [2020-09-04 16:30:33,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-09-04 16:30:33,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-09-04 16:30:33,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-09-04 16:30:33,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2020-09-04 16:30:33,080 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 107 [2020-09-04 16:30:33,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:30:33,081 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2020-09-04 16:30:33,081 INFO L480 AbstractCegarLoop]: Interpolant automaton has 31 states. [2020-09-04 16:30:33,081 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2020-09-04 16:30:33,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-09-04 16:30:33,082 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:30:33,083 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:30:33,083 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 16:30:33,083 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:30:33,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:30:33,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1701157728, now seen corresponding path program 14 times [2020-09-04 16:30:33,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:30:33,084 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2102157690] [2020-09-04 16:30:33,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:30:33,086 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:30:33,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:33,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:30:33,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:33,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:30:33,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:33,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:33,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:33,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:33,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:33,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:33,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:33,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:33,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:33,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:33,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:33,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:33,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:33,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:33,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:33,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:33,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:33,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:34,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:34,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:34,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:34,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:34,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:34,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:34,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:34,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:34,653 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2020-09-04 16:30:34,654 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2102157690] [2020-09-04 16:30:34,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:30:34,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2020-09-04 16:30:34,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426928677] [2020-09-04 16:30:34,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2020-09-04 16:30:34,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:30:34,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2020-09-04 16:30:34,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2020-09-04 16:30:34,659 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 33 states. [2020-09-04 16:30:35,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:30:35,797 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2020-09-04 16:30:35,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2020-09-04 16:30:35,798 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 114 [2020-09-04 16:30:35,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:30:35,799 INFO L225 Difference]: With dead ends: 83 [2020-09-04 16:30:35,799 INFO L226 Difference]: Without dead ends: 78 [2020-09-04 16:30:35,803 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=123, Invalid=2133, Unknown=0, NotChecked=0, Total=2256 [2020-09-04 16:30:35,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-09-04 16:30:35,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2020-09-04 16:30:35,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-09-04 16:30:35,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2020-09-04 16:30:35,814 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 114 [2020-09-04 16:30:35,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:30:35,815 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2020-09-04 16:30:35,816 INFO L480 AbstractCegarLoop]: Interpolant automaton has 33 states. [2020-09-04 16:30:35,816 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2020-09-04 16:30:35,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-09-04 16:30:35,817 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:30:35,817 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:30:35,818 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-04 16:30:35,818 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:30:35,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:30:35,818 INFO L82 PathProgramCache]: Analyzing trace with hash -751861855, now seen corresponding path program 15 times [2020-09-04 16:30:35,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:30:35,819 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [42011976] [2020-09-04 16:30:35,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:30:35,823 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:30:35,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:35,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:30:35,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:35,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:30:35,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:35,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:35,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:36,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:36,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:36,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:36,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:36,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:36,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:36,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:36,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:36,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:36,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:36,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:36,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:36,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:36,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:36,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:36,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:36,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:36,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:36,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:37,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:37,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:37,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:37,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:37,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:37,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:37,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:37,680 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2020-09-04 16:30:37,681 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [42011976] [2020-09-04 16:30:37,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:30:37,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2020-09-04 16:30:37,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999673666] [2020-09-04 16:30:37,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2020-09-04 16:30:37,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:30:37,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2020-09-04 16:30:37,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2020-09-04 16:30:37,683 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 35 states. [2020-09-04 16:30:38,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:30:38,984 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2020-09-04 16:30:38,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2020-09-04 16:30:38,985 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 121 [2020-09-04 16:30:38,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:30:38,987 INFO L225 Difference]: With dead ends: 87 [2020-09-04 16:30:38,987 INFO L226 Difference]: Without dead ends: 82 [2020-09-04 16:30:38,990 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=131, Invalid=2419, Unknown=0, NotChecked=0, Total=2550 [2020-09-04 16:30:38,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-09-04 16:30:38,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2020-09-04 16:30:38,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-09-04 16:30:38,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2020-09-04 16:30:38,999 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 121 [2020-09-04 16:30:39,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:30:39,002 INFO L479 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2020-09-04 16:30:39,003 INFO L480 AbstractCegarLoop]: Interpolant automaton has 35 states. [2020-09-04 16:30:39,003 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2020-09-04 16:30:39,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-09-04 16:30:39,005 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:30:39,005 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:30:39,006 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-04 16:30:39,006 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:30:39,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:30:39,006 INFO L82 PathProgramCache]: Analyzing trace with hash 2017083634, now seen corresponding path program 16 times [2020-09-04 16:30:39,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:30:39,007 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2003856716] [2020-09-04 16:30:39,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:30:39,008 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:30:39,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:39,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:30:39,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:39,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:30:39,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:39,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:39,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:39,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:39,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:39,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:39,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:39,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:39,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:39,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:39,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:39,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:39,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:39,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:39,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:39,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:39,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:39,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:39,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:39,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:39,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:40,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:40,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:40,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:40,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:40,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:40,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:40,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:40,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:40,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:40,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:40,600 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2020-09-04 16:30:40,601 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2003856716] [2020-09-04 16:30:40,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:30:40,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2020-09-04 16:30:40,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296991104] [2020-09-04 16:30:40,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2020-09-04 16:30:40,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:30:40,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2020-09-04 16:30:40,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2020-09-04 16:30:40,603 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 37 states. [2020-09-04 16:30:42,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:30:42,136 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2020-09-04 16:30:42,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2020-09-04 16:30:42,137 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 128 [2020-09-04 16:30:42,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:30:42,139 INFO L225 Difference]: With dead ends: 91 [2020-09-04 16:30:42,139 INFO L226 Difference]: Without dead ends: 86 [2020-09-04 16:30:42,141 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=139, Invalid=2723, Unknown=0, NotChecked=0, Total=2862 [2020-09-04 16:30:42,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-09-04 16:30:42,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2020-09-04 16:30:42,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-09-04 16:30:42,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2020-09-04 16:30:42,148 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 128 [2020-09-04 16:30:42,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:30:42,149 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2020-09-04 16:30:42,149 INFO L480 AbstractCegarLoop]: Interpolant automaton has 37 states. [2020-09-04 16:30:42,149 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2020-09-04 16:30:42,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-09-04 16:30:42,150 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:30:42,150 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:30:42,151 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-04 16:30:42,151 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:30:42,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:30:42,151 INFO L82 PathProgramCache]: Analyzing trace with hash -750736845, now seen corresponding path program 17 times [2020-09-04 16:30:42,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:30:42,152 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1525077011] [2020-09-04 16:30:42,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:30:42,153 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:30:42,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:42,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:30:42,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:42,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:30:42,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:42,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:42,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:42,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:42,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:42,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:42,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:42,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:42,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:42,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:42,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:42,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:42,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:42,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:42,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:42,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:42,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:43,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:43,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:43,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:43,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:43,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:43,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:43,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:43,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:43,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:43,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:43,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:43,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:43,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:43,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:43,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:43,998 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2020-09-04 16:30:43,999 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1525077011] [2020-09-04 16:30:43,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:30:43,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2020-09-04 16:30:44,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909584383] [2020-09-04 16:30:44,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2020-09-04 16:30:44,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:30:44,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2020-09-04 16:30:44,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2020-09-04 16:30:44,001 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand 39 states. [2020-09-04 16:30:45,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:30:45,721 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2020-09-04 16:30:45,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2020-09-04 16:30:45,722 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 135 [2020-09-04 16:30:45,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:30:45,724 INFO L225 Difference]: With dead ends: 95 [2020-09-04 16:30:45,724 INFO L226 Difference]: Without dead ends: 90 [2020-09-04 16:30:45,726 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=147, Invalid=3045, Unknown=0, NotChecked=0, Total=3192 [2020-09-04 16:30:45,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-09-04 16:30:45,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2020-09-04 16:30:45,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-09-04 16:30:45,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2020-09-04 16:30:45,735 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 135 [2020-09-04 16:30:45,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:30:45,736 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2020-09-04 16:30:45,736 INFO L480 AbstractCegarLoop]: Interpolant automaton has 39 states. [2020-09-04 16:30:45,736 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2020-09-04 16:30:45,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-09-04 16:30:45,738 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:30:45,738 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:30:45,738 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-09-04 16:30:45,738 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:30:45,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:30:45,739 INFO L82 PathProgramCache]: Analyzing trace with hash 112489604, now seen corresponding path program 18 times [2020-09-04 16:30:45,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:30:45,739 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [724903880] [2020-09-04 16:30:45,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:30:45,741 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:30:45,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:45,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:30:45,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:45,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:30:45,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:45,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:45,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:45,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:45,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:46,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:46,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:46,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:46,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:46,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:46,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:46,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:46,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:46,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:46,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:46,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:46,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:46,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:46,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:46,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:46,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:46,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:46,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:46,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:46,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:46,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:46,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:47,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:47,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:47,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:47,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:47,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:47,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:47,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:47,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:47,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:47,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:47,745 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2020-09-04 16:30:47,746 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [724903880] [2020-09-04 16:30:47,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:30:47,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2020-09-04 16:30:47,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548747352] [2020-09-04 16:30:47,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2020-09-04 16:30:47,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:30:47,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2020-09-04 16:30:47,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2020-09-04 16:30:47,748 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 41 states. [2020-09-04 16:30:49,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:30:49,661 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2020-09-04 16:30:49,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2020-09-04 16:30:49,663 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 142 [2020-09-04 16:30:49,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:30:49,665 INFO L225 Difference]: With dead ends: 99 [2020-09-04 16:30:49,665 INFO L226 Difference]: Without dead ends: 94 [2020-09-04 16:30:49,666 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=155, Invalid=3385, Unknown=0, NotChecked=0, Total=3540 [2020-09-04 16:30:49,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-09-04 16:30:49,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2020-09-04 16:30:49,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-09-04 16:30:49,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2020-09-04 16:30:49,674 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 142 [2020-09-04 16:30:49,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:30:49,674 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2020-09-04 16:30:49,674 INFO L480 AbstractCegarLoop]: Interpolant automaton has 41 states. [2020-09-04 16:30:49,674 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2020-09-04 16:30:49,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-09-04 16:30:49,676 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:30:49,676 INFO L422 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:30:49,677 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-09-04 16:30:49,677 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:30:49,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:30:49,677 INFO L82 PathProgramCache]: Analyzing trace with hash 374596293, now seen corresponding path program 19 times [2020-09-04 16:30:49,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:30:49,678 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [908267693] [2020-09-04 16:30:49,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:30:49,679 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:30:49,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:49,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:30:49,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:49,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:30:49,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:49,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:49,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:49,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:49,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:49,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:50,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:50,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:50,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:50,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:50,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:50,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:50,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:50,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:50,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:50,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:50,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:50,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:50,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:50,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:50,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:50,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:50,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:50,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:51,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:51,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:51,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:51,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:51,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:51,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:51,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:51,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:51,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:51,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:51,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:30:51,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:51,890 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2020-09-04 16:30:51,891 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [908267693] [2020-09-04 16:30:51,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:30:51,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2020-09-04 16:30:51,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333573752] [2020-09-04 16:30:51,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2020-09-04 16:30:51,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:30:51,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2020-09-04 16:30:51,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2020-09-04 16:30:51,893 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 43 states. [2020-09-04 16:30:53,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:30:53,976 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2020-09-04 16:30:53,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2020-09-04 16:30:53,977 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 149 [2020-09-04 16:30:53,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:30:53,978 INFO L225 Difference]: With dead ends: 103 [2020-09-04 16:30:53,978 INFO L226 Difference]: Without dead ends: 98 [2020-09-04 16:30:53,980 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=163, Invalid=3743, Unknown=0, NotChecked=0, Total=3906 [2020-09-04 16:30:53,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-09-04 16:30:53,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2020-09-04 16:30:53,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-09-04 16:30:53,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2020-09-04 16:30:53,987 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 99 transitions. Word has length 149 [2020-09-04 16:30:53,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:30:53,988 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 99 transitions. [2020-09-04 16:30:53,988 INFO L480 AbstractCegarLoop]: Interpolant automaton has 43 states. [2020-09-04 16:30:53,988 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2020-09-04 16:30:53,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2020-09-04 16:30:53,989 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:30:53,989 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:30:53,990 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-09-04 16:30:53,990 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:30:53,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:30:53,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1900661226, now seen corresponding path program 20 times [2020-09-04 16:30:53,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:30:53,990 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [436902872] [2020-09-04 16:30:53,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:30:53,992 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:30:54,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 16:30:54,089 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 16:30:54,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 16:30:54,187 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 16:30:54,221 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-04 16:30:54,221 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-04 16:30:54,222 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-09-04 16:30:54,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 04:30:54 BoogieIcfgContainer [2020-09-04 16:30:54,253 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 16:30:54,256 INFO L168 Benchmark]: Toolchain (without parser) took 37810.00 ms. Allocated memory was 138.9 MB in the beginning and 526.4 MB in the end (delta: 387.4 MB). Free memory was 101.8 MB in the beginning and 85.6 MB in the end (delta: 16.2 MB). Peak memory consumption was 403.7 MB. Max. memory is 7.1 GB. [2020-09-04 16:30:54,257 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 138.9 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.7 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 16:30:54,257 INFO L168 Benchmark]: CACSL2BoogieTranslator took 289.32 ms. Allocated memory is still 138.9 MB. Free memory was 101.6 MB in the beginning and 92.3 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-09-04 16:30:54,258 INFO L168 Benchmark]: Boogie Preprocessor took 32.20 ms. Allocated memory is still 138.9 MB. Free memory was 92.3 MB in the beginning and 91.0 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:30:54,259 INFO L168 Benchmark]: RCFGBuilder took 358.29 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 91.0 MB in the beginning and 171.4 MB in the end (delta: -80.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2020-09-04 16:30:54,259 INFO L168 Benchmark]: TraceAbstraction took 37123.46 ms. Allocated memory was 203.4 MB in the beginning and 526.4 MB in the end (delta: 323.0 MB). Free memory was 171.4 MB in the beginning and 85.6 MB in the end (delta: 85.8 MB). Peak memory consumption was 408.8 MB. Max. memory is 7.1 GB. [2020-09-04 16:30:54,262 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.30 ms. Allocated memory is still 138.9 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.7 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 289.32 ms. Allocated memory is still 138.9 MB. Free memory was 101.6 MB in the beginning and 92.3 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.20 ms. Allocated memory is still 138.9 MB. Free memory was 92.3 MB in the beginning and 91.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 358.29 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 91.0 MB in the beginning and 171.4 MB in the end (delta: -80.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 37123.46 ms. Allocated memory was 203.4 MB in the beginning and 526.4 MB in the end (delta: 323.0 MB). Free memory was 171.4 MB in the beginning and 85.6 MB in the end (delta: 85.8 MB). Peak memory consumption was 408.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] unsigned int input = __VERIFIER_nondet_uint(); [L11] CALL, EXPR id(input) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND TRUE x==0 [L5] return 0; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L11] RET, EXPR id(input) [L11] unsigned int result = id(input); [L12] COND TRUE result == 20 [L13] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 37.0s, OverallIterations: 21, TraceHistogramMax: 21, AutomataDifference: 15.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 935 SDtfs, 212 SDslu, 18686 SDs, 0 SdLazy, 10957 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1150 GetRequests, 500 SyntacticMatches, 0 SemanticMatches, 650 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1330 ImplicationChecksByTransitivity, 18.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred 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...