/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 false -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/locks/test_locks_9.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-eb0fd7c [2020-09-21 10:20:41,145 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-21 10:20:41,149 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-21 10:20:41,177 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-21 10:20:41,177 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-21 10:20:41,179 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-21 10:20:41,180 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-21 10:20:41,182 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-21 10:20:41,184 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-21 10:20:41,185 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-21 10:20:41,186 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-21 10:20:41,187 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-21 10:20:41,188 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-21 10:20:41,189 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-21 10:20:41,190 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-21 10:20:41,191 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-21 10:20:41,192 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-21 10:20:41,193 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-21 10:20:41,195 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-21 10:20:41,197 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-21 10:20:41,199 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-21 10:20:41,200 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-21 10:20:41,202 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-21 10:20:41,203 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-21 10:20:41,208 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-21 10:20:41,208 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-21 10:20:41,208 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-21 10:20:41,212 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-21 10:20:41,213 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-21 10:20:41,214 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-21 10:20:41,214 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-21 10:20:41,217 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-21 10:20:41,218 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-21 10:20:41,219 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-21 10:20:41,221 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-21 10:20:41,221 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-21 10:20:41,222 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-21 10:20:41,222 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-21 10:20:41,223 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-21 10:20:41,224 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-21 10:20:41,226 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-21 10:20:41,227 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-09-21 10:20:41,284 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-21 10:20:41,284 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-21 10:20:41,286 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-21 10:20:41,286 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-21 10:20:41,286 INFO L138 SettingsManager]: * Use SBE=true [2020-09-21 10:20:41,286 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-21 10:20:41,287 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-21 10:20:41,287 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-21 10:20:41,288 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-21 10:20:41,288 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-21 10:20:41,289 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-21 10:20:41,289 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-21 10:20:41,289 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-21 10:20:41,290 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-21 10:20:41,290 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-21 10:20:41,290 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-21 10:20:41,290 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-21 10:20:41,290 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-21 10:20:41,291 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-21 10:20:41,291 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-21 10:20:41,291 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-21 10:20:41,291 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-21 10:20:41,291 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-21 10:20:41,292 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-21 10:20:41,292 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-21 10:20:41,292 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-21 10:20:41,292 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-21 10:20:41,293 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-21 10:20:41,293 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-21 10:20:41,293 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 -> false [2020-09-21 10:20:41,811 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-21 10:20:41,837 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-21 10:20:41,841 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-21 10:20:41,843 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-21 10:20:41,844 INFO L275 PluginConnector]: CDTParser initialized [2020-09-21 10:20:41,845 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_9.c [2020-09-21 10:20:41,936 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5d27896f5/4efb662997ec40569b2808fe275bb113/FLAGec8418bc4 [2020-09-21 10:20:42,524 INFO L306 CDTParser]: Found 1 translation units. [2020-09-21 10:20:42,525 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/locks/test_locks_9.c [2020-09-21 10:20:42,535 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5d27896f5/4efb662997ec40569b2808fe275bb113/FLAGec8418bc4 [2020-09-21 10:20:42,867 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5d27896f5/4efb662997ec40569b2808fe275bb113 [2020-09-21 10:20:42,882 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-21 10:20:42,889 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-21 10:20:42,891 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-21 10:20:42,891 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-21 10:20:42,896 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-21 10:20:42,897 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 10:20:42" (1/1) ... [2020-09-21 10:20:42,902 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@291cbb33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:20:42, skipping insertion in model container [2020-09-21 10:20:42,903 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 10:20:42" (1/1) ... [2020-09-21 10:20:42,913 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-21 10:20:42,948 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-21 10:20:43,169 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 10:20:43,175 INFO L203 MainTranslator]: Completed pre-run [2020-09-21 10:20:43,206 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 10:20:43,225 INFO L208 MainTranslator]: Completed translation [2020-09-21 10:20:43,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:20:43 WrapperNode [2020-09-21 10:20:43,226 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-21 10:20:43,227 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-21 10:20:43,227 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-21 10:20:43,227 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-21 10:20:43,318 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:20:43" (1/1) ... [2020-09-21 10:20:43,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:20:43" (1/1) ... [2020-09-21 10:20:43,328 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:20:43" (1/1) ... [2020-09-21 10:20:43,328 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:20:43" (1/1) ... [2020-09-21 10:20:43,335 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:20:43" (1/1) ... [2020-09-21 10:20:43,343 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:20:43" (1/1) ... [2020-09-21 10:20:43,347 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:20:43" (1/1) ... [2020-09-21 10:20:43,353 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-21 10:20:43,354 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-21 10:20:43,354 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-21 10:20:43,354 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-21 10:20:43,356 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:20:43" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-21 10:20:43,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-21 10:20:43,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-21 10:20:43,423 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-21 10:20:43,424 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-21 10:20:43,424 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-21 10:20:43,424 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-21 10:20:43,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-21 10:20:43,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-21 10:20:43,718 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-21 10:20:43,719 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-21 10:20:43,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 10:20:43 BoogieIcfgContainer [2020-09-21 10:20:43,724 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-21 10:20:43,726 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-21 10:20:43,726 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-21 10:20:43,730 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-21 10:20:43,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 10:20:42" (1/3) ... [2020-09-21 10:20:43,732 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d2d9ca0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 10:20:43, skipping insertion in model container [2020-09-21 10:20:43,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:20:43" (2/3) ... [2020-09-21 10:20:43,732 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d2d9ca0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 10:20:43, skipping insertion in model container [2020-09-21 10:20:43,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 10:20:43" (3/3) ... [2020-09-21 10:20:43,735 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_9.c [2020-09-21 10:20:43,753 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-21 10:20:43,763 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-21 10:20:43,791 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-21 10:20:43,838 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-21 10:20:43,838 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-21 10:20:43,839 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-21 10:20:43,839 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-21 10:20:43,839 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-21 10:20:43,839 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-21 10:20:43,839 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-21 10:20:43,839 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-21 10:20:43,886 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2020-09-21 10:20:43,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-21 10:20:43,895 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:43,896 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:20:43,897 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:43,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:43,906 INFO L82 PathProgramCache]: Analyzing trace with hash 691982780, now seen corresponding path program 1 times [2020-09-21 10:20:43,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:43,918 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1948468948] [2020-09-21 10:20:43,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:44,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:44,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:44,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:44,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:44,138 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1948468948] [2020-09-21 10:20:44,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:20:44,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-21 10:20:44,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427762383] [2020-09-21 10:20:44,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-21 10:20:44,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:44,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-21 10:20:44,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-21 10:20:44,163 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 3 states. [2020-09-21 10:20:44,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:44,244 INFO L93 Difference]: Finished difference Result 81 states and 138 transitions. [2020-09-21 10:20:44,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-21 10:20:44,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-09-21 10:20:44,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:44,261 INFO L225 Difference]: With dead ends: 81 [2020-09-21 10:20:44,262 INFO L226 Difference]: Without dead ends: 66 [2020-09-21 10:20:44,266 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-21 10:20:44,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-09-21 10:20:44,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2020-09-21 10:20:44,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-09-21 10:20:44,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 81 transitions. [2020-09-21 10:20:44,317 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 81 transitions. Word has length 19 [2020-09-21 10:20:44,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:44,317 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 81 transitions. [2020-09-21 10:20:44,317 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-21 10:20:44,318 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 81 transitions. [2020-09-21 10:20:44,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-21 10:20:44,319 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:44,319 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:20:44,320 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-21 10:20:44,320 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:44,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:44,320 INFO L82 PathProgramCache]: Analyzing trace with hash 950148218, now seen corresponding path program 1 times [2020-09-21 10:20:44,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:44,321 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [83948992] [2020-09-21 10:20:44,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:44,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:44,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:44,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:44,390 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [83948992] [2020-09-21 10:20:44,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:20:44,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-21 10:20:44,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113723202] [2020-09-21 10:20:44,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-21 10:20:44,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:44,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-21 10:20:44,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-21 10:20:44,394 INFO L87 Difference]: Start difference. First operand 46 states and 81 transitions. Second operand 3 states. [2020-09-21 10:20:44,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:44,423 INFO L93 Difference]: Finished difference Result 107 states and 192 transitions. [2020-09-21 10:20:44,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-21 10:20:44,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-09-21 10:20:44,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:44,426 INFO L225 Difference]: With dead ends: 107 [2020-09-21 10:20:44,427 INFO L226 Difference]: Without dead ends: 66 [2020-09-21 10:20:44,428 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-21 10:20:44,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-09-21 10:20:44,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2020-09-21 10:20:44,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-09-21 10:20:44,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 113 transitions. [2020-09-21 10:20:44,440 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 113 transitions. Word has length 19 [2020-09-21 10:20:44,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:44,440 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 113 transitions. [2020-09-21 10:20:44,440 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-21 10:20:44,441 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 113 transitions. [2020-09-21 10:20:44,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-09-21 10:20:44,442 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:44,442 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:20:44,442 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-21 10:20:44,443 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:44,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:44,443 INFO L82 PathProgramCache]: Analyzing trace with hash -23156596, now seen corresponding path program 1 times [2020-09-21 10:20:44,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:44,444 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [693304111] [2020-09-21 10:20:44,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:44,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:44,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:44,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:44,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:44,524 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [693304111] [2020-09-21 10:20:44,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:20:44,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-21 10:20:44,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328552106] [2020-09-21 10:20:44,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-21 10:20:44,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:44,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-21 10:20:44,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-21 10:20:44,527 INFO L87 Difference]: Start difference. First operand 64 states and 113 transitions. Second operand 3 states. [2020-09-21 10:20:44,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:44,553 INFO L93 Difference]: Finished difference Result 99 states and 171 transitions. [2020-09-21 10:20:44,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-21 10:20:44,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-09-21 10:20:44,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:44,555 INFO L225 Difference]: With dead ends: 99 [2020-09-21 10:20:44,555 INFO L226 Difference]: Without dead ends: 69 [2020-09-21 10:20:44,556 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-21 10:20:44,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-09-21 10:20:44,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2020-09-21 10:20:44,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-09-21 10:20:44,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 115 transitions. [2020-09-21 10:20:44,568 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 115 transitions. Word has length 20 [2020-09-21 10:20:44,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:44,570 INFO L479 AbstractCegarLoop]: Abstraction has 67 states and 115 transitions. [2020-09-21 10:20:44,570 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-21 10:20:44,571 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 115 transitions. [2020-09-21 10:20:44,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-09-21 10:20:44,572 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:44,572 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:20:44,572 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-21 10:20:44,573 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:44,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:44,573 INFO L82 PathProgramCache]: Analyzing trace with hash -609962610, now seen corresponding path program 1 times [2020-09-21 10:20:44,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:44,574 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [76894165] [2020-09-21 10:20:44,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:44,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:44,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:44,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:44,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:44,677 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [76894165] [2020-09-21 10:20:44,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:20:44,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-21 10:20:44,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855502509] [2020-09-21 10:20:44,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-21 10:20:44,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:44,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-21 10:20:44,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-21 10:20:44,680 INFO L87 Difference]: Start difference. First operand 67 states and 115 transitions. Second operand 3 states. [2020-09-21 10:20:44,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:44,701 INFO L93 Difference]: Finished difference Result 124 states and 216 transitions. [2020-09-21 10:20:44,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-21 10:20:44,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-09-21 10:20:44,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:44,704 INFO L225 Difference]: With dead ends: 124 [2020-09-21 10:20:44,704 INFO L226 Difference]: Without dead ends: 122 [2020-09-21 10:20:44,705 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-21 10:20:44,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-09-21 10:20:44,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 88. [2020-09-21 10:20:44,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-09-21 10:20:44,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 152 transitions. [2020-09-21 10:20:44,718 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 152 transitions. Word has length 20 [2020-09-21 10:20:44,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:44,718 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 152 transitions. [2020-09-21 10:20:44,719 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-21 10:20:44,719 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 152 transitions. [2020-09-21 10:20:44,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-09-21 10:20:44,720 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:44,720 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:20:44,720 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-21 10:20:44,721 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:44,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:44,721 INFO L82 PathProgramCache]: Analyzing trace with hash -351797172, now seen corresponding path program 1 times [2020-09-21 10:20:44,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:44,722 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1481140715] [2020-09-21 10:20:44,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:44,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:44,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:44,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:44,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:44,768 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1481140715] [2020-09-21 10:20:44,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:20:44,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-21 10:20:44,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180163542] [2020-09-21 10:20:44,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-21 10:20:44,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:44,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-21 10:20:44,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-21 10:20:44,771 INFO L87 Difference]: Start difference. First operand 88 states and 152 transitions. Second operand 3 states. [2020-09-21 10:20:44,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:44,804 INFO L93 Difference]: Finished difference Result 204 states and 358 transitions. [2020-09-21 10:20:44,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-21 10:20:44,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-09-21 10:20:44,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:44,807 INFO L225 Difference]: With dead ends: 204 [2020-09-21 10:20:44,807 INFO L226 Difference]: Without dead ends: 124 [2020-09-21 10:20:44,808 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-21 10:20:44,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-09-21 10:20:44,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2020-09-21 10:20:44,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-09-21 10:20:44,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 210 transitions. [2020-09-21 10:20:44,822 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 210 transitions. Word has length 20 [2020-09-21 10:20:44,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:44,823 INFO L479 AbstractCegarLoop]: Abstraction has 122 states and 210 transitions. [2020-09-21 10:20:44,823 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-21 10:20:44,823 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 210 transitions. [2020-09-21 10:20:44,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-21 10:20:44,824 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:44,825 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:20:44,825 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-21 10:20:44,825 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:44,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:44,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1728757681, now seen corresponding path program 1 times [2020-09-21 10:20:44,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:44,826 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [374098331] [2020-09-21 10:20:44,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:44,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:44,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:44,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:44,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:44,867 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [374098331] [2020-09-21 10:20:44,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:20:44,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-21 10:20:44,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374173491] [2020-09-21 10:20:44,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-21 10:20:44,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:44,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-21 10:20:44,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-21 10:20:44,870 INFO L87 Difference]: Start difference. First operand 122 states and 210 transitions. Second operand 3 states. [2020-09-21 10:20:44,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:44,891 INFO L93 Difference]: Finished difference Result 183 states and 313 transitions. [2020-09-21 10:20:44,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-21 10:20:44,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-09-21 10:20:44,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:44,894 INFO L225 Difference]: With dead ends: 183 [2020-09-21 10:20:44,894 INFO L226 Difference]: Without dead ends: 126 [2020-09-21 10:20:44,895 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-21 10:20:44,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-09-21 10:20:44,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2020-09-21 10:20:44,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-09-21 10:20:44,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 210 transitions. [2020-09-21 10:20:44,926 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 210 transitions. Word has length 21 [2020-09-21 10:20:44,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:44,930 INFO L479 AbstractCegarLoop]: Abstraction has 124 states and 210 transitions. [2020-09-21 10:20:44,930 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-21 10:20:44,930 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 210 transitions. [2020-09-21 10:20:44,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-21 10:20:44,932 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:44,932 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:20:44,932 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-21 10:20:44,932 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:44,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:44,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1979403601, now seen corresponding path program 1 times [2020-09-21 10:20:44,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:44,937 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [938428809] [2020-09-21 10:20:44,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:44,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:45,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:45,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:45,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:45,011 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [938428809] [2020-09-21 10:20:45,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:20:45,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-21 10:20:45,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135663377] [2020-09-21 10:20:45,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-21 10:20:45,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:45,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-21 10:20:45,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-21 10:20:45,013 INFO L87 Difference]: Start difference. First operand 124 states and 210 transitions. Second operand 3 states. [2020-09-21 10:20:45,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:45,033 INFO L93 Difference]: Finished difference Result 228 states and 392 transitions. [2020-09-21 10:20:45,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-21 10:20:45,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-09-21 10:20:45,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:45,036 INFO L225 Difference]: With dead ends: 228 [2020-09-21 10:20:45,036 INFO L226 Difference]: Without dead ends: 226 [2020-09-21 10:20:45,037 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-21 10:20:45,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2020-09-21 10:20:45,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 168. [2020-09-21 10:20:45,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-09-21 10:20:45,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 282 transitions. [2020-09-21 10:20:45,051 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 282 transitions. Word has length 21 [2020-09-21 10:20:45,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:45,052 INFO L479 AbstractCegarLoop]: Abstraction has 168 states and 282 transitions. [2020-09-21 10:20:45,052 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-21 10:20:45,052 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 282 transitions. [2020-09-21 10:20:45,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-21 10:20:45,054 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:45,054 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:20:45,054 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-21 10:20:45,054 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:45,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:45,055 INFO L82 PathProgramCache]: Analyzing trace with hash -2057398257, now seen corresponding path program 1 times [2020-09-21 10:20:45,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:45,055 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [321355408] [2020-09-21 10:20:45,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:45,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:45,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:45,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:45,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:45,090 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [321355408] [2020-09-21 10:20:45,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:20:45,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-21 10:20:45,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404249526] [2020-09-21 10:20:45,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-21 10:20:45,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:45,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-21 10:20:45,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-21 10:20:45,093 INFO L87 Difference]: Start difference. First operand 168 states and 282 transitions. Second operand 3 states. [2020-09-21 10:20:45,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:45,117 INFO L93 Difference]: Finished difference Result 392 states and 664 transitions. [2020-09-21 10:20:45,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-21 10:20:45,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-09-21 10:20:45,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:45,119 INFO L225 Difference]: With dead ends: 392 [2020-09-21 10:20:45,119 INFO L226 Difference]: Without dead ends: 234 [2020-09-21 10:20:45,121 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-21 10:20:45,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2020-09-21 10:20:45,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 232. [2020-09-21 10:20:45,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2020-09-21 10:20:45,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 386 transitions. [2020-09-21 10:20:45,143 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 386 transitions. Word has length 21 [2020-09-21 10:20:45,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:45,144 INFO L479 AbstractCegarLoop]: Abstraction has 232 states and 386 transitions. [2020-09-21 10:20:45,144 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-21 10:20:45,144 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 386 transitions. [2020-09-21 10:20:45,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-21 10:20:45,147 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:45,147 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:20:45,147 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-21 10:20:45,149 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:45,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:45,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1232183873, now seen corresponding path program 1 times [2020-09-21 10:20:45,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:45,152 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [821414831] [2020-09-21 10:20:45,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:45,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:45,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:45,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:45,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:45,186 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [821414831] [2020-09-21 10:20:45,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:20:45,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-21 10:20:45,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951923085] [2020-09-21 10:20:45,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-21 10:20:45,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:45,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-21 10:20:45,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-21 10:20:45,188 INFO L87 Difference]: Start difference. First operand 232 states and 386 transitions. Second operand 3 states. [2020-09-21 10:20:45,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:45,221 INFO L93 Difference]: Finished difference Result 348 states and 576 transitions. [2020-09-21 10:20:45,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-21 10:20:45,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-09-21 10:20:45,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:45,226 INFO L225 Difference]: With dead ends: 348 [2020-09-21 10:20:45,227 INFO L226 Difference]: Without dead ends: 238 [2020-09-21 10:20:45,228 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-21 10:20:45,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-09-21 10:20:45,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2020-09-21 10:20:45,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2020-09-21 10:20:45,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 386 transitions. [2020-09-21 10:20:45,259 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 386 transitions. Word has length 22 [2020-09-21 10:20:45,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:45,259 INFO L479 AbstractCegarLoop]: Abstraction has 236 states and 386 transitions. [2020-09-21 10:20:45,259 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-21 10:20:45,260 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 386 transitions. [2020-09-21 10:20:45,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-21 10:20:45,264 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:45,264 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:20:45,265 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-21 10:20:45,265 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:45,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:45,265 INFO L82 PathProgramCache]: Analyzing trace with hash 645377859, now seen corresponding path program 1 times [2020-09-21 10:20:45,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:45,265 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [407260814] [2020-09-21 10:20:45,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:45,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:45,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:45,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:45,298 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [407260814] [2020-09-21 10:20:45,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:20:45,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-21 10:20:45,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053007663] [2020-09-21 10:20:45,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-21 10:20:45,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:45,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-21 10:20:45,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-21 10:20:45,300 INFO L87 Difference]: Start difference. First operand 236 states and 386 transitions. Second operand 3 states. [2020-09-21 10:20:45,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:45,324 INFO L93 Difference]: Finished difference Result 428 states and 712 transitions. [2020-09-21 10:20:45,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-21 10:20:45,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-09-21 10:20:45,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:45,327 INFO L225 Difference]: With dead ends: 428 [2020-09-21 10:20:45,327 INFO L226 Difference]: Without dead ends: 426 [2020-09-21 10:20:45,328 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-21 10:20:45,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2020-09-21 10:20:45,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 328. [2020-09-21 10:20:45,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2020-09-21 10:20:45,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 526 transitions. [2020-09-21 10:20:45,344 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 526 transitions. Word has length 22 [2020-09-21 10:20:45,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:45,346 INFO L479 AbstractCegarLoop]: Abstraction has 328 states and 526 transitions. [2020-09-21 10:20:45,346 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-21 10:20:45,346 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 526 transitions. [2020-09-21 10:20:45,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-21 10:20:45,354 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:45,354 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:20:45,354 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-21 10:20:45,354 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:45,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:45,356 INFO L82 PathProgramCache]: Analyzing trace with hash 903543297, now seen corresponding path program 1 times [2020-09-21 10:20:45,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:45,356 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [818821993] [2020-09-21 10:20:45,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:45,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:45,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:45,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:45,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:45,408 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [818821993] [2020-09-21 10:20:45,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:20:45,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-21 10:20:45,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229552399] [2020-09-21 10:20:45,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-21 10:20:45,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:45,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-21 10:20:45,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-21 10:20:45,410 INFO L87 Difference]: Start difference. First operand 328 states and 526 transitions. Second operand 3 states. [2020-09-21 10:20:45,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:45,453 INFO L93 Difference]: Finished difference Result 764 states and 1232 transitions. [2020-09-21 10:20:45,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-21 10:20:45,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-09-21 10:20:45,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:45,457 INFO L225 Difference]: With dead ends: 764 [2020-09-21 10:20:45,457 INFO L226 Difference]: Without dead ends: 450 [2020-09-21 10:20:45,460 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-21 10:20:45,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2020-09-21 10:20:45,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 448. [2020-09-21 10:20:45,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2020-09-21 10:20:45,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 710 transitions. [2020-09-21 10:20:45,480 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 710 transitions. Word has length 22 [2020-09-21 10:20:45,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:45,481 INFO L479 AbstractCegarLoop]: Abstraction has 448 states and 710 transitions. [2020-09-21 10:20:45,481 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-21 10:20:45,481 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 710 transitions. [2020-09-21 10:20:45,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-21 10:20:45,482 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:45,482 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:20:45,483 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-21 10:20:45,483 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:45,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:45,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1467908124, now seen corresponding path program 1 times [2020-09-21 10:20:45,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:45,484 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1741879471] [2020-09-21 10:20:45,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:45,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:45,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:45,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:45,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:45,513 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1741879471] [2020-09-21 10:20:45,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:20:45,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-21 10:20:45,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976077773] [2020-09-21 10:20:45,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-21 10:20:45,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:45,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-21 10:20:45,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-21 10:20:45,515 INFO L87 Difference]: Start difference. First operand 448 states and 710 transitions. Second operand 3 states. [2020-09-21 10:20:45,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:45,538 INFO L93 Difference]: Finished difference Result 672 states and 1060 transitions. [2020-09-21 10:20:45,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-21 10:20:45,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-09-21 10:20:45,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:45,541 INFO L225 Difference]: With dead ends: 672 [2020-09-21 10:20:45,541 INFO L226 Difference]: Without dead ends: 458 [2020-09-21 10:20:45,542 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-21 10:20:45,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2020-09-21 10:20:45,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 456. [2020-09-21 10:20:45,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2020-09-21 10:20:45,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 710 transitions. [2020-09-21 10:20:45,557 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 710 transitions. Word has length 23 [2020-09-21 10:20:45,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:45,557 INFO L479 AbstractCegarLoop]: Abstraction has 456 states and 710 transitions. [2020-09-21 10:20:45,557 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-21 10:20:45,557 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 710 transitions. [2020-09-21 10:20:45,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-21 10:20:45,558 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:45,559 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:20:45,559 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-21 10:20:45,559 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:45,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:45,560 INFO L82 PathProgramCache]: Analyzing trace with hash -2054714138, now seen corresponding path program 1 times [2020-09-21 10:20:45,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:45,560 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2015890685] [2020-09-21 10:20:45,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:45,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:45,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:45,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:45,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:45,588 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2015890685] [2020-09-21 10:20:45,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:20:45,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-21 10:20:45,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96471248] [2020-09-21 10:20:45,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-21 10:20:45,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:45,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-21 10:20:45,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-21 10:20:45,590 INFO L87 Difference]: Start difference. First operand 456 states and 710 transitions. Second operand 3 states. [2020-09-21 10:20:45,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:45,615 INFO L93 Difference]: Finished difference Result 812 states and 1288 transitions. [2020-09-21 10:20:45,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-21 10:20:45,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-09-21 10:20:45,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:45,620 INFO L225 Difference]: With dead ends: 812 [2020-09-21 10:20:45,620 INFO L226 Difference]: Without dead ends: 810 [2020-09-21 10:20:45,621 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-21 10:20:45,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2020-09-21 10:20:45,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 648. [2020-09-21 10:20:45,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2020-09-21 10:20:45,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 982 transitions. [2020-09-21 10:20:45,643 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 982 transitions. Word has length 23 [2020-09-21 10:20:45,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:45,643 INFO L479 AbstractCegarLoop]: Abstraction has 648 states and 982 transitions. [2020-09-21 10:20:45,644 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-21 10:20:45,644 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 982 transitions. [2020-09-21 10:20:45,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-21 10:20:45,645 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:45,646 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:20:45,646 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-21 10:20:45,646 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:45,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:45,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1796548700, now seen corresponding path program 1 times [2020-09-21 10:20:45,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:45,647 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [269956093] [2020-09-21 10:20:45,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:45,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:45,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:45,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:45,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:45,686 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [269956093] [2020-09-21 10:20:45,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:20:45,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-21 10:20:45,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534403539] [2020-09-21 10:20:45,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-21 10:20:45,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:45,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-21 10:20:45,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-21 10:20:45,688 INFO L87 Difference]: Start difference. First operand 648 states and 982 transitions. Second operand 3 states. [2020-09-21 10:20:45,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:45,727 INFO L93 Difference]: Finished difference Result 1500 states and 2280 transitions. [2020-09-21 10:20:45,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-21 10:20:45,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-09-21 10:20:45,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:45,733 INFO L225 Difference]: With dead ends: 1500 [2020-09-21 10:20:45,734 INFO L226 Difference]: Without dead ends: 874 [2020-09-21 10:20:45,736 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-21 10:20:45,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2020-09-21 10:20:45,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 872. [2020-09-21 10:20:45,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2020-09-21 10:20:45,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1302 transitions. [2020-09-21 10:20:45,767 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1302 transitions. Word has length 23 [2020-09-21 10:20:45,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:45,767 INFO L479 AbstractCegarLoop]: Abstraction has 872 states and 1302 transitions. [2020-09-21 10:20:45,767 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-21 10:20:45,767 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1302 transitions. [2020-09-21 10:20:45,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-21 10:20:45,769 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:45,770 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:20:45,770 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-21 10:20:45,770 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:45,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:45,771 INFO L82 PathProgramCache]: Analyzing trace with hash 728586230, now seen corresponding path program 1 times [2020-09-21 10:20:45,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:45,771 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1705593941] [2020-09-21 10:20:45,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:45,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:45,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:45,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:45,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:45,798 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1705593941] [2020-09-21 10:20:45,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:20:45,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-21 10:20:45,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357193267] [2020-09-21 10:20:45,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-21 10:20:45,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:45,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-21 10:20:45,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-21 10:20:45,800 INFO L87 Difference]: Start difference. First operand 872 states and 1302 transitions. Second operand 3 states. [2020-09-21 10:20:45,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:45,853 INFO L93 Difference]: Finished difference Result 1308 states and 1944 transitions. [2020-09-21 10:20:45,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-21 10:20:45,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-09-21 10:20:45,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:45,860 INFO L225 Difference]: With dead ends: 1308 [2020-09-21 10:20:45,860 INFO L226 Difference]: Without dead ends: 890 [2020-09-21 10:20:45,861 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-21 10:20:45,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2020-09-21 10:20:45,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 888. [2020-09-21 10:20:45,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2020-09-21 10:20:45,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1302 transitions. [2020-09-21 10:20:45,896 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1302 transitions. Word has length 24 [2020-09-21 10:20:45,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:45,897 INFO L479 AbstractCegarLoop]: Abstraction has 888 states and 1302 transitions. [2020-09-21 10:20:45,897 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-21 10:20:45,897 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1302 transitions. [2020-09-21 10:20:45,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-21 10:20:45,899 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:45,900 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:20:45,900 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-21 10:20:45,900 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:45,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:45,901 INFO L82 PathProgramCache]: Analyzing trace with hash 141780216, now seen corresponding path program 1 times [2020-09-21 10:20:45,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:45,901 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [165207325] [2020-09-21 10:20:45,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:45,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:45,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:45,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:45,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:45,942 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [165207325] [2020-09-21 10:20:45,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:20:45,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-21 10:20:45,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882271376] [2020-09-21 10:20:45,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-21 10:20:45,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:45,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-21 10:20:45,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-21 10:20:45,949 INFO L87 Difference]: Start difference. First operand 888 states and 1302 transitions. Second operand 3 states. [2020-09-21 10:20:45,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:45,991 INFO L93 Difference]: Finished difference Result 1548 states and 2312 transitions. [2020-09-21 10:20:45,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-21 10:20:45,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-09-21 10:20:45,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:46,003 INFO L225 Difference]: With dead ends: 1548 [2020-09-21 10:20:46,003 INFO L226 Difference]: Without dead ends: 1546 [2020-09-21 10:20:46,004 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-21 10:20:46,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2020-09-21 10:20:46,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1288. [2020-09-21 10:20:46,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1288 states. [2020-09-21 10:20:46,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1830 transitions. [2020-09-21 10:20:46,060 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1830 transitions. Word has length 24 [2020-09-21 10:20:46,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:46,062 INFO L479 AbstractCegarLoop]: Abstraction has 1288 states and 1830 transitions. [2020-09-21 10:20:46,062 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-21 10:20:46,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1830 transitions. [2020-09-21 10:20:46,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-21 10:20:46,065 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:46,065 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:20:46,065 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-21 10:20:46,065 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:46,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:46,066 INFO L82 PathProgramCache]: Analyzing trace with hash 399945654, now seen corresponding path program 1 times [2020-09-21 10:20:46,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:46,066 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [376606545] [2020-09-21 10:20:46,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:46,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:46,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:46,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:46,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:46,110 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [376606545] [2020-09-21 10:20:46,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:20:46,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-21 10:20:46,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392094600] [2020-09-21 10:20:46,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-21 10:20:46,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:46,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-21 10:20:46,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-21 10:20:46,112 INFO L87 Difference]: Start difference. First operand 1288 states and 1830 transitions. Second operand 3 states. [2020-09-21 10:20:46,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:46,163 INFO L93 Difference]: Finished difference Result 2956 states and 4200 transitions. [2020-09-21 10:20:46,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-21 10:20:46,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-09-21 10:20:46,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:46,173 INFO L225 Difference]: With dead ends: 2956 [2020-09-21 10:20:46,173 INFO L226 Difference]: Without dead ends: 1706 [2020-09-21 10:20:46,176 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-21 10:20:46,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2020-09-21 10:20:46,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1704. [2020-09-21 10:20:46,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1704 states. [2020-09-21 10:20:46,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 2374 transitions. [2020-09-21 10:20:46,232 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 2374 transitions. Word has length 24 [2020-09-21 10:20:46,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:46,232 INFO L479 AbstractCegarLoop]: Abstraction has 1704 states and 2374 transitions. [2020-09-21 10:20:46,232 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-21 10:20:46,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 2374 transitions. [2020-09-21 10:20:46,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-21 10:20:46,235 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:46,235 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:20:46,235 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-21 10:20:46,235 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:46,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:46,236 INFO L82 PathProgramCache]: Analyzing trace with hash 100434809, now seen corresponding path program 1 times [2020-09-21 10:20:46,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:46,236 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [745643619] [2020-09-21 10:20:46,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:46,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:46,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:46,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:46,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:46,264 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [745643619] [2020-09-21 10:20:46,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:20:46,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-21 10:20:46,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062746303] [2020-09-21 10:20:46,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-21 10:20:46,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:46,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-21 10:20:46,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-21 10:20:46,266 INFO L87 Difference]: Start difference. First operand 1704 states and 2374 transitions. Second operand 3 states. [2020-09-21 10:20:46,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:46,312 INFO L93 Difference]: Finished difference Result 2556 states and 3544 transitions. [2020-09-21 10:20:46,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-21 10:20:46,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-09-21 10:20:46,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:46,321 INFO L225 Difference]: With dead ends: 2556 [2020-09-21 10:20:46,322 INFO L226 Difference]: Without dead ends: 1738 [2020-09-21 10:20:46,324 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-21 10:20:46,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2020-09-21 10:20:46,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1736. [2020-09-21 10:20:46,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1736 states. [2020-09-21 10:20:46,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1736 states and 2374 transitions. [2020-09-21 10:20:46,380 INFO L78 Accepts]: Start accepts. Automaton has 1736 states and 2374 transitions. Word has length 25 [2020-09-21 10:20:46,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:46,381 INFO L479 AbstractCegarLoop]: Abstraction has 1736 states and 2374 transitions. [2020-09-21 10:20:46,381 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-21 10:20:46,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1736 states and 2374 transitions. [2020-09-21 10:20:46,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-21 10:20:46,384 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:46,384 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:20:46,384 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-09-21 10:20:46,384 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:46,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:46,385 INFO L82 PathProgramCache]: Analyzing trace with hash -486371205, now seen corresponding path program 1 times [2020-09-21 10:20:46,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:46,387 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [915986119] [2020-09-21 10:20:46,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:46,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:46,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:46,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:46,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:46,418 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [915986119] [2020-09-21 10:20:46,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:20:46,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-21 10:20:46,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994253738] [2020-09-21 10:20:46,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-21 10:20:46,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:46,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-21 10:20:46,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-21 10:20:46,421 INFO L87 Difference]: Start difference. First operand 1736 states and 2374 transitions. Second operand 3 states. [2020-09-21 10:20:46,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:46,505 INFO L93 Difference]: Finished difference Result 2956 states and 4104 transitions. [2020-09-21 10:20:46,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-21 10:20:46,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-09-21 10:20:46,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:46,519 INFO L225 Difference]: With dead ends: 2956 [2020-09-21 10:20:46,519 INFO L226 Difference]: Without dead ends: 2954 [2020-09-21 10:20:46,520 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-21 10:20:46,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2020-09-21 10:20:46,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2568. [2020-09-21 10:20:46,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2568 states. [2020-09-21 10:20:46,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2568 states and 3398 transitions. [2020-09-21 10:20:46,604 INFO L78 Accepts]: Start accepts. Automaton has 2568 states and 3398 transitions. Word has length 25 [2020-09-21 10:20:46,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:46,605 INFO L479 AbstractCegarLoop]: Abstraction has 2568 states and 3398 transitions. [2020-09-21 10:20:46,605 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-21 10:20:46,605 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 3398 transitions. [2020-09-21 10:20:46,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-21 10:20:46,610 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:46,610 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:20:46,610 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-09-21 10:20:46,611 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:46,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:46,611 INFO L82 PathProgramCache]: Analyzing trace with hash -228205767, now seen corresponding path program 1 times [2020-09-21 10:20:46,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:46,611 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1192082128] [2020-09-21 10:20:46,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:46,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:46,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:46,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:46,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:46,652 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1192082128] [2020-09-21 10:20:46,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:20:46,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-21 10:20:46,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227595052] [2020-09-21 10:20:46,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-21 10:20:46,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:46,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-21 10:20:46,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-21 10:20:46,654 INFO L87 Difference]: Start difference. First operand 2568 states and 3398 transitions. Second operand 3 states. [2020-09-21 10:20:46,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:46,734 INFO L93 Difference]: Finished difference Result 5836 states and 7688 transitions. [2020-09-21 10:20:46,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-21 10:20:46,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-09-21 10:20:46,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:46,750 INFO L225 Difference]: With dead ends: 5836 [2020-09-21 10:20:46,750 INFO L226 Difference]: Without dead ends: 3338 [2020-09-21 10:20:46,756 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-21 10:20:46,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2020-09-21 10:20:46,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 3336. [2020-09-21 10:20:46,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3336 states. [2020-09-21 10:20:46,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4294 transitions. [2020-09-21 10:20:46,865 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4294 transitions. Word has length 25 [2020-09-21 10:20:46,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:46,866 INFO L479 AbstractCegarLoop]: Abstraction has 3336 states and 4294 transitions. [2020-09-21 10:20:46,866 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-21 10:20:46,866 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4294 transitions. [2020-09-21 10:20:46,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-09-21 10:20:46,873 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:46,873 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:20:46,874 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-09-21 10:20:46,876 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:46,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:46,876 INFO L82 PathProgramCache]: Analyzing trace with hash 2102577579, now seen corresponding path program 1 times [2020-09-21 10:20:46,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:46,877 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1734951859] [2020-09-21 10:20:46,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:46,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:46,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:46,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:46,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:46,912 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1734951859] [2020-09-21 10:20:46,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:20:46,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-21 10:20:46,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672350350] [2020-09-21 10:20:46,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-21 10:20:46,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:46,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-21 10:20:46,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-21 10:20:46,916 INFO L87 Difference]: Start difference. First operand 3336 states and 4294 transitions. Second operand 3 states. [2020-09-21 10:20:46,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:46,997 INFO L93 Difference]: Finished difference Result 5004 states and 6408 transitions. [2020-09-21 10:20:46,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-21 10:20:46,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-09-21 10:20:46,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:47,011 INFO L225 Difference]: With dead ends: 5004 [2020-09-21 10:20:47,011 INFO L226 Difference]: Without dead ends: 3402 [2020-09-21 10:20:47,015 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-21 10:20:47,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3402 states. [2020-09-21 10:20:47,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3402 to 3400. [2020-09-21 10:20:47,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3400 states. [2020-09-21 10:20:47,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3400 states to 3400 states and 4294 transitions. [2020-09-21 10:20:47,112 INFO L78 Accepts]: Start accepts. Automaton has 3400 states and 4294 transitions. Word has length 26 [2020-09-21 10:20:47,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:47,113 INFO L479 AbstractCegarLoop]: Abstraction has 3400 states and 4294 transitions. [2020-09-21 10:20:47,113 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-21 10:20:47,113 INFO L276 IsEmpty]: Start isEmpty. Operand 3400 states and 4294 transitions. [2020-09-21 10:20:47,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-09-21 10:20:47,118 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:47,118 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:20:47,119 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-09-21 10:20:47,119 INFO L427 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:47,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:47,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1515771565, now seen corresponding path program 1 times [2020-09-21 10:20:47,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:47,120 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1415488106] [2020-09-21 10:20:47,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:47,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:47,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:47,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:47,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:47,148 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1415488106] [2020-09-21 10:20:47,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:20:47,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-21 10:20:47,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766701262] [2020-09-21 10:20:47,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-21 10:20:47,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:47,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-21 10:20:47,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-21 10:20:47,152 INFO L87 Difference]: Start difference. First operand 3400 states and 4294 transitions. Second operand 3 states. [2020-09-21 10:20:47,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:47,260 INFO L93 Difference]: Finished difference Result 9804 states and 12104 transitions. [2020-09-21 10:20:47,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-21 10:20:47,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-09-21 10:20:47,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:47,300 INFO L225 Difference]: With dead ends: 9804 [2020-09-21 10:20:47,300 INFO L226 Difference]: Without dead ends: 6538 [2020-09-21 10:20:47,308 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-21 10:20:47,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6538 states. [2020-09-21 10:20:47,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6538 to 6536. [2020-09-21 10:20:47,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6536 states. [2020-09-21 10:20:47,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 7814 transitions. [2020-09-21 10:20:47,577 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 7814 transitions. Word has length 26 [2020-09-21 10:20:47,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:47,577 INFO L479 AbstractCegarLoop]: Abstraction has 6536 states and 7814 transitions. [2020-09-21 10:20:47,578 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-21 10:20:47,578 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 7814 transitions. [2020-09-21 10:20:47,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-09-21 10:20:47,586 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:47,586 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:20:47,586 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-09-21 10:20:47,586 INFO L427 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:47,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:47,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1257606127, now seen corresponding path program 1 times [2020-09-21 10:20:47,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:47,592 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1908169737] [2020-09-21 10:20:47,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:47,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:47,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:47,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:47,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:47,629 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1908169737] [2020-09-21 10:20:47,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:20:47,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-21 10:20:47,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357389300] [2020-09-21 10:20:47,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-21 10:20:47,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:47,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-21 10:20:47,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-21 10:20:47,635 INFO L87 Difference]: Start difference. First operand 6536 states and 7814 transitions. Second operand 3 states. [2020-09-21 10:20:47,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:47,755 INFO L93 Difference]: Finished difference Result 7052 states and 8584 transitions. [2020-09-21 10:20:47,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-21 10:20:47,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-09-21 10:20:47,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:47,777 INFO L225 Difference]: With dead ends: 7052 [2020-09-21 10:20:47,777 INFO L226 Difference]: Without dead ends: 7050 [2020-09-21 10:20:47,781 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-21 10:20:47,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7050 states. [2020-09-21 10:20:47,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7050 to 6536. [2020-09-21 10:20:47,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6536 states. [2020-09-21 10:20:47,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 7686 transitions. [2020-09-21 10:20:47,951 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 7686 transitions. Word has length 26 [2020-09-21 10:20:47,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:47,951 INFO L479 AbstractCegarLoop]: Abstraction has 6536 states and 7686 transitions. [2020-09-21 10:20:47,951 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-21 10:20:47,951 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 7686 transitions. [2020-09-21 10:20:47,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-09-21 10:20:47,961 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:47,961 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:20:47,961 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-09-21 10:20:47,961 INFO L427 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:47,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:47,962 INFO L82 PathProgramCache]: Analyzing trace with hash -255505650, now seen corresponding path program 1 times [2020-09-21 10:20:47,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:47,963 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1678849848] [2020-09-21 10:20:47,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:47,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:47,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:47,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:47,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:47,989 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1678849848] [2020-09-21 10:20:47,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:20:47,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-21 10:20:47,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928834162] [2020-09-21 10:20:47,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-21 10:20:47,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:47,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-21 10:20:47,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-21 10:20:47,991 INFO L87 Difference]: Start difference. First operand 6536 states and 7686 transitions. Second operand 3 states. [2020-09-21 10:20:48,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:48,209 INFO L93 Difference]: Finished difference Result 10634 states and 12423 transitions. [2020-09-21 10:20:48,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-21 10:20:48,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-09-21 10:20:48,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:48,229 INFO L225 Difference]: With dead ends: 10634 [2020-09-21 10:20:48,229 INFO L226 Difference]: Without dead ends: 10632 [2020-09-21 10:20:48,232 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-21 10:20:48,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10632 states. [2020-09-21 10:20:48,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10632 to 10120. [2020-09-21 10:20:48,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10120 states. [2020-09-21 10:20:48,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10120 states to 10120 states and 11654 transitions. [2020-09-21 10:20:48,430 INFO L78 Accepts]: Start accepts. Automaton has 10120 states and 11654 transitions. Word has length 27 [2020-09-21 10:20:48,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:48,430 INFO L479 AbstractCegarLoop]: Abstraction has 10120 states and 11654 transitions. [2020-09-21 10:20:48,430 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-21 10:20:48,430 INFO L276 IsEmpty]: Start isEmpty. Operand 10120 states and 11654 transitions. [2020-09-21 10:20:48,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-09-21 10:20:48,445 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:20:48,446 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:20:48,446 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-09-21 10:20:48,446 INFO L427 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:20:48,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:20:48,446 INFO L82 PathProgramCache]: Analyzing trace with hash 2659788, now seen corresponding path program 1 times [2020-09-21 10:20:48,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:20:48,447 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [821324791] [2020-09-21 10:20:48,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:20:48,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:48,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:20:48,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:20:48,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:20:48,475 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [821324791] [2020-09-21 10:20:48,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:20:48,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-21 10:20:48,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245419807] [2020-09-21 10:20:48,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-21 10:20:48,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:20:48,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-21 10:20:48,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-21 10:20:48,476 INFO L87 Difference]: Start difference. First operand 10120 states and 11654 transitions. Second operand 3 states. [2020-09-21 10:20:48,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:20:48,788 INFO L93 Difference]: Finished difference Result 22664 states and 25734 transitions. [2020-09-21 10:20:48,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-21 10:20:48,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-09-21 10:20:48,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:20:48,789 INFO L225 Difference]: With dead ends: 22664 [2020-09-21 10:20:48,789 INFO L226 Difference]: Without dead ends: 0 [2020-09-21 10:20:48,819 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-21 10:20:48,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-21 10:20:48,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-21 10:20:48,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-21 10:20:48,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-21 10:20:48,821 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2020-09-21 10:20:48,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:20:48,821 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-21 10:20:48,821 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-21 10:20:48,821 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-21 10:20:48,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-21 10:20:48,821 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-09-21 10:20:48,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-21 10:20:48,848 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-21 10:20:48,848 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-09-21 10:20:48,848 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-09-21 10:20:48,848 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-21 10:20:48,848 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-21 10:20:48,848 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-09-21 10:20:48,848 INFO L268 CegarLoopResult]: For program point L93-1(lines 36 144) no Hoare annotation was computed. [2020-09-21 10:20:48,849 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 4 149) no Hoare annotation was computed. [2020-09-21 10:20:48,849 INFO L268 CegarLoopResult]: For program point L85-1(lines 36 144) no Hoare annotation was computed. [2020-09-21 10:20:48,849 INFO L268 CegarLoopResult]: For program point L110(line 110) no Hoare annotation was computed. [2020-09-21 10:20:48,849 INFO L268 CegarLoopResult]: For program point L77-1(lines 36 144) no Hoare annotation was computed. [2020-09-21 10:20:48,849 INFO L268 CegarLoopResult]: For program point L135(line 135) no Hoare annotation was computed. [2020-09-21 10:20:48,849 INFO L268 CegarLoopResult]: For program point L69-1(lines 36 144) no Hoare annotation was computed. [2020-09-21 10:20:48,849 INFO L268 CegarLoopResult]: For program point L61(lines 61 63) no Hoare annotation was computed. [2020-09-21 10:20:48,849 INFO L268 CegarLoopResult]: For program point L61-2(lines 36 144) no Hoare annotation was computed. [2020-09-21 10:20:48,850 INFO L268 CegarLoopResult]: For program point L119-1(lines 36 144) no Hoare annotation was computed. [2020-09-21 10:20:48,850 INFO L268 CegarLoopResult]: For program point L120(line 120) no Hoare annotation was computed. [2020-09-21 10:20:48,850 INFO L271 CegarLoopResult]: At program point L145(lines 5 149) the Hoare annotation is: true [2020-09-21 10:20:48,850 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 4 149) no Hoare annotation was computed. [2020-09-21 10:20:48,850 INFO L268 CegarLoopResult]: For program point L104-1(lines 36 144) no Hoare annotation was computed. [2020-09-21 10:20:48,850 INFO L268 CegarLoopResult]: For program point L38(lines 38 40) no Hoare annotation was computed. [2020-09-21 10:20:48,850 INFO L268 CegarLoopResult]: For program point L129-1(lines 36 144) no Hoare annotation was computed. [2020-09-21 10:20:48,851 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 147) no Hoare annotation was computed. [2020-09-21 10:20:48,851 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 149) the Hoare annotation is: true [2020-09-21 10:20:48,851 INFO L268 CegarLoopResult]: For program point L105(line 105) no Hoare annotation was computed. [2020-09-21 10:20:48,851 INFO L268 CegarLoopResult]: For program point L130(line 130) no Hoare annotation was computed. [2020-09-21 10:20:48,851 INFO L268 CegarLoopResult]: For program point L89-1(lines 36 144) no Hoare annotation was computed. [2020-09-21 10:20:48,851 INFO L268 CegarLoopResult]: For program point L114-1(lines 36 144) no Hoare annotation was computed. [2020-09-21 10:20:48,851 INFO L268 CegarLoopResult]: For program point L81-1(lines 36 144) no Hoare annotation was computed. [2020-09-21 10:20:48,851 INFO L271 CegarLoopResult]: At program point L139-1(lines 36 144) the Hoare annotation is: true [2020-09-21 10:20:48,851 INFO L268 CegarLoopResult]: For program point L73-1(lines 36 144) no Hoare annotation was computed. [2020-09-21 10:20:48,852 INFO L268 CegarLoopResult]: For program point L65-1(lines 36 144) no Hoare annotation was computed. [2020-09-21 10:20:48,852 INFO L268 CegarLoopResult]: For program point L115(line 115) no Hoare annotation was computed. [2020-09-21 10:20:48,852 INFO L268 CegarLoopResult]: For program point L140(line 140) no Hoare annotation was computed. [2020-09-21 10:20:48,852 INFO L264 CegarLoopResult]: At program point L140-1(lines 5 149) the Hoare annotation is: false [2020-09-21 10:20:48,852 INFO L268 CegarLoopResult]: For program point L99-1(lines 36 144) no Hoare annotation was computed. [2020-09-21 10:20:48,852 INFO L268 CegarLoopResult]: For program point L124-1(lines 36 144) no Hoare annotation was computed. [2020-09-21 10:20:48,852 INFO L268 CegarLoopResult]: For program point L100(line 100) no Hoare annotation was computed. [2020-09-21 10:20:48,852 INFO L268 CegarLoopResult]: For program point L125(line 125) no Hoare annotation was computed. [2020-09-21 10:20:48,853 INFO L268 CegarLoopResult]: For program point L109-1(lines 36 144) no Hoare annotation was computed. [2020-09-21 10:20:48,853 INFO L268 CegarLoopResult]: For program point L134-1(lines 36 144) no Hoare annotation was computed. [2020-09-21 10:20:48,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.09 10:20:48 BoogieIcfgContainer [2020-09-21 10:20:48,867 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-21 10:20:48,870 INFO L168 Benchmark]: Toolchain (without parser) took 5984.86 ms. Allocated memory was 143.1 MB in the beginning and 344.5 MB in the end (delta: 201.3 MB). Free memory was 106.0 MB in the beginning and 237.7 MB in the end (delta: -131.7 MB). Peak memory consumption was 69.7 MB. Max. memory is 7.1 GB. [2020-09-21 10:20:48,871 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 143.1 MB. Free memory was 124.7 MB in the beginning and 124.5 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-21 10:20:48,871 INFO L168 Benchmark]: CACSL2BoogieTranslator took 335.34 ms. Allocated memory is still 143.1 MB. Free memory was 105.3 MB in the beginning and 94.8 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2020-09-21 10:20:48,872 INFO L168 Benchmark]: Boogie Preprocessor took 126.67 ms. Allocated memory was 143.1 MB in the beginning and 203.9 MB in the end (delta: 60.8 MB). Free memory was 94.8 MB in the beginning and 182.1 MB in the end (delta: -87.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. [2020-09-21 10:20:48,872 INFO L168 Benchmark]: RCFGBuilder took 370.60 ms. Allocated memory is still 203.9 MB. Free memory was 182.1 MB in the beginning and 163.4 MB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. [2020-09-21 10:20:48,873 INFO L168 Benchmark]: TraceAbstraction took 5141.06 ms. Allocated memory was 203.9 MB in the beginning and 344.5 MB in the end (delta: 140.5 MB). Free memory was 162.8 MB in the beginning and 237.7 MB in the end (delta: -74.9 MB). Peak memory consumption was 65.6 MB. Max. memory is 7.1 GB. [2020-09-21 10:20:48,875 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.20 ms. Allocated memory is still 143.1 MB. Free memory was 124.7 MB in the beginning and 124.5 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 335.34 ms. Allocated memory is still 143.1 MB. Free memory was 105.3 MB in the beginning and 94.8 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 126.67 ms. Allocated memory was 143.1 MB in the beginning and 203.9 MB in the end (delta: 60.8 MB). Free memory was 94.8 MB in the beginning and 182.1 MB in the end (delta: -87.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 370.60 ms. Allocated memory is still 203.9 MB. Free memory was 182.1 MB in the beginning and 163.4 MB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5141.06 ms. Allocated memory was 203.9 MB in the beginning and 344.5 MB in the end (delta: 140.5 MB). Free memory was 162.8 MB in the beginning and 237.7 MB in the end (delta: -74.9 MB). Peak memory consumption was 65.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 147]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 41 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.9s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1937 SDtfs, 926 SDslu, 1314 SDs, 0 SdLazy, 133 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10120occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 25 MinimizatonAttempts, 2072 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 522 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 575 NumberOfCodeBlocks, 575 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 550 ConstructedInterpolants, 0 QuantifiedInterpolants, 23930 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 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 correct! Received shutdown request...