/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/systemc/toy2.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-4f750a8 [2020-12-22 07:12:56,943 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-22 07:12:56,946 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-22 07:12:56,986 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-22 07:12:56,987 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-22 07:12:56,988 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-22 07:12:56,990 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-22 07:12:56,993 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-22 07:12:56,995 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-22 07:12:56,997 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-22 07:12:56,998 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-22 07:12:57,000 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-22 07:12:57,000 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-22 07:12:57,002 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-22 07:12:57,003 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-22 07:12:57,005 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-22 07:12:57,006 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-22 07:12:57,008 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-22 07:12:57,010 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-22 07:12:57,013 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-22 07:12:57,015 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-22 07:12:57,018 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-22 07:12:57,020 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-22 07:12:57,021 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-22 07:12:57,025 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-22 07:12:57,025 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-22 07:12:57,026 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-22 07:12:57,027 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-22 07:12:57,028 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-22 07:12:57,029 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-22 07:12:57,030 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-22 07:12:57,031 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-22 07:12:57,032 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-22 07:12:57,034 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-22 07:12:57,036 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-22 07:12:57,037 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-22 07:12:57,038 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-22 07:12:57,038 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-22 07:12:57,038 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-22 07:12:57,039 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-22 07:12:57,040 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-22 07:12:57,041 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-22 07:12:57,071 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-22 07:12:57,071 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-22 07:12:57,073 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-22 07:12:57,073 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-22 07:12:57,073 INFO L138 SettingsManager]: * Use SBE=true [2020-12-22 07:12:57,074 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-22 07:12:57,074 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-22 07:12:57,074 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-22 07:12:57,074 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-22 07:12:57,075 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-22 07:12:57,075 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-22 07:12:57,075 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-22 07:12:57,075 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-22 07:12:57,076 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-22 07:12:57,076 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-22 07:12:57,076 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-22 07:12:57,076 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-22 07:12:57,077 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-22 07:12:57,077 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-22 07:12:57,077 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-22 07:12:57,078 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-22 07:12:57,078 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-22 07:12:57,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-22 07:12:57,078 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-22 07:12:57,078 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-22 07:12:57,079 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-22 07:12:57,516 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-22 07:12:57,568 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-22 07:12:57,572 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-22 07:12:57,573 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-22 07:12:57,576 INFO L275 PluginConnector]: CDTParser initialized [2020-12-22 07:12:57,577 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/toy2.cil.c [2020-12-22 07:12:57,670 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2be2002b4/9a1587baf115451180fd8429dd5f0f28/FLAGd84614556 [2020-12-22 07:12:58,280 INFO L306 CDTParser]: Found 1 translation units. [2020-12-22 07:12:58,280 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy2.cil.c [2020-12-22 07:12:58,299 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2be2002b4/9a1587baf115451180fd8429dd5f0f28/FLAGd84614556 [2020-12-22 07:12:58,596 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2be2002b4/9a1587baf115451180fd8429dd5f0f28 [2020-12-22 07:12:58,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-22 07:12:58,610 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-22 07:12:58,612 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-22 07:12:58,612 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-22 07:12:58,616 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-22 07:12:58,618 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 07:12:58" (1/1) ... [2020-12-22 07:12:58,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@461b5ac3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:12:58, skipping insertion in model container [2020-12-22 07:12:58,621 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 07:12:58" (1/1) ... [2020-12-22 07:12:58,630 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-22 07:12:58,696 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-22 07:12:58,839 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy2.cil.c[393,406] [2020-12-22 07:12:58,909 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 07:12:58,920 INFO L203 MainTranslator]: Completed pre-run [2020-12-22 07:12:58,931 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy2.cil.c[393,406] [2020-12-22 07:12:58,977 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 07:12:58,998 INFO L208 MainTranslator]: Completed translation [2020-12-22 07:12:59,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:12:59 WrapperNode [2020-12-22 07:12:59,003 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-22 07:12:59,004 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-22 07:12:59,004 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-22 07:12:59,004 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-22 07:12:59,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:12:59" (1/1) ... [2020-12-22 07:12:59,038 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:12:59" (1/1) ... [2020-12-22 07:12:59,074 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-22 07:12:59,075 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-22 07:12:59,075 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-22 07:12:59,075 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-22 07:12:59,085 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:12:59" (1/1) ... [2020-12-22 07:12:59,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:12:59" (1/1) ... [2020-12-22 07:12:59,089 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:12:59" (1/1) ... [2020-12-22 07:12:59,090 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:12:59" (1/1) ... [2020-12-22 07:12:59,105 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:12:59" (1/1) ... [2020-12-22 07:12:59,126 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:12:59" (1/1) ... [2020-12-22 07:12:59,133 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:12:59" (1/1) ... [2020-12-22 07:12:59,142 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-22 07:12:59,146 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-22 07:12:59,146 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-22 07:12:59,146 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-22 07:12:59,149 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:12:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/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-12-22 07:12:59,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-22 07:12:59,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-22 07:12:59,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-22 07:12:59,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-22 07:13:00,007 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-22 07:13:00,007 INFO L299 CfgBuilder]: Removed 26 assume(true) statements. [2020-12-22 07:13:00,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 07:13:00 BoogieIcfgContainer [2020-12-22 07:13:00,011 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-22 07:13:00,015 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-22 07:13:00,017 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-22 07:13:00,021 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-22 07:13:00,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 07:12:58" (1/3) ... [2020-12-22 07:13:00,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@876e0ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 07:13:00, skipping insertion in model container [2020-12-22 07:13:00,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:12:59" (2/3) ... [2020-12-22 07:13:00,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@876e0ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 07:13:00, skipping insertion in model container [2020-12-22 07:13:00,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 07:13:00" (3/3) ... [2020-12-22 07:13:00,028 INFO L111 eAbstractionObserver]: Analyzing ICFG toy2.cil.c [2020-12-22 07:13:00,039 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-22 07:13:00,045 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-22 07:13:00,064 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-22 07:13:00,092 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-22 07:13:00,093 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-22 07:13:00,093 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-22 07:13:00,093 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-22 07:13:00,093 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-22 07:13:00,093 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-22 07:13:00,093 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-22 07:13:00,094 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-22 07:13:00,112 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states. [2020-12-22 07:13:00,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-22 07:13:00,121 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:00,122 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:00,122 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:00,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:00,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1633671955, now seen corresponding path program 1 times [2020-12-22 07:13:00,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:00,137 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395071038] [2020-12-22 07:13:00,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:00,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:13:00,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395071038] [2020-12-22 07:13:00,451 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:00,451 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:13:00,452 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562169492] [2020-12-22 07:13:00,457 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:13:00,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:00,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:13:00,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:00,478 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 3 states. [2020-12-22 07:13:00,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:00,534 INFO L93 Difference]: Finished difference Result 242 states and 449 transitions. [2020-12-22 07:13:00,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:13:00,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-12-22 07:13:00,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:00,549 INFO L225 Difference]: With dead ends: 242 [2020-12-22 07:13:00,549 INFO L226 Difference]: Without dead ends: 121 [2020-12-22 07:13:00,553 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-12-22 07:13:00,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-12-22 07:13:00,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2020-12-22 07:13:00,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-12-22 07:13:00,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 213 transitions. [2020-12-22 07:13:00,634 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 213 transitions. Word has length 35 [2020-12-22 07:13:00,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:00,635 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 213 transitions. [2020-12-22 07:13:00,635 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:13:00,635 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 213 transitions. [2020-12-22 07:13:00,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-22 07:13:00,639 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:00,640 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:00,641 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-22 07:13:00,641 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:00,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:00,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1611039701, now seen corresponding path program 1 times [2020-12-22 07:13:00,643 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:00,644 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118639961] [2020-12-22 07:13:00,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:00,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:00,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:13:00,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118639961] [2020-12-22 07:13:00,736 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:00,736 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:13:00,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156539857] [2020-12-22 07:13:00,738 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:13:00,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:00,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:13:00,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:13:00,740 INFO L87 Difference]: Start difference. First operand 121 states and 213 transitions. Second operand 4 states. [2020-12-22 07:13:00,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:00,813 INFO L93 Difference]: Finished difference Result 325 states and 571 transitions. [2020-12-22 07:13:00,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 07:13:00,814 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-12-22 07:13:00,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:00,816 INFO L225 Difference]: With dead ends: 325 [2020-12-22 07:13:00,817 INFO L226 Difference]: Without dead ends: 207 [2020-12-22 07:13:00,819 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:13:00,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2020-12-22 07:13:00,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 204. [2020-12-22 07:13:00,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-12-22 07:13:00,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 357 transitions. [2020-12-22 07:13:00,847 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 357 transitions. Word has length 35 [2020-12-22 07:13:00,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:00,847 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 357 transitions. [2020-12-22 07:13:00,848 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:13:00,848 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 357 transitions. [2020-12-22 07:13:00,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-22 07:13:00,849 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:00,850 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:00,850 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-22 07:13:00,850 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:00,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:00,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1101566611, now seen corresponding path program 1 times [2020-12-22 07:13:00,851 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:00,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026230153] [2020-12-22 07:13:00,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:00,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:00,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:13:00,917 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026230153] [2020-12-22 07:13:00,917 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:00,917 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:13:00,917 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211493588] [2020-12-22 07:13:00,918 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:13:00,918 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:00,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:13:00,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:00,919 INFO L87 Difference]: Start difference. First operand 204 states and 357 transitions. Second operand 3 states. [2020-12-22 07:13:00,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:00,998 INFO L93 Difference]: Finished difference Result 399 states and 701 transitions. [2020-12-22 07:13:00,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:13:00,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-12-22 07:13:00,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:01,002 INFO L225 Difference]: With dead ends: 399 [2020-12-22 07:13:01,002 INFO L226 Difference]: Without dead ends: 204 [2020-12-22 07:13:01,004 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-12-22 07:13:01,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2020-12-22 07:13:01,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2020-12-22 07:13:01,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-12-22 07:13:01,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 345 transitions. [2020-12-22 07:13:01,041 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 345 transitions. Word has length 35 [2020-12-22 07:13:01,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:01,041 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 345 transitions. [2020-12-22 07:13:01,041 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:13:01,042 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 345 transitions. [2020-12-22 07:13:01,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-22 07:13:01,043 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:01,043 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:01,044 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-22 07:13:01,044 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:01,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:01,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1744930967, now seen corresponding path program 1 times [2020-12-22 07:13:01,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:01,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396759281] [2020-12-22 07:13:01,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:01,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:13:01,140 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396759281] [2020-12-22 07:13:01,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:01,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:13:01,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983121658] [2020-12-22 07:13:01,144 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:13:01,144 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:01,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:13:01,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:13:01,145 INFO L87 Difference]: Start difference. First operand 204 states and 345 transitions. Second operand 4 states. [2020-12-22 07:13:01,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:01,329 INFO L93 Difference]: Finished difference Result 553 states and 938 transitions. [2020-12-22 07:13:01,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 07:13:01,331 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-12-22 07:13:01,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:01,336 INFO L225 Difference]: With dead ends: 553 [2020-12-22 07:13:01,336 INFO L226 Difference]: Without dead ends: 359 [2020-12-22 07:13:01,341 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:13:01,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2020-12-22 07:13:01,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 204. [2020-12-22 07:13:01,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-12-22 07:13:01,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 342 transitions. [2020-12-22 07:13:01,390 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 342 transitions. Word has length 35 [2020-12-22 07:13:01,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:01,390 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 342 transitions. [2020-12-22 07:13:01,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:13:01,391 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 342 transitions. [2020-12-22 07:13:01,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-22 07:13:01,392 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:01,395 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:01,395 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-22 07:13:01,396 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:01,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:01,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1806970581, now seen corresponding path program 1 times [2020-12-22 07:13:01,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:01,399 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923331667] [2020-12-22 07:13:01,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:01,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:01,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:13:01,480 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923331667] [2020-12-22 07:13:01,480 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:01,480 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:13:01,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997054807] [2020-12-22 07:13:01,481 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:13:01,481 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:01,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:13:01,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:13:01,482 INFO L87 Difference]: Start difference. First operand 204 states and 342 transitions. Second operand 4 states. [2020-12-22 07:13:01,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:01,576 INFO L93 Difference]: Finished difference Result 556 states and 934 transitions. [2020-12-22 07:13:01,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 07:13:01,577 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-12-22 07:13:01,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:01,581 INFO L225 Difference]: With dead ends: 556 [2020-12-22 07:13:01,581 INFO L226 Difference]: Without dead ends: 363 [2020-12-22 07:13:01,583 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:13:01,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2020-12-22 07:13:01,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 204. [2020-12-22 07:13:01,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-12-22 07:13:01,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 339 transitions. [2020-12-22 07:13:01,609 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 339 transitions. Word has length 35 [2020-12-22 07:13:01,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:01,610 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 339 transitions. [2020-12-22 07:13:01,610 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:13:01,610 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 339 transitions. [2020-12-22 07:13:01,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-22 07:13:01,612 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:01,612 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:01,612 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-22 07:13:01,612 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:01,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:01,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1947519191, now seen corresponding path program 1 times [2020-12-22 07:13:01,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:01,614 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733662252] [2020-12-22 07:13:01,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:01,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:01,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:13:01,655 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733662252] [2020-12-22 07:13:01,655 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:01,655 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:13:01,656 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974135059] [2020-12-22 07:13:01,656 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:13:01,656 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:01,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:13:01,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:13:01,657 INFO L87 Difference]: Start difference. First operand 204 states and 339 transitions. Second operand 4 states. [2020-12-22 07:13:01,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:01,734 INFO L93 Difference]: Finished difference Result 568 states and 945 transitions. [2020-12-22 07:13:01,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 07:13:01,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-12-22 07:13:01,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:01,737 INFO L225 Difference]: With dead ends: 568 [2020-12-22 07:13:01,737 INFO L226 Difference]: Without dead ends: 376 [2020-12-22 07:13:01,738 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:13:01,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2020-12-22 07:13:01,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 210. [2020-12-22 07:13:01,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-12-22 07:13:01,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 343 transitions. [2020-12-22 07:13:01,752 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 343 transitions. Word has length 35 [2020-12-22 07:13:01,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:01,753 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 343 transitions. [2020-12-22 07:13:01,753 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:13:01,753 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 343 transitions. [2020-12-22 07:13:01,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-22 07:13:01,754 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:01,755 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:01,755 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-22 07:13:01,755 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:01,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:01,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1813505685, now seen corresponding path program 1 times [2020-12-22 07:13:01,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:01,756 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829520677] [2020-12-22 07:13:01,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:01,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:01,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-12-22 07:13:01,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829520677] [2020-12-22 07:13:01,799 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:01,799 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:13:01,800 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559932382] [2020-12-22 07:13:01,800 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:13:01,800 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:01,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:13:01,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:13:01,801 INFO L87 Difference]: Start difference. First operand 210 states and 343 transitions. Second operand 4 states. [2020-12-22 07:13:01,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:01,902 INFO L93 Difference]: Finished difference Result 713 states and 1165 transitions. [2020-12-22 07:13:01,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 07:13:01,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-12-22 07:13:01,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:01,922 INFO L225 Difference]: With dead ends: 713 [2020-12-22 07:13:01,923 INFO L226 Difference]: Without dead ends: 516 [2020-12-22 07:13:01,924 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:13:01,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2020-12-22 07:13:01,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 341. [2020-12-22 07:13:01,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-12-22 07:13:01,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 554 transitions. [2020-12-22 07:13:01,948 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 554 transitions. Word has length 35 [2020-12-22 07:13:01,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:01,948 INFO L481 AbstractCegarLoop]: Abstraction has 341 states and 554 transitions. [2020-12-22 07:13:01,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:13:01,949 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 554 transitions. [2020-12-22 07:13:01,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-22 07:13:01,950 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:01,950 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:01,950 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-22 07:13:01,950 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:01,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:01,951 INFO L82 PathProgramCache]: Analyzing trace with hash 8067351, now seen corresponding path program 1 times [2020-12-22 07:13:01,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:01,952 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595973620] [2020-12-22 07:13:01,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:01,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:01,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:13:01,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595973620] [2020-12-22 07:13:01,987 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:01,987 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:13:01,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414183823] [2020-12-22 07:13:01,988 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:13:01,988 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:01,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:13:01,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:01,989 INFO L87 Difference]: Start difference. First operand 341 states and 554 transitions. Second operand 3 states. [2020-12-22 07:13:02,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:02,047 INFO L93 Difference]: Finished difference Result 812 states and 1325 transitions. [2020-12-22 07:13:02,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:13:02,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-12-22 07:13:02,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:02,052 INFO L225 Difference]: With dead ends: 812 [2020-12-22 07:13:02,052 INFO L226 Difference]: Without dead ends: 495 [2020-12-22 07:13:02,054 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-12-22 07:13:02,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2020-12-22 07:13:02,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 493. [2020-12-22 07:13:02,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2020-12-22 07:13:02,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 800 transitions. [2020-12-22 07:13:02,087 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 800 transitions. Word has length 35 [2020-12-22 07:13:02,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:02,087 INFO L481 AbstractCegarLoop]: Abstraction has 493 states and 800 transitions. [2020-12-22 07:13:02,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:13:02,088 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 800 transitions. [2020-12-22 07:13:02,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-22 07:13:02,088 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:02,089 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:02,089 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-22 07:13:02,089 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:02,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:02,090 INFO L82 PathProgramCache]: Analyzing trace with hash 2127880731, now seen corresponding path program 1 times [2020-12-22 07:13:02,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:02,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948032696] [2020-12-22 07:13:02,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:02,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:13:02,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948032696] [2020-12-22 07:13:02,153 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:02,154 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:13:02,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138055855] [2020-12-22 07:13:02,154 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:13:02,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:02,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:13:02,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:13:02,156 INFO L87 Difference]: Start difference. First operand 493 states and 800 transitions. Second operand 4 states. [2020-12-22 07:13:02,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:02,258 INFO L93 Difference]: Finished difference Result 1255 states and 2037 transitions. [2020-12-22 07:13:02,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 07:13:02,259 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-12-22 07:13:02,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:02,264 INFO L225 Difference]: With dead ends: 1255 [2020-12-22 07:13:02,264 INFO L226 Difference]: Without dead ends: 779 [2020-12-22 07:13:02,265 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:13:02,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2020-12-22 07:13:02,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 493. [2020-12-22 07:13:02,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2020-12-22 07:13:02,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 792 transitions. [2020-12-22 07:13:02,304 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 792 transitions. Word has length 35 [2020-12-22 07:13:02,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:02,305 INFO L481 AbstractCegarLoop]: Abstraction has 493 states and 792 transitions. [2020-12-22 07:13:02,305 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:13:02,305 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 792 transitions. [2020-12-22 07:13:02,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-22 07:13:02,306 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:02,306 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:02,306 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-22 07:13:02,306 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:02,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:02,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1106812377, now seen corresponding path program 1 times [2020-12-22 07:13:02,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:02,309 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457993546] [2020-12-22 07:13:02,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:02,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:02,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:13:02,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457993546] [2020-12-22 07:13:02,367 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:02,367 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:13:02,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697594175] [2020-12-22 07:13:02,368 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:13:02,368 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:02,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:13:02,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:13:02,371 INFO L87 Difference]: Start difference. First operand 493 states and 792 transitions. Second operand 4 states. [2020-12-22 07:13:02,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:02,485 INFO L93 Difference]: Finished difference Result 1251 states and 2010 transitions. [2020-12-22 07:13:02,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 07:13:02,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-12-22 07:13:02,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:02,498 INFO L225 Difference]: With dead ends: 1251 [2020-12-22 07:13:02,499 INFO L226 Difference]: Without dead ends: 781 [2020-12-22 07:13:02,501 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:13:02,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2020-12-22 07:13:02,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 493. [2020-12-22 07:13:02,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2020-12-22 07:13:02,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 784 transitions. [2020-12-22 07:13:02,565 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 784 transitions. Word has length 35 [2020-12-22 07:13:02,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:02,565 INFO L481 AbstractCegarLoop]: Abstraction has 493 states and 784 transitions. [2020-12-22 07:13:02,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:13:02,566 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 784 transitions. [2020-12-22 07:13:02,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-22 07:13:02,566 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:02,566 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:02,567 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-22 07:13:02,567 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:02,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:02,567 INFO L82 PathProgramCache]: Analyzing trace with hash 95695127, now seen corresponding path program 1 times [2020-12-22 07:13:02,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:02,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117762157] [2020-12-22 07:13:02,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:02,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:02,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:13:02,601 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117762157] [2020-12-22 07:13:02,601 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:02,601 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:13:02,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436357288] [2020-12-22 07:13:02,602 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:13:02,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:02,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:13:02,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:13:02,603 INFO L87 Difference]: Start difference. First operand 493 states and 784 transitions. Second operand 4 states. [2020-12-22 07:13:02,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:02,711 INFO L93 Difference]: Finished difference Result 1192 states and 1892 transitions. [2020-12-22 07:13:02,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 07:13:02,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-12-22 07:13:02,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:02,716 INFO L225 Difference]: With dead ends: 1192 [2020-12-22 07:13:02,716 INFO L226 Difference]: Without dead ends: 716 [2020-12-22 07:13:02,718 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:13:02,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2020-12-22 07:13:02,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 541. [2020-12-22 07:13:02,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2020-12-22 07:13:02,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 841 transitions. [2020-12-22 07:13:02,759 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 841 transitions. Word has length 35 [2020-12-22 07:13:02,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:02,759 INFO L481 AbstractCegarLoop]: Abstraction has 541 states and 841 transitions. [2020-12-22 07:13:02,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:13:02,760 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 841 transitions. [2020-12-22 07:13:02,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-22 07:13:02,760 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:02,760 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:02,761 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-22 07:13:02,761 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:02,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:02,761 INFO L82 PathProgramCache]: Analyzing trace with hash 353860565, now seen corresponding path program 1 times [2020-12-22 07:13:02,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:02,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447218788] [2020-12-22 07:13:02,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:02,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:02,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:13:02,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447218788] [2020-12-22 07:13:02,803 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:02,803 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:13:02,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12317864] [2020-12-22 07:13:02,804 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:13:02,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:02,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:13:02,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:02,805 INFO L87 Difference]: Start difference. First operand 541 states and 841 transitions. Second operand 3 states. [2020-12-22 07:13:02,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:02,890 INFO L93 Difference]: Finished difference Result 1288 states and 2008 transitions. [2020-12-22 07:13:02,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:13:02,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-12-22 07:13:02,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:02,895 INFO L225 Difference]: With dead ends: 1288 [2020-12-22 07:13:02,895 INFO L226 Difference]: Without dead ends: 761 [2020-12-22 07:13:02,896 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-12-22 07:13:02,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2020-12-22 07:13:02,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 758. [2020-12-22 07:13:02,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2020-12-22 07:13:02,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1165 transitions. [2020-12-22 07:13:02,947 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1165 transitions. Word has length 35 [2020-12-22 07:13:02,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:02,947 INFO L481 AbstractCegarLoop]: Abstraction has 758 states and 1165 transitions. [2020-12-22 07:13:02,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:13:02,947 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1165 transitions. [2020-12-22 07:13:02,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-12-22 07:13:02,948 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:02,948 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:02,949 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-22 07:13:02,949 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:02,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:02,949 INFO L82 PathProgramCache]: Analyzing trace with hash -209495903, now seen corresponding path program 1 times [2020-12-22 07:13:02,950 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:02,950 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183687122] [2020-12-22 07:13:02,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:02,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:03,021 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:13:03,021 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183687122] [2020-12-22 07:13:03,022 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:03,022 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:13:03,022 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022678868] [2020-12-22 07:13:03,022 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:13:03,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:03,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:13:03,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:03,024 INFO L87 Difference]: Start difference. First operand 758 states and 1165 transitions. Second operand 3 states. [2020-12-22 07:13:03,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:03,114 INFO L93 Difference]: Finished difference Result 1864 states and 2903 transitions. [2020-12-22 07:13:03,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:13:03,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2020-12-22 07:13:03,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:03,121 INFO L225 Difference]: With dead ends: 1864 [2020-12-22 07:13:03,121 INFO L226 Difference]: Without dead ends: 1133 [2020-12-22 07:13:03,129 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-12-22 07:13:03,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2020-12-22 07:13:03,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1131. [2020-12-22 07:13:03,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1131 states. [2020-12-22 07:13:03,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1752 transitions. [2020-12-22 07:13:03,214 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1752 transitions. Word has length 45 [2020-12-22 07:13:03,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:03,217 INFO L481 AbstractCegarLoop]: Abstraction has 1131 states and 1752 transitions. [2020-12-22 07:13:03,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:13:03,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1752 transitions. [2020-12-22 07:13:03,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-12-22 07:13:03,220 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:03,220 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:03,220 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-22 07:13:03,222 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:03,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:03,222 INFO L82 PathProgramCache]: Analyzing trace with hash 214150819, now seen corresponding path program 1 times [2020-12-22 07:13:03,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:03,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133344496] [2020-12-22 07:13:03,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:03,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:03,259 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-22 07:13:03,260 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133344496] [2020-12-22 07:13:03,260 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:03,260 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:13:03,260 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824604747] [2020-12-22 07:13:03,261 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:13:03,261 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:03,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:13:03,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:03,261 INFO L87 Difference]: Start difference. First operand 1131 states and 1752 transitions. Second operand 3 states. [2020-12-22 07:13:03,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:03,340 INFO L93 Difference]: Finished difference Result 2213 states and 3445 transitions. [2020-12-22 07:13:03,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:13:03,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2020-12-22 07:13:03,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:03,347 INFO L225 Difference]: With dead ends: 2213 [2020-12-22 07:13:03,347 INFO L226 Difference]: Without dead ends: 1109 [2020-12-22 07:13:03,350 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-12-22 07:13:03,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2020-12-22 07:13:03,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1109. [2020-12-22 07:13:03,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1109 states. [2020-12-22 07:13:03,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1725 transitions. [2020-12-22 07:13:03,455 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1725 transitions. Word has length 45 [2020-12-22 07:13:03,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:03,456 INFO L481 AbstractCegarLoop]: Abstraction has 1109 states and 1725 transitions. [2020-12-22 07:13:03,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:13:03,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1725 transitions. [2020-12-22 07:13:03,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-12-22 07:13:03,457 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:03,457 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:03,458 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-22 07:13:03,458 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:03,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:03,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1700232685, now seen corresponding path program 1 times [2020-12-22 07:13:03,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:03,459 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737160490] [2020-12-22 07:13:03,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:03,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:03,505 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:13:03,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737160490] [2020-12-22 07:13:03,506 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:03,506 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:13:03,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549621610] [2020-12-22 07:13:03,508 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:13:03,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:03,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:13:03,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:03,510 INFO L87 Difference]: Start difference. First operand 1109 states and 1725 transitions. Second operand 3 states. [2020-12-22 07:13:03,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:03,680 INFO L93 Difference]: Finished difference Result 2813 states and 4432 transitions. [2020-12-22 07:13:03,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:13:03,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-12-22 07:13:03,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:03,690 INFO L225 Difference]: With dead ends: 2813 [2020-12-22 07:13:03,691 INFO L226 Difference]: Without dead ends: 1731 [2020-12-22 07:13:03,695 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-12-22 07:13:03,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1731 states. [2020-12-22 07:13:03,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1731 to 1729. [2020-12-22 07:13:03,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1729 states. [2020-12-22 07:13:03,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1729 states to 1729 states and 2711 transitions. [2020-12-22 07:13:03,822 INFO L78 Accepts]: Start accepts. Automaton has 1729 states and 2711 transitions. Word has length 46 [2020-12-22 07:13:03,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:03,823 INFO L481 AbstractCegarLoop]: Abstraction has 1729 states and 2711 transitions. [2020-12-22 07:13:03,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:13:03,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1729 states and 2711 transitions. [2020-12-22 07:13:03,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-12-22 07:13:03,824 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:03,825 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:03,825 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-22 07:13:03,825 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:03,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:03,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1601371510, now seen corresponding path program 1 times [2020-12-22 07:13:03,826 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:03,826 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740226688] [2020-12-22 07:13:03,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:03,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:03,876 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:13:03,876 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740226688] [2020-12-22 07:13:03,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:03,879 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:13:03,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978957269] [2020-12-22 07:13:03,880 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:13:03,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:03,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:13:03,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:03,881 INFO L87 Difference]: Start difference. First operand 1729 states and 2711 transitions. Second operand 3 states. [2020-12-22 07:13:04,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:04,109 INFO L93 Difference]: Finished difference Result 4644 states and 7373 transitions. [2020-12-22 07:13:04,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:13:04,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2020-12-22 07:13:04,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:04,127 INFO L225 Difference]: With dead ends: 4644 [2020-12-22 07:13:04,128 INFO L226 Difference]: Without dead ends: 2944 [2020-12-22 07:13:04,132 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-12-22 07:13:04,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2020-12-22 07:13:04,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 2942. [2020-12-22 07:13:04,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2942 states. [2020-12-22 07:13:04,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2942 states to 2942 states and 4650 transitions. [2020-12-22 07:13:04,376 INFO L78 Accepts]: Start accepts. Automaton has 2942 states and 4650 transitions. Word has length 47 [2020-12-22 07:13:04,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:04,376 INFO L481 AbstractCegarLoop]: Abstraction has 2942 states and 4650 transitions. [2020-12-22 07:13:04,376 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:13:04,376 INFO L276 IsEmpty]: Start isEmpty. Operand 2942 states and 4650 transitions. [2020-12-22 07:13:04,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-12-22 07:13:04,378 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:04,378 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:04,380 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-22 07:13:04,381 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:04,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:04,381 INFO L82 PathProgramCache]: Analyzing trace with hash 2025018232, now seen corresponding path program 1 times [2020-12-22 07:13:04,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:04,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777205640] [2020-12-22 07:13:04,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:04,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:04,415 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-22 07:13:04,416 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777205640] [2020-12-22 07:13:04,416 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:04,416 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:13:04,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267235150] [2020-12-22 07:13:04,417 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:13:04,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:04,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:13:04,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:04,419 INFO L87 Difference]: Start difference. First operand 2942 states and 4650 transitions. Second operand 3 states. [2020-12-22 07:13:04,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:04,602 INFO L93 Difference]: Finished difference Result 5833 states and 9241 transitions. [2020-12-22 07:13:04,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:13:04,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2020-12-22 07:13:04,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:04,620 INFO L225 Difference]: With dead ends: 5833 [2020-12-22 07:13:04,620 INFO L226 Difference]: Without dead ends: 2920 [2020-12-22 07:13:04,627 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-12-22 07:13:04,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2020-12-22 07:13:04,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 2920. [2020-12-22 07:13:04,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2920 states. [2020-12-22 07:13:04,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2920 states and 4624 transitions. [2020-12-22 07:13:04,870 INFO L78 Accepts]: Start accepts. Automaton has 2920 states and 4624 transitions. Word has length 47 [2020-12-22 07:13:04,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:04,870 INFO L481 AbstractCegarLoop]: Abstraction has 2920 states and 4624 transitions. [2020-12-22 07:13:04,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:13:04,870 INFO L276 IsEmpty]: Start isEmpty. Operand 2920 states and 4624 transitions. [2020-12-22 07:13:04,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-12-22 07:13:04,872 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:04,872 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:04,872 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-22 07:13:04,873 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:04,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:04,873 INFO L82 PathProgramCache]: Analyzing trace with hash -2129316584, now seen corresponding path program 1 times [2020-12-22 07:13:04,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:04,874 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746951427] [2020-12-22 07:13:04,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:04,916 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:13:04,916 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746951427] [2020-12-22 07:13:04,916 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:04,916 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:13:04,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672519325] [2020-12-22 07:13:04,919 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:13:04,919 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:04,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:13:04,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:13:04,920 INFO L87 Difference]: Start difference. First operand 2920 states and 4624 transitions. Second operand 4 states. [2020-12-22 07:13:05,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:05,311 INFO L93 Difference]: Finished difference Result 7421 states and 11813 transitions. [2020-12-22 07:13:05,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 07:13:05,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2020-12-22 07:13:05,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:05,333 INFO L225 Difference]: With dead ends: 7421 [2020-12-22 07:13:05,333 INFO L226 Difference]: Without dead ends: 3797 [2020-12-22 07:13:05,340 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:13:05,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3797 states. [2020-12-22 07:13:05,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3797 to 3797. [2020-12-22 07:13:05,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3797 states. [2020-12-22 07:13:05,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3797 states to 3797 states and 5990 transitions. [2020-12-22 07:13:05,650 INFO L78 Accepts]: Start accepts. Automaton has 3797 states and 5990 transitions. Word has length 48 [2020-12-22 07:13:05,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:05,650 INFO L481 AbstractCegarLoop]: Abstraction has 3797 states and 5990 transitions. [2020-12-22 07:13:05,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:13:05,651 INFO L276 IsEmpty]: Start isEmpty. Operand 3797 states and 5990 transitions. [2020-12-22 07:13:05,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-12-22 07:13:05,653 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:05,653 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-22 07:13:05,653 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-22 07:13:05,653 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:05,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:05,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1211370450, now seen corresponding path program 1 times [2020-12-22 07:13:05,654 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:05,656 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327672199] [2020-12-22 07:13:05,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:05,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:05,717 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:13:05,718 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327672199] [2020-12-22 07:13:05,718 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:05,718 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 07:13:05,718 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901513000] [2020-12-22 07:13:05,720 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 07:13:05,720 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:05,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 07:13:05,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:13:05,721 INFO L87 Difference]: Start difference. First operand 3797 states and 5990 transitions. Second operand 5 states. [2020-12-22 07:13:06,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:06,259 INFO L93 Difference]: Finished difference Result 9692 states and 15178 transitions. [2020-12-22 07:13:06,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-22 07:13:06,260 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2020-12-22 07:13:06,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:06,307 INFO L225 Difference]: With dead ends: 9692 [2020-12-22 07:13:06,307 INFO L226 Difference]: Without dead ends: 5918 [2020-12-22 07:13:06,316 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-22 07:13:06,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5918 states. [2020-12-22 07:13:06,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5918 to 4440. [2020-12-22 07:13:06,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4440 states. [2020-12-22 07:13:06,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4440 states to 4440 states and 6847 transitions. [2020-12-22 07:13:06,705 INFO L78 Accepts]: Start accepts. Automaton has 4440 states and 6847 transitions. Word has length 53 [2020-12-22 07:13:06,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:06,705 INFO L481 AbstractCegarLoop]: Abstraction has 4440 states and 6847 transitions. [2020-12-22 07:13:06,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 07:13:06,705 INFO L276 IsEmpty]: Start isEmpty. Operand 4440 states and 6847 transitions. [2020-12-22 07:13:06,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-12-22 07:13:06,715 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:06,716 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:06,716 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-22 07:13:06,716 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:06,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:06,717 INFO L82 PathProgramCache]: Analyzing trace with hash -826237841, now seen corresponding path program 1 times [2020-12-22 07:13:06,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:06,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009465314] [2020-12-22 07:13:06,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:06,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:06,803 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:13:06,804 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009465314] [2020-12-22 07:13:06,804 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:06,805 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:13:06,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33395299] [2020-12-22 07:13:06,806 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:13:06,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:06,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:13:06,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:06,808 INFO L87 Difference]: Start difference. First operand 4440 states and 6847 transitions. Second operand 3 states. [2020-12-22 07:13:07,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:07,242 INFO L93 Difference]: Finished difference Result 9203 states and 14160 transitions. [2020-12-22 07:13:07,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:13:07,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2020-12-22 07:13:07,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:07,256 INFO L225 Difference]: With dead ends: 9203 [2020-12-22 07:13:07,256 INFO L226 Difference]: Without dead ends: 4792 [2020-12-22 07:13:07,263 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-12-22 07:13:07,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4792 states. [2020-12-22 07:13:07,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4792 to 4760. [2020-12-22 07:13:07,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4760 states. [2020-12-22 07:13:07,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4760 states to 4760 states and 7096 transitions. [2020-12-22 07:13:07,617 INFO L78 Accepts]: Start accepts. Automaton has 4760 states and 7096 transitions. Word has length 85 [2020-12-22 07:13:07,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:07,618 INFO L481 AbstractCegarLoop]: Abstraction has 4760 states and 7096 transitions. [2020-12-22 07:13:07,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:13:07,618 INFO L276 IsEmpty]: Start isEmpty. Operand 4760 states and 7096 transitions. [2020-12-22 07:13:07,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-12-22 07:13:07,622 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:07,623 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:07,623 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-22 07:13:07,623 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:07,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:07,624 INFO L82 PathProgramCache]: Analyzing trace with hash -433884439, now seen corresponding path program 1 times [2020-12-22 07:13:07,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:07,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313722491] [2020-12-22 07:13:07,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:07,661 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:13:07,661 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313722491] [2020-12-22 07:13:07,661 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:07,661 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:13:07,662 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018562295] [2020-12-22 07:13:07,662 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:13:07,662 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:07,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:13:07,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:07,663 INFO L87 Difference]: Start difference. First operand 4760 states and 7096 transitions. Second operand 3 states. [2020-12-22 07:13:08,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:08,067 INFO L93 Difference]: Finished difference Result 10001 states and 14870 transitions. [2020-12-22 07:13:08,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:13:08,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2020-12-22 07:13:08,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:08,081 INFO L225 Difference]: With dead ends: 10001 [2020-12-22 07:13:08,082 INFO L226 Difference]: Without dead ends: 5282 [2020-12-22 07:13:08,088 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-12-22 07:13:08,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5282 states. [2020-12-22 07:13:08,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5282 to 5234. [2020-12-22 07:13:08,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5234 states. [2020-12-22 07:13:08,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5234 states to 5234 states and 7539 transitions. [2020-12-22 07:13:08,426 INFO L78 Accepts]: Start accepts. Automaton has 5234 states and 7539 transitions. Word has length 86 [2020-12-22 07:13:08,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:08,426 INFO L481 AbstractCegarLoop]: Abstraction has 5234 states and 7539 transitions. [2020-12-22 07:13:08,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:13:08,426 INFO L276 IsEmpty]: Start isEmpty. Operand 5234 states and 7539 transitions. [2020-12-22 07:13:08,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-12-22 07:13:08,431 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:08,432 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:08,432 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-22 07:13:08,432 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:08,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:08,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1869450223, now seen corresponding path program 1 times [2020-12-22 07:13:08,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:08,433 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704565397] [2020-12-22 07:13:08,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:08,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:08,470 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:13:08,470 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704565397] [2020-12-22 07:13:08,470 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:08,471 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:13:08,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005969340] [2020-12-22 07:13:08,471 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:13:08,471 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:08,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:13:08,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:08,472 INFO L87 Difference]: Start difference. First operand 5234 states and 7539 transitions. Second operand 3 states. [2020-12-22 07:13:08,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:08,910 INFO L93 Difference]: Finished difference Result 10775 states and 15529 transitions. [2020-12-22 07:13:08,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:13:08,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2020-12-22 07:13:08,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:08,929 INFO L225 Difference]: With dead ends: 10775 [2020-12-22 07:13:08,930 INFO L226 Difference]: Without dead ends: 5602 [2020-12-22 07:13:08,938 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-12-22 07:13:08,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5602 states. [2020-12-22 07:13:09,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5602 to 5024. [2020-12-22 07:13:09,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5024 states. [2020-12-22 07:13:09,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5024 states to 5024 states and 6917 transitions. [2020-12-22 07:13:09,337 INFO L78 Accepts]: Start accepts. Automaton has 5024 states and 6917 transitions. Word has length 87 [2020-12-22 07:13:09,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:09,338 INFO L481 AbstractCegarLoop]: Abstraction has 5024 states and 6917 transitions. [2020-12-22 07:13:09,338 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:13:09,338 INFO L276 IsEmpty]: Start isEmpty. Operand 5024 states and 6917 transitions. [2020-12-22 07:13:09,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-12-22 07:13:09,344 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:09,344 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-22 07:13:09,345 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-22 07:13:09,345 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:09,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:09,345 INFO L82 PathProgramCache]: Analyzing trace with hash -2059863225, now seen corresponding path program 1 times [2020-12-22 07:13:09,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:09,346 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121867035] [2020-12-22 07:13:09,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:09,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:09,408 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-22 07:13:09,409 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121867035] [2020-12-22 07:13:09,409 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:09,409 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:13:09,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795168309] [2020-12-22 07:13:09,411 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:13:09,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:09,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:13:09,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:13:09,415 INFO L87 Difference]: Start difference. First operand 5024 states and 6917 transitions. Second operand 4 states. [2020-12-22 07:13:10,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:10,003 INFO L93 Difference]: Finished difference Result 9412 states and 12909 transitions. [2020-12-22 07:13:10,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 07:13:10,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2020-12-22 07:13:10,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:10,016 INFO L225 Difference]: With dead ends: 9412 [2020-12-22 07:13:10,016 INFO L226 Difference]: Without dead ends: 4839 [2020-12-22 07:13:10,023 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:13:10,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4839 states. [2020-12-22 07:13:10,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4839 to 4725. [2020-12-22 07:13:10,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4725 states. [2020-12-22 07:13:10,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4725 states to 4725 states and 6299 transitions. [2020-12-22 07:13:10,343 INFO L78 Accepts]: Start accepts. Automaton has 4725 states and 6299 transitions. Word has length 88 [2020-12-22 07:13:10,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:10,343 INFO L481 AbstractCegarLoop]: Abstraction has 4725 states and 6299 transitions. [2020-12-22 07:13:10,343 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:13:10,344 INFO L276 IsEmpty]: Start isEmpty. Operand 4725 states and 6299 transitions. [2020-12-22 07:13:10,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-12-22 07:13:10,362 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:10,363 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:10,363 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-22 07:13:10,365 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:10,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:10,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1061949686, now seen corresponding path program 1 times [2020-12-22 07:13:10,366 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:10,367 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721024687] [2020-12-22 07:13:10,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:10,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:10,439 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-22 07:13:10,439 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721024687] [2020-12-22 07:13:10,439 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:10,439 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:13:10,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311014374] [2020-12-22 07:13:10,440 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:13:10,440 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:10,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:13:10,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:10,444 INFO L87 Difference]: Start difference. First operand 4725 states and 6299 transitions. Second operand 3 states. [2020-12-22 07:13:10,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:10,981 INFO L93 Difference]: Finished difference Result 9005 states and 11995 transitions. [2020-12-22 07:13:10,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:13:10,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2020-12-22 07:13:10,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:10,992 INFO L225 Difference]: With dead ends: 9005 [2020-12-22 07:13:10,992 INFO L226 Difference]: Without dead ends: 4671 [2020-12-22 07:13:10,998 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-12-22 07:13:11,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4671 states. [2020-12-22 07:13:11,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4671 to 4671. [2020-12-22 07:13:11,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4671 states. [2020-12-22 07:13:11,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4671 states to 4671 states and 6193 transitions. [2020-12-22 07:13:11,414 INFO L78 Accepts]: Start accepts. Automaton has 4671 states and 6193 transitions. Word has length 115 [2020-12-22 07:13:11,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:11,415 INFO L481 AbstractCegarLoop]: Abstraction has 4671 states and 6193 transitions. [2020-12-22 07:13:11,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:13:11,415 INFO L276 IsEmpty]: Start isEmpty. Operand 4671 states and 6193 transitions. [2020-12-22 07:13:11,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2020-12-22 07:13:11,426 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:11,426 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:11,426 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-22 07:13:11,426 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:11,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:11,427 INFO L82 PathProgramCache]: Analyzing trace with hash 314934891, now seen corresponding path program 1 times [2020-12-22 07:13:11,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:11,427 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879000280] [2020-12-22 07:13:11,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:11,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:11,485 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-22 07:13:11,486 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879000280] [2020-12-22 07:13:11,486 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:11,486 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:13:11,486 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23799610] [2020-12-22 07:13:11,487 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:13:11,487 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:11,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:13:11,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:13:11,488 INFO L87 Difference]: Start difference. First operand 4671 states and 6193 transitions. Second operand 4 states. [2020-12-22 07:13:11,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:11,942 INFO L93 Difference]: Finished difference Result 8293 states and 11017 transitions. [2020-12-22 07:13:11,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 07:13:11,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2020-12-22 07:13:11,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:11,952 INFO L225 Difference]: With dead ends: 8293 [2020-12-22 07:13:11,952 INFO L226 Difference]: Without dead ends: 4591 [2020-12-22 07:13:11,958 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:13:11,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4591 states. [2020-12-22 07:13:12,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4591 to 4589. [2020-12-22 07:13:12,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4589 states. [2020-12-22 07:13:12,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4589 states to 4589 states and 5972 transitions. [2020-12-22 07:13:12,342 INFO L78 Accepts]: Start accepts. Automaton has 4589 states and 5972 transitions. Word has length 127 [2020-12-22 07:13:12,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:12,342 INFO L481 AbstractCegarLoop]: Abstraction has 4589 states and 5972 transitions. [2020-12-22 07:13:12,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:13:12,343 INFO L276 IsEmpty]: Start isEmpty. Operand 4589 states and 5972 transitions. [2020-12-22 07:13:12,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-12-22 07:13:12,353 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:12,353 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:12,353 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-22 07:13:12,353 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:12,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:12,354 INFO L82 PathProgramCache]: Analyzing trace with hash -146147841, now seen corresponding path program 1 times [2020-12-22 07:13:12,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:12,354 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561907714] [2020-12-22 07:13:12,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:12,402 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-12-22 07:13:12,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561907714] [2020-12-22 07:13:12,402 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:12,403 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:13:12,403 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017971460] [2020-12-22 07:13:12,403 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:13:12,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:12,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:13:12,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:12,404 INFO L87 Difference]: Start difference. First operand 4589 states and 5972 transitions. Second operand 3 states. [2020-12-22 07:13:12,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:12,845 INFO L93 Difference]: Finished difference Result 8787 states and 11424 transitions. [2020-12-22 07:13:12,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:13:12,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2020-12-22 07:13:12,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:12,855 INFO L225 Difference]: With dead ends: 8787 [2020-12-22 07:13:12,855 INFO L226 Difference]: Without dead ends: 4589 [2020-12-22 07:13:12,862 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-12-22 07:13:12,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4589 states. [2020-12-22 07:13:13,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4589 to 4549. [2020-12-22 07:13:13,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4549 states. [2020-12-22 07:13:13,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4549 states to 4549 states and 5890 transitions. [2020-12-22 07:13:13,305 INFO L78 Accepts]: Start accepts. Automaton has 4549 states and 5890 transitions. Word has length 133 [2020-12-22 07:13:13,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:13,305 INFO L481 AbstractCegarLoop]: Abstraction has 4549 states and 5890 transitions. [2020-12-22 07:13:13,305 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:13:13,305 INFO L276 IsEmpty]: Start isEmpty. Operand 4549 states and 5890 transitions. [2020-12-22 07:13:13,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-12-22 07:13:13,313 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:13,314 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:13,314 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-22 07:13:13,314 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:13,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:13,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1797709215, now seen corresponding path program 1 times [2020-12-22 07:13:13,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:13,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061023277] [2020-12-22 07:13:13,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:13,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:13,361 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-12-22 07:13:13,361 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061023277] [2020-12-22 07:13:13,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:13,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:13:13,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103571416] [2020-12-22 07:13:13,362 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:13:13,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:13,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:13:13,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:13,363 INFO L87 Difference]: Start difference. First operand 4549 states and 5890 transitions. Second operand 3 states. [2020-12-22 07:13:13,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:13,657 INFO L93 Difference]: Finished difference Result 8735 states and 11302 transitions. [2020-12-22 07:13:13,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:13:13,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2020-12-22 07:13:13,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:13,675 INFO L225 Difference]: With dead ends: 8735 [2020-12-22 07:13:13,675 INFO L226 Difference]: Without dead ends: 4558 [2020-12-22 07:13:13,683 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-12-22 07:13:13,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4558 states. [2020-12-22 07:13:14,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4558 to 4518. [2020-12-22 07:13:14,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4518 states. [2020-12-22 07:13:14,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4518 states to 4518 states and 5818 transitions. [2020-12-22 07:13:14,121 INFO L78 Accepts]: Start accepts. Automaton has 4518 states and 5818 transitions. Word has length 133 [2020-12-22 07:13:14,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:14,122 INFO L481 AbstractCegarLoop]: Abstraction has 4518 states and 5818 transitions. [2020-12-22 07:13:14,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:13:14,122 INFO L276 IsEmpty]: Start isEmpty. Operand 4518 states and 5818 transitions. [2020-12-22 07:13:14,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-12-22 07:13:14,128 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:14,129 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:14,129 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-22 07:13:14,129 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:14,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:14,130 INFO L82 PathProgramCache]: Analyzing trace with hash 282610594, now seen corresponding path program 1 times [2020-12-22 07:13:14,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:14,130 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672770516] [2020-12-22 07:13:14,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:14,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:14,179 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-12-22 07:13:14,179 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672770516] [2020-12-22 07:13:14,179 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:14,180 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:13:14,180 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839584336] [2020-12-22 07:13:14,180 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:13:14,180 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:14,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:13:14,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:13:14,181 INFO L87 Difference]: Start difference. First operand 4518 states and 5818 transitions. Second operand 4 states. [2020-12-22 07:13:14,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:14,513 INFO L93 Difference]: Finished difference Result 7327 states and 9468 transitions. [2020-12-22 07:13:14,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 07:13:14,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2020-12-22 07:13:14,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:14,521 INFO L225 Difference]: With dead ends: 7327 [2020-12-22 07:13:14,521 INFO L226 Difference]: Without dead ends: 3182 [2020-12-22 07:13:14,527 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:13:14,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3182 states. [2020-12-22 07:13:14,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3182 to 3180. [2020-12-22 07:13:14,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3180 states. [2020-12-22 07:13:14,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3180 states to 3180 states and 4000 transitions. [2020-12-22 07:13:14,788 INFO L78 Accepts]: Start accepts. Automaton has 3180 states and 4000 transitions. Word has length 136 [2020-12-22 07:13:14,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:14,788 INFO L481 AbstractCegarLoop]: Abstraction has 3180 states and 4000 transitions. [2020-12-22 07:13:14,788 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:13:14,788 INFO L276 IsEmpty]: Start isEmpty. Operand 3180 states and 4000 transitions. [2020-12-22 07:13:14,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-12-22 07:13:14,792 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:14,792 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:14,792 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-22 07:13:14,792 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:14,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:14,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1519116211, now seen corresponding path program 1 times [2020-12-22 07:13:14,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:14,793 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398474028] [2020-12-22 07:13:14,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:14,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:14,842 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-12-22 07:13:14,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398474028] [2020-12-22 07:13:14,843 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:14,843 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:13:14,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928548047] [2020-12-22 07:13:14,844 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:13:14,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:14,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:13:14,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:13:14,845 INFO L87 Difference]: Start difference. First operand 3180 states and 4000 transitions. Second operand 4 states. [2020-12-22 07:13:15,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:15,056 INFO L93 Difference]: Finished difference Result 5150 states and 6486 transitions. [2020-12-22 07:13:15,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 07:13:15,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2020-12-22 07:13:15,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:15,060 INFO L225 Difference]: With dead ends: 5150 [2020-12-22 07:13:15,060 INFO L226 Difference]: Without dead ends: 2043 [2020-12-22 07:13:15,063 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:13:15,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2043 states. [2020-12-22 07:13:15,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2043 to 2041. [2020-12-22 07:13:15,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2041 states. [2020-12-22 07:13:15,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2041 states to 2041 states and 2486 transitions. [2020-12-22 07:13:15,233 INFO L78 Accepts]: Start accepts. Automaton has 2041 states and 2486 transitions. Word has length 136 [2020-12-22 07:13:15,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:15,234 INFO L481 AbstractCegarLoop]: Abstraction has 2041 states and 2486 transitions. [2020-12-22 07:13:15,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:13:15,234 INFO L276 IsEmpty]: Start isEmpty. Operand 2041 states and 2486 transitions. [2020-12-22 07:13:15,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-12-22 07:13:15,235 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:15,235 INFO L422 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:15,235 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-22 07:13:15,236 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:15,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:15,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1947572035, now seen corresponding path program 1 times [2020-12-22 07:13:15,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:15,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28542947] [2020-12-22 07:13:15,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:15,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:15,289 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-12-22 07:13:15,290 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28542947] [2020-12-22 07:13:15,290 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:15,290 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:13:15,290 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151447312] [2020-12-22 07:13:15,291 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:13:15,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:15,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:13:15,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:15,292 INFO L87 Difference]: Start difference. First operand 2041 states and 2486 transitions. Second operand 3 states. [2020-12-22 07:13:15,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:15,435 INFO L93 Difference]: Finished difference Result 3699 states and 4535 transitions. [2020-12-22 07:13:15,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:13:15,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2020-12-22 07:13:15,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:15,440 INFO L225 Difference]: With dead ends: 3699 [2020-12-22 07:13:15,441 INFO L226 Difference]: Without dead ends: 1999 [2020-12-22 07:13:15,443 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-12-22 07:13:15,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2020-12-22 07:13:15,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 1931. [2020-12-22 07:13:15,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1931 states. [2020-12-22 07:13:15,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1931 states to 1931 states and 2328 transitions. [2020-12-22 07:13:15,617 INFO L78 Accepts]: Start accepts. Automaton has 1931 states and 2328 transitions. Word has length 175 [2020-12-22 07:13:15,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:15,617 INFO L481 AbstractCegarLoop]: Abstraction has 1931 states and 2328 transitions. [2020-12-22 07:13:15,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:13:15,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2328 transitions. [2020-12-22 07:13:15,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2020-12-22 07:13:15,619 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:15,619 INFO L422 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:15,620 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-22 07:13:15,620 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:15,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:15,620 INFO L82 PathProgramCache]: Analyzing trace with hash 640476680, now seen corresponding path program 1 times [2020-12-22 07:13:15,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:15,621 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130638829] [2020-12-22 07:13:15,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:15,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:15,687 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-12-22 07:13:15,687 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130638829] [2020-12-22 07:13:15,687 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:15,688 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:13:15,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291149671] [2020-12-22 07:13:15,688 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:13:15,688 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:15,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:13:15,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:15,689 INFO L87 Difference]: Start difference. First operand 1931 states and 2328 transitions. Second operand 3 states. [2020-12-22 07:13:15,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:15,872 INFO L93 Difference]: Finished difference Result 4154 states and 5043 transitions. [2020-12-22 07:13:15,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:13:15,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2020-12-22 07:13:15,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:15,876 INFO L225 Difference]: With dead ends: 4154 [2020-12-22 07:13:15,876 INFO L226 Difference]: Without dead ends: 2560 [2020-12-22 07:13:15,878 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-12-22 07:13:15,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2560 states. [2020-12-22 07:13:16,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2560 to 2209. [2020-12-22 07:13:16,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2209 states. [2020-12-22 07:13:16,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2209 states to 2209 states and 2628 transitions. [2020-12-22 07:13:16,072 INFO L78 Accepts]: Start accepts. Automaton has 2209 states and 2628 transitions. Word has length 181 [2020-12-22 07:13:16,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:16,072 INFO L481 AbstractCegarLoop]: Abstraction has 2209 states and 2628 transitions. [2020-12-22 07:13:16,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:13:16,072 INFO L276 IsEmpty]: Start isEmpty. Operand 2209 states and 2628 transitions. [2020-12-22 07:13:16,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2020-12-22 07:13:16,074 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:16,074 INFO L422 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:16,074 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-22 07:13:16,075 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:16,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:16,075 INFO L82 PathProgramCache]: Analyzing trace with hash -646225786, now seen corresponding path program 1 times [2020-12-22 07:13:16,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:16,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442770283] [2020-12-22 07:13:16,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:13:16,158 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-12-22 07:13:16,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442770283] [2020-12-22 07:13:16,159 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:13:16,159 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:13:16,159 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811827511] [2020-12-22 07:13:16,160 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:13:16,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:13:16,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:13:16,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:13:16,161 INFO L87 Difference]: Start difference. First operand 2209 states and 2628 transitions. Second operand 3 states. [2020-12-22 07:13:16,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:13:16,345 INFO L93 Difference]: Finished difference Result 3746 states and 4490 transitions. [2020-12-22 07:13:16,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:13:16,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2020-12-22 07:13:16,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:13:16,348 INFO L225 Difference]: With dead ends: 3746 [2020-12-22 07:13:16,348 INFO L226 Difference]: Without dead ends: 1872 [2020-12-22 07:13:16,350 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-12-22 07:13:16,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1872 states. [2020-12-22 07:13:16,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1872 to 1793. [2020-12-22 07:13:16,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1793 states. [2020-12-22 07:13:16,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 2102 transitions. [2020-12-22 07:13:16,485 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 2102 transitions. Word has length 184 [2020-12-22 07:13:16,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:13:16,485 INFO L481 AbstractCegarLoop]: Abstraction has 1793 states and 2102 transitions. [2020-12-22 07:13:16,485 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:13:16,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 2102 transitions. [2020-12-22 07:13:16,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2020-12-22 07:13:16,486 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:13:16,486 INFO L422 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:13:16,487 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-22 07:13:16,487 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:13:16,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:13:16,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1772258692, now seen corresponding path program 1 times [2020-12-22 07:13:16,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:13:16,488 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486147108] [2020-12-22 07:13:16,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:13:16,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-22 07:13:16,515 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-22 07:13:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-22 07:13:16,537 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-22 07:13:16,623 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-22 07:13:16,623 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-22 07:13:16,624 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-12-22 07:13:16,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 07:13:16 BoogieIcfgContainer [2020-12-22 07:13:16,842 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-22 07:13:16,843 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-22 07:13:16,843 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-22 07:13:16,843 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-22 07:13:16,844 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 07:13:00" (3/4) ... [2020-12-22 07:13:16,846 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-22 07:13:17,122 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/systemc/toy2.cil.c-witness.graphml [2020-12-22 07:13:17,123 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-22 07:13:17,125 INFO L168 Benchmark]: Toolchain (without parser) took 18514.98 ms. Allocated memory was 159.4 MB in the beginning and 1.1 GB in the end (delta: 987.8 MB). Free memory was 135.2 MB in the beginning and 783.1 MB in the end (delta: -648.0 MB). Peak memory consumption was 340.5 MB. Max. memory is 8.0 GB. [2020-12-22 07:13:17,126 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 159.4 MB. Free memory is still 140.0 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-22 07:13:17,127 INFO L168 Benchmark]: CACSL2BoogieTranslator took 391.31 ms. Allocated memory is still 159.4 MB. Free memory was 135.0 MB in the beginning and 120.8 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2020-12-22 07:13:17,127 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.86 ms. Allocated memory is still 159.4 MB. Free memory was 120.8 MB in the beginning and 118.6 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-22 07:13:17,127 INFO L168 Benchmark]: Boogie Preprocessor took 70.28 ms. Allocated memory is still 159.4 MB. Free memory was 118.6 MB in the beginning and 116.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-22 07:13:17,128 INFO L168 Benchmark]: RCFGBuilder took 865.25 ms. Allocated memory is still 159.4 MB. Free memory was 116.4 MB in the beginning and 121.4 MB in the end (delta: -5.0 MB). Peak memory consumption was 26.5 MB. Max. memory is 8.0 GB. [2020-12-22 07:13:17,128 INFO L168 Benchmark]: TraceAbstraction took 16827.10 ms. Allocated memory was 159.4 MB in the beginning and 1.1 GB in the end (delta: 987.8 MB). Free memory was 120.9 MB in the beginning and 820.3 MB in the end (delta: -699.4 MB). Peak memory consumption was 288.8 MB. Max. memory is 8.0 GB. [2020-12-22 07:13:17,128 INFO L168 Benchmark]: Witness Printer took 279.76 ms. Allocated memory is still 1.1 GB. Free memory was 820.3 MB in the beginning and 783.1 MB in the end (delta: 37.2 MB). Peak memory consumption was 36.7 MB. Max. memory is 8.0 GB. [2020-12-22 07:13:17,131 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 159.4 MB. Free memory is still 140.0 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 391.31 ms. Allocated memory is still 159.4 MB. Free memory was 135.0 MB in the beginning and 120.8 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 69.86 ms. Allocated memory is still 159.4 MB. Free memory was 120.8 MB in the beginning and 118.6 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 70.28 ms. Allocated memory is still 159.4 MB. Free memory was 118.6 MB in the beginning and 116.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 865.25 ms. Allocated memory is still 159.4 MB. Free memory was 116.4 MB in the beginning and 121.4 MB in the end (delta: -5.0 MB). Peak memory consumption was 26.5 MB. Max. memory is 8.0 GB. * TraceAbstraction took 16827.10 ms. Allocated memory was 159.4 MB in the beginning and 1.1 GB in the end (delta: 987.8 MB). Free memory was 120.9 MB in the beginning and 820.3 MB in the end (delta: -699.4 MB). Peak memory consumption was 288.8 MB. Max. memory is 8.0 GB. * Witness Printer took 279.76 ms. Allocated memory is still 1.1 GB. Free memory was 820.3 MB in the beginning and 783.1 MB in the end (delta: 37.2 MB). Peak memory consumption was 36.7 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L20] int c ; [L21] int c_t ; [L22] int c_req_up ; [L23] int p_in ; [L24] int p_out ; [L25] int wl_st ; [L26] int c1_st ; [L27] int c2_st ; [L28] int wb_st ; [L29] int r_st ; [L30] int wl_i ; [L31] int c1_i ; [L32] int c2_i ; [L33] int wb_i ; [L34] int r_i ; [L35] int wl_pc ; [L36] int c1_pc ; [L37] int c2_pc ; [L38] int wb_pc ; [L39] int e_e ; [L40] int e_f ; [L41] int e_g ; [L42] int e_c ; [L43] int e_p_in ; [L44] int e_wl ; [L50] int d ; [L51] int data ; [L52] int processed ; [L53] static int t_b ; VAL [c=0, c1_i=0, c1_pc=0, c1_st=0, c2_i=0, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=0, e_e=0, e_f=0, e_g=0, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=0, wb_pc=0, wb_st=0, wl_i=0, wl_pc=0, wl_st=0] [L681] int __retres1 ; [L685] e_wl = 2 [L686] e_c = e_wl [L687] e_g = e_c [L688] e_f = e_g [L689] e_e = e_f [L690] wl_pc = 0 [L691] c1_pc = 0 [L692] c2_pc = 0 [L693] wb_pc = 0 [L694] wb_i = 1 [L695] c2_i = wb_i [L696] c1_i = c2_i [L697] wl_i = c1_i [L698] r_i = 0 [L699] c_req_up = 0 [L700] d = 0 [L701] c = 0 [L392] int kernel_st ; [L395] kernel_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L396] COND FALSE !((int )c_req_up == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L407] COND TRUE (int )wl_i == 1 [L408] wl_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L412] COND TRUE (int )c1_i == 1 [L413] c1_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L417] COND TRUE (int )c2_i == 1 [L418] c2_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L422] COND TRUE (int )wb_i == 1 [L423] wb_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L427] COND FALSE !((int )r_i == 1) [L430] r_st = 2 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L432] COND FALSE !((int )e_f == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L437] COND FALSE !((int )e_g == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L442] COND FALSE !((int )e_e == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L447] COND FALSE !((int )e_c == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L452] COND FALSE !((int )e_wl == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L457] COND FALSE !((int )wl_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L465] COND FALSE !((int )wl_pc == 2) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L475] COND FALSE !((int )c1_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L484] COND FALSE !((int )c2_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L493] COND FALSE !((int )wb_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L502] COND FALSE !((int )e_c == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L507] COND FALSE !((int )e_e == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L512] COND FALSE !((int )e_f == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L517] COND FALSE !((int )e_g == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L522] COND FALSE !((int )e_c == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L527] COND FALSE !((int )e_wl == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L533] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L536] kernel_st = 1 [L278] int tmp ; [L279] int tmp___0 ; [L280] int tmp___1 ; [L281] int tmp___2 ; [L282] int tmp___3 ; VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L286] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L288] COND TRUE (int )wl_st == 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L309] COND TRUE (int )wl_st == 0 [L311] tmp = __VERIFIER_nondet_int() [L313] COND TRUE \read(tmp) [L315] wl_st = 1 [L55] int t ; VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=1] [L58] COND TRUE (int )wl_pc == 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=1] [L72] wl_st = 2 [L73] wl_pc = 1 [L74] e_wl = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L324] COND TRUE (int )c1_st == 0 [L326] tmp___0 = __VERIFIER_nondet_int() [L328] COND TRUE \read(tmp___0) [L330] c1_st = 1 VAL [c=0, c1_i=1, c1_pc=0, c1_st=1, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L129] COND TRUE (int )c1_pc == 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=1, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L140] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=0, c1_st=1, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L142] c1_st = 2 [L143] c1_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L339] COND TRUE (int )c2_st == 0 [L341] tmp___1 = __VERIFIER_nondet_int() [L343] COND TRUE \read(tmp___1) [L345] c2_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=0, c2_st=1, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L174] COND TRUE (int )c2_pc == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=0, c2_st=1, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L185] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=0, c2_st=1, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L187] c2_st = 2 [L188] c2_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L354] COND TRUE (int )wb_st == 0 [L356] tmp___2 = __VERIFIER_nondet_int() [L358] COND TRUE \read(tmp___2) [L360] wb_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=1, wl_i=1, wl_pc=1, wl_st=2] [L219] COND TRUE (int )wb_pc == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=1, wl_i=1, wl_pc=1, wl_st=2] [L230] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=1, wl_i=1, wl_pc=1, wl_st=2] [L232] wb_st = 2 [L233] wb_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L369] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L286] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L288] COND FALSE !((int )wl_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L291] COND FALSE !((int )c1_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L294] COND FALSE !((int )c2_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L297] COND FALSE !((int )wb_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L300] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L539] kernel_st = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L540] COND FALSE !((int )c_req_up == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L551] kernel_st = 3 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L552] COND FALSE !((int )e_f == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L557] COND FALSE !((int )e_g == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L562] COND FALSE !((int )e_e == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L567] COND FALSE !((int )e_c == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L572] COND TRUE (int )e_wl == 0 [L573] e_wl = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L577] COND TRUE (int )wl_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L578] COND TRUE (int )e_wl == 1 [L579] wl_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L595] COND TRUE (int )c1_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L596] COND FALSE !((int )e_f == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L604] COND TRUE (int )c2_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L605] COND FALSE !((int )e_f == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L613] COND TRUE (int )wb_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L614] COND FALSE !((int )e_g == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L622] COND FALSE !((int )e_c == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L627] COND FALSE !((int )e_e == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L632] COND FALSE !((int )e_f == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L637] COND FALSE !((int )e_g == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L642] COND FALSE !((int )e_c == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L647] COND TRUE (int )e_wl == 1 [L648] e_wl = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L652] COND TRUE (int )wl_st == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L533] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L536] kernel_st = 1 [L278] int tmp ; [L279] int tmp___0 ; [L280] int tmp___1 ; [L281] int tmp___2 ; [L282] int tmp___3 ; VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L286] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L288] COND TRUE (int )wl_st == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L309] COND TRUE (int )wl_st == 0 [L311] tmp = __VERIFIER_nondet_int() [L313] COND TRUE \read(tmp) [L315] wl_st = 1 [L55] int t ; VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L58] COND FALSE !((int )wl_pc == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L61] COND FALSE !((int )wl_pc == 2) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L64] COND TRUE (int )wl_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L79] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L81] t = d [L82] data = d [L83] processed = 0 [L84] e_f = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L85] COND TRUE (int )c1_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L86] COND TRUE (int )e_f == 1 [L87] c1_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L94] COND TRUE (int )c2_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L95] COND TRUE (int )e_f == 1 [L96] c2_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L103] e_f = 2 [L104] wl_st = 2 [L105] wl_pc = 2 [L106] t_b = t VAL [c=0, c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L324] COND TRUE (int )c1_st == 0 [L326] tmp___0 = __VERIFIER_nondet_int() [L328] COND TRUE \read(tmp___0) [L330] c1_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L129] COND FALSE !((int )c1_pc == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L132] COND TRUE (int )c1_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L147] COND TRUE ! processed [L148] data += 1 [L149] e_g = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L150] COND TRUE (int )wb_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L151] COND TRUE (int )e_g == 1 [L152] wb_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L159] e_g = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L140] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L142] c1_st = 2 [L143] c1_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L339] COND TRUE (int )c2_st == 0 [L341] tmp___1 = __VERIFIER_nondet_int() [L343] COND TRUE \read(tmp___1) [L345] c2_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L174] COND FALSE !((int )c2_pc == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L177] COND TRUE (int )c2_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L192] COND TRUE ! processed [L193] data += 1 [L194] e_g = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L195] COND TRUE (int )wb_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L196] COND TRUE (int )e_g == 1 [L197] wb_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L204] e_g = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L185] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L187] c2_st = 2 [L188] c2_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L354] COND TRUE (int )wb_st == 0 [L356] tmp___2 = __VERIFIER_nondet_int() [L358] COND TRUE \read(tmp___2) [L360] wb_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L219] COND FALSE !((int )wb_pc == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L222] COND TRUE (int )wb_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L237] c_t = data [L238] c_req_up = 1 [L239] processed = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L230] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L232] wb_st = 2 [L233] wb_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L369] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L286] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L288] COND FALSE !((int )wl_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L291] COND FALSE !((int )c1_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L294] COND FALSE !((int )c2_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L297] COND FALSE !((int )wb_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L300] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L539] kernel_st = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L540] COND TRUE (int )c_req_up == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L541] COND TRUE c != c_t [L542] c = c_t [L543] e_c = 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L547] c_req_up = 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L551] kernel_st = 3 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L552] COND FALSE !((int )e_f == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L557] COND FALSE !((int )e_g == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L562] COND FALSE !((int )e_e == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L567] COND TRUE (int )e_c == 0 [L568] e_c = 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L572] COND FALSE !((int )e_wl == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L577] COND FALSE !((int )wl_pc == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L585] COND TRUE (int )wl_pc == 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L586] COND FALSE !((int )e_e == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L595] COND TRUE (int )c1_pc == 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L596] COND FALSE !((int )e_f == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L604] COND TRUE (int )c2_pc == 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L605] COND FALSE !((int )e_f == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L613] COND TRUE (int )wb_pc == 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L614] COND FALSE !((int )e_g == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L622] COND TRUE (int )e_c == 1 [L623] r_st = 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L627] COND FALSE !((int )e_e == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L632] COND FALSE !((int )e_f == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L637] COND FALSE !((int )e_g == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L642] COND TRUE (int )e_c == 1 [L643] e_c = 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L647] COND FALSE !((int )e_wl == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L652] COND FALSE !((int )wl_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L655] COND FALSE !((int )c1_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L658] COND FALSE !((int )c2_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L661] COND FALSE !((int )wb_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L664] COND TRUE (int )r_st == 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L533] COND TRUE 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L536] kernel_st = 1 [L278] int tmp ; [L279] int tmp___0 ; [L280] int tmp___1 ; [L281] int tmp___2 ; [L282] int tmp___3 ; VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L286] COND TRUE 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L288] COND FALSE !((int )wl_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L291] COND FALSE !((int )c1_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L294] COND FALSE !((int )c2_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L297] COND FALSE !((int )wb_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L300] COND TRUE (int )r_st == 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L309] COND FALSE !((int )wl_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L324] COND FALSE !((int )c1_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L339] COND FALSE !((int )c2_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L354] COND FALSE !((int )wb_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L369] COND TRUE (int )r_st == 0 [L371] tmp___3 = __VERIFIER_nondet_int() [L373] COND TRUE \read(tmp___3) [L375] r_st = 1 [L251] d = c [L252] e_e = 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L253] COND FALSE !((int )wl_pc == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L261] COND TRUE (int )wl_pc == 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L262] COND TRUE (int )e_e == 1 [L263] wl_st = 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L271] e_e = 2 [L272] r_st = 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L286] COND TRUE 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L288] COND TRUE (int )wl_st == 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L309] COND TRUE (int )wl_st == 0 [L311] tmp = __VERIFIER_nondet_int() [L313] COND TRUE \read(tmp) [L315] wl_st = 1 [L55] int t ; VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L58] COND FALSE !((int )wl_pc == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L61] COND TRUE (int )wl_pc == 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L110] t = t_b VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L111] COND FALSE !(d == t + 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L15] reach_error() VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 125 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16.5s, OverallIterations: 33, TraceHistogramMax: 6, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6387 SDtfs, 7478 SDslu, 3842 SDs, 0 SdLazy, 674 SolverSat, 203 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5234occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.9s AutomataMinimizationTime, 32 MinimizatonAttempts, 4252 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 2601 NumberOfCodeBlocks, 2601 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2385 ConstructedInterpolants, 0 QuantifiedInterpolants, 376157 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 PerfectInterpolantSequences, 704/704 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...