/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 --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --traceabstraction.use.minimal.unsat.core.enumeration true --traceabstraction.additional.smt.options enumeration-timeout=5 --traceabstraction.additional.smt.options interpolation-heuristic=WIDESTAMONGSMALL --traceabstraction.additional.smt.options tolerance=0.8 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/sum_20x0-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-5644d1e-m [2020-08-19 01:57:30,924 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-19 01:57:30,927 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-19 01:57:30,968 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-19 01:57:30,968 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-19 01:57:30,977 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-19 01:57:30,979 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-19 01:57:30,982 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-19 01:57:30,985 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-19 01:57:30,988 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-19 01:57:30,989 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-19 01:57:30,991 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-19 01:57:30,991 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-19 01:57:30,994 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-19 01:57:30,997 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-19 01:57:30,998 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-19 01:57:31,000 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-19 01:57:31,001 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-19 01:57:31,003 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-19 01:57:31,011 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-19 01:57:31,013 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-19 01:57:31,014 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-19 01:57:31,015 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-19 01:57:31,016 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-19 01:57:31,028 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-19 01:57:31,029 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-19 01:57:31,032 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-19 01:57:31,033 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-19 01:57:31,033 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-19 01:57:31,034 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-19 01:57:31,034 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-19 01:57:31,035 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-19 01:57:31,035 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-19 01:57:31,036 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-19 01:57:31,037 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-19 01:57:31,037 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-19 01:57:31,038 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-19 01:57:31,038 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-19 01:57:31,038 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-19 01:57:31,039 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-19 01:57:31,040 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-19 01:57:31,040 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-08-19 01:57:31,062 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-19 01:57:31,063 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-19 01:57:31,064 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-19 01:57:31,064 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-19 01:57:31,064 INFO L138 SettingsManager]: * Use SBE=true [2020-08-19 01:57:31,065 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-19 01:57:31,065 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-19 01:57:31,065 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-19 01:57:31,065 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-19 01:57:31,065 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-19 01:57:31,066 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-19 01:57:31,066 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-19 01:57:31,066 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-19 01:57:31,066 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-19 01:57:31,066 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-19 01:57:31,067 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-19 01:57:31,067 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-19 01:57:31,067 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-19 01:57:31,067 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-19 01:57:31,067 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-19 01:57:31,068 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-19 01:57:31,068 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-19 01:57:31,068 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-19 01:57:31,068 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-19 01:57:31,068 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-19 01:57:31,069 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-19 01:57:31,069 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-19 01:57:31,069 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-19 01:57:31,069 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-19 01:57:31,069 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=0.8; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=0.8; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=0.8; [2020-08-19 01:57:31,348 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-19 01:57:31,368 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-19 01:57:31,373 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-19 01:57:31,375 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-19 01:57:31,376 INFO L275 PluginConnector]: CDTParser initialized [2020-08-19 01:57:31,376 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/sum_20x0-1.c [2020-08-19 01:57:31,460 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/aa9078b20/174869546ab94a3a9cd78745db9b45fd/FLAGb1bf68498 [2020-08-19 01:57:31,947 INFO L306 CDTParser]: Found 1 translation units. [2020-08-19 01:57:31,948 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/sum_20x0-1.c [2020-08-19 01:57:31,954 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/aa9078b20/174869546ab94a3a9cd78745db9b45fd/FLAGb1bf68498 [2020-08-19 01:57:32,318 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/aa9078b20/174869546ab94a3a9cd78745db9b45fd [2020-08-19 01:57:32,328 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-19 01:57:32,330 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-19 01:57:32,332 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-19 01:57:32,332 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-19 01:57:32,335 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-19 01:57:32,337 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.08 01:57:32" (1/1) ... [2020-08-19 01:57:32,340 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30a48022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 01:57:32, skipping insertion in model container [2020-08-19 01:57:32,340 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.08 01:57:32" (1/1) ... [2020-08-19 01:57:32,349 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-19 01:57:32,366 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-19 01:57:32,521 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-19 01:57:32,525 INFO L203 MainTranslator]: Completed pre-run [2020-08-19 01:57:32,538 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-19 01:57:32,551 INFO L208 MainTranslator]: Completed translation [2020-08-19 01:57:32,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 01:57:32 WrapperNode [2020-08-19 01:57:32,551 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-19 01:57:32,552 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-19 01:57:32,552 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-19 01:57:32,552 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-19 01:57:32,564 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 01:57:32" (1/1) ... [2020-08-19 01:57:32,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 01:57:32" (1/1) ... [2020-08-19 01:57:32,642 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 01:57:32" (1/1) ... [2020-08-19 01:57:32,643 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 01:57:32" (1/1) ... [2020-08-19 01:57:32,648 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 01:57:32" (1/1) ... [2020-08-19 01:57:32,651 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 01:57:32" (1/1) ... [2020-08-19 01:57:32,653 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 01:57:32" (1/1) ... [2020-08-19 01:57:32,655 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-19 01:57:32,655 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-19 01:57:32,655 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-19 01:57:32,655 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-19 01:57:32,658 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 01:57:32" (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-08-19 01:57:32,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-19 01:57:32,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-19 01:57:32,726 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2020-08-19 01:57:32,726 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-19 01:57:32,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-19 01:57:32,726 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2020-08-19 01:57:32,726 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-19 01:57:32,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-19 01:57:32,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-19 01:57:32,893 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-19 01:57:32,894 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-19 01:57:32,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.08 01:57:32 BoogieIcfgContainer [2020-08-19 01:57:32,898 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-19 01:57:32,899 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-19 01:57:32,899 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-19 01:57:32,902 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-19 01:57:32,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.08 01:57:32" (1/3) ... [2020-08-19 01:57:32,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26ce86cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.08 01:57:32, skipping insertion in model container [2020-08-19 01:57:32,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 01:57:32" (2/3) ... [2020-08-19 01:57:32,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26ce86cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.08 01:57:32, skipping insertion in model container [2020-08-19 01:57:32,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.08 01:57:32" (3/3) ... [2020-08-19 01:57:32,906 INFO L109 eAbstractionObserver]: Analyzing ICFG sum_20x0-1.c [2020-08-19 01:57:32,916 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-19 01:57:32,923 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-19 01:57:32,939 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-19 01:57:32,965 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-19 01:57:32,965 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-19 01:57:32,965 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-19 01:57:32,965 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-19 01:57:32,966 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-19 01:57:32,966 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-19 01:57:32,966 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-19 01:57:32,966 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-19 01:57:32,985 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-08-19 01:57:32,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-19 01:57:32,992 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:57:32,993 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 01:57:32,993 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:57:32,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:57:33,000 INFO L82 PathProgramCache]: Analyzing trace with hash 2001781660, now seen corresponding path program 1 times [2020-08-19 01:57:33,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:57:33,010 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [721266599] [2020-08-19 01:57:33,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:57:33,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:33,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:57:33,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:33,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:57:33,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:33,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 01:57:33,238 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [721266599] [2020-08-19 01:57:33,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 01:57:33,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-19 01:57:33,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627096441] [2020-08-19 01:57:33,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-19 01:57:33,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:57:33,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-19 01:57:33,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-19 01:57:33,271 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2020-08-19 01:57:33,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:57:33,415 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-08-19 01:57:33,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-19 01:57:33,417 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-19 01:57:33,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:57:33,428 INFO L225 Difference]: With dead ends: 30 [2020-08-19 01:57:33,429 INFO L226 Difference]: Without dead ends: 18 [2020-08-19 01:57:33,433 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-19 01:57:33,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-08-19 01:57:33,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-08-19 01:57:33,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-08-19 01:57:33,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2020-08-19 01:57:33,516 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2020-08-19 01:57:33,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:57:33,517 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2020-08-19 01:57:33,517 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-19 01:57:33,517 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-08-19 01:57:33,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-08-19 01:57:33,522 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:57:33,522 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 01:57:33,523 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-19 01:57:33,523 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:57:33,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:57:33,524 INFO L82 PathProgramCache]: Analyzing trace with hash -118151420, now seen corresponding path program 1 times [2020-08-19 01:57:33,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:57:33,525 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [189820649] [2020-08-19 01:57:33,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:57:33,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:33,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:57:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:33,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:57:33,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:33,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:33,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:33,655 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-08-19 01:57:33,656 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [189820649] [2020-08-19 01:57:33,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:57:33,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-19 01:57:33,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094652628] [2020-08-19 01:57:33,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-19 01:57:33,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:57:33,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-19 01:57:33,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-19 01:57:33,660 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 6 states. [2020-08-19 01:57:33,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:57:33,728 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-08-19 01:57:33,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-19 01:57:33,729 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-08-19 01:57:33,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:57:33,730 INFO L225 Difference]: With dead ends: 25 [2020-08-19 01:57:33,731 INFO L226 Difference]: Without dead ends: 21 [2020-08-19 01:57:33,732 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-08-19 01:57:33,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-08-19 01:57:33,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-08-19 01:57:33,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-19 01:57:33,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2020-08-19 01:57:33,739 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2020-08-19 01:57:33,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:57:33,740 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-08-19 01:57:33,740 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-19 01:57:33,741 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-08-19 01:57:33,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-08-19 01:57:33,742 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:57:33,742 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 01:57:33,743 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-19 01:57:33,743 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:57:33,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:57:33,743 INFO L82 PathProgramCache]: Analyzing trace with hash 764931548, now seen corresponding path program 2 times [2020-08-19 01:57:33,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:57:33,744 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1225379675] [2020-08-19 01:57:33,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:57:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:33,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:57:33,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:33,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:57:33,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:33,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:33,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:33,906 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-08-19 01:57:33,907 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1225379675] [2020-08-19 01:57:33,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:57:33,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-19 01:57:33,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501191459] [2020-08-19 01:57:33,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-19 01:57:33,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:57:33,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-19 01:57:33,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-19 01:57:33,910 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 7 states. [2020-08-19 01:57:33,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:57:33,981 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-08-19 01:57:33,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-19 01:57:33,982 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-08-19 01:57:33,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:57:33,983 INFO L225 Difference]: With dead ends: 28 [2020-08-19 01:57:33,983 INFO L226 Difference]: Without dead ends: 24 [2020-08-19 01:57:33,984 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-19 01:57:33,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-08-19 01:57:33,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-08-19 01:57:33,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-08-19 01:57:33,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2020-08-19 01:57:33,992 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2020-08-19 01:57:33,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:57:33,992 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2020-08-19 01:57:33,993 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-19 01:57:33,993 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-08-19 01:57:33,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-08-19 01:57:33,994 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:57:33,994 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 01:57:33,995 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-19 01:57:33,995 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:57:33,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:57:33,995 INFO L82 PathProgramCache]: Analyzing trace with hash 601942852, now seen corresponding path program 3 times [2020-08-19 01:57:33,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:57:33,996 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [66142975] [2020-08-19 01:57:33,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:57:34,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:34,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:57:34,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:34,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:57:34,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:34,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:34,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:34,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:34,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:34,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:34,246 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-08-19 01:57:34,247 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [66142975] [2020-08-19 01:57:34,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:57:34,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-19 01:57:34,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360190603] [2020-08-19 01:57:34,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-19 01:57:34,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:57:34,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-19 01:57:34,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-08-19 01:57:34,265 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 8 states. [2020-08-19 01:57:34,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:57:34,365 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2020-08-19 01:57:34,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-19 01:57:34,366 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2020-08-19 01:57:34,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:57:34,367 INFO L225 Difference]: With dead ends: 31 [2020-08-19 01:57:34,368 INFO L226 Difference]: Without dead ends: 27 [2020-08-19 01:57:34,368 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-08-19 01:57:34,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-08-19 01:57:34,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-08-19 01:57:34,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-08-19 01:57:34,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2020-08-19 01:57:34,380 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2020-08-19 01:57:34,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:57:34,382 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-08-19 01:57:34,382 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-19 01:57:34,382 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-08-19 01:57:34,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-08-19 01:57:34,384 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:57:34,385 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 01:57:34,385 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-19 01:57:34,385 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:57:34,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:57:34,386 INFO L82 PathProgramCache]: Analyzing trace with hash -183109604, now seen corresponding path program 4 times [2020-08-19 01:57:34,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:57:34,387 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1221455541] [2020-08-19 01:57:34,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:57:34,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:34,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:57:34,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:34,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:57:34,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:34,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:34,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:34,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:34,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:34,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:34,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:34,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:34,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:34,572 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-08-19 01:57:34,573 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1221455541] [2020-08-19 01:57:34,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:57:34,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-19 01:57:34,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302991198] [2020-08-19 01:57:34,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-19 01:57:34,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:57:34,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-19 01:57:34,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-08-19 01:57:34,575 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 9 states. [2020-08-19 01:57:34,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:57:34,661 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-08-19 01:57:34,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-19 01:57:34,662 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2020-08-19 01:57:34,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:57:34,663 INFO L225 Difference]: With dead ends: 34 [2020-08-19 01:57:34,663 INFO L226 Difference]: Without dead ends: 30 [2020-08-19 01:57:34,664 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-08-19 01:57:34,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-08-19 01:57:34,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-08-19 01:57:34,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-08-19 01:57:34,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2020-08-19 01:57:34,671 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2020-08-19 01:57:34,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:57:34,672 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2020-08-19 01:57:34,672 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-19 01:57:34,672 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-08-19 01:57:34,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-08-19 01:57:34,673 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:57:34,674 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 01:57:34,674 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-19 01:57:34,674 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:57:34,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:57:34,675 INFO L82 PathProgramCache]: Analyzing trace with hash -155447420, now seen corresponding path program 5 times [2020-08-19 01:57:34,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:57:34,675 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2079810801] [2020-08-19 01:57:34,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:57:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:34,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:57:34,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:34,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:57:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:34,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:34,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:34,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:34,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:34,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:34,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:34,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:34,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:34,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:34,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:34,845 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-08-19 01:57:34,845 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2079810801] [2020-08-19 01:57:34,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:57:34,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-19 01:57:34,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007463195] [2020-08-19 01:57:34,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-19 01:57:34,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:57:34,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-19 01:57:34,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-19 01:57:34,848 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 10 states. [2020-08-19 01:57:34,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:57:34,945 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2020-08-19 01:57:34,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-19 01:57:34,946 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2020-08-19 01:57:34,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:57:34,947 INFO L225 Difference]: With dead ends: 37 [2020-08-19 01:57:34,948 INFO L226 Difference]: Without dead ends: 33 [2020-08-19 01:57:34,948 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-08-19 01:57:34,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-08-19 01:57:34,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-08-19 01:57:34,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-08-19 01:57:34,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2020-08-19 01:57:34,957 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 43 [2020-08-19 01:57:34,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:57:34,958 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2020-08-19 01:57:34,958 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-19 01:57:34,958 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-08-19 01:57:34,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-08-19 01:57:34,968 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:57:34,968 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 01:57:34,968 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-19 01:57:34,969 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:57:34,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:57:34,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1716183644, now seen corresponding path program 6 times [2020-08-19 01:57:34,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:57:34,970 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [780826485] [2020-08-19 01:57:34,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:57:34,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:57:35,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:57:35,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:35,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:35,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:35,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:35,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:35,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:35,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,203 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-08-19 01:57:35,204 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [780826485] [2020-08-19 01:57:35,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:57:35,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-19 01:57:35,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776853755] [2020-08-19 01:57:35,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-19 01:57:35,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:57:35,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-19 01:57:35,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-08-19 01:57:35,206 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 11 states. [2020-08-19 01:57:35,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:57:35,329 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2020-08-19 01:57:35,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-19 01:57:35,329 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2020-08-19 01:57:35,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:57:35,331 INFO L225 Difference]: With dead ends: 40 [2020-08-19 01:57:35,331 INFO L226 Difference]: Without dead ends: 36 [2020-08-19 01:57:35,332 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2020-08-19 01:57:35,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-08-19 01:57:35,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-08-19 01:57:35,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-08-19 01:57:35,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2020-08-19 01:57:35,338 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 49 [2020-08-19 01:57:35,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:57:35,339 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2020-08-19 01:57:35,339 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-19 01:57:35,339 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2020-08-19 01:57:35,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-08-19 01:57:35,340 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:57:35,340 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 01:57:35,340 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-19 01:57:35,341 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:57:35,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:57:35,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1079602236, now seen corresponding path program 7 times [2020-08-19 01:57:35,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:57:35,342 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [633027550] [2020-08-19 01:57:35,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:57:35,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:57:35,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:57:35,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:35,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:35,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:35,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:35,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:35,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:35,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,565 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-08-19 01:57:35,566 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [633027550] [2020-08-19 01:57:35,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:57:35,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-08-19 01:57:35,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341128554] [2020-08-19 01:57:35,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-19 01:57:35,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:57:35,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-19 01:57:35,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-08-19 01:57:35,568 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 12 states. [2020-08-19 01:57:35,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:57:35,688 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2020-08-19 01:57:35,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-19 01:57:35,689 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2020-08-19 01:57:35,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:57:35,690 INFO L225 Difference]: With dead ends: 43 [2020-08-19 01:57:35,690 INFO L226 Difference]: Without dead ends: 39 [2020-08-19 01:57:35,691 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2020-08-19 01:57:35,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-08-19 01:57:35,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-08-19 01:57:35,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-08-19 01:57:35,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2020-08-19 01:57:35,698 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 55 [2020-08-19 01:57:35,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:57:35,698 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2020-08-19 01:57:35,698 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-19 01:57:35,698 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2020-08-19 01:57:35,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-08-19 01:57:35,699 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:57:35,699 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 01:57:35,700 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-19 01:57:35,700 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:57:35,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:57:35,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1035381916, now seen corresponding path program 8 times [2020-08-19 01:57:35,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:57:35,701 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [122018159] [2020-08-19 01:57:35,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:57:35,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:57:35,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:57:35,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:35,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:35,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:35,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:35,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:35,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:35,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:35,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:35,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:35,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:36,009 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-08-19 01:57:36,009 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [122018159] [2020-08-19 01:57:36,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:57:36,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-08-19 01:57:36,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010205684] [2020-08-19 01:57:36,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-19 01:57:36,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:57:36,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-19 01:57:36,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-08-19 01:57:36,017 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 13 states. [2020-08-19 01:57:36,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:57:36,167 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-08-19 01:57:36,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-08-19 01:57:36,168 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2020-08-19 01:57:36,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:57:36,169 INFO L225 Difference]: With dead ends: 46 [2020-08-19 01:57:36,170 INFO L226 Difference]: Without dead ends: 42 [2020-08-19 01:57:36,171 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2020-08-19 01:57:36,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-08-19 01:57:36,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-08-19 01:57:36,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-08-19 01:57:36,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2020-08-19 01:57:36,177 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 61 [2020-08-19 01:57:36,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:57:36,177 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-08-19 01:57:36,177 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-19 01:57:36,178 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-08-19 01:57:36,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-08-19 01:57:36,178 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:57:36,179 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 01:57:36,179 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-19 01:57:36,179 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:57:36,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:57:36,179 INFO L82 PathProgramCache]: Analyzing trace with hash 952137732, now seen corresponding path program 9 times [2020-08-19 01:57:36,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:57:36,180 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1462786856] [2020-08-19 01:57:36,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:57:36,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:36,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:57:36,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:36,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:57:36,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:36,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:36,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:36,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:36,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:36,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:36,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:36,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:36,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:36,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:36,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:36,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:36,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:36,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:36,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:36,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:36,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:36,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:36,502 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-08-19 01:57:36,502 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1462786856] [2020-08-19 01:57:36,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:57:36,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-08-19 01:57:36,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004941614] [2020-08-19 01:57:36,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-08-19 01:57:36,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:57:36,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-08-19 01:57:36,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2020-08-19 01:57:36,504 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 14 states. [2020-08-19 01:57:36,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:57:36,657 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-08-19 01:57:36,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-19 01:57:36,658 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2020-08-19 01:57:36,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:57:36,659 INFO L225 Difference]: With dead ends: 49 [2020-08-19 01:57:36,659 INFO L226 Difference]: Without dead ends: 45 [2020-08-19 01:57:36,660 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2020-08-19 01:57:36,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-08-19 01:57:36,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-08-19 01:57:36,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-08-19 01:57:36,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2020-08-19 01:57:36,666 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 67 [2020-08-19 01:57:36,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:57:36,667 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2020-08-19 01:57:36,667 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-08-19 01:57:36,667 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2020-08-19 01:57:36,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-08-19 01:57:36,668 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:57:36,668 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 01:57:36,668 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-19 01:57:36,668 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:57:36,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:57:36,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1540970204, now seen corresponding path program 10 times [2020-08-19 01:57:36,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:57:36,669 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [972344522] [2020-08-19 01:57:36,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:57:36,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:36,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:57:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:36,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:57:36,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:36,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:36,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:36,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:36,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:36,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:36,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:36,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:36,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:36,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:36,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:36,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:36,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:36,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:36,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:36,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:36,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:36,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:36,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:36,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:37,011 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2020-08-19 01:57:37,012 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [972344522] [2020-08-19 01:57:37,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:57:37,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-08-19 01:57:37,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224728942] [2020-08-19 01:57:37,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-08-19 01:57:37,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:57:37,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-08-19 01:57:37,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2020-08-19 01:57:37,014 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 15 states. [2020-08-19 01:57:37,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:57:37,179 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2020-08-19 01:57:37,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-08-19 01:57:37,180 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 73 [2020-08-19 01:57:37,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:57:37,181 INFO L225 Difference]: With dead ends: 52 [2020-08-19 01:57:37,181 INFO L226 Difference]: Without dead ends: 48 [2020-08-19 01:57:37,182 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=236, Invalid=414, Unknown=0, NotChecked=0, Total=650 [2020-08-19 01:57:37,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-08-19 01:57:37,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-08-19 01:57:37,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-08-19 01:57:37,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2020-08-19 01:57:37,189 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 73 [2020-08-19 01:57:37,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:57:37,189 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2020-08-19 01:57:37,190 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-08-19 01:57:37,190 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2020-08-19 01:57:37,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-08-19 01:57:37,191 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:57:37,191 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 01:57:37,191 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-19 01:57:37,191 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:57:37,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:57:37,192 INFO L82 PathProgramCache]: Analyzing trace with hash -2010530748, now seen corresponding path program 11 times [2020-08-19 01:57:37,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:57:37,192 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [663378320] [2020-08-19 01:57:37,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:57:37,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:37,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:57:37,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:37,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:57:37,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:37,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:37,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:37,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:37,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:37,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:37,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:37,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:37,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:37,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:37,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:37,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:37,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:37,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:37,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:37,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:37,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:37,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:37,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:37,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:37,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:37,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:37,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:37,670 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2020-08-19 01:57:37,671 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [663378320] [2020-08-19 01:57:37,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:57:37,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-08-19 01:57:37,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044878488] [2020-08-19 01:57:37,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-08-19 01:57:37,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:57:37,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-08-19 01:57:37,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2020-08-19 01:57:37,674 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 16 states. [2020-08-19 01:57:37,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:57:37,941 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2020-08-19 01:57:37,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-19 01:57:37,942 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 79 [2020-08-19 01:57:37,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:57:37,944 INFO L225 Difference]: With dead ends: 55 [2020-08-19 01:57:37,944 INFO L226 Difference]: Without dead ends: 51 [2020-08-19 01:57:37,945 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=275, Invalid=481, Unknown=0, NotChecked=0, Total=756 [2020-08-19 01:57:37,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-08-19 01:57:37,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-08-19 01:57:37,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-08-19 01:57:37,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2020-08-19 01:57:37,951 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 79 [2020-08-19 01:57:37,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:57:37,952 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2020-08-19 01:57:37,952 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-08-19 01:57:37,953 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2020-08-19 01:57:37,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-08-19 01:57:37,954 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:57:37,954 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 01:57:37,954 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-19 01:57:37,954 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:57:37,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:57:37,955 INFO L82 PathProgramCache]: Analyzing trace with hash -986521316, now seen corresponding path program 12 times [2020-08-19 01:57:37,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:57:37,955 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1291224877] [2020-08-19 01:57:37,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:57:37,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:38,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:57:38,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:38,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:57:38,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:38,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:38,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:38,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:38,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:38,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:38,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:38,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:38,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:38,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:38,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:38,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:38,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:38,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:38,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:38,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:38,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:38,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:38,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:38,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:38,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:38,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:38,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:38,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:38,508 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2020-08-19 01:57:38,509 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1291224877] [2020-08-19 01:57:38,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:57:38,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-08-19 01:57:38,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858384351] [2020-08-19 01:57:38,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-08-19 01:57:38,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:57:38,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-08-19 01:57:38,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=163, Unknown=0, NotChecked=0, Total=272 [2020-08-19 01:57:38,512 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 17 states. [2020-08-19 01:57:38,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:57:38,744 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2020-08-19 01:57:38,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-08-19 01:57:38,745 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2020-08-19 01:57:38,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:57:38,746 INFO L225 Difference]: With dead ends: 58 [2020-08-19 01:57:38,746 INFO L226 Difference]: Without dead ends: 54 [2020-08-19 01:57:38,747 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=317, Invalid=553, Unknown=0, NotChecked=0, Total=870 [2020-08-19 01:57:38,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-08-19 01:57:38,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-08-19 01:57:38,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-08-19 01:57:38,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2020-08-19 01:57:38,753 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 85 [2020-08-19 01:57:38,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:57:38,753 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2020-08-19 01:57:38,753 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-08-19 01:57:38,753 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2020-08-19 01:57:38,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-08-19 01:57:38,754 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:57:38,754 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 01:57:38,754 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-19 01:57:38,755 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:57:38,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:57:38,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1073897604, now seen corresponding path program 13 times [2020-08-19 01:57:38,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:57:38,756 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [723432802] [2020-08-19 01:57:38,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:57:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:38,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:57:38,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:38,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:57:38,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:38,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:38,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:38,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:38,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:38,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:38,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:38,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:39,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:39,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:39,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:39,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:39,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:39,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:39,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:39,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:39,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:39,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:39,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:39,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:39,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:39,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:39,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:39,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:39,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:39,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:39,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:39,374 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2020-08-19 01:57:39,374 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [723432802] [2020-08-19 01:57:39,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:57:39,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-08-19 01:57:39,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696281615] [2020-08-19 01:57:39,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-08-19 01:57:39,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:57:39,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-08-19 01:57:39,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=182, Unknown=0, NotChecked=0, Total=306 [2020-08-19 01:57:39,376 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 18 states. [2020-08-19 01:57:39,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:57:39,584 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2020-08-19 01:57:39,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-08-19 01:57:39,585 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 91 [2020-08-19 01:57:39,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:57:39,586 INFO L225 Difference]: With dead ends: 61 [2020-08-19 01:57:39,586 INFO L226 Difference]: Without dead ends: 57 [2020-08-19 01:57:39,588 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=362, Invalid=630, Unknown=0, NotChecked=0, Total=992 [2020-08-19 01:57:39,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-08-19 01:57:39,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-08-19 01:57:39,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-08-19 01:57:39,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2020-08-19 01:57:39,595 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 91 [2020-08-19 01:57:39,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:57:39,595 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2020-08-19 01:57:39,595 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-08-19 01:57:39,595 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2020-08-19 01:57:39,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-08-19 01:57:39,596 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:57:39,596 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 01:57:39,597 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-08-19 01:57:39,597 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:57:39,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:57:39,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1572648100, now seen corresponding path program 14 times [2020-08-19 01:57:39,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:57:39,601 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [365723070] [2020-08-19 01:57:39,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:57:39,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:39,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:57:39,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:39,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:57:39,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:39,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:39,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:39,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:39,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:39,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:39,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:39,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:39,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:39,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:39,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:39,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:39,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:39,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:39,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:39,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:39,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:40,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:40,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:40,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:40,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:40,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:40,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:40,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:40,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:40,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:40,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:40,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:40,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:40,205 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2020-08-19 01:57:40,206 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [365723070] [2020-08-19 01:57:40,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:57:40,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-08-19 01:57:40,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056836862] [2020-08-19 01:57:40,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-08-19 01:57:40,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:57:40,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-08-19 01:57:40,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=202, Unknown=0, NotChecked=0, Total=342 [2020-08-19 01:57:40,208 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 19 states. [2020-08-19 01:57:40,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:57:40,473 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2020-08-19 01:57:40,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-08-19 01:57:40,474 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 97 [2020-08-19 01:57:40,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:57:40,475 INFO L225 Difference]: With dead ends: 64 [2020-08-19 01:57:40,476 INFO L226 Difference]: Without dead ends: 60 [2020-08-19 01:57:40,477 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=410, Invalid=712, Unknown=0, NotChecked=0, Total=1122 [2020-08-19 01:57:40,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-08-19 01:57:40,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2020-08-19 01:57:40,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-08-19 01:57:40,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2020-08-19 01:57:40,484 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 97 [2020-08-19 01:57:40,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:57:40,485 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2020-08-19 01:57:40,485 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-08-19 01:57:40,485 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2020-08-19 01:57:40,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-08-19 01:57:40,486 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:57:40,487 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 01:57:40,487 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-08-19 01:57:40,487 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:57:40,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:57:40,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1584030916, now seen corresponding path program 15 times [2020-08-19 01:57:40,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:57:40,488 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [507853440] [2020-08-19 01:57:40,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:57:40,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:40,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:57:40,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:40,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:57:40,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:40,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:40,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:40,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:40,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:40,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:40,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:40,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:40,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:40,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:40,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:40,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:40,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:40,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:40,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:40,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:40,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:40,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:40,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:40,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:40,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:40,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:40,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:40,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:41,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:41,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:41,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:41,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:41,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:41,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:41,136 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2020-08-19 01:57:41,136 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [507853440] [2020-08-19 01:57:41,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:57:41,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-08-19 01:57:41,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832050350] [2020-08-19 01:57:41,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-08-19 01:57:41,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:57:41,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-08-19 01:57:41,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=223, Unknown=0, NotChecked=0, Total=380 [2020-08-19 01:57:41,138 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 20 states. [2020-08-19 01:57:41,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:57:41,434 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2020-08-19 01:57:41,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-08-19 01:57:41,434 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 103 [2020-08-19 01:57:41,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:57:41,435 INFO L225 Difference]: With dead ends: 67 [2020-08-19 01:57:41,436 INFO L226 Difference]: Without dead ends: 63 [2020-08-19 01:57:41,437 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=461, Invalid=799, Unknown=0, NotChecked=0, Total=1260 [2020-08-19 01:57:41,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-08-19 01:57:41,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-08-19 01:57:41,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-08-19 01:57:41,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2020-08-19 01:57:41,448 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 103 [2020-08-19 01:57:41,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:57:41,449 INFO L479 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2020-08-19 01:57:41,449 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-08-19 01:57:41,449 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2020-08-19 01:57:41,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-08-19 01:57:41,452 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:57:41,452 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 01:57:41,452 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-08-19 01:57:41,452 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:57:41,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:57:41,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1066046876, now seen corresponding path program 16 times [2020-08-19 01:57:41,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:57:41,454 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [872696177] [2020-08-19 01:57:41,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:57:41,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:41,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:57:41,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:41,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:57:41,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:41,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:41,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:41,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:41,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:41,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:41,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:41,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:41,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:41,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:41,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:41,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:41,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:41,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:41,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:41,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:41,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:41,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:41,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:41,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:41,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:41,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:41,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:41,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:41,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:41,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:41,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:41,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:41,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:41,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:41,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:42,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:42,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:42,144 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2020-08-19 01:57:42,145 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [872696177] [2020-08-19 01:57:42,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:57:42,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2020-08-19 01:57:42,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752652134] [2020-08-19 01:57:42,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-08-19 01:57:42,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:57:42,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-08-19 01:57:42,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=245, Unknown=0, NotChecked=0, Total=420 [2020-08-19 01:57:42,147 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 21 states. [2020-08-19 01:57:42,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:57:42,406 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2020-08-19 01:57:42,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-08-19 01:57:42,407 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 109 [2020-08-19 01:57:42,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:57:42,408 INFO L225 Difference]: With dead ends: 70 [2020-08-19 01:57:42,408 INFO L226 Difference]: Without dead ends: 66 [2020-08-19 01:57:42,410 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=515, Invalid=891, Unknown=0, NotChecked=0, Total=1406 [2020-08-19 01:57:42,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-08-19 01:57:42,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2020-08-19 01:57:42,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-08-19 01:57:42,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2020-08-19 01:57:42,423 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 109 [2020-08-19 01:57:42,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:57:42,423 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2020-08-19 01:57:42,423 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-08-19 01:57:42,423 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2020-08-19 01:57:42,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-08-19 01:57:42,426 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:57:42,426 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 01:57:42,426 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-08-19 01:57:42,426 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:57:42,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:57:42,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1300351236, now seen corresponding path program 17 times [2020-08-19 01:57:42,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:57:42,427 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [896743780] [2020-08-19 01:57:42,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:57:42,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:42,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:57:42,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:42,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:57:42,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:42,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:42,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:42,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:42,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:42,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:42,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:42,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:42,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:42,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:42,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:42,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:42,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:42,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:42,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:42,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:42,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:42,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:42,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:42,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:42,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:42,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:42,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:42,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:43,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:43,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:43,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:43,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:43,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:43,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:43,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:43,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:43,348 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2020-08-19 01:57:43,348 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [896743780] [2020-08-19 01:57:43,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:57:43,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-08-19 01:57:43,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277649670] [2020-08-19 01:57:43,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-08-19 01:57:43,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:57:43,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-08-19 01:57:43,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=268, Unknown=0, NotChecked=0, Total=462 [2020-08-19 01:57:43,357 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 22 states. [2020-08-19 01:57:43,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:57:43,657 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2020-08-19 01:57:43,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-08-19 01:57:43,657 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 115 [2020-08-19 01:57:43,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:57:43,658 INFO L225 Difference]: With dead ends: 73 [2020-08-19 01:57:43,659 INFO L226 Difference]: Without dead ends: 69 [2020-08-19 01:57:43,660 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=572, Invalid=988, Unknown=0, NotChecked=0, Total=1560 [2020-08-19 01:57:43,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-08-19 01:57:43,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-08-19 01:57:43,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-08-19 01:57:43,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2020-08-19 01:57:43,666 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 115 [2020-08-19 01:57:43,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:57:43,666 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2020-08-19 01:57:43,667 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-08-19 01:57:43,670 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2020-08-19 01:57:43,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-08-19 01:57:43,672 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:57:43,672 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 01:57:43,673 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-08-19 01:57:43,673 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:57:43,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:57:43,673 INFO L82 PathProgramCache]: Analyzing trace with hash 227065820, now seen corresponding path program 18 times [2020-08-19 01:57:43,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:57:43,675 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1922595409] [2020-08-19 01:57:43,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:57:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:43,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:57:43,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:43,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:57:43,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:43,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:43,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:43,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:43,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:43,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:43,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:43,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:44,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:44,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:44,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:44,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:44,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:44,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:44,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:44,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:44,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:44,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:44,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:44,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:44,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:44,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:44,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:44,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:44,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:44,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:44,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:44,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:44,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:44,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:44,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:44,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:44,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:44,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:44,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:44,782 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2020-08-19 01:57:44,782 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1922595409] [2020-08-19 01:57:44,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:57:44,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-08-19 01:57:44,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477907124] [2020-08-19 01:57:44,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-08-19 01:57:44,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:57:44,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-08-19 01:57:44,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=292, Unknown=0, NotChecked=0, Total=506 [2020-08-19 01:57:44,788 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 23 states. [2020-08-19 01:57:45,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:57:45,203 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2020-08-19 01:57:45,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-08-19 01:57:45,203 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 121 [2020-08-19 01:57:45,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:57:45,205 INFO L225 Difference]: With dead ends: 76 [2020-08-19 01:57:45,205 INFO L226 Difference]: Without dead ends: 72 [2020-08-19 01:57:45,206 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=632, Invalid=1090, Unknown=0, NotChecked=0, Total=1722 [2020-08-19 01:57:45,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-08-19 01:57:45,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2020-08-19 01:57:45,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-08-19 01:57:45,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2020-08-19 01:57:45,214 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 121 [2020-08-19 01:57:45,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:57:45,215 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2020-08-19 01:57:45,215 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-08-19 01:57:45,215 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2020-08-19 01:57:45,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2020-08-19 01:57:45,216 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:57:45,217 INFO L422 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 01:57:45,217 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-08-19 01:57:45,217 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:57:45,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:57:45,217 INFO L82 PathProgramCache]: Analyzing trace with hash -479687356, now seen corresponding path program 19 times [2020-08-19 01:57:45,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:57:45,218 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1703125099] [2020-08-19 01:57:45,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:57:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:45,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:57:45,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:45,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:57:45,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:45,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:45,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:45,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:45,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:45,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:45,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:45,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:45,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:45,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:45,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:45,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:45,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:45,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:45,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:45,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:45,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:45,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:45,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:45,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:45,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:45,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:45,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:45,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:45,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:45,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:45,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:45,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:45,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:45,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:45,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:45,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:46,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:46,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:46,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:46,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-19 01:57:46,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:57:46,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2020-08-19 01:57:46,184 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1703125099] [2020-08-19 01:57:46,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:57:46,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-08-19 01:57:46,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645573092] [2020-08-19 01:57:46,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-08-19 01:57:46,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:57:46,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-08-19 01:57:46,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=317, Unknown=0, NotChecked=0, Total=552 [2020-08-19 01:57:46,186 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 24 states. [2020-08-19 01:57:46,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:57:46,591 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2020-08-19 01:57:46,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-08-19 01:57:46,592 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 127 [2020-08-19 01:57:46,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:57:46,593 INFO L225 Difference]: With dead ends: 79 [2020-08-19 01:57:46,593 INFO L226 Difference]: Without dead ends: 75 [2020-08-19 01:57:46,598 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=695, Invalid=1197, Unknown=0, NotChecked=0, Total=1892 [2020-08-19 01:57:46,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-08-19 01:57:46,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2020-08-19 01:57:46,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-08-19 01:57:46,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2020-08-19 01:57:46,609 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 127 [2020-08-19 01:57:46,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:57:46,613 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2020-08-19 01:57:46,613 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-08-19 01:57:46,614 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2020-08-19 01:57:46,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-08-19 01:57:46,615 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:57:46,615 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 01:57:46,616 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-08-19 01:57:46,616 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:57:46,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:57:46,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1598174692, now seen corresponding path program 20 times [2020-08-19 01:57:46,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:57:46,617 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [640162077] [2020-08-19 01:57:46,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:57:46,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-19 01:57:46,655 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-19 01:57:46,655 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-19 01:57:46,662 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-08-19 01:57:46,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.08 01:57:46 BoogieIcfgContainer [2020-08-19 01:57:46,728 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-19 01:57:46,731 INFO L168 Benchmark]: Toolchain (without parser) took 14399.82 ms. Allocated memory was 139.5 MB in the beginning and 480.8 MB in the end (delta: 341.3 MB). Free memory was 102.4 MB in the beginning and 449.7 MB in the end (delta: -347.3 MB). Peak memory consumption was 353.9 MB. Max. memory is 7.1 GB. [2020-08-19 01:57:46,731 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-08-19 01:57:46,732 INFO L168 Benchmark]: CACSL2BoogieTranslator took 220.30 ms. Allocated memory is still 139.5 MB. Free memory was 102.2 MB in the beginning and 92.9 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-08-19 01:57:46,733 INFO L168 Benchmark]: Boogie Preprocessor took 102.54 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 92.9 MB in the beginning and 181.5 MB in the end (delta: -88.6 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. [2020-08-19 01:57:46,733 INFO L168 Benchmark]: RCFGBuilder took 242.69 ms. Allocated memory is still 202.4 MB. Free memory was 181.5 MB in the beginning and 169.6 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 7.1 GB. [2020-08-19 01:57:46,734 INFO L168 Benchmark]: TraceAbstraction took 13829.37 ms. Allocated memory was 202.4 MB in the beginning and 480.8 MB in the end (delta: 278.4 MB). Free memory was 168.9 MB in the beginning and 449.7 MB in the end (delta: -280.8 MB). Peak memory consumption was 357.5 MB. Max. memory is 7.1 GB. [2020-08-19 01:57:46,736 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.24 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 220.30 ms. Allocated memory is still 139.5 MB. Free memory was 102.2 MB in the beginning and 92.9 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 102.54 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 92.9 MB in the beginning and 181.5 MB in the end (delta: -88.6 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 242.69 ms. Allocated memory is still 202.4 MB. Free memory was 181.5 MB in the beginning and 169.6 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13829.37 ms. Allocated memory was 202.4 MB in the beginning and 480.8 MB in the end (delta: 278.4 MB). Free memory was 168.9 MB in the beginning and 449.7 MB in the end (delta: -280.8 MB). Peak memory consumption was 357.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 16]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int a = 20; [L13] int b = 0; [L14] CALL, EXPR sum(a, b) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND TRUE n <= 0 [L5] return m + n; [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L14] RET, EXPR sum(a, b) [L14] int result = sum(a, b); [L15] COND TRUE result == a + b [L16] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.7s, OverallIterations: 21, TraceHistogramMax: 21, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 243 SDtfs, 523 SDslu, 1120 SDs, 0 SdLazy, 809 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 940 GetRequests, 480 SyntacticMatches, 0 SemanticMatches, 460 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2470 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 1533 NumberOfCodeBlocks, 1533 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1380 ConstructedInterpolants, 0 QuantifiedInterpolants, 301200 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 1 PerfectInterpolantSequences, 3800/7600 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...