/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/id2_b5_o10.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 16:28:44,781 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 16:28:44,786 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 16:28:44,831 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 16:28:44,832 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 16:28:44,843 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 16:28:44,845 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 16:28:44,848 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 16:28:44,852 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 16:28:44,856 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 16:28:44,857 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 16:28:44,859 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 16:28:44,859 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 16:28:44,862 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 16:28:44,865 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 16:28:44,866 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 16:28:44,866 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 16:28:44,869 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 16:28:44,871 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 16:28:44,878 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 16:28:44,880 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 16:28:44,881 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 16:28:44,882 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 16:28:44,883 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 16:28:44,885 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 16:28:44,885 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 16:28:44,886 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 16:28:44,886 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 16:28:44,887 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 16:28:44,888 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 16:28:44,888 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 16:28:44,889 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 16:28:44,889 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 16:28:44,890 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 16:28:44,891 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 16:28:44,891 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 16:28:44,892 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 16:28:44,892 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 16:28:44,892 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 16:28:44,893 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 16:28:44,894 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 16:28:44,895 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:28:44,908 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 16:28:44,908 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 16:28:44,910 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 16:28:44,910 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 16:28:44,910 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 16:28:44,911 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 16:28:44,911 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 16:28:44,911 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 16:28:44,911 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 16:28:44,911 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 16:28:44,912 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 16:28:44,912 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 16:28:44,912 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 16:28:44,912 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 16:28:44,912 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 16:28:44,913 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 16:28:44,913 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 16:28:44,913 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 16:28:44,913 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 16:28:44,913 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 16:28:44,914 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 16:28:44,914 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 16:28:44,914 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-09-04 16:28:45,420 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 16:28:45,439 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 16:28:45,444 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 16:28:45,446 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 16:28:45,447 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 16:28:45,449 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id2_b5_o10.c [2020-09-04 16:28:45,541 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/59293409f/a31addd9b7824845bb32200f39155381/FLAGb595efd19 [2020-09-04 16:28:46,180 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 16:28:46,181 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/id2_b5_o10.c [2020-09-04 16:28:46,194 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/59293409f/a31addd9b7824845bb32200f39155381/FLAGb595efd19 [2020-09-04 16:28:46,517 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/59293409f/a31addd9b7824845bb32200f39155381 [2020-09-04 16:28:46,533 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 16:28:46,536 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 16:28:46,538 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 16:28:46,538 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 16:28:46,543 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 16:28:46,545 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:28:46" (1/1) ... [2020-09-04 16:28:46,550 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71e67e7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:46, skipping insertion in model container [2020-09-04 16:28:46,550 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:28:46" (1/1) ... [2020-09-04 16:28:46,561 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 16:28:46,590 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 16:28:46,837 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:28:46,844 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 16:28:46,866 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:28:46,885 INFO L208 MainTranslator]: Completed translation [2020-09-04 16:28:46,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:46 WrapperNode [2020-09-04 16:28:46,886 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 16:28:46,887 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 16:28:46,887 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 16:28:46,887 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 16:28:46,902 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:46" (1/1) ... [2020-09-04 16:28:46,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:46" (1/1) ... [2020-09-04 16:28:46,908 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:46" (1/1) ... [2020-09-04 16:28:46,909 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:46" (1/1) ... [2020-09-04 16:28:47,018 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:46" (1/1) ... [2020-09-04 16:28:47,023 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:46" (1/1) ... [2020-09-04 16:28:47,025 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:46" (1/1) ... [2020-09-04 16:28:47,027 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 16:28:47,028 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 16:28:47,028 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 16:28:47,028 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 16:28:47,030 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:46" (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:28:47,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 16:28:47,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 16:28:47,116 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-09-04 16:28:47,116 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2020-09-04 16:28:47,117 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 16:28:47,117 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-09-04 16:28:47,117 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 16:28:47,117 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-09-04 16:28:47,117 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2020-09-04 16:28:47,118 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 16:28:47,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 16:28:47,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 16:28:47,368 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 16:28:47,369 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 16:28:47,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:28:47 BoogieIcfgContainer [2020-09-04 16:28:47,377 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 16:28:47,379 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 16:28:47,380 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 16:28:47,384 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 16:28:47,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 04:28:46" (1/3) ... [2020-09-04 16:28:47,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b1447d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:28:47, skipping insertion in model container [2020-09-04 16:28:47,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:46" (2/3) ... [2020-09-04 16:28:47,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b1447d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:28:47, skipping insertion in model container [2020-09-04 16:28:47,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:28:47" (3/3) ... [2020-09-04 16:28:47,390 INFO L109 eAbstractionObserver]: Analyzing ICFG id2_b5_o10.c [2020-09-04 16:28:47,407 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 16:28:47,421 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 16:28:47,454 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 16:28:47,496 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 16:28:47,500 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 16:28:47,501 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-09-04 16:28:47,501 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 16:28:47,501 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 16:28:47,501 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 16:28:47,502 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 16:28:47,502 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 16:28:47,532 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2020-09-04 16:28:47,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-09-04 16:28:47,550 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:28:47,551 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:28:47,552 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:28:47,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:28:47,561 INFO L82 PathProgramCache]: Analyzing trace with hash 875745540, now seen corresponding path program 1 times [2020-09-04 16:28:47,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:28:47,580 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1508429319] [2020-09-04 16:28:47,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:28:47,668 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:28:47,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:47,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:28:47,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:47,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:28:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:47,971 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:28:47,974 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1508429319] [2020-09-04 16:28:47,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:28:47,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 16:28:47,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521835671] [2020-09-04 16:28:47,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 16:28:47,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:28:48,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 16:28:48,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 16:28:48,010 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 5 states. [2020-09-04 16:28:48,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:28:48,150 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2020-09-04 16:28:48,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 16:28:48,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-09-04 16:28:48,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:28:48,171 INFO L225 Difference]: With dead ends: 51 [2020-09-04 16:28:48,171 INFO L226 Difference]: Without dead ends: 36 [2020-09-04 16:28:48,178 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:28:48,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-09-04 16:28:48,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-09-04 16:28:48,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-09-04 16:28:48,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2020-09-04 16:28:48,258 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 16 [2020-09-04 16:28:48,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:28:48,259 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2020-09-04 16:28:48,259 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 16:28:48,259 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2020-09-04 16:28:48,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-04 16:28:48,263 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:28:48,263 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:28:48,264 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 16:28:48,264 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:28:48,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:28:48,265 INFO L82 PathProgramCache]: Analyzing trace with hash 71846672, now seen corresponding path program 1 times [2020-09-04 16:28:48,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:28:48,266 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1351622325] [2020-09-04 16:28:48,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:28:48,269 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:28:48,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:48,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:28:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:48,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:28:48,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:48,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:48,539 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:28:48,540 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1351622325] [2020-09-04 16:28:48,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:28:48,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 16:28:48,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693902208] [2020-09-04 16:28:48,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 16:28:48,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:28:48,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 16:28:48,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-09-04 16:28:48,545 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 8 states. [2020-09-04 16:28:48,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:28:48,701 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2020-09-04 16:28:48,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 16:28:48,702 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2020-09-04 16:28:48,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:28:48,705 INFO L225 Difference]: With dead ends: 66 [2020-09-04 16:28:48,705 INFO L226 Difference]: Without dead ends: 44 [2020-09-04 16:28:48,709 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-09-04 16:28:48,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-09-04 16:28:48,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2020-09-04 16:28:48,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-09-04 16:28:48,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2020-09-04 16:28:48,727 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 25 [2020-09-04 16:28:48,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:28:48,728 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2020-09-04 16:28:48,728 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 16:28:48,729 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2020-09-04 16:28:48,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-09-04 16:28:48,731 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:28:48,731 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:28:48,732 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 16:28:48,732 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:28:48,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:28:48,733 INFO L82 PathProgramCache]: Analyzing trace with hash -511991682, now seen corresponding path program 1 times [2020-09-04 16:28:48,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:28:48,734 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [99526617] [2020-09-04 16:28:48,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:28:48,770 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:28:48,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:48,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:28:48,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:48,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:28:48,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:49,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:49,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:49,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:49,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:49,107 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:28:49,108 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [99526617] [2020-09-04 16:28:49,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:28:49,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 16:28:49,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530764975] [2020-09-04 16:28:49,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 16:28:49,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:28:49,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 16:28:49,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 16:28:49,113 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 5 states. [2020-09-04 16:28:49,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:28:49,239 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2020-09-04 16:28:49,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 16:28:49,240 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2020-09-04 16:28:49,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:28:49,242 INFO L225 Difference]: With dead ends: 69 [2020-09-04 16:28:49,242 INFO L226 Difference]: Without dead ends: 50 [2020-09-04 16:28:49,243 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-04 16:28:49,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-09-04 16:28:49,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2020-09-04 16:28:49,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-09-04 16:28:49,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2020-09-04 16:28:49,258 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 34 [2020-09-04 16:28:49,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:28:49,259 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2020-09-04 16:28:49,259 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 16:28:49,259 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2020-09-04 16:28:49,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-09-04 16:28:49,261 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:28:49,261 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:28:49,261 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 16:28:49,261 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:28:49,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:28:49,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1477652418, now seen corresponding path program 1 times [2020-09-04 16:28:49,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:28:49,263 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1894879785] [2020-09-04 16:28:49,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:28:49,271 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:28:49,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:49,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:28:49,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:49,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:28:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:49,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:49,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:49,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:49,440 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:28:49,441 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1894879785] [2020-09-04 16:28:49,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:28:49,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 16:28:49,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670732255] [2020-09-04 16:28:49,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 16:28:49,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:28:49,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 16:28:49,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 16:28:49,444 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 5 states. [2020-09-04 16:28:49,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:28:49,487 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2020-09-04 16:28:49,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 16:28:49,488 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2020-09-04 16:28:49,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:28:49,490 INFO L225 Difference]: With dead ends: 54 [2020-09-04 16:28:49,490 INFO L226 Difference]: Without dead ends: 49 [2020-09-04 16:28:49,491 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-04 16:28:49,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-09-04 16:28:49,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2020-09-04 16:28:49,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-09-04 16:28:49,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2020-09-04 16:28:49,503 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 34 [2020-09-04 16:28:49,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:28:49,504 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2020-09-04 16:28:49,504 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 16:28:49,504 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2020-09-04 16:28:49,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-09-04 16:28:49,506 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:28:49,507 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:28:49,507 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 16:28:49,507 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:28:49,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:28:49,508 INFO L82 PathProgramCache]: Analyzing trace with hash -2109914946, now seen corresponding path program 1 times [2020-09-04 16:28:49,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:28:49,509 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1771052750] [2020-09-04 16:28:49,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:28:49,518 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:28:49,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:49,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:28:49,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:49,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:28:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:49,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:49,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:49,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:49,869 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:28:49,870 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1771052750] [2020-09-04 16:28:49,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:28:49,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 16:28:49,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450074425] [2020-09-04 16:28:49,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 16:28:49,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:28:49,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 16:28:49,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2020-09-04 16:28:49,874 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 11 states. [2020-09-04 16:28:50,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:28:50,143 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2020-09-04 16:28:50,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 16:28:50,145 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2020-09-04 16:28:50,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:28:50,147 INFO L225 Difference]: With dead ends: 90 [2020-09-04 16:28:50,147 INFO L226 Difference]: Without dead ends: 61 [2020-09-04 16:28:50,151 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2020-09-04 16:28:50,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-09-04 16:28:50,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2020-09-04 16:28:50,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-09-04 16:28:50,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2020-09-04 16:28:50,177 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 34 [2020-09-04 16:28:50,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:28:50,179 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2020-09-04 16:28:50,180 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 16:28:50,180 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2020-09-04 16:28:50,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-09-04 16:28:50,184 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:28:50,185 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:28:50,185 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 16:28:50,185 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:28:50,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:28:50,186 INFO L82 PathProgramCache]: Analyzing trace with hash 830258234, now seen corresponding path program 1 times [2020-09-04 16:28:50,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:28:50,187 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1949308322] [2020-09-04 16:28:50,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:28:50,200 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:28:50,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:50,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:28:50,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:50,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:28:50,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:50,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:50,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:50,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:50,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:50,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:50,580 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-09-04 16:28:50,582 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1949308322] [2020-09-04 16:28:50,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:28:50,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-09-04 16:28:50,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950869292] [2020-09-04 16:28:50,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 16:28:50,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:28:50,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 16:28:50,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2020-09-04 16:28:50,584 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 14 states. [2020-09-04 16:28:50,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:28:50,943 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2020-09-04 16:28:50,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 16:28:50,944 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2020-09-04 16:28:50,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:28:50,946 INFO L225 Difference]: With dead ends: 102 [2020-09-04 16:28:50,946 INFO L226 Difference]: Without dead ends: 73 [2020-09-04 16:28:50,948 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2020-09-04 16:28:50,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-09-04 16:28:50,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 59. [2020-09-04 16:28:50,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-09-04 16:28:50,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2020-09-04 16:28:50,962 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 43 [2020-09-04 16:28:50,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:28:50,962 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2020-09-04 16:28:50,962 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 16:28:50,962 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2020-09-04 16:28:50,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-09-04 16:28:50,964 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:28:50,964 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:28:50,965 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 16:28:50,965 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:28:50,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:28:50,966 INFO L82 PathProgramCache]: Analyzing trace with hash 444280, now seen corresponding path program 2 times [2020-09-04 16:28:50,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:28:50,966 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1843024678] [2020-09-04 16:28:50,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:28:50,975 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:28:50,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:51,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:28:51,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:51,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:28:51,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:51,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:51,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:51,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:51,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:51,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:51,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:51,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:51,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:51,454 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-09-04 16:28:51,455 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1843024678] [2020-09-04 16:28:51,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:28:51,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-09-04 16:28:51,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718527111] [2020-09-04 16:28:51,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-04 16:28:51,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:28:51,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-04 16:28:51,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2020-09-04 16:28:51,458 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 17 states. [2020-09-04 16:28:51,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:28:51,911 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2020-09-04 16:28:51,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-09-04 16:28:51,911 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 52 [2020-09-04 16:28:51,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:28:51,913 INFO L225 Difference]: With dead ends: 114 [2020-09-04 16:28:51,914 INFO L226 Difference]: Without dead ends: 85 [2020-09-04 16:28:51,915 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2020-09-04 16:28:51,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-09-04 16:28:51,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 65. [2020-09-04 16:28:51,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-09-04 16:28:51,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2020-09-04 16:28:51,931 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 52 [2020-09-04 16:28:51,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:28:51,932 INFO L479 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2020-09-04 16:28:51,932 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-04 16:28:51,932 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2020-09-04 16:28:51,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-09-04 16:28:51,934 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:28:51,934 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:28:51,934 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 16:28:51,935 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:28:51,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:28:51,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1783783324, now seen corresponding path program 2 times [2020-09-04 16:28:51,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:28:51,936 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1913391626] [2020-09-04 16:28:51,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:28:51,942 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:28:51,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:52,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:28:52,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:52,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:28:52,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:52,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:52,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:52,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:52,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:52,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:52,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:52,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:52,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:52,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:52,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:52,483 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-09-04 16:28:52,484 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1913391626] [2020-09-04 16:28:52,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:28:52,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-09-04 16:28:52,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382847946] [2020-09-04 16:28:52,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-09-04 16:28:52,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:28:52,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-09-04 16:28:52,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2020-09-04 16:28:52,486 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 20 states. [2020-09-04 16:28:53,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:28:53,083 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2020-09-04 16:28:53,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-09-04 16:28:53,084 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 61 [2020-09-04 16:28:53,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:28:53,088 INFO L225 Difference]: With dead ends: 128 [2020-09-04 16:28:53,088 INFO L226 Difference]: Without dead ends: 99 [2020-09-04 16:28:53,090 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=81, Invalid=849, Unknown=0, NotChecked=0, Total=930 [2020-09-04 16:28:53,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-09-04 16:28:53,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 71. [2020-09-04 16:28:53,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-09-04 16:28:53,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2020-09-04 16:28:53,107 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 61 [2020-09-04 16:28:53,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:28:53,108 INFO L479 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2020-09-04 16:28:53,108 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-09-04 16:28:53,108 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2020-09-04 16:28:53,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-09-04 16:28:53,109 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:28:53,110 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:28:53,110 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 16:28:53,110 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:28:53,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:28:53,111 INFO L82 PathProgramCache]: Analyzing trace with hash -756456142, now seen corresponding path program 3 times [2020-09-04 16:28:53,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:28:53,111 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1639852551] [2020-09-04 16:28:53,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:28:53,120 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:28:53,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:53,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:28:53,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:53,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:28:53,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:53,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:53,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:53,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:53,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:53,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:53,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:53,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:53,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:53,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:53,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:53,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:53,826 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-09-04 16:28:53,827 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1639852551] [2020-09-04 16:28:53,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:28:53,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-09-04 16:28:53,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705248448] [2020-09-04 16:28:53,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-09-04 16:28:53,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:28:53,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-09-04 16:28:53,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2020-09-04 16:28:53,837 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 20 states. [2020-09-04 16:28:54,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:28:54,480 INFO L93 Difference]: Finished difference Result 135 states and 143 transitions. [2020-09-04 16:28:54,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-09-04 16:28:54,481 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 70 [2020-09-04 16:28:54,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:28:54,483 INFO L225 Difference]: With dead ends: 135 [2020-09-04 16:28:54,483 INFO L226 Difference]: Without dead ends: 109 [2020-09-04 16:28:54,485 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=81, Invalid=849, Unknown=0, NotChecked=0, Total=930 [2020-09-04 16:28:54,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-09-04 16:28:54,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 101. [2020-09-04 16:28:54,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-09-04 16:28:54,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2020-09-04 16:28:54,507 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 70 [2020-09-04 16:28:54,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:28:54,508 INFO L479 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2020-09-04 16:28:54,508 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-09-04 16:28:54,508 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2020-09-04 16:28:54,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-09-04 16:28:54,509 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:28:54,510 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:28:54,510 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 16:28:54,510 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:28:54,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:28:54,511 INFO L82 PathProgramCache]: Analyzing trace with hash -242092146, now seen corresponding path program 3 times [2020-09-04 16:28:54,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:28:54,511 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [283128659] [2020-09-04 16:28:54,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:28:54,518 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:28:54,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:54,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:28:54,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:54,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:28:54,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:54,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:54,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:54,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:54,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:54,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:54,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:54,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:54,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:54,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:54,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:54,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:55,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:55,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:55,086 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-09-04 16:28:55,087 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [283128659] [2020-09-04 16:28:55,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:28:55,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-09-04 16:28:55,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922184112] [2020-09-04 16:28:55,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-09-04 16:28:55,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:28:55,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-09-04 16:28:55,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2020-09-04 16:28:55,089 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand 20 states. [2020-09-04 16:28:55,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:28:55,675 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2020-09-04 16:28:55,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-09-04 16:28:55,676 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 79 [2020-09-04 16:28:55,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:28:55,677 INFO L225 Difference]: With dead ends: 117 [2020-09-04 16:28:55,677 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 16:28:55,678 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=81, Invalid=849, Unknown=0, NotChecked=0, Total=930 [2020-09-04 16:28:55,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 16:28:55,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 16:28:55,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 16:28:55,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 16:28:55,679 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 79 [2020-09-04 16:28:55,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:28:55,680 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 16:28:55,680 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-09-04 16:28:55,680 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 16:28:55,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 16:28:55,680 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 16:28:55,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 16:28:56,798 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 35 [2020-09-04 16:28:57,041 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 35 [2020-09-04 16:28:57,328 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 16:28:57,328 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-09-04 16:28:57,329 INFO L264 CegarLoopResult]: At program point id2FINAL(lines 14 19) the Hoare annotation is: (or (and (<= |id2_#res| 5) (<= 5 |id2_#res|)) (and (<= |id2_#res| 3) (<= 3 id2_~ret~1) (<= id2_~ret~1 3) (<= 3 |id2_#res|)) (and (<= |id2_#res| 1) (<= 1 id2_~ret~1) (<= id2_~ret~1 1) (<= 1 |id2_#res|)) (and (<= |id2_#res| 0) (<= 0 |id2_#res|)) (and (<= 4 id2_~ret~1) (<= id2_~ret~1 4) (<= |id2_#res| 4) (<= 4 |id2_#res|)) (and (<= 2 |id2_#res|) (<= id2_~ret~1 2) (<= |id2_#res| 2) (<= 2 id2_~ret~1))) [2020-09-04 16:28:57,329 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (or (and (<= 4 id2_~ret~1) (<= id2_~ret~1 4)) (and (<= id2_~ret~1 5) (<= 5 id2_~ret~1)) (and (<= id2_~ret~1 2) (<= 2 id2_~ret~1)) (and (<= 1 id2_~ret~1) (<= id2_~ret~1 1)) (and (<= 3 id2_~ret~1) (<= id2_~ret~1 3))) [2020-09-04 16:28:57,329 INFO L264 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: (or (and (<= 4 id2_~ret~1) (<= id2_~ret~1 4)) (and (<= id2_~ret~1 5) (<= 5 id2_~ret~1)) (and (<= id2_~ret~1 2) (<= 2 id2_~ret~1)) (and (<= 1 id2_~ret~1) (<= id2_~ret~1 1)) (and (<= 6 id2_~ret~1) (<= (div id2_~ret~1 4294967296) 0)) (and (<= 3 id2_~ret~1) (<= id2_~ret~1 3))) [2020-09-04 16:28:57,330 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-09-04 16:28:57,330 INFO L264 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: (and (<= 6 id2_~ret~1) (<= (div id2_~ret~1 4294967296) 0)) [2020-09-04 16:28:57,330 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-09-04 16:28:57,330 INFO L264 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: (or (and (<= |id2_#t~ret1| 5) (<= 5 |id2_#t~ret1|)) (and (<= 2 |id2_#t~ret1|) (<= |id2_#t~ret1| 2)) (and (<= 4 |id2_#t~ret1|) (<= |id2_#t~ret1| 4)) (and (<= 0 |id2_#t~ret1|) (<= |id2_#t~ret1| 0)) (and (<= |id2_#t~ret1| 1) (<= 1 |id2_#t~ret1|)) (and (<= 3 |id2_#t~ret1|) (<= |id2_#t~ret1| 3))) [2020-09-04 16:28:57,330 INFO L271 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-09-04 16:28:57,331 INFO L264 CegarLoopResult]: At program point L16-2(line 16) the Hoare annotation is: (or (and (<= |id2_#t~ret1| 5) (<= 6 id2_~ret~1) (<= 5 |id2_#t~ret1|) (<= (div id2_~ret~1 4294967296) 0)) (and (<= 0 |id2_#t~ret1|) (<= |id2_#t~ret1| 0) (<= 1 id2_~ret~1) (<= id2_~ret~1 1)) (and (<= |id2_#t~ret1| 1) (<= 1 |id2_#t~ret1|) (<= id2_~ret~1 2) (<= 2 id2_~ret~1)) (and (<= 4 |id2_#t~ret1|) (<= id2_~ret~1 5) (<= |id2_#t~ret1| 4) (<= 5 id2_~ret~1)) (and (<= 4 id2_~ret~1) (<= 3 |id2_#t~ret1|) (<= id2_~ret~1 4) (<= |id2_#t~ret1| 3)) (and (<= 2 |id2_#t~ret1|) (<= |id2_#t~ret1| 2) (<= 3 id2_~ret~1) (<= id2_~ret~1 3))) [2020-09-04 16:28:57,331 INFO L264 CegarLoopResult]: At program point id2EXIT(lines 14 19) the Hoare annotation is: (or (and (<= |id2_#res| 5) (<= 5 |id2_#res|)) (and (<= |id2_#res| 3) (<= 3 id2_~ret~1) (<= id2_~ret~1 3) (<= 3 |id2_#res|)) (and (<= |id2_#res| 1) (<= 1 id2_~ret~1) (<= id2_~ret~1 1) (<= 1 |id2_#res|)) (and (<= |id2_#res| 0) (<= 0 |id2_#res|)) (and (<= 4 id2_~ret~1) (<= id2_~ret~1 4) (<= |id2_#res| 4) (<= 4 |id2_#res|)) (and (<= 2 |id2_#res|) (<= id2_~ret~1 2) (<= |id2_#res| 2) (<= 2 id2_~ret~1))) [2020-09-04 16:28:57,331 INFO L271 CegarLoopResult]: At program point id2ENTRY(lines 14 19) the Hoare annotation is: true [2020-09-04 16:28:57,331 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 16:28:57,332 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 16:28:57,332 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 16:28:57,332 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 16:28:57,332 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 25) the Hoare annotation is: false [2020-09-04 16:28:57,332 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 21 27) the Hoare annotation is: true [2020-09-04 16:28:57,333 INFO L264 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: false [2020-09-04 16:28:57,333 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 21 27) the Hoare annotation is: true [2020-09-04 16:28:57,333 INFO L264 CegarLoopResult]: At program point L24(lines 24 26) the Hoare annotation is: (and (< 0 (+ (div main_~result~0 4294967296) 1)) (<= main_~result~0 5)) [2020-09-04 16:28:57,333 INFO L271 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: true [2020-09-04 16:28:57,333 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-09-04 16:28:57,334 INFO L264 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: (or (and (<= |main_#t~ret3| 3) (<= 3 |main_#t~ret3|)) (and (<= |main_#t~ret3| 0) (<= 0 |main_#t~ret3|)) (and (<= 2 |main_#t~ret3|) (<= |main_#t~ret3| 2)) (and (<= |main_#t~ret3| 1) (<= 1 |main_#t~ret3|)) (and (<= 5 |main_#t~ret3|) (<= |main_#t~ret3| 5)) (and (<= |main_#t~ret3| 4) (<= 4 |main_#t~ret3|))) [2020-09-04 16:28:57,334 INFO L271 CegarLoopResult]: At program point L24-2(lines 21 27) the Hoare annotation is: true [2020-09-04 16:28:57,334 INFO L264 CegarLoopResult]: At program point L23-2(line 23) the Hoare annotation is: (let ((.cse0 (< 0 (+ (div main_~result~0 4294967296) 1)))) (or (and (<= |main_#t~ret3| 0) (<= main_~result~0 0) (<= 0 |main_#t~ret3|) .cse0) (and (<= main_~result~0 3) .cse0 (<= |main_#t~ret3| 3) (<= 3 |main_#t~ret3|)) (and (<= |main_#t~ret3| 4) (<= main_~result~0 4) .cse0 (<= 4 |main_#t~ret3|)) (and (<= 2 |main_#t~ret3|) (<= main_~result~0 2) (<= |main_#t~ret3| 2) .cse0) (and (<= 5 |main_#t~ret3|) (<= |main_#t~ret3| 5) .cse0 (<= main_~result~0 5)) (and (<= |main_#t~ret3| 1) (<= main_~result~0 1) (<= 1 |main_#t~ret3|) .cse0))) [2020-09-04 16:28:57,335 INFO L264 CegarLoopResult]: At program point idFINAL(lines 7 12) the Hoare annotation is: (or (and (<= |id_#res| 1) (<= id_~ret~0 1) (<= 1 |id_#res|) (<= 1 id_~ret~0)) (and (<= |id_#res| 3) (<= 3 id_~ret~0) (<= id_~ret~0 3) (<= 3 |id_#res|)) (and (<= id_~ret~0 2) (<= 2 |id_#res|) (<= |id_#res| 2) (<= 2 id_~ret~0)) (and (<= |id_#res| 4) (<= 4 |id_#res|) (<= id_~ret~0 4) (<= 4 id_~ret~0)) (and (<= 0 |id_#res|) (<= |id_#res| 0)) (and (<= 5 |id_#res|) (<= |id_#res| 5))) [2020-09-04 16:28:57,335 INFO L264 CegarLoopResult]: At program point idEXIT(lines 7 12) the Hoare annotation is: (or (and (<= |id_#res| 1) (<= id_~ret~0 1) (<= 1 |id_#res|) (<= 1 id_~ret~0)) (and (<= |id_#res| 3) (<= 3 id_~ret~0) (<= id_~ret~0 3) (<= 3 |id_#res|)) (and (<= id_~ret~0 2) (<= 2 |id_#res|) (<= |id_#res| 2) (<= 2 id_~ret~0)) (and (<= |id_#res| 4) (<= 4 |id_#res|) (<= id_~ret~0 4) (<= 4 id_~ret~0)) (and (<= 0 |id_#res|) (<= |id_#res| 0)) (and (<= 5 |id_#res|) (<= |id_#res| 5))) [2020-09-04 16:28:57,335 INFO L271 CegarLoopResult]: At program point idENTRY(lines 7 12) the Hoare annotation is: true [2020-09-04 16:28:57,336 INFO L264 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (or (and (<= 5 id_~ret~0) (<= id_~ret~0 5)) (and (<= id_~ret~0 2) (<= 2 id_~ret~0)) (and (<= id_~ret~0 4) (<= 4 id_~ret~0)) (and (<= 3 id_~ret~0) (<= id_~ret~0 3)) (and (<= id_~ret~0 1) (<= 1 id_~ret~0))) [2020-09-04 16:28:57,336 INFO L264 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: (or (and (<= 5 id_~ret~0) (<= id_~ret~0 5)) (and (<= id_~ret~0 2) (<= 2 id_~ret~0)) (and (<= 6 id_~ret~0) (<= (div id_~ret~0 4294967296) 0)) (and (<= id_~ret~0 4) (<= 4 id_~ret~0)) (and (<= 3 id_~ret~0) (<= id_~ret~0 3)) (and (<= id_~ret~0 1) (<= 1 id_~ret~0))) [2020-09-04 16:28:57,336 INFO L271 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-09-04 16:28:57,336 INFO L271 CegarLoopResult]: At program point L10-1(line 10) the Hoare annotation is: true [2020-09-04 16:28:57,337 INFO L271 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: true [2020-09-04 16:28:57,337 INFO L264 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: (or (and (<= 1 |id_#t~ret0|) (<= |id_#t~ret0| 1)) (and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|)) (and (<= |id_#t~ret0| 5) (<= 5 |id_#t~ret0|)) (and (<= 3 |id_#t~ret0|) (<= |id_#t~ret0| 3)) (and (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4)) (and (<= 0 |id_#t~ret0|) (<= |id_#t~ret0| 0))) [2020-09-04 16:28:57,337 INFO L271 CegarLoopResult]: At program point L8-1(line 8) the Hoare annotation is: true [2020-09-04 16:28:57,337 INFO L264 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: (or (and (<= id_~ret~0 4) (<= 4 id_~ret~0) (<= 3 |id_#t~ret0|) (<= |id_#t~ret0| 3)) (and (<= |id_#t~ret0| 5) (<= 6 id_~ret~0) (<= (div id_~ret~0 4294967296) 0) (<= 5 |id_#t~ret0|)) (and (<= 5 id_~ret~0) (<= id_~ret~0 5) (<= 4 |id_#t~ret0|) (<= |id_#t~ret0| 4)) (and (<= |id_#t~ret0| 2) (<= 3 id_~ret~0) (<= id_~ret~0 3) (<= 2 |id_#t~ret0|)) (and (<= 0 |id_#t~ret0|) (<= |id_#t~ret0| 0) (<= id_~ret~0 1) (<= 1 id_~ret~0)) (and (<= id_~ret~0 2) (<= 1 |id_#t~ret0|) (<= |id_#t~ret0| 1) (<= 2 id_~ret~0))) [2020-09-04 16:28:57,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 04:28:57 BoogieIcfgContainer [2020-09-04 16:28:57,376 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 16:28:57,379 INFO L168 Benchmark]: Toolchain (without parser) took 10842.85 ms. Allocated memory was 138.4 MB in the beginning and 320.3 MB in the end (delta: 181.9 MB). Free memory was 102.9 MB in the beginning and 252.3 MB in the end (delta: -149.3 MB). Peak memory consumption was 190.3 MB. Max. memory is 7.1 GB. [2020-09-04 16:28:57,380 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 138.4 MB. Free memory was 121.0 MB in the beginning and 120.5 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. [2020-09-04 16:28:57,381 INFO L168 Benchmark]: CACSL2BoogieTranslator took 348.27 ms. Allocated memory is still 138.4 MB. Free memory was 102.5 MB in the beginning and 93.1 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2020-09-04 16:28:57,382 INFO L168 Benchmark]: Boogie Preprocessor took 140.68 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 93.1 MB in the beginning and 181.7 MB in the end (delta: -88.6 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. [2020-09-04 16:28:57,383 INFO L168 Benchmark]: RCFGBuilder took 349.56 ms. Allocated memory is still 202.9 MB. Free memory was 181.7 MB in the beginning and 167.5 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. [2020-09-04 16:28:57,383 INFO L168 Benchmark]: TraceAbstraction took 9996.46 ms. Allocated memory was 202.9 MB in the beginning and 320.3 MB in the end (delta: 117.4 MB). Free memory was 167.5 MB in the beginning and 252.3 MB in the end (delta: -84.7 MB). Peak memory consumption was 190.4 MB. Max. memory is 7.1 GB. [2020-09-04 16:28:57,388 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.27 ms. Allocated memory is still 138.4 MB. Free memory was 121.0 MB in the beginning and 120.5 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 348.27 ms. Allocated memory is still 138.4 MB. Free memory was 102.5 MB in the beginning and 93.1 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 140.68 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 93.1 MB in the beginning and 181.7 MB in the end (delta: -88.6 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 349.56 ms. Allocated memory is still 202.9 MB. Free memory was 181.7 MB in the beginning and 167.5 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9996.46 ms. Allocated memory was 202.9 MB in the beginning and 320.3 MB in the end (delta: 117.4 MB). Free memory was 167.5 MB in the beginning and 252.3 MB in the end (delta: -84.7 MB). Peak memory consumption was 190.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 25]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 14]: Procedure Contract for id2 Derived contract for procedure id2: (((((\result <= 5 && 5 <= \result) || (((\result <= 3 && 3 <= ret) && ret <= 3) && 3 <= \result)) || (((\result <= 1 && 1 <= ret) && ret <= 1) && 1 <= \result)) || (\result <= 0 && 0 <= \result)) || (((4 <= ret && ret <= 4) && \result <= 4) && 4 <= \result)) || (((2 <= \result && ret <= 2) && \result <= 2) && 2 <= ret) - ProcedureContractResult [Line: 21]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 7]: Procedure Contract for id Derived contract for procedure id: (((((((\result <= 1 && ret <= 1) && 1 <= \result) && 1 <= ret) || (((\result <= 3 && 3 <= ret) && ret <= 3) && 3 <= \result)) || (((ret <= 2 && 2 <= \result) && \result <= 2) && 2 <= ret)) || (((\result <= 4 && 4 <= \result) && ret <= 4) && 4 <= ret)) || (0 <= \result && \result <= 0)) || (5 <= \result && \result <= 5) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 8.1s, OverallIterations: 10, TraceHistogramMax: 4, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 438 SDtfs, 96 SDslu, 4462 SDs, 0 SdLazy, 1592 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 293 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 85 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 38 LocationsWithAnnotation, 49 PreInvPairs, 294 NumberOfFragments, 866 HoareAnnotationTreeSize, 49 FomulaSimplifications, 14014 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 38 FomulaSimplificationsInter, 344 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...