./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/toy1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/toy1.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f4cd6a09c2ca92f0964bf6dcd7808d358e7e20e1 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-5485861 [2020-10-25 23:16:10,889 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-25 23:16:10,893 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-25 23:16:10,929 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-25 23:16:10,930 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-25 23:16:10,931 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-25 23:16:10,933 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-25 23:16:10,936 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-25 23:16:10,938 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-25 23:16:10,939 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-25 23:16:10,941 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-25 23:16:10,942 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-25 23:16:10,943 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-25 23:16:10,944 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-25 23:16:10,946 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-25 23:16:10,947 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-25 23:16:10,949 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-25 23:16:10,950 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-25 23:16:10,952 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-25 23:16:10,955 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-25 23:16:10,957 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-25 23:16:10,959 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-25 23:16:10,960 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-25 23:16:10,962 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-25 23:16:10,965 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-25 23:16:10,966 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-25 23:16:10,966 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-25 23:16:10,967 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-25 23:16:10,968 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-25 23:16:10,970 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-25 23:16:10,970 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-25 23:16:10,971 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-25 23:16:10,972 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-25 23:16:10,974 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-25 23:16:10,975 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-25 23:16:10,976 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-25 23:16:10,977 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-25 23:16:10,977 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-25 23:16:10,977 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-25 23:16:10,979 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-25 23:16:10,980 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-25 23:16:10,984 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-25 23:16:11,047 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-25 23:16:11,048 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-25 23:16:11,050 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-25 23:16:11,051 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-25 23:16:11,052 INFO L138 SettingsManager]: * Use SBE=true [2020-10-25 23:16:11,052 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-25 23:16:11,053 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-25 23:16:11,053 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-25 23:16:11,053 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-25 23:16:11,054 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-25 23:16:11,055 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-25 23:16:11,056 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-25 23:16:11,056 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-25 23:16:11,056 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-25 23:16:11,057 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-25 23:16:11,057 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-25 23:16:11,057 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-25 23:16:11,058 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-25 23:16:11,058 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-25 23:16:11,058 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-25 23:16:11,059 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-25 23:16:11,059 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 23:16:11,059 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-25 23:16:11,060 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-25 23:16:11,060 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-25 23:16:11,060 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-25 23:16:11,061 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-25 23:16:11,061 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-25 23:16:11,061 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-25 23:16:11,062 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f4cd6a09c2ca92f0964bf6dcd7808d358e7e20e1 [2020-10-25 23:16:11,531 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-25 23:16:11,562 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-25 23:16:11,566 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-25 23:16:11,567 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-25 23:16:11,568 INFO L275 PluginConnector]: CDTParser initialized [2020-10-25 23:16:11,569 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/toy1.cil.c [2020-10-25 23:16:11,656 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4393004d/0808226126fe406197c4a6de62ec1b18/FLAG9243fed94 [2020-10-25 23:16:12,232 INFO L306 CDTParser]: Found 1 translation units. [2020-10-25 23:16:12,233 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy1.cil.c [2020-10-25 23:16:12,253 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4393004d/0808226126fe406197c4a6de62ec1b18/FLAG9243fed94 [2020-10-25 23:16:12,581 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4393004d/0808226126fe406197c4a6de62ec1b18 [2020-10-25 23:16:12,584 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-25 23:16:12,590 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-25 23:16:12,615 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-25 23:16:12,616 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-25 23:16:12,623 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-25 23:16:12,627 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 11:16:12" (1/1) ... [2020-10-25 23:16:12,639 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41c281e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:16:12, skipping insertion in model container [2020-10-25 23:16:12,639 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 11:16:12" (1/1) ... [2020-10-25 23:16:12,663 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-25 23:16:12,715 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-25 23:16:12,979 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 23:16:13,007 INFO L203 MainTranslator]: Completed pre-run [2020-10-25 23:16:13,092 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 23:16:13,112 INFO L208 MainTranslator]: Completed translation [2020-10-25 23:16:13,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:16:13 WrapperNode [2020-10-25 23:16:13,113 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-25 23:16:13,115 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-25 23:16:13,115 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-25 23:16:13,115 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-25 23:16:13,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:16:13" (1/1) ... [2020-10-25 23:16:13,143 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:16:13" (1/1) ... [2020-10-25 23:16:13,180 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-25 23:16:13,185 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-25 23:16:13,185 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-25 23:16:13,187 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-25 23:16:13,199 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:16:13" (1/1) ... [2020-10-25 23:16:13,199 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:16:13" (1/1) ... [2020-10-25 23:16:13,213 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:16:13" (1/1) ... [2020-10-25 23:16:13,220 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:16:13" (1/1) ... [2020-10-25 23:16:13,233 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:16:13" (1/1) ... [2020-10-25 23:16:13,254 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:16:13" (1/1) ... [2020-10-25 23:16:13,258 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:16:13" (1/1) ... [2020-10-25 23:16:13,262 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-25 23:16:13,263 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-25 23:16:13,264 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-25 23:16:13,264 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-25 23:16:13,265 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:16:13" (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-10-25 23:16:13,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-25 23:16:13,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-25 23:16:13,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-25 23:16:13,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-25 23:16:14,238 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-25 23:16:14,239 INFO L298 CfgBuilder]: Removed 32 assume(true) statements. [2020-10-25 23:16:14,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 11:16:14 BoogieIcfgContainer [2020-10-25 23:16:14,241 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-25 23:16:14,243 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-25 23:16:14,244 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-25 23:16:14,248 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-25 23:16:14,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 11:16:12" (1/3) ... [2020-10-25 23:16:14,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c28955d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 11:16:14, skipping insertion in model container [2020-10-25 23:16:14,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:16:13" (2/3) ... [2020-10-25 23:16:14,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c28955d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 11:16:14, skipping insertion in model container [2020-10-25 23:16:14,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 11:16:14" (3/3) ... [2020-10-25 23:16:14,252 INFO L111 eAbstractionObserver]: Analyzing ICFG toy1.cil.c [2020-10-25 23:16:14,266 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-25 23:16:14,272 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-25 23:16:14,286 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-10-25 23:16:14,316 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-25 23:16:14,316 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-25 23:16:14,317 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-25 23:16:14,317 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-25 23:16:14,317 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-25 23:16:14,317 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-25 23:16:14,318 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-25 23:16:14,318 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-25 23:16:14,338 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2020-10-25 23:16:14,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-10-25 23:16:14,348 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:14,349 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, 1] [2020-10-25 23:16:14,350 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:14,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:14,357 INFO L82 PathProgramCache]: Analyzing trace with hash -895778102, now seen corresponding path program 1 times [2020-10-25 23:16:14,368 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:14,369 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87089550] [2020-10-25 23:16:14,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:14,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:14,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:16:14,615 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87089550] [2020-10-25 23:16:14,616 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:14,617 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:16:14,618 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402949906] [2020-10-25 23:16:14,627 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:16:14,628 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:14,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:16:14,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:16:14,654 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 3 states. [2020-10-25 23:16:14,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:14,763 INFO L93 Difference]: Finished difference Result 252 states and 463 transitions. [2020-10-25 23:16:14,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:16:14,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2020-10-25 23:16:14,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:14,784 INFO L225 Difference]: With dead ends: 252 [2020-10-25 23:16:14,785 INFO L226 Difference]: Without dead ends: 125 [2020-10-25 23:16:14,802 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-10-25 23:16:14,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-10-25 23:16:14,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2020-10-25 23:16:14,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-10-25 23:16:14,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 218 transitions. [2020-10-25 23:16:14,856 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 218 transitions. Word has length 36 [2020-10-25 23:16:14,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:14,857 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 218 transitions. [2020-10-25 23:16:14,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:16:14,857 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 218 transitions. [2020-10-25 23:16:14,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-10-25 23:16:14,859 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:14,859 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, 1] [2020-10-25 23:16:14,859 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-25 23:16:14,860 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:14,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:14,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1597377976, now seen corresponding path program 1 times [2020-10-25 23:16:14,861 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:14,861 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022250234] [2020-10-25 23:16:14,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:14,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:14,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:16:14,933 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022250234] [2020-10-25 23:16:14,933 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:14,933 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:16:14,934 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626999861] [2020-10-25 23:16:14,935 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:16:14,935 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:14,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:16:14,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:16:14,937 INFO L87 Difference]: Start difference. First operand 125 states and 218 transitions. Second operand 4 states. [2020-10-25 23:16:15,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:15,055 INFO L93 Difference]: Finished difference Result 337 states and 586 transitions. [2020-10-25 23:16:15,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 23:16:15,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-10-25 23:16:15,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:15,059 INFO L225 Difference]: With dead ends: 337 [2020-10-25 23:16:15,059 INFO L226 Difference]: Without dead ends: 215 [2020-10-25 23:16:15,061 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-10-25 23:16:15,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2020-10-25 23:16:15,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 210. [2020-10-25 23:16:15,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-10-25 23:16:15,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 366 transitions. [2020-10-25 23:16:15,088 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 366 transitions. Word has length 36 [2020-10-25 23:16:15,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:15,088 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 366 transitions. [2020-10-25 23:16:15,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:16:15,089 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 366 transitions. [2020-10-25 23:16:15,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-10-25 23:16:15,090 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:15,090 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, 1] [2020-10-25 23:16:15,091 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-25 23:16:15,091 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:15,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:15,092 INFO L82 PathProgramCache]: Analyzing trace with hash -211174582, now seen corresponding path program 1 times [2020-10-25 23:16:15,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:15,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340948153] [2020-10-25 23:16:15,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:15,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:15,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:16:15,163 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340948153] [2020-10-25 23:16:15,163 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:15,163 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:16:15,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806910478] [2020-10-25 23:16:15,164 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:16:15,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:15,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:16:15,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:16:15,165 INFO L87 Difference]: Start difference. First operand 210 states and 366 transitions. Second operand 3 states. [2020-10-25 23:16:15,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:15,228 INFO L93 Difference]: Finished difference Result 411 states and 719 transitions. [2020-10-25 23:16:15,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:16:15,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2020-10-25 23:16:15,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:15,231 INFO L225 Difference]: With dead ends: 411 [2020-10-25 23:16:15,231 INFO L226 Difference]: Without dead ends: 210 [2020-10-25 23:16:15,232 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-10-25 23:16:15,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2020-10-25 23:16:15,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2020-10-25 23:16:15,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-10-25 23:16:15,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 354 transitions. [2020-10-25 23:16:15,253 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 354 transitions. Word has length 36 [2020-10-25 23:16:15,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:15,253 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 354 transitions. [2020-10-25 23:16:15,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:16:15,253 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 354 transitions. [2020-10-25 23:16:15,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-10-25 23:16:15,255 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:15,255 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, 1] [2020-10-25 23:16:15,255 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-25 23:16:15,256 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:15,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:15,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1741716026, now seen corresponding path program 1 times [2020-10-25 23:16:15,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:15,257 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853090753] [2020-10-25 23:16:15,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:15,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:15,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:16:15,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853090753] [2020-10-25 23:16:15,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:15,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:16:15,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108402160] [2020-10-25 23:16:15,354 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:16:15,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:15,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:16:15,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:16:15,356 INFO L87 Difference]: Start difference. First operand 210 states and 354 transitions. Second operand 4 states. [2020-10-25 23:16:15,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:15,505 INFO L93 Difference]: Finished difference Result 571 states and 965 transitions. [2020-10-25 23:16:15,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 23:16:15,506 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-10-25 23:16:15,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:15,509 INFO L225 Difference]: With dead ends: 571 [2020-10-25 23:16:15,509 INFO L226 Difference]: Without dead ends: 371 [2020-10-25 23:16:15,510 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-10-25 23:16:15,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2020-10-25 23:16:15,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 210. [2020-10-25 23:16:15,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-10-25 23:16:15,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 351 transitions. [2020-10-25 23:16:15,530 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 351 transitions. Word has length 36 [2020-10-25 23:16:15,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:15,530 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 351 transitions. [2020-10-25 23:16:15,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:16:15,531 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 351 transitions. [2020-10-25 23:16:15,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-10-25 23:16:15,532 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:15,532 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, 1] [2020-10-25 23:16:15,533 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-25 23:16:15,533 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:15,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:15,534 INFO L82 PathProgramCache]: Analyzing trace with hash 181512008, now seen corresponding path program 1 times [2020-10-25 23:16:15,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:15,534 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552873135] [2020-10-25 23:16:15,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:15,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:15,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:16:15,605 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552873135] [2020-10-25 23:16:15,606 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:15,606 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:16:15,606 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249960988] [2020-10-25 23:16:15,607 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:16:15,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:15,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:16:15,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:16:15,608 INFO L87 Difference]: Start difference. First operand 210 states and 351 transitions. Second operand 4 states. [2020-10-25 23:16:15,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:15,730 INFO L93 Difference]: Finished difference Result 574 states and 961 transitions. [2020-10-25 23:16:15,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 23:16:15,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-10-25 23:16:15,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:15,734 INFO L225 Difference]: With dead ends: 574 [2020-10-25 23:16:15,735 INFO L226 Difference]: Without dead ends: 375 [2020-10-25 23:16:15,736 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-10-25 23:16:15,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2020-10-25 23:16:15,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 210. [2020-10-25 23:16:15,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-10-25 23:16:15,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 348 transitions. [2020-10-25 23:16:15,755 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 348 transitions. Word has length 36 [2020-10-25 23:16:15,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:15,755 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 348 transitions. [2020-10-25 23:16:15,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:16:15,756 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 348 transitions. [2020-10-25 23:16:15,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-10-25 23:16:15,758 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:15,758 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, 1] [2020-10-25 23:16:15,758 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-25 23:16:15,758 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:15,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:15,759 INFO L82 PathProgramCache]: Analyzing trace with hash 243551622, now seen corresponding path program 1 times [2020-10-25 23:16:15,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:15,760 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630694131] [2020-10-25 23:16:15,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:15,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:15,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:16:15,812 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630694131] [2020-10-25 23:16:15,812 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:15,813 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:16:15,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97561468] [2020-10-25 23:16:15,813 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:16:15,814 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:15,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:16:15,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:16:15,815 INFO L87 Difference]: Start difference. First operand 210 states and 348 transitions. Second operand 4 states. [2020-10-25 23:16:15,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:15,910 INFO L93 Difference]: Finished difference Result 586 states and 972 transitions. [2020-10-25 23:16:15,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 23:16:15,911 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-10-25 23:16:15,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:15,914 INFO L225 Difference]: With dead ends: 586 [2020-10-25 23:16:15,914 INFO L226 Difference]: Without dead ends: 388 [2020-10-25 23:16:15,915 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-10-25 23:16:15,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2020-10-25 23:16:15,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 216. [2020-10-25 23:16:15,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-10-25 23:16:15,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 352 transitions. [2020-10-25 23:16:15,936 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 352 transitions. Word has length 36 [2020-10-25 23:16:15,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:15,941 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 352 transitions. [2020-10-25 23:16:15,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:16:15,942 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 352 transitions. [2020-10-25 23:16:15,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-10-25 23:16:15,946 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:15,947 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, 1] [2020-10-25 23:16:15,947 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-25 23:16:15,947 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:15,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:15,948 INFO L82 PathProgramCache]: Analyzing trace with hash 384100232, now seen corresponding path program 1 times [2020-10-25 23:16:15,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:15,948 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814078450] [2020-10-25 23:16:15,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:15,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:15,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:16:15,997 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814078450] [2020-10-25 23:16:15,997 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:15,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:16:15,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015526572] [2020-10-25 23:16:15,998 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:16:15,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:15,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:16:15,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:16:15,999 INFO L87 Difference]: Start difference. First operand 216 states and 352 transitions. Second operand 4 states. [2020-10-25 23:16:16,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:16,105 INFO L93 Difference]: Finished difference Result 737 states and 1201 transitions. [2020-10-25 23:16:16,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 23:16:16,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-10-25 23:16:16,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:16,109 INFO L225 Difference]: With dead ends: 737 [2020-10-25 23:16:16,109 INFO L226 Difference]: Without dead ends: 534 [2020-10-25 23:16:16,110 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-10-25 23:16:16,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-10-25 23:16:16,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 351. [2020-10-25 23:16:16,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2020-10-25 23:16:16,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 571 transitions. [2020-10-25 23:16:16,142 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 571 transitions. Word has length 36 [2020-10-25 23:16:16,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:16,142 INFO L481 AbstractCegarLoop]: Abstraction has 351 states and 571 transitions. [2020-10-25 23:16:16,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:16:16,142 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 571 transitions. [2020-10-25 23:16:16,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-10-25 23:16:16,143 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:16,144 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, 1] [2020-10-25 23:16:16,144 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-25 23:16:16,144 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:16,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:16,145 INFO L82 PathProgramCache]: Analyzing trace with hash 250086726, now seen corresponding path program 1 times [2020-10-25 23:16:16,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:16,145 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270815719] [2020-10-25 23:16:16,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:16,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:16,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:16:16,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270815719] [2020-10-25 23:16:16,183 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:16,183 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:16:16,183 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764028985] [2020-10-25 23:16:16,183 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:16:16,183 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:16,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:16:16,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:16:16,184 INFO L87 Difference]: Start difference. First operand 351 states and 571 transitions. Second operand 3 states. [2020-10-25 23:16:16,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:16,246 INFO L93 Difference]: Finished difference Result 838 states and 1368 transitions. [2020-10-25 23:16:16,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:16:16,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2020-10-25 23:16:16,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:16,250 INFO L225 Difference]: With dead ends: 838 [2020-10-25 23:16:16,251 INFO L226 Difference]: Without dead ends: 511 [2020-10-25 23:16:16,252 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-10-25 23:16:16,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2020-10-25 23:16:16,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 507. [2020-10-25 23:16:16,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2020-10-25 23:16:16,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 825 transitions. [2020-10-25 23:16:16,293 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 825 transitions. Word has length 36 [2020-10-25 23:16:16,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:16,294 INFO L481 AbstractCegarLoop]: Abstraction has 507 states and 825 transitions. [2020-10-25 23:16:16,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:16:16,294 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 825 transitions. [2020-10-25 23:16:16,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-10-25 23:16:16,295 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:16,296 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, 1] [2020-10-25 23:16:16,296 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-25 23:16:16,296 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:16,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:16,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1539792066, now seen corresponding path program 1 times [2020-10-25 23:16:16,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:16,297 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953607378] [2020-10-25 23:16:16,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:16,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:16,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:16:16,334 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953607378] [2020-10-25 23:16:16,334 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:16,334 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:16:16,335 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046556113] [2020-10-25 23:16:16,335 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:16:16,335 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:16,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:16:16,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:16:16,336 INFO L87 Difference]: Start difference. First operand 507 states and 825 transitions. Second operand 4 states. [2020-10-25 23:16:16,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:16,447 INFO L93 Difference]: Finished difference Result 1293 states and 2104 transitions. [2020-10-25 23:16:16,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 23:16:16,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-10-25 23:16:16,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:16,454 INFO L225 Difference]: With dead ends: 1293 [2020-10-25 23:16:16,454 INFO L226 Difference]: Without dead ends: 803 [2020-10-25 23:16:16,455 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-10-25 23:16:16,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2020-10-25 23:16:16,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 507. [2020-10-25 23:16:16,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2020-10-25 23:16:16,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 817 transitions. [2020-10-25 23:16:16,502 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 817 transitions. Word has length 36 [2020-10-25 23:16:16,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:16,503 INFO L481 AbstractCegarLoop]: Abstraction has 507 states and 817 transitions. [2020-10-25 23:16:16,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:16:16,503 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 817 transitions. [2020-10-25 23:16:16,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-10-25 23:16:16,504 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:16,504 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, 1] [2020-10-25 23:16:16,504 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-25 23:16:16,505 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:16,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:16,506 INFO L82 PathProgramCache]: Analyzing trace with hash -48555836, now seen corresponding path program 1 times [2020-10-25 23:16:16,506 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:16,507 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665820092] [2020-10-25 23:16:16,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:16,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:16:16,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665820092] [2020-10-25 23:16:16,578 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:16,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:16:16,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201903676] [2020-10-25 23:16:16,579 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:16:16,579 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:16,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:16:16,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:16:16,580 INFO L87 Difference]: Start difference. First operand 507 states and 817 transitions. Second operand 4 states. [2020-10-25 23:16:16,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:16,705 INFO L93 Difference]: Finished difference Result 1289 states and 2077 transitions. [2020-10-25 23:16:16,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 23:16:16,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-10-25 23:16:16,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:16,719 INFO L225 Difference]: With dead ends: 1289 [2020-10-25 23:16:16,719 INFO L226 Difference]: Without dead ends: 805 [2020-10-25 23:16:16,721 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-10-25 23:16:16,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2020-10-25 23:16:16,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 507. [2020-10-25 23:16:16,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2020-10-25 23:16:16,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 809 transitions. [2020-10-25 23:16:16,772 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 809 transitions. Word has length 36 [2020-10-25 23:16:16,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:16,774 INFO L481 AbstractCegarLoop]: Abstraction has 507 states and 809 transitions. [2020-10-25 23:16:16,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:16:16,775 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 809 transitions. [2020-10-25 23:16:16,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-10-25 23:16:16,776 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:16,776 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, 1] [2020-10-25 23:16:16,778 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-25 23:16:16,778 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:16,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:16,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1328419514, now seen corresponding path program 1 times [2020-10-25 23:16:16,779 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:16,779 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154705936] [2020-10-25 23:16:16,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:16,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:16,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:16:16,822 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154705936] [2020-10-25 23:16:16,822 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:16,822 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:16:16,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825025758] [2020-10-25 23:16:16,823 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:16:16,823 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:16,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:16:16,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:16:16,825 INFO L87 Difference]: Start difference. First operand 507 states and 809 transitions. Second operand 4 states. [2020-10-25 23:16:16,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:16,942 INFO L93 Difference]: Finished difference Result 1226 states and 1951 transitions. [2020-10-25 23:16:16,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 23:16:16,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-10-25 23:16:16,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:16,947 INFO L225 Difference]: With dead ends: 1226 [2020-10-25 23:16:16,947 INFO L226 Difference]: Without dead ends: 736 [2020-10-25 23:16:16,950 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-10-25 23:16:16,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2020-10-25 23:16:16,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 555. [2020-10-25 23:16:16,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2020-10-25 23:16:16,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 866 transitions. [2020-10-25 23:16:17,000 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 866 transitions. Word has length 36 [2020-10-25 23:16:17,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:17,000 INFO L481 AbstractCegarLoop]: Abstraction has 555 states and 866 transitions. [2020-10-25 23:16:17,000 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:16:17,000 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 866 transitions. [2020-10-25 23:16:17,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-10-25 23:16:17,001 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:17,001 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, 1] [2020-10-25 23:16:17,001 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-25 23:16:17,002 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:17,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:17,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1915225528, now seen corresponding path program 1 times [2020-10-25 23:16:17,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:17,003 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451073380] [2020-10-25 23:16:17,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:17,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:17,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:16:17,064 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451073380] [2020-10-25 23:16:17,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:17,065 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:16:17,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518776534] [2020-10-25 23:16:17,068 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:16:17,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:17,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:16:17,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:16:17,069 INFO L87 Difference]: Start difference. First operand 555 states and 866 transitions. Second operand 3 states. [2020-10-25 23:16:17,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:17,156 INFO L93 Difference]: Finished difference Result 1316 states and 2058 transitions. [2020-10-25 23:16:17,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:16:17,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2020-10-25 23:16:17,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:17,161 INFO L225 Difference]: With dead ends: 1316 [2020-10-25 23:16:17,161 INFO L226 Difference]: Without dead ends: 775 [2020-10-25 23:16:17,163 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-10-25 23:16:17,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2020-10-25 23:16:17,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 772. [2020-10-25 23:16:17,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2020-10-25 23:16:17,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1190 transitions. [2020-10-25 23:16:17,214 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1190 transitions. Word has length 36 [2020-10-25 23:16:17,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:17,215 INFO L481 AbstractCegarLoop]: Abstraction has 772 states and 1190 transitions. [2020-10-25 23:16:17,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:16:17,215 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1190 transitions. [2020-10-25 23:16:17,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-10-25 23:16:17,216 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:17,216 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-10-25 23:16:17,216 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-25 23:16:17,216 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:17,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:17,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1824541764, now seen corresponding path program 1 times [2020-10-25 23:16:17,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:17,217 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020505484] [2020-10-25 23:16:17,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:17,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:17,261 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:16:17,261 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020505484] [2020-10-25 23:16:17,261 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:17,262 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:16:17,262 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306017011] [2020-10-25 23:16:17,263 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:16:17,263 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:17,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:16:17,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:16:17,264 INFO L87 Difference]: Start difference. First operand 772 states and 1190 transitions. Second operand 3 states. [2020-10-25 23:16:17,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:17,359 INFO L93 Difference]: Finished difference Result 1906 states and 2978 transitions. [2020-10-25 23:16:17,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:16:17,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-10-25 23:16:17,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:17,366 INFO L225 Difference]: With dead ends: 1906 [2020-10-25 23:16:17,367 INFO L226 Difference]: Without dead ends: 1161 [2020-10-25 23:16:17,369 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-10-25 23:16:17,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2020-10-25 23:16:17,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1157. [2020-10-25 23:16:17,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1157 states. [2020-10-25 23:16:17,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1801 transitions. [2020-10-25 23:16:17,463 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1801 transitions. Word has length 46 [2020-10-25 23:16:17,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:17,464 INFO L481 AbstractCegarLoop]: Abstraction has 1157 states and 1801 transitions. [2020-10-25 23:16:17,465 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:16:17,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1801 transitions. [2020-10-25 23:16:17,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-10-25 23:16:17,466 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:17,467 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-10-25 23:16:17,467 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-25 23:16:17,467 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:17,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:17,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1576395270, now seen corresponding path program 1 times [2020-10-25 23:16:17,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:17,473 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933774602] [2020-10-25 23:16:17,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:17,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:17,511 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-25 23:16:17,512 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933774602] [2020-10-25 23:16:17,512 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:17,512 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:16:17,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732903452] [2020-10-25 23:16:17,513 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:16:17,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:17,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:16:17,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:16:17,514 INFO L87 Difference]: Start difference. First operand 1157 states and 1801 transitions. Second operand 3 states. [2020-10-25 23:16:17,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:17,594 INFO L93 Difference]: Finished difference Result 2265 states and 3543 transitions. [2020-10-25 23:16:17,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:16:17,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-10-25 23:16:17,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:17,601 INFO L225 Difference]: With dead ends: 2265 [2020-10-25 23:16:17,601 INFO L226 Difference]: Without dead ends: 1135 [2020-10-25 23:16:17,607 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-10-25 23:16:17,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2020-10-25 23:16:17,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 1135. [2020-10-25 23:16:17,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1135 states. [2020-10-25 23:16:17,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1774 transitions. [2020-10-25 23:16:17,695 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1774 transitions. Word has length 46 [2020-10-25 23:16:17,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:17,696 INFO L481 AbstractCegarLoop]: Abstraction has 1135 states and 1774 transitions. [2020-10-25 23:16:17,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:16:17,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1774 transitions. [2020-10-25 23:16:17,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-10-25 23:16:17,697 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:17,697 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-10-25 23:16:17,698 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-25 23:16:17,698 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:17,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:17,698 INFO L82 PathProgramCache]: Analyzing trace with hash 121182915, now seen corresponding path program 1 times [2020-10-25 23:16:17,699 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:17,699 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199857079] [2020-10-25 23:16:17,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:17,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:17,731 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:16:17,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199857079] [2020-10-25 23:16:17,731 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:17,731 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:16:17,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999136043] [2020-10-25 23:16:17,732 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:16:17,733 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:17,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:16:17,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:16:17,733 INFO L87 Difference]: Start difference. First operand 1135 states and 1774 transitions. Second operand 3 states. [2020-10-25 23:16:17,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:17,889 INFO L93 Difference]: Finished difference Result 2891 states and 4579 transitions. [2020-10-25 23:16:17,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:16:17,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2020-10-25 23:16:17,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:17,900 INFO L225 Difference]: With dead ends: 2891 [2020-10-25 23:16:17,900 INFO L226 Difference]: Without dead ends: 1783 [2020-10-25 23:16:17,904 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-10-25 23:16:17,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2020-10-25 23:16:18,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1779. [2020-10-25 23:16:18,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1779 states. [2020-10-25 23:16:18,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 2808 transitions. [2020-10-25 23:16:18,035 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 2808 transitions. Word has length 47 [2020-10-25 23:16:18,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:18,037 INFO L481 AbstractCegarLoop]: Abstraction has 1779 states and 2808 transitions. [2020-10-25 23:16:18,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:16:18,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2808 transitions. [2020-10-25 23:16:18,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-10-25 23:16:18,038 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:18,039 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-10-25 23:16:18,039 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-25 23:16:18,039 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:18,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:18,040 INFO L82 PathProgramCache]: Analyzing trace with hash 241239015, now seen corresponding path program 1 times [2020-10-25 23:16:18,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:18,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764025907] [2020-10-25 23:16:18,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:18,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:18,117 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:16:18,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764025907] [2020-10-25 23:16:18,118 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:18,118 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:16:18,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970220376] [2020-10-25 23:16:18,119 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:16:18,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:18,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:16:18,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:16:18,124 INFO L87 Difference]: Start difference. First operand 1779 states and 2808 transitions. Second operand 3 states. [2020-10-25 23:16:18,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:18,396 INFO L93 Difference]: Finished difference Result 4794 states and 7664 transitions. [2020-10-25 23:16:18,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:16:18,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2020-10-25 23:16:18,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:18,413 INFO L225 Difference]: With dead ends: 4794 [2020-10-25 23:16:18,413 INFO L226 Difference]: Without dead ends: 3044 [2020-10-25 23:16:18,417 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-10-25 23:16:18,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3044 states. [2020-10-25 23:16:18,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3044 to 3040. [2020-10-25 23:16:18,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3040 states. [2020-10-25 23:16:18,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3040 states to 3040 states and 4843 transitions. [2020-10-25 23:16:18,686 INFO L78 Accepts]: Start accepts. Automaton has 3040 states and 4843 transitions. Word has length 48 [2020-10-25 23:16:18,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:18,686 INFO L481 AbstractCegarLoop]: Abstraction has 3040 states and 4843 transitions. [2020-10-25 23:16:18,686 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:16:18,686 INFO L276 IsEmpty]: Start isEmpty. Operand 3040 states and 4843 transitions. [2020-10-25 23:16:18,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-10-25 23:16:18,688 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:18,688 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-10-25 23:16:18,688 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-25 23:16:18,688 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:18,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:18,689 INFO L82 PathProgramCache]: Analyzing trace with hash 489385509, now seen corresponding path program 1 times [2020-10-25 23:16:18,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:18,689 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048793008] [2020-10-25 23:16:18,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:18,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:18,732 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-25 23:16:18,732 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048793008] [2020-10-25 23:16:18,732 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:18,732 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:16:18,733 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986050139] [2020-10-25 23:16:18,733 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:16:18,733 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:18,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:16:18,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:16:18,734 INFO L87 Difference]: Start difference. First operand 3040 states and 4843 transitions. Second operand 3 states. [2020-10-25 23:16:18,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:18,945 INFO L93 Difference]: Finished difference Result 6029 states and 9627 transitions. [2020-10-25 23:16:18,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:16:18,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2020-10-25 23:16:18,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:18,961 INFO L225 Difference]: With dead ends: 6029 [2020-10-25 23:16:18,961 INFO L226 Difference]: Without dead ends: 3018 [2020-10-25 23:16:18,966 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-10-25 23:16:18,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2020-10-25 23:16:19,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 3018. [2020-10-25 23:16:19,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3018 states. [2020-10-25 23:16:19,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 4817 transitions. [2020-10-25 23:16:19,204 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 4817 transitions. Word has length 48 [2020-10-25 23:16:19,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:19,204 INFO L481 AbstractCegarLoop]: Abstraction has 3018 states and 4817 transitions. [2020-10-25 23:16:19,204 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:16:19,204 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 4817 transitions. [2020-10-25 23:16:19,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-10-25 23:16:19,206 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:19,206 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] [2020-10-25 23:16:19,206 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-25 23:16:19,206 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:19,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:19,207 INFO L82 PathProgramCache]: Analyzing trace with hash 497105560, now seen corresponding path program 1 times [2020-10-25 23:16:19,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:19,207 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148894903] [2020-10-25 23:16:19,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:19,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:19,250 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:16:19,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148894903] [2020-10-25 23:16:19,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:19,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:16:19,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138721486] [2020-10-25 23:16:19,253 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:16:19,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:19,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:16:19,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:16:19,254 INFO L87 Difference]: Start difference. First operand 3018 states and 4817 transitions. Second operand 4 states. [2020-10-25 23:16:19,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:19,744 INFO L93 Difference]: Finished difference Result 7617 states and 12199 transitions. [2020-10-25 23:16:19,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 23:16:19,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2020-10-25 23:16:19,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:19,766 INFO L225 Difference]: With dead ends: 7617 [2020-10-25 23:16:19,766 INFO L226 Difference]: Without dead ends: 3895 [2020-10-25 23:16:19,774 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-10-25 23:16:19,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3895 states. [2020-10-25 23:16:20,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3895 to 3895. [2020-10-25 23:16:20,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3895 states. [2020-10-25 23:16:20,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3895 states to 3895 states and 6183 transitions. [2020-10-25 23:16:20,107 INFO L78 Accepts]: Start accepts. Automaton has 3895 states and 6183 transitions. Word has length 49 [2020-10-25 23:16:20,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:20,107 INFO L481 AbstractCegarLoop]: Abstraction has 3895 states and 6183 transitions. [2020-10-25 23:16:20,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:16:20,107 INFO L276 IsEmpty]: Start isEmpty. Operand 3895 states and 6183 transitions. [2020-10-25 23:16:20,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-10-25 23:16:20,109 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:20,109 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, 1] [2020-10-25 23:16:20,110 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-25 23:16:20,110 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:20,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:20,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1266326705, now seen corresponding path program 1 times [2020-10-25 23:16:20,111 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:20,111 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152897160] [2020-10-25 23:16:20,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:20,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:20,153 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:16:20,154 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152897160] [2020-10-25 23:16:20,154 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:20,154 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-25 23:16:20,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990659043] [2020-10-25 23:16:20,154 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 23:16:20,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:20,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 23:16:20,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:16:20,155 INFO L87 Difference]: Start difference. First operand 3895 states and 6183 transitions. Second operand 5 states. [2020-10-25 23:16:20,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:20,731 INFO L93 Difference]: Finished difference Result 9940 states and 15662 transitions. [2020-10-25 23:16:20,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-25 23:16:20,731 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2020-10-25 23:16:20,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:20,765 INFO L225 Difference]: With dead ends: 9940 [2020-10-25 23:16:20,765 INFO L226 Difference]: Without dead ends: 6068 [2020-10-25 23:16:20,772 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-10-25 23:16:20,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6068 states. [2020-10-25 23:16:21,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6068 to 4554. [2020-10-25 23:16:21,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4554 states. [2020-10-25 23:16:21,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4554 states to 4554 states and 7072 transitions. [2020-10-25 23:16:21,205 INFO L78 Accepts]: Start accepts. Automaton has 4554 states and 7072 transitions. Word has length 54 [2020-10-25 23:16:21,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:21,205 INFO L481 AbstractCegarLoop]: Abstraction has 4554 states and 7072 transitions. [2020-10-25 23:16:21,205 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 23:16:21,206 INFO L276 IsEmpty]: Start isEmpty. Operand 4554 states and 7072 transitions. [2020-10-25 23:16:21,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-10-25 23:16:21,209 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:21,210 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-10-25 23:16:21,210 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-25 23:16:21,210 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:21,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:21,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1019387986, now seen corresponding path program 1 times [2020-10-25 23:16:21,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:21,211 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222396973] [2020-10-25 23:16:21,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:21,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:21,258 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:16:21,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222396973] [2020-10-25 23:16:21,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:21,259 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:16:21,259 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860305787] [2020-10-25 23:16:21,259 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:16:21,260 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:21,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:16:21,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:16:21,260 INFO L87 Difference]: Start difference. First operand 4554 states and 7072 transitions. Second operand 3 states. [2020-10-25 23:16:21,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:21,720 INFO L93 Difference]: Finished difference Result 9431 states and 14610 transitions. [2020-10-25 23:16:21,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:16:21,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2020-10-25 23:16:21,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:21,751 INFO L225 Difference]: With dead ends: 9431 [2020-10-25 23:16:21,752 INFO L226 Difference]: Without dead ends: 4906 [2020-10-25 23:16:21,759 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-10-25 23:16:21,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4906 states. [2020-10-25 23:16:22,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4906 to 4874. [2020-10-25 23:16:22,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4874 states. [2020-10-25 23:16:22,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4874 states to 4874 states and 7321 transitions. [2020-10-25 23:16:22,155 INFO L78 Accepts]: Start accepts. Automaton has 4874 states and 7321 transitions. Word has length 86 [2020-10-25 23:16:22,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:22,156 INFO L481 AbstractCegarLoop]: Abstraction has 4874 states and 7321 transitions. [2020-10-25 23:16:22,156 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:16:22,156 INFO L276 IsEmpty]: Start isEmpty. Operand 4874 states and 7321 transitions. [2020-10-25 23:16:22,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-10-25 23:16:22,160 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:22,161 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-10-25 23:16:22,161 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-25 23:16:22,161 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:22,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:22,162 INFO L82 PathProgramCache]: Analyzing trace with hash 359155335, now seen corresponding path program 1 times [2020-10-25 23:16:22,162 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:22,162 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850314744] [2020-10-25 23:16:22,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:22,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:22,207 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:16:22,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850314744] [2020-10-25 23:16:22,207 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:22,208 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:16:22,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266431167] [2020-10-25 23:16:22,208 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:16:22,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:22,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:16:22,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:16:22,209 INFO L87 Difference]: Start difference. First operand 4874 states and 7321 transitions. Second operand 3 states. [2020-10-25 23:16:22,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:22,697 INFO L93 Difference]: Finished difference Result 10229 states and 15320 transitions. [2020-10-25 23:16:22,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:16:22,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2020-10-25 23:16:22,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:22,708 INFO L225 Difference]: With dead ends: 10229 [2020-10-25 23:16:22,709 INFO L226 Difference]: Without dead ends: 5396 [2020-10-25 23:16:22,716 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-10-25 23:16:22,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5396 states. [2020-10-25 23:16:23,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5396 to 5348. [2020-10-25 23:16:23,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5348 states. [2020-10-25 23:16:23,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5348 states to 5348 states and 7764 transitions. [2020-10-25 23:16:23,164 INFO L78 Accepts]: Start accepts. Automaton has 5348 states and 7764 transitions. Word has length 87 [2020-10-25 23:16:23,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:23,164 INFO L481 AbstractCegarLoop]: Abstraction has 5348 states and 7764 transitions. [2020-10-25 23:16:23,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:16:23,164 INFO L276 IsEmpty]: Start isEmpty. Operand 5348 states and 7764 transitions. [2020-10-25 23:16:23,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-10-25 23:16:23,177 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:23,178 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-10-25 23:16:23,178 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-25 23:16:23,178 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:23,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:23,178 INFO L82 PathProgramCache]: Analyzing trace with hash -503038292, now seen corresponding path program 1 times [2020-10-25 23:16:23,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:23,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064565692] [2020-10-25 23:16:23,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:23,231 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:16:23,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064565692] [2020-10-25 23:16:23,232 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:23,232 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:16:23,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097014239] [2020-10-25 23:16:23,233 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:16:23,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:23,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:16:23,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:16:23,235 INFO L87 Difference]: Start difference. First operand 5348 states and 7764 transitions. Second operand 3 states. [2020-10-25 23:16:23,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:23,651 INFO L93 Difference]: Finished difference Result 11003 states and 15979 transitions. [2020-10-25 23:16:23,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:16:23,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2020-10-25 23:16:23,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:23,665 INFO L225 Difference]: With dead ends: 11003 [2020-10-25 23:16:23,665 INFO L226 Difference]: Without dead ends: 5716 [2020-10-25 23:16:23,675 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-10-25 23:16:23,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5716 states. [2020-10-25 23:16:24,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5716 to 5130. [2020-10-25 23:16:24,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5130 states. [2020-10-25 23:16:24,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5130 states to 5130 states and 7126 transitions. [2020-10-25 23:16:24,101 INFO L78 Accepts]: Start accepts. Automaton has 5130 states and 7126 transitions. Word has length 88 [2020-10-25 23:16:24,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:24,102 INFO L481 AbstractCegarLoop]: Abstraction has 5130 states and 7126 transitions. [2020-10-25 23:16:24,102 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:16:24,102 INFO L276 IsEmpty]: Start isEmpty. Operand 5130 states and 7126 transitions. [2020-10-25 23:16:24,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-10-25 23:16:24,109 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:24,109 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, 1] [2020-10-25 23:16:24,109 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-25 23:16:24,109 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:24,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:24,110 INFO L82 PathProgramCache]: Analyzing trace with hash 2120110985, now seen corresponding path program 1 times [2020-10-25 23:16:24,110 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:24,111 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317753524] [2020-10-25 23:16:24,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:24,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:24,180 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-25 23:16:24,181 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317753524] [2020-10-25 23:16:24,181 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:24,181 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:16:24,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838061995] [2020-10-25 23:16:24,182 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:16:24,182 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:24,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:16:24,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:16:24,184 INFO L87 Difference]: Start difference. First operand 5130 states and 7126 transitions. Second operand 4 states. [2020-10-25 23:16:25,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:25,111 INFO L93 Difference]: Finished difference Result 9554 states and 13184 transitions. [2020-10-25 23:16:25,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 23:16:25,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2020-10-25 23:16:25,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:25,123 INFO L225 Difference]: With dead ends: 9554 [2020-10-25 23:16:25,123 INFO L226 Difference]: Without dead ends: 4875 [2020-10-25 23:16:25,131 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-10-25 23:16:25,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4875 states. [2020-10-25 23:16:25,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4875 to 4759. [2020-10-25 23:16:25,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4759 states. [2020-10-25 23:16:25,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4759 states to 4759 states and 6364 transitions. [2020-10-25 23:16:25,640 INFO L78 Accepts]: Start accepts. Automaton has 4759 states and 6364 transitions. Word has length 89 [2020-10-25 23:16:25,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:25,641 INFO L481 AbstractCegarLoop]: Abstraction has 4759 states and 6364 transitions. [2020-10-25 23:16:25,641 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:16:25,641 INFO L276 IsEmpty]: Start isEmpty. Operand 4759 states and 6364 transitions. [2020-10-25 23:16:25,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-10-25 23:16:25,653 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:25,653 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, 1] [2020-10-25 23:16:25,653 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-25 23:16:25,654 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:25,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:25,654 INFO L82 PathProgramCache]: Analyzing trace with hash 520985863, now seen corresponding path program 1 times [2020-10-25 23:16:25,654 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:25,655 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634208033] [2020-10-25 23:16:25,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:25,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:25,705 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-10-25 23:16:25,706 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634208033] [2020-10-25 23:16:25,706 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:25,706 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:16:25,706 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14319688] [2020-10-25 23:16:25,707 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:16:25,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:25,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:16:25,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:16:25,708 INFO L87 Difference]: Start difference. First operand 4759 states and 6364 transitions. Second operand 3 states. [2020-10-25 23:16:26,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:26,154 INFO L93 Difference]: Finished difference Result 9073 states and 12125 transitions. [2020-10-25 23:16:26,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:16:26,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2020-10-25 23:16:26,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:26,166 INFO L225 Difference]: With dead ends: 9073 [2020-10-25 23:16:26,167 INFO L226 Difference]: Without dead ends: 4705 [2020-10-25 23:16:26,174 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-10-25 23:16:26,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4705 states. [2020-10-25 23:16:26,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4705 to 4705. [2020-10-25 23:16:26,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4705 states. [2020-10-25 23:16:26,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4705 states to 4705 states and 6258 transitions. [2020-10-25 23:16:26,586 INFO L78 Accepts]: Start accepts. Automaton has 4705 states and 6258 transitions. Word has length 116 [2020-10-25 23:16:26,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:26,586 INFO L481 AbstractCegarLoop]: Abstraction has 4705 states and 6258 transitions. [2020-10-25 23:16:26,587 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:16:26,587 INFO L276 IsEmpty]: Start isEmpty. Operand 4705 states and 6258 transitions. [2020-10-25 23:16:26,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-10-25 23:16:26,599 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:26,599 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] [2020-10-25 23:16:26,600 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-25 23:16:26,600 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:26,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:26,601 INFO L82 PathProgramCache]: Analyzing trace with hash -778538235, now seen corresponding path program 1 times [2020-10-25 23:16:26,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:26,601 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556933654] [2020-10-25 23:16:26,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:26,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:26,649 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-10-25 23:16:26,649 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556933654] [2020-10-25 23:16:26,650 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:26,650 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:16:26,650 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176570951] [2020-10-25 23:16:26,650 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:16:26,651 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:26,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:16:26,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:16:26,652 INFO L87 Difference]: Start difference. First operand 4705 states and 6258 transitions. Second operand 4 states. [2020-10-25 23:16:27,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:27,105 INFO L93 Difference]: Finished difference Result 8363 states and 11148 transitions. [2020-10-25 23:16:27,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 23:16:27,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2020-10-25 23:16:27,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:27,115 INFO L225 Difference]: With dead ends: 8363 [2020-10-25 23:16:27,115 INFO L226 Difference]: Without dead ends: 4627 [2020-10-25 23:16:27,121 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-10-25 23:16:27,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4627 states. [2020-10-25 23:16:27,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4627 to 4623. [2020-10-25 23:16:27,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4623 states. [2020-10-25 23:16:27,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4623 states to 4623 states and 6037 transitions. [2020-10-25 23:16:27,503 INFO L78 Accepts]: Start accepts. Automaton has 4623 states and 6037 transitions. Word has length 128 [2020-10-25 23:16:27,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:27,504 INFO L481 AbstractCegarLoop]: Abstraction has 4623 states and 6037 transitions. [2020-10-25 23:16:27,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:16:27,504 INFO L276 IsEmpty]: Start isEmpty. Operand 4623 states and 6037 transitions. [2020-10-25 23:16:27,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-10-25 23:16:27,513 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:27,513 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, 1] [2020-10-25 23:16:27,513 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-25 23:16:27,514 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:27,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:27,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1096157553, now seen corresponding path program 1 times [2020-10-25 23:16:27,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:27,515 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032532970] [2020-10-25 23:16:27,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:27,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:27,575 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-10-25 23:16:27,575 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032532970] [2020-10-25 23:16:27,576 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:27,576 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:16:27,576 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126925903] [2020-10-25 23:16:27,577 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:16:27,577 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:27,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:16:27,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:16:27,578 INFO L87 Difference]: Start difference. First operand 4623 states and 6037 transitions. Second operand 3 states. [2020-10-25 23:16:27,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:27,874 INFO L93 Difference]: Finished difference Result 8859 states and 11562 transitions. [2020-10-25 23:16:27,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:16:27,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2020-10-25 23:16:27,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:27,883 INFO L225 Difference]: With dead ends: 8859 [2020-10-25 23:16:27,884 INFO L226 Difference]: Without dead ends: 4622 [2020-10-25 23:16:27,890 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-10-25 23:16:27,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2020-10-25 23:16:28,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 4582. [2020-10-25 23:16:28,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4582 states. [2020-10-25 23:16:28,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4582 states to 4582 states and 5954 transitions. [2020-10-25 23:16:28,332 INFO L78 Accepts]: Start accepts. Automaton has 4582 states and 5954 transitions. Word has length 134 [2020-10-25 23:16:28,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:28,332 INFO L481 AbstractCegarLoop]: Abstraction has 4582 states and 5954 transitions. [2020-10-25 23:16:28,332 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:16:28,333 INFO L276 IsEmpty]: Start isEmpty. Operand 4582 states and 5954 transitions. [2020-10-25 23:16:28,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-10-25 23:16:28,341 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:28,341 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, 1] [2020-10-25 23:16:28,341 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-25 23:16:28,342 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:28,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:28,342 INFO L82 PathProgramCache]: Analyzing trace with hash 966130961, now seen corresponding path program 1 times [2020-10-25 23:16:28,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:28,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064768701] [2020-10-25 23:16:28,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:28,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:28,396 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-10-25 23:16:28,396 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064768701] [2020-10-25 23:16:28,396 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:28,397 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:16:28,397 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221682017] [2020-10-25 23:16:28,397 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:16:28,397 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:28,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:16:28,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:16:28,398 INFO L87 Difference]: Start difference. First operand 4582 states and 5954 transitions. Second operand 3 states. [2020-10-25 23:16:28,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:28,780 INFO L93 Difference]: Finished difference Result 8798 states and 11423 transitions. [2020-10-25 23:16:28,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:16:28,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2020-10-25 23:16:28,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:28,788 INFO L225 Difference]: With dead ends: 8798 [2020-10-25 23:16:28,789 INFO L226 Difference]: Without dead ends: 4592 [2020-10-25 23:16:28,795 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-10-25 23:16:28,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4592 states. [2020-10-25 23:16:29,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4592 to 4552. [2020-10-25 23:16:29,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4552 states. [2020-10-25 23:16:29,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4552 states to 4552 states and 5883 transitions. [2020-10-25 23:16:29,241 INFO L78 Accepts]: Start accepts. Automaton has 4552 states and 5883 transitions. Word has length 134 [2020-10-25 23:16:29,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:29,241 INFO L481 AbstractCegarLoop]: Abstraction has 4552 states and 5883 transitions. [2020-10-25 23:16:29,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:16:29,241 INFO L276 IsEmpty]: Start isEmpty. Operand 4552 states and 5883 transitions. [2020-10-25 23:16:29,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-10-25 23:16:29,248 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:29,249 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, 1] [2020-10-25 23:16:29,249 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-25 23:16:29,249 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:29,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:29,250 INFO L82 PathProgramCache]: Analyzing trace with hash -710463440, now seen corresponding path program 1 times [2020-10-25 23:16:29,250 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:29,250 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012685628] [2020-10-25 23:16:29,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:29,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:29,313 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-10-25 23:16:29,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012685628] [2020-10-25 23:16:29,314 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:29,315 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:16:29,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455126261] [2020-10-25 23:16:29,315 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:16:29,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:29,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:16:29,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:16:29,317 INFO L87 Difference]: Start difference. First operand 4552 states and 5883 transitions. Second operand 4 states. [2020-10-25 23:16:29,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:29,671 INFO L93 Difference]: Finished difference Result 7425 states and 9645 transitions. [2020-10-25 23:16:29,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 23:16:29,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2020-10-25 23:16:29,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:29,675 INFO L225 Difference]: With dead ends: 7425 [2020-10-25 23:16:29,676 INFO L226 Difference]: Without dead ends: 3245 [2020-10-25 23:16:29,680 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-10-25 23:16:29,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3245 states. [2020-10-25 23:16:29,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3245 to 3241. [2020-10-25 23:16:29,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3241 states. [2020-10-25 23:16:29,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3241 states to 3241 states and 4085 transitions. [2020-10-25 23:16:29,971 INFO L78 Accepts]: Start accepts. Automaton has 3241 states and 4085 transitions. Word has length 137 [2020-10-25 23:16:29,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:29,972 INFO L481 AbstractCegarLoop]: Abstraction has 3241 states and 4085 transitions. [2020-10-25 23:16:29,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:16:29,972 INFO L276 IsEmpty]: Start isEmpty. Operand 3241 states and 4085 transitions. [2020-10-25 23:16:29,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-10-25 23:16:29,976 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:29,977 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, 1] [2020-10-25 23:16:29,977 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-25 23:16:29,977 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:29,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:29,978 INFO L82 PathProgramCache]: Analyzing trace with hash -691507333, now seen corresponding path program 1 times [2020-10-25 23:16:29,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:29,978 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159206749] [2020-10-25 23:16:29,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:29,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:30,045 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-25 23:16:30,045 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159206749] [2020-10-25 23:16:30,046 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:30,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:16:30,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079192469] [2020-10-25 23:16:30,047 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:16:30,047 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:30,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:16:30,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:16:30,048 INFO L87 Difference]: Start difference. First operand 3241 states and 4085 transitions. Second operand 4 states. [2020-10-25 23:16:30,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:30,288 INFO L93 Difference]: Finished difference Result 5244 states and 6615 transitions. [2020-10-25 23:16:30,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 23:16:30,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2020-10-25 23:16:30,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:30,291 INFO L225 Difference]: With dead ends: 5244 [2020-10-25 23:16:30,291 INFO L226 Difference]: Without dead ends: 2075 [2020-10-25 23:16:30,295 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-10-25 23:16:30,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2075 states. [2020-10-25 23:16:30,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2075 to 2071. [2020-10-25 23:16:30,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2071 states. [2020-10-25 23:16:30,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 2543 transitions. [2020-10-25 23:16:30,532 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 2543 transitions. Word has length 137 [2020-10-25 23:16:30,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:30,532 INFO L481 AbstractCegarLoop]: Abstraction has 2071 states and 2543 transitions. [2020-10-25 23:16:30,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:16:30,532 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 2543 transitions. [2020-10-25 23:16:30,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-10-25 23:16:30,535 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:30,535 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, 1] [2020-10-25 23:16:30,536 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-25 23:16:30,536 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:30,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:30,536 INFO L82 PathProgramCache]: Analyzing trace with hash -737827078, now seen corresponding path program 1 times [2020-10-25 23:16:30,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:30,537 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045400231] [2020-10-25 23:16:30,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:30,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:30,614 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-10-25 23:16:30,616 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045400231] [2020-10-25 23:16:30,616 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:30,616 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:16:30,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556806941] [2020-10-25 23:16:30,617 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:16:30,617 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:30,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:16:30,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:16:30,618 INFO L87 Difference]: Start difference. First operand 2071 states and 2543 transitions. Second operand 3 states. [2020-10-25 23:16:30,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:30,805 INFO L93 Difference]: Finished difference Result 3759 states and 4649 transitions. [2020-10-25 23:16:30,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:16:30,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2020-10-25 23:16:30,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:30,807 INFO L225 Difference]: With dead ends: 3759 [2020-10-25 23:16:30,808 INFO L226 Difference]: Without dead ends: 2029 [2020-10-25 23:16:30,810 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-10-25 23:16:30,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2029 states. [2020-10-25 23:16:30,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2029 to 1941. [2020-10-25 23:16:30,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1941 states. [2020-10-25 23:16:30,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1941 states and 2345 transitions. [2020-10-25 23:16:30,927 INFO L78 Accepts]: Start accepts. Automaton has 1941 states and 2345 transitions. Word has length 176 [2020-10-25 23:16:30,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:30,927 INFO L481 AbstractCegarLoop]: Abstraction has 1941 states and 2345 transitions. [2020-10-25 23:16:30,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:16:30,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 2345 transitions. [2020-10-25 23:16:30,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2020-10-25 23:16:30,929 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:30,929 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] [2020-10-25 23:16:30,929 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-10-25 23:16:30,929 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:30,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:30,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1218463733, now seen corresponding path program 1 times [2020-10-25 23:16:30,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:30,930 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139547843] [2020-10-25 23:16:30,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:30,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:31,002 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-10-25 23:16:31,002 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139547843] [2020-10-25 23:16:31,002 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:31,002 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:16:31,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373644230] [2020-10-25 23:16:31,003 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:16:31,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:31,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:16:31,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:16:31,004 INFO L87 Difference]: Start difference. First operand 1941 states and 2345 transitions. Second operand 3 states. [2020-10-25 23:16:31,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:31,184 INFO L93 Difference]: Finished difference Result 4180 states and 5086 transitions. [2020-10-25 23:16:31,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:16:31,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2020-10-25 23:16:31,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:31,189 INFO L225 Difference]: With dead ends: 4180 [2020-10-25 23:16:31,189 INFO L226 Difference]: Without dead ends: 2576 [2020-10-25 23:16:31,191 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-10-25 23:16:31,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2576 states. [2020-10-25 23:16:31,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2576 to 2219. [2020-10-25 23:16:31,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2219 states. [2020-10-25 23:16:31,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2219 states to 2219 states and 2645 transitions. [2020-10-25 23:16:31,460 INFO L78 Accepts]: Start accepts. Automaton has 2219 states and 2645 transitions. Word has length 182 [2020-10-25 23:16:31,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:31,461 INFO L481 AbstractCegarLoop]: Abstraction has 2219 states and 2645 transitions. [2020-10-25 23:16:31,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:16:31,461 INFO L276 IsEmpty]: Start isEmpty. Operand 2219 states and 2645 transitions. [2020-10-25 23:16:31,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-10-25 23:16:31,462 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:31,463 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, 1] [2020-10-25 23:16:31,463 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-10-25 23:16:31,463 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:31,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:31,463 INFO L82 PathProgramCache]: Analyzing trace with hash -2019531348, now seen corresponding path program 1 times [2020-10-25 23:16:31,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:31,464 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953181043] [2020-10-25 23:16:31,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:31,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:31,556 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2020-10-25 23:16:31,556 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953181043] [2020-10-25 23:16:31,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:16:31,557 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:16:31,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45805680] [2020-10-25 23:16:31,557 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:16:31,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:31,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:16:31,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:16:31,559 INFO L87 Difference]: Start difference. First operand 2219 states and 2645 transitions. Second operand 3 states. [2020-10-25 23:16:31,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:31,863 INFO L93 Difference]: Finished difference Result 2233 states and 2662 transitions. [2020-10-25 23:16:31,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:16:31,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2020-10-25 23:16:31,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:31,867 INFO L225 Difference]: With dead ends: 2233 [2020-10-25 23:16:31,867 INFO L226 Difference]: Without dead ends: 2231 [2020-10-25 23:16:31,868 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-10-25 23:16:31,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2020-10-25 23:16:32,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 2223. [2020-10-25 23:16:32,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2223 states. [2020-10-25 23:16:32,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2223 states to 2223 states and 2649 transitions. [2020-10-25 23:16:32,065 INFO L78 Accepts]: Start accepts. Automaton has 2223 states and 2649 transitions. Word has length 185 [2020-10-25 23:16:32,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:32,066 INFO L481 AbstractCegarLoop]: Abstraction has 2223 states and 2649 transitions. [2020-10-25 23:16:32,066 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:16:32,066 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 2649 transitions. [2020-10-25 23:16:32,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-10-25 23:16:32,067 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:32,068 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, 1] [2020-10-25 23:16:32,068 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-10-25 23:16:32,068 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:32,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:32,068 INFO L82 PathProgramCache]: Analyzing trace with hash -2019529810, now seen corresponding path program 1 times [2020-10-25 23:16:32,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:32,069 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514053681] [2020-10-25 23:16:32,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:32,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:32,419 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-10-25 23:16:32,419 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514053681] [2020-10-25 23:16:32,419 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505976360] [2020-10-25 23:16:32,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:16:32,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:16:32,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 20 conjunts are in the unsatisfiable core [2020-10-25 23:16:32,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:16:33,035 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 81 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-10-25 23:16:33,036 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 23:16:33,036 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2020-10-25 23:16:33,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099957041] [2020-10-25 23:16:33,039 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-10-25 23:16:33,040 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:16:33,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-10-25 23:16:33,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2020-10-25 23:16:33,040 INFO L87 Difference]: Start difference. First operand 2223 states and 2649 transitions. Second operand 19 states. [2020-10-25 23:16:34,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:16:34,776 INFO L93 Difference]: Finished difference Result 7200 states and 8561 transitions. [2020-10-25 23:16:34,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-10-25 23:16:34,777 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 185 [2020-10-25 23:16:34,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:16:34,795 INFO L225 Difference]: With dead ends: 7200 [2020-10-25 23:16:34,795 INFO L226 Difference]: Without dead ends: 5301 [2020-10-25 23:16:34,801 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 188 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=230, Invalid=1492, Unknown=0, NotChecked=0, Total=1722 [2020-10-25 23:16:34,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5301 states. [2020-10-25 23:16:35,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5301 to 2903. [2020-10-25 23:16:35,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2903 states. [2020-10-25 23:16:35,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2903 states to 2903 states and 3446 transitions. [2020-10-25 23:16:35,193 INFO L78 Accepts]: Start accepts. Automaton has 2903 states and 3446 transitions. Word has length 185 [2020-10-25 23:16:35,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:16:35,193 INFO L481 AbstractCegarLoop]: Abstraction has 2903 states and 3446 transitions. [2020-10-25 23:16:35,193 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-10-25 23:16:35,193 INFO L276 IsEmpty]: Start isEmpty. Operand 2903 states and 3446 transitions. [2020-10-25 23:16:35,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2020-10-25 23:16:35,196 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:16:35,197 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, 1, 1] [2020-10-25 23:16:35,410 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2020-10-25 23:16:35,411 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:16:35,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:16:35,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1819084020, now seen corresponding path program 1 times [2020-10-25 23:16:35,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:16:35,413 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032926845] [2020-10-25 23:16:35,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:16:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 23:16:35,437 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 23:16:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 23:16:35,459 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 23:16:35,543 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-25 23:16:35,543 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-25 23:16:35,543 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-10-25 23:16:35,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 11:16:35 BoogieIcfgContainer [2020-10-25 23:16:35,782 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-25 23:16:35,783 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-25 23:16:35,783 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-25 23:16:35,783 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-25 23:16:35,784 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 11:16:14" (3/4) ... [2020-10-25 23:16:35,787 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-25 23:16:35,989 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-25 23:16:35,989 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-25 23:16:35,992 INFO L168 Benchmark]: Toolchain (without parser) took 23405.25 ms. Allocated memory was 44.0 MB in the beginning and 1.9 GB in the end (delta: 1.8 GB). Free memory was 20.7 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 178.7 MB. Max. memory is 16.1 GB. [2020-10-25 23:16:35,992 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 44.0 MB. Free memory was 22.4 MB in the beginning and 22.3 MB in the end (delta: 28.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 23:16:35,993 INFO L168 Benchmark]: CACSL2BoogieTranslator took 498.75 ms. Allocated memory is still 54.5 MB. Free memory was 39.6 MB in the beginning and 25.3 MB in the end (delta: 14.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-10-25 23:16:35,993 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.82 ms. Allocated memory is still 54.5 MB. Free memory was 25.3 MB in the beginning and 36.9 MB in the end (delta: -11.6 MB). Peak memory consumption was 5.0 MB. Max. memory is 16.1 GB. [2020-10-25 23:16:35,994 INFO L168 Benchmark]: Boogie Preprocessor took 77.73 ms. Allocated memory is still 54.5 MB. Free memory was 36.9 MB in the beginning and 35.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-25 23:16:35,994 INFO L168 Benchmark]: RCFGBuilder took 978.20 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 34.8 MB in the beginning and 48.4 MB in the end (delta: -13.6 MB). Peak memory consumption was 15.1 MB. Max. memory is 16.1 GB. [2020-10-25 23:16:35,995 INFO L168 Benchmark]: TraceAbstraction took 21538.53 ms. Allocated memory was 67.1 MB in the beginning and 1.9 GB in the end (delta: 1.8 GB). Free memory was 48.1 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 142.6 MB. Max. memory is 16.1 GB. [2020-10-25 23:16:35,995 INFO L168 Benchmark]: Witness Printer took 206.99 ms. Allocated memory is still 1.9 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 37.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 16.1 GB. [2020-10-25 23:16:35,997 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.26 ms. Allocated memory is still 44.0 MB. Free memory was 22.4 MB in the beginning and 22.3 MB in the end (delta: 28.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 498.75 ms. Allocated memory is still 54.5 MB. Free memory was 39.6 MB in the beginning and 25.3 MB in the end (delta: 14.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 68.82 ms. Allocated memory is still 54.5 MB. Free memory was 25.3 MB in the beginning and 36.9 MB in the end (delta: -11.6 MB). Peak memory consumption was 5.0 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 77.73 ms. Allocated memory is still 54.5 MB. Free memory was 36.9 MB in the beginning and 35.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 978.20 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 34.8 MB in the beginning and 48.4 MB in the end (delta: -13.6 MB). Peak memory consumption was 15.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 21538.53 ms. Allocated memory was 67.1 MB in the beginning and 1.9 GB in the end (delta: 1.8 GB). Free memory was 48.1 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 142.6 MB. Max. memory is 16.1 GB. * Witness Printer took 206.99 ms. Allocated memory is still 1.9 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 37.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_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] [L693] int __retres1 ; [L697] e_wl = 2 [L698] e_c = e_wl [L699] e_g = e_c [L700] e_f = e_g [L701] e_e = e_f [L702] wl_pc = 0 [L703] c1_pc = 0 [L704] c2_pc = 0 [L705] wb_pc = 0 [L706] wb_i = 1 [L707] c2_i = wb_i [L708] c1_i = c2_i [L709] wl_i = c1_i [L710] r_i = 0 [L711] c_req_up = 0 [L712] d = 0 [L713] c = 0 [L404] int kernel_st ; [L407] 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] [L408] 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] [L419] COND TRUE (int )wl_i == 1 [L420] 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] [L424] COND TRUE (int )c1_i == 1 [L425] 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] [L429] COND TRUE (int )c2_i == 1 [L430] 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] [L434] COND TRUE (int )wb_i == 1 [L435] 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] [L439] COND FALSE !((int )r_i == 1) [L442] 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] [L444] 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] [L449] 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] [L454] 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] [L459] 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] [L464] 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] [L469] 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] [L477] 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] [L487] 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] [L496] 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] [L505] 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] [L514] 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] [L519] 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] [L524] 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] [L529] 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] [L534] 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] [L539] 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] [L545] 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] [L548] kernel_st = 1 [L290] int tmp ; [L291] int tmp___0 ; [L292] int tmp___1 ; [L293] int tmp___2 ; [L294] 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] [L298] 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] [L300] 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] [L321] COND TRUE (int )wl_st == 0 [L323] tmp = __VERIFIER_nondet_int() [L325] COND TRUE \read(tmp) [L327] 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] [L336] COND TRUE (int )c1_st == 0 [L338] tmp___0 = __VERIFIER_nondet_int() [L340] COND TRUE \read(tmp___0) [L342] 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] [L141] 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] [L152] 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] [L154] c1_st = 2 [L155] 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] [L351] COND TRUE (int )c2_st == 0 [L353] tmp___1 = __VERIFIER_nondet_int() [L355] COND TRUE \read(tmp___1) [L357] 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] [L186] 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] [L197] 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] [L199] c2_st = 2 [L200] 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] [L366] COND TRUE (int )wb_st == 0 [L368] tmp___2 = __VERIFIER_nondet_int() [L370] COND TRUE \read(tmp___2) [L372] 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] [L231] 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] [L242] 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] [L244] wb_st = 2 [L245] 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] [L381] 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] [L298] 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] [L300] 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] [L303] 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] [L306] 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] [L309] 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] [L312] 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] [L551] 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] [L552] 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] [L563] 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] [L564] 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] [L569] 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] [L574] 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] [L579] 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] [L584] COND TRUE (int )e_wl == 0 [L585] 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] [L589] 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] [L590] COND TRUE (int )e_wl == 1 [L591] 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] [L607] 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] [L608] 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] [L616] 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] [L617] 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] [L625] 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] [L626] 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] [L634] 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] [L639] 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] [L644] 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] [L649] 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] [L654] 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] [L659] COND TRUE (int )e_wl == 1 [L660] 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] [L664] 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] [L545] 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] [L548] kernel_st = 1 [L290] int tmp ; [L291] int tmp___0 ; [L292] int tmp___1 ; [L293] int tmp___2 ; [L294] 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] [L298] 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] [L300] 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] [L321] COND TRUE (int )wl_st == 0 [L323] tmp = __VERIFIER_nondet_int() [L325] COND TRUE \read(tmp) [L327] 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] [L336] COND TRUE (int )c1_st == 0 [L338] tmp___0 = __VERIFIER_nondet_int() [L340] COND TRUE \read(tmp___0) [L342] 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] [L141] 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] [L144] 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] [L159] COND TRUE ! processed [L160] data += 1 [L161] 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] [L162] 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] [L163] COND TRUE (int )e_g == 1 [L164] 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] [L171] 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] [L152] 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] [L154] c1_st = 2 [L155] 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] [L351] COND TRUE (int )c2_st == 0 [L353] tmp___1 = __VERIFIER_nondet_int() [L355] COND TRUE \read(tmp___1) [L357] 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] [L186] 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] [L189] 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] [L204] COND TRUE ! processed [L205] data += 1 [L206] 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] [L207] 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] [L208] COND TRUE (int )e_g == 1 [L209] 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] [L216] 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] [L197] 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] [L199] c2_st = 2 [L200] 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] [L366] COND TRUE (int )wb_st == 0 [L368] tmp___2 = __VERIFIER_nondet_int() [L370] COND TRUE \read(tmp___2) [L372] 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] [L231] 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] [L234] 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] [L249] c_t = data [L250] c_req_up = 1 [L251] 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] [L242] 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] [L244] wb_st = 2 [L245] 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] [L381] 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] [L298] 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] [L300] 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] [L303] 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] [L306] 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] [L309] 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] [L312] 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] [L551] 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] [L552] 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] [L553] COND TRUE c != c_t [L554] c = c_t [L555] 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] [L559] 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] [L563] 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] [L564] 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] [L569] 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] [L574] 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] [L579] COND TRUE (int )e_c == 0 [L580] 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] [L584] 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] [L589] 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] [L597] 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] [L598] 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] [L607] 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] [L608] 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] [L616] 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] [L617] 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] [L625] 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] [L626] 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] [L634] COND TRUE (int )e_c == 1 [L635] 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] [L639] 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] [L644] 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] [L649] 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] [L654] COND TRUE (int )e_c == 1 [L655] 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] [L659] 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] [L664] 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] [L667] 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] [L670] 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] [L673] 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] [L676] 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] [L545] 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] [L548] kernel_st = 1 [L290] int tmp ; [L291] int tmp___0 ; [L292] int tmp___1 ; [L293] int tmp___2 ; [L294] 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] [L298] 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] [L300] 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] [L303] 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] [L306] 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] [L309] 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] [L312] 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] [L321] 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] [L336] 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] [L351] 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] [L366] 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] [L381] COND TRUE (int )r_st == 0 [L383] tmp___3 = __VERIFIER_nondet_int() [L385] COND TRUE \read(tmp___3) [L387] r_st = 1 [L263] d = c [L264] 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] [L265] 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] [L273] 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] [L274] COND TRUE (int )e_e == 1 [L275] 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] [L283] e_e = 2 [L284] 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] [L298] 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] [L300] 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] [L321] COND TRUE (int )wl_st == 0 [L323] tmp = __VERIFIER_nondet_int() [L325] COND TRUE \read(tmp) [L327] 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] [L114] COND TRUE d == t + 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] [L122] 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] [L3] __assert_fail("0", "toy1.cil.c", 3, "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, 131 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 21.2s, OverallIterations: 34, TraceHistogramMax: 6, AutomataDifference: 10.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7076 SDtfs, 10115 SDslu, 8985 SDs, 0 SdLazy, 1146 SolverSat, 265 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 369 GetRequests, 266 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5348occurred 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: 6.9s AutomataMinimizationTime, 33 MinimizatonAttempts, 6719 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 3005 NumberOfCodeBlocks, 3005 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2785 ConstructedInterpolants, 0 QuantifiedInterpolants, 702999 SizeOfPredicates, 6 NumberOfNonLiveVariables, 528 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 34 InterpolantComputations, 32 PerfectInterpolantSequences, 807/918 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...